ONE-MACHINE RESCHEDULING HEURISTICS WITH EFFICIENCY AND STABILITY AS CRITERIA

被引:177
作者
WU, SD [1 ]
STORER, RH [1 ]
CHANG, PC [1 ]
机构
[1] YUAN ZE INST TECHNOL,DEPT IND ENGN,TAOYUAN 32026,TAIWAN
关键词
D O I
10.1016/0305-0548(93)90091-V
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Heuristics for the problem of rescheduling a machine on occurrence of an unforeseen disruption are developed. The criteria include minimization of the makespan (schedule efficiency) and the impact of the schedule change (schedule stability). The impact of schedule change is a non-regular performance measure defined in two ways: (1) the starting time deviations between the new schedule and the original schedule, and (2) a measure of the sequence difference between the two schedules. Three local search procedures are developed for the bicriterion problem and a set of experiments are conducted to test the efficacy of the heuristics. The heuristic solutions are shown to be effective in that the schedule stability can be increased significantly with little or no sacrifice in makespan.
引用
收藏
页码:1 / 14
页数:14
相关论文
共 15 条
[1]   THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].
ADAMS, J ;
BALAS, E ;
ZAWACK, D .
MANAGEMENT SCIENCE, 1988, 34 (03) :391-401
[3]  
BEAN JC, 1985, NBS PUBLICATION, V724, P197
[4]   THE ONE-MACHINE SEQUENCING PROBLEM [J].
CARLIER, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 11 (01) :42-47
[5]   AN ALGORITHM FOR SOLVING THE JOB-SHOP PROBLEM [J].
CARLIER, J ;
PINSON, E .
MANAGEMENT SCIENCE, 1989, 35 (02) :164-176
[6]  
Davis L, 1987, GENETIC ALGORITHMS S
[7]  
FLORIAN M, MANAGE SCI, V17, P782
[8]  
FRY T, IIE T, V19, P445
[9]  
Garey MR., 1979, COMPUTERS INTRACTABI
[10]  
Goldberg D., 1989, GENETIC ALGORITHMS S