|
|||||
|
|
A heuristic for the two‐machine no‐wait openshop scheduling problem |
|
| Authors: | Jeffrey B Sidney Chelliah Sriskandarajah |
| Abstract: | In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999 |
| Keywords: | flowshop openshop no‐wait scheduling deterministic scheduling heuristic algorithm |