|
|||||
|
|
One-machine scheduling to minimize mean tardiness with minimum number tardy |
|
| Authors: | S O Duffuaa A Raouf M Ben-Daya M Makki |
| Institution: | 1. Department of Industrial Management , National Taiwan University of Science and Technology , No. 43, Sec. 4, Keelung Road, Taipei, 106, Taiwan, Republic of China kjwang@mail.ntust.edu.tw;3. Department of Business Management , National Dong Hwa University , Hualien, 974, Taiwan, Republic of China;4. Department of Industrial Engineering , Chung-Yuan Christian University , Taiwan, Republic of China |
| Abstract: | In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed. An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed optimal. |
| Keywords: | Single Machine Scheduling Mean Tardiness Number Of Tardy Jobs |