An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach

被引:40
作者
Framinan, JM [1 ]
Schuster, C
机构
[1] Univ Seville, Sch Engn, E-41092 Seville, Spain
[2] Bayer Technol Serv, Supply Chain Org, D-51368 Leverkusen, Germany
关键词
D O I
10.1016/j.cor.2004.09.009
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper we consider the no-wait job shop problem with a makespan objective. This problem has usually been addressed by its decomposition into a sequencing and a timetabling problem. Here, first we focus on the timetabling problem and take advantage of the symmetry of the problem in order to suggest a new timetabling procedure. Secondly, we suggest embedding this timetabling into a recent metaheuristic named complete local search with memory. (c) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1200 / 1213
页数:14
相关论文
共 28 条
[1]  
Applegate D., 1991, ORSA Journal on Computing, V3, P149, DOI 10.1287/ijoc.3.2.149
[2]   Guided local search with shifting bottleneck for job shop scheduling [J].
Balas, E ;
Vazacopoulos, A .
MANAGEMENT SCIENCE, 1998, 44 (02) :262-275
[3]   The job shop scheduling problem: Conventional and new solution techniques [J].
Blazewicz, J ;
Domschke, W ;
Pesch, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (01) :1-33
[4]   A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM [J].
BRUCKER, P ;
JURISCH, B ;
SIEVERS, B .
DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) :107-127
[5]  
CASEAU Y, 1995, LECT NOTES COMPUTER, V8
[6]  
Fisher H., 1963, IND SCHEDULING, P225
[7]   Complete local search with memory [J].
Ghosh, D ;
Sierksma, G .
JOURNAL OF HEURISTICS, 2002, 8 (06) :571-584
[8]  
Glover F., 1990, ORSA Journal on Computing, V2, P4, DOI [10.1287/ijoc.1.3.190, 10.1287/ijoc.2.1.4]
[9]   Sequencing of jobs in some production system [J].
Grabowski, J ;
Pempera, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 125 (03) :535-550
[10]   A survey of machine scheduling problems with blocking and no-wait in process [J].
Hall, NG ;
Sriskandarajah, C .
OPERATIONS RESEARCH, 1996, 44 (03) :510-525