A heuristic method for job-shop scheduling with an infinite wait buffer: From one-machine to multi-machine problems

A heuristic method for job-shop scheduling with an infinite wait buffer: From one-machine to multi-machine problems

Through empirical comparison of classical job shop problems (JSP) with multi-machine consideration, we find that the objective to minimize the sum of weighted tardiness has a better wait property compared with the objective to minimize the makespan. Further, we test the proposed Iterative Minimizati...

Full description

Saved in:
Bibliographic Details
Main Authors: ZHAO, Z. J., KIM, J., LUO, M., LAU, Hoong Chuin, GE, S. S.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2008
Subjects:
Job Shop Scheduling
Multiple Machine
infinite in-process wait buffer
Artificial Intelligence and Robotics
Operations Research, Systems Engineering and Industrial Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/554
https://ink.library.smu.edu.sg/context/sis_research/article/1553/viewcontent/HeuristicMethodJobShopScheduling_2008_CIS.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Description
Summary:Through empirical comparison of classical job shop problems (JSP) with multi-machine consideration, we find that the objective to minimize the sum of weighted tardiness has a better wait property compared with the objective to minimize the makespan. Further, we test the proposed Iterative Minimization Micro-model (IMM) heuristic method with the mixed integer programming (MIP) solution by CPLEX. For multi-machine problems, the IMM heuristic method is faster and achieves a better solution. Finally, for a large problem instance with 409 jobs and 30 types of machines, IMM-heuristic method is compared with ProModel and we find that the heuristic method is slightly better.

Similar Items