1
A PC-based heuristic infinite capacity job shop scheduler | |
| Author | Nay Win |
| Call Number | AIT Thesis no.IE-94-26 |
| Subject(s) | Scheduling (Management) |
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Series Statement | Thesis ; no. IE-94-26 |
| Abstract | In this study, a microcomputer based job shop production system is implemented by using a proposed job shop heuristic method. The study also presents a two stage heuristic algorithm for job shop scheduling problems with due dates wherein the objectives are to minimize number of tardy jobs and total tardiness. A Ga ntt chart of a resultant schedule is displayed on a computer screen. A proposed heuristic in this study gives improvement in performance measures and a runtime of the the algorithm is fast. The due date estimation can be performed quickly. The application of the algorithm is demonstrated with example problems. |
| Year | 1994 |
| Corresponding Series Added Entry | Asian Institute of Technology. Thesis ; no. IE-94-26 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Department of Industrial Systems Engineering (DISE) |
| Academic Program/FoS | Industrial Engineering (IE) |
| Chairperson(s) | Bohez, Erik L.J.; |
| Examination Committee(s) | Tabucanon, Mario T. ;Pastijn, Hugo |
| Scholarship Donor(s) | DAAD (German Academic Exchange Service); |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 1994 |