Generate And Test Algorithm Development For Job Scheduling In Parallel Machines Which Considering Setup Time For Minimizing Tardiness And Minimizing Makespan For Alternative Sequences That Have Same Tardiness  

Oleh:

Suhandi, Victor ; Ismanto, Melissa Septina

Jenis: Article from Proceeding
Dalam koleksi: Proceeding The 7th International Seminar on Industrial Engineering and Management (7th ISIEM) di Bali, March 11th – 13th, 2014, page PS 15-22.
Topik: job scheduling; tardiness; makespan; Generate and Test; parallel machine
Fulltext: Paper 20 Victor Suhandi Maranatha University.pdf (582.58KB)

Isi artikel

Search for solutions to generate and test algorithm guarantees the optimal value of the desired results. However, the main constraint is the limitation of element number. Number of input elements may lead to a lot of combinations of alternative solutions, the number may increase exponentially. The application of this algorithm in job scheduling would not be suitable for cases that have a large number of jobs. In this study raised the case of PT Agronesia Inkaba for job scheduling in general press division. Generate and test algorithm can accommodate more than one objective. In this case the main assessment criteria scheduling is total tardiness. If it has the same total tardiness then will compare the makespan. It is quite difficult to be represented using mathematical formulas or using metaheuristic methods. One more thing that increases complexity is the consideration of setup time when a machine will make a new product or a different product than the one before. The results obtained from the use of generate and test algorithm is optimal and much better than existing heuristic methods. Comparison method used is the method of EDD (Earliest Due Date), Wilkerson Irwin algorithm, Slack methods, and methods of LPT (Longest Processing Time)

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali