| Article ID: | iaor19992934 |
| Country: | United States |
| Volume: | 46 |
| Issue: | 2 |
| Start Page Number: | 129 |
| End Page Number: | 145 |
| Publication Date: | Mar 1999 |
| Journal: | Naval Research Logistics |
| Authors: | Sriskandarajah Chelliah, Sidney Jeffrey B. |
| Keywords: | heuristics |
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.