A PC-based heuristic infinite capacity job shop scheduler

By: Call Number: AIT Thesis no.IE-94-26 Contributor(s): Material type: TextSeries: Asian Institute of Technology. Thesis ; no. IE-94-26Publication details: Bangkok : Asian Institute of Technology, 1994Description: 81 leavesSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 1994 Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Cover image Item type Current library Home library Collection Shelving location Call number Materials specified Vol info URL Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
22-AIT Thesis (Replacement) Asian Institute of Technology Library AIT Publications AIT Thesis no.IE-94-26 (Browse shelf(Opens below)) 3 Available 30050120820419
40-Archives Asian Institute of Technology Library Archives AIT Thesis no.IE-94-26 (Browse shelf(Opens below)) 1 Available 30050160074596
20-AIT Publication Asian Institute of Technology Library AIT Publications AIT Thesis no.IE-94-26 (Browse shelf(Opens below)) 1 Available 30050121007750

A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology

Thesis (M.Eng.) - Asian Institute of Technology, 1994

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.

There are no comments on this title.

to post a comment.
คัดลอกแล้ว!