Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICCIS.2008.4670933
Title: A heuristic method for job-shop scheduling with an infinite wait buffer - From one-machine to multi-machine problems
Authors: Zhao, Z.J.
Kim, J.
Luo, M.
Lau, H.C.
Ge, S.S. 
Zhang, J.B.
Keywords: Inhnite in-process wait buffer
Job Shop Scheduling
Multiple Machine
Issue Date: 2008
Source: Zhao, Z.J.,Kim, J.,Luo, M.,Lau, H.C.,Ge, S.S.,Zhang, J.B. (2008). A heuristic method for job-shop scheduling with an infinite wait buffer - From one-machine to multi-machine problems. 2008 IEEE International Conference on Cybernetics and Intelligent Systems, CIS 2008 : -. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCIS.2008.4670933
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. © 2008 IEEE.
Source Title: 2008 IEEE International Conference on Cybernetics and Intelligent Systems, CIS 2008
URI: http://scholarbank.nus.edu.sg/handle/10635/68828
ISBN: 9781424416745
DOI: 10.1109/ICCIS.2008.4670933
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

32
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.