| Article ID: | iaor2006468 |
| Country: | China |
| Volume: | 34 |
| Issue: | 7 |
| Start Page Number: | 97 |
| End Page Number: | 101 |
| Publication Date: | Jul 2004 |
| Journal: | Mathematics in Practice and Theory |
| Authors: | Shi Ling |
This paper presents the open-shop scheduling problem with release times and job priorities. We give a simple heuristic and prove that its worst-case performance is 4/3, and the bound is tight.