| Article ID: | iaor20081724 |
| Country: | China |
| Volume: | 41 |
| Issue: | 1 |
| Start Page Number: | 74 |
| End Page Number: | 77 |
| Publication Date: | Feb 2006 |
| Journal: | Journal of Shandong University (Natural Science) |
| Authors: | Wang Xiaoli, Zhao Hongluan, Qi Xingqin |
Single processor scheduling with a common due window and family setups is studied. All jobs have common earliness cost and common tardiness penalty, but the window location with linear cost is a decision variable. The objective is to minimize the sum of the costs. Following some properties of the optimal scheduling, a polynomial algorithm is proposed.