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

Abstract

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.

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@article{Zhao2008AHM, title={A heuristic method for job-shop scheduling with an infinite wait buffer - from one-machine to multi-machine problems}, author={Z. J. Zhao and J. Kim and Minsky Luo and H. C. Lau and S . S . Ge and J. B. Zhang}, journal={2008 IEEE Conference on Cybernetics and Intelligent Systems}, year={2008}, pages={1198-1203} }