Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs

详细信息	查看全文 | 推荐本文 |

• 作者：Wen-Chiung Lee ; ^{wclee@fcu.edu.tw} ; Zon-Syun Lu
• 关键词：Group technology ; Total weighted number of late jobs ; Deteriorating jobs
• 刊名：Applied Mathematics and Computation
• 出版年：2012
• 期刊代码：7_00963003
• 类别：cp
• 出版时间：1 May, 2012
• 卷：218
• 期：17
• 页码：8750-8757
• 文件大小：185 K

摘要

Deteriorating jobs scheduling has received tremendous attention in the past two decades. However, the group technology has seldom been discussed. With the current emphasis on customer service and meeting the promised delivery dates, we consider a single-machine scheduling problem of minimizing the total weighted number of late jobs with deteriorating jobs and setup times. A branch-and-bound with several dominance properties and a lower bound is developed to solve this problem optimally. Computational results show that the proposed algorithm can solve instances up to 1500 jobs. In addition, statistical tests are conducted to investigate the impact of the parameters.