| Article ID: | iaor2002736 |
| Country: | China |
| Volume: | 22 |
| Issue: | 3 |
| Start Page Number: | 284 |
| End Page Number: | 288 |
| Publication Date: | Jun 2000 |
| Journal: | Journal of University of Science and Technology Beijing |
| Authors: | Xie Tiejun, Cheng Tao, Liu Renping |
A kind of earliness–tardiness scheduling problem with four penalty factors is discussed in order to determine the optimal sequence and optimal common due date. A methodology for determining the common due date is presented, the concept of combinative penalty factor is proposed, and the structure of the optimal solution is discussed.