| Article ID: | iaor20102936 |
| Volume: | 37 |
| Issue: | 2 |
| Start Page Number: | 97 |
| End Page Number: | 101 |
| Publication Date: | Mar 2009 |
| Journal: | Operations Research Letters |
| Authors: | Zhang Guochuan, Yu Guosong |
We investigate the scheduling problem with release dates and deadlines on a minimum number of machines. In the case of equal release dates, we present a 2-approximation algorithm. We also show that Greedy Best-Fit (GBF) is a 6-approximation algorithm for the case of equal processing times.