The complexity of machine scheduling for stability with a single disrupted job

被引:36
作者
Leus, R [1 ]
Herroelen, W [1 ]
机构
[1] Katholieke Univ Leuven, Dept Appl Econ, Operat Management Grp, B-3000 Louvain, Belgium
关键词
scheduling; uncertainty; robustness; stability; complexity;
D O I
10.1016/j.orl.2004.04.008
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A stable schedule is a robust schedule that will change little when uncertain events occur. The purpose of this paper is to investigate the complexity status of a number of machine scheduling problems with stability objective, when the duration of a single job is anticipated to be disrupted. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:151 / 156
页数:6
相关论文
共 25 条
[1]   SINGLE-MACHINE FLOW-TIME SCHEDULING WITH A SINGLE BREAKDOWN [J].
ADIRI, I ;
BRUNO, J ;
FROSTIG, E ;
KAN, AHGR .
ACTA INFORMATICA, 1989, 26 (07) :679-685
[2]   Match-up scheduling under a machine breakdown [J].
Akturk, MS ;
Gorgulu, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) :81-97
[3]  
[Anonymous], 2001, THESIS TU BERLIN BER
[4]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[5]  
AYTUG HJ, 2004, IN PRESS EUROPEAN J
[6]   MATCHUP SCHEDULING WITH MULTIPLE RESOURCES, RELEASE DATES AND DISRUPTIONS [J].
BEAN, JC ;
BIRGE, JR ;
MITTENTHAL, J ;
NOON, CE .
OPERATIONS RESEARCH, 1991, 39 (03) :470-483
[7]   SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].
BRUNO, J ;
COFFMAN, EG ;
SETHI, R .
COMMUNICATIONS OF THE ACM, 1974, 17 (07) :382-387
[8]   ROBUST SCHEDULING TO HEDGE AGAINST PROCESSING TIME UNCERTAINTY IN SINGLE-STAGE PRODUCTION [J].
DANIELS, RL ;
KOUVELIS, P .
MANAGEMENT SCIENCE, 1995, 41 (02) :363-376
[9]  
Daniels RL, 1997, IIE TRANS, V29, P977
[10]   SCHEDULING CHAIN-STRUCTURED TASKS TO MINIMIZE MAKESPAN AND MEAN FLOW TIME [J].
DU, JZ ;
LEUNG, JYT ;
YOUNG, GH .
INFORMATION AND COMPUTATION, 1991, 92 (02) :219-236