Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration

被引:36
作者
Shiau, Yau-Ren [1 ]
Lee, Wen-Chiung [1 ]
Wu, Chin-Chia [1 ]
Chang, Chia-Ming [1 ]
机构
[1] Feng Chia Univ, Dept Stat, Taichung 40724, Taiwan
关键词
production; mean flow time; linear deterioration;
D O I
10.1007/s00170-006-0646-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A real industrial production phenomenon, referred to as deteriorating jobs, has drawn increasing attention. However, most research on this issue considers only single-machine problems. Motivated by this limitation, this paper considers a simple linear deterioration model in a two-machine flowshop where the objective is to minimize the mean flow time. Several dominance rules and three lower bounds are proposed to speed up the search for an optimal solution, and several heuristic algorithms are provided to derive near-optimal solutions. In addition, a computational experiment is conducted to evaluate their performances. Results indicate that the algorithms perform well, and a combined heuristic algorithm is recommended for practitioners.
引用
收藏
页码:774 / 782
页数:9
相关论文
共 23 条
[1]   Scheduling with time dependent processing times: Review and extensions [J].
Alidaee, B ;
Womer, NK .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1999, 50 (07) :711-720
[2]   ANNEALING METHOD FOR PCB ASSEMBLY SCHEDULING ON 2 SEQUENTIAL-MACHINES [J].
BENARIEH, D ;
MAIMON, O .
INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 1992, 5 (06) :361-367
[3]   SCHEDULING DETERIORATING JOBS ON A SINGLE PROCESSOR [J].
BROWNE, S ;
YECHIALI, U .
OPERATIONS RESEARCH, 1990, 38 (03) :495-498
[4]   Parallel machine scheduling with time dependent processing times [J].
Chen, ZL .
DISCRETE APPLIED MATHEMATICS, 1996, 70 (01) :81-93
[5]   A concise survey of scheduling with time-dependent processing times [J].
Cheng, TCE ;
Ding, Q ;
Lin, BMT .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 152 (01) :1-13
[6]   Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine [J].
Cheng, TCE ;
Ding, Q .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (01) :51-62
[7]   The time dependent machine makespan problem is strongly NP-complete [J].
Cheng, TCE ;
Ding, Q .
COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (08) :749-754
[8]   SCHEDULING JOBS WITH VARYING PROCESSING TIMES [J].
GAWIEJNOWICZ, S ;
PANKOWSKA, L .
INFORMATION PROCESSING LETTERS, 1995, 54 (03) :175-178
[9]  
GUPTA JND, 1988, J OPER RES SOC, V14, P387
[10]   COMPLEXITY OF SCHEDULING TASKS WITH TIME-DEPENDENT EXECUTION TIMES [J].
HO, KIJ ;
LEUNG, JYT ;
WEI, WD .
INFORMATION PROCESSING LETTERS, 1993, 48 (06) :315-320