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

被引:29
|
作者
Lee, Wen-Chiung [1 ]
Lu, Zon-Syun [1 ]
机构
[1] Feng Chia Univ, Dept Stat, Taichung 407, Taiwan
关键词
Group technology; Total weighted number of late jobs; Deteriorating jobs; DEPENDENT PROCESSING TIMES; TOTAL COMPLETION-TIME; 2-MACHINE FLOW-SHOP; SINGLE-MACHINE; LINEAR DETERIORATION; MAKESPAN; FPTAS;
D O I
10.1016/j.amc.2012.02.033
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:8750 / 8757
页数:8
相关论文
共 50 条