| Article ID: | iaor199788 |
| Country: | Netherlands |
| Volume: | 70 |
| Issue: | 3 |
| Start Page Number: | 379 |
| End Page Number: | 390 |
| Publication Date: | Nov 1993 |
| Journal: | European Journal of Operational Research |
| Authors: | Chen Bo, Strusevich Vitaly A. |
| Keywords: | heuristics |
The paper considers the multi-stage open shop scheduling problem wit a numbe of identical parallel machines at each stage. No preemption is allowed, and the objective is to minimize the makespan. Several heuritic algorithms are presented, and their worst-case performance is analyzed. In the case of two stages, a worst-case performance ratio strictly less than 2 is established.