| Article ID: | iaor20081729 |
| Country: | China |
| Volume: | 19 |
| Issue: | 2 |
| Start Page Number: | 336 |
| End Page Number: | 341 |
| Publication Date: | Apr 2006 |
| Journal: | Mathematica Applicata |
| Authors: | Li Shuguang, Zhao Hongluan, Wang Qi |
Concerning the weighted number of early and tardy jobs, a single machine scheduling problem with a common due window is investigated. The window location and size are decision variables with penalties. Following several properties of an optimal schedule, a polynomial algorithm is proposed to minimize the sum of all the penalties.