Publication Type

Conference Proceeding Article

Version

Postprint

Publication Date

9-2008

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

Job Shop Scheduling, Multiple Machine, infinite in-process wait buffer

Discipline

Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Intelligent Systems and Decision Analytics

Publication

IEEE Conference on Cybernetics and Intelligent Systems CIS 2008: 21-24 Sept. 2008, Chengdu, China

First Page

1198

Last Page

1203

ISBN

9781424416738

Identifier

10.1109/ICCIS.2008.4670933

Publisher

IEEE

City or Country

Piscataway, NJ

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://doi.org/10.1109/ICCIS.2008.4670933

Share

COinS