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

• المؤلفون الرئيسيون: ZHAO, Z. J., KIM, J., LUO, M., LAU, Hoong Chuin, GE, S. S.
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2008
• الموضوعات: Job Shop Scheduling; Multiple Machine; infinite in-process wait buffer; Artificial Intelligence and Robotics; Operations Research, Systems Engineering and Industrial Engineering
• الوصول للمادة أونلاين: 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
• المؤسسة: Singapore Management University

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...