Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ICCIS.2008.4670933
DC Field | Value | |
---|---|---|
dc.title | A heuristic method for job-shop scheduling with an infinite wait buffer - From one-machine to multi-machine problems | |
dc.contributor.author | Zhao, Z.J. | |
dc.contributor.author | Kim, J. | |
dc.contributor.author | Luo, M. | |
dc.contributor.author | Lau, H.C. | |
dc.contributor.author | Ge, S.S. | |
dc.contributor.author | Zhang, J.B. | |
dc.date.accessioned | 2014-06-19T02:53:41Z | |
dc.date.available | 2014-06-19T02:53:41Z | |
dc.date.issued | 2008 | |
dc.identifier.citation | 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. <a href="https://doi.org/10.1109/ICCIS.2008.4670933" target="_blank">https://doi.org/10.1109/ICCIS.2008.4670933</a> | |
dc.identifier.isbn | 9781424416745 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/68828 | |
dc.description.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. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ICCIS.2008.4670933 | |
dc.source | Scopus | |
dc.subject | Inhnite in-process wait buffer | |
dc.subject | Job Shop Scheduling | |
dc.subject | Multiple Machine | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.doi | 10.1109/ICCIS.2008.4670933 | |
dc.description.sourcetitle | 2008 IEEE International Conference on Cybernetics and Intelligent Systems, CIS 2008 | |
dc.description.page | - | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.