A heuristic for the twomachine nowait openshop scheduling problem
- Additional Document Info
- View All
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.
author list (cited authors)
Sidney, J. B., & Sriskandarajah, C.
complete list of authors
Sidney, Jeffrey B||Sriskandarajah, Chelliah