| Article ID: | iaor2005930 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 4 |
| Start Page Number: | 320 |
| End Page Number: | 325 |
| Publication Date: | Jul 2004 |
| Journal: | Operations Research Letters |
| Authors: | Woeginger Gerhard J. |
| Keywords: | combinatorial analysis |
We investigate the approximability of the no-wait job shop scheduling problem under the makespan criterion. We show that this problem is