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

Author

Zhao, Z.J. ; Kim, J. ; Luo, M. ; Lau, H.C. ; Ge, S.S. ; Zhang, J.B.

Author_Institution

Electr. & Comput. Eng. Dept., Nat. Univ. of Singapore, Singapore

fYear

2008

fDate

21-24 Sept. 2008

Firstpage

1198

Lastpage

1203

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.

Keywords

heuristic programming; integer programming; iterative methods; job shop scheduling; minimisation; infinite wait buffer; iterative minimization micromodel heuristic method; job shop scheduling; mixed integer programming; multimachine problems; Dispatching; Information management; Iterative methods; Job production systems; Job shop scheduling; Linear programming; Logistics; Management information systems; Minimization methods; Testing; Job Shop Scheduling; Multiple Machine; infinite in-process wait buffer;

fLanguage

English

Publisher

ieee

Conference_Titel

Cybernetics and Intelligent Systems, 2008 IEEE Conference on

Conference_Location

Chengdu

Print_ISBN

978-1-4244-1673-8

Electronic_ISBN

978-1-4244-1674-5

Type

conf

DOI

10.1109/ICCIS.2008.4670933

Filename

4670933