An efficient algorithm for a job shop problem |
| |
| Authors: | Wieslaw Kubiak Suresh Sethi Chelliah Sriskandarajah |
| |
| Affiliation: | (1) Faculty of Business Administration, Memorial University of Newfoundland, St. John's, Newfoundland, Canada;(2) Faculty of Management, University of Toronto, Toronto, Ontario, Canada;(3) Department of Industrial Engineering, University of Toronto, Toronto, Ontario, Canada |
| |
| Abstract: | We study the problem of minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [1,2], Hefetz and Adiri [7], and Timkovskiy [15]. The idea behind the algorithm has the potential of extension to job shops with parallel machines.This research is supported in part by NSERC Grants A4619, OGP0105675, OGP0104900, General Motors of Canada, and the Manufacturing Research Corporation of Ontario. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
