| Article ID: | iaor20033141 |
| Country: | China |
| Volume: | 20 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 4 |
| Publication Date: | Jan 2002 |
| Journal: | Journal of Shenyang Normal University |
| Authors: | Zhao Chuanli, Tang Hengyong |
In this paper the scheduling problem with sequence-dependent setup times is discussed. We generalize the results of the least processing time algorithm to a general algorithm, and the new result is generalized to a system with uniform processors.