| Article ID: | iaor2003512 |
| Country: | Austria |
| Volume: | 67 |
| Issue: | 1 |
| Start Page Number: | 83 |
| End Page Number: | 90 |
| Publication Date: | Jul 2001 |
| Journal: | Computing |
| Authors: | Anderson E.J., Jayram T.S., Kimbrel T. |
We consider the preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan. We present an algorithm that finds a schedule of length at most