Rolling horizon scheduling in large job shops

被引:0
作者
Thoney, KA [1 ]
Joines, JA [1 ]
Manninagarajan, P [1 ]
Hodgson, TJ [1 ]
机构
[1] N Carolina State Univ, Coll Text, Raleigh, NC 27695 USA
来源
PROCEEDINGS OF THE 2002 WINTER SIMULATION CONFERENCE, VOLS 1 AND 2 | 2002年
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The Virtual Factory is a job shop scheduling tool that was developed at NC State. It has been shown to provide near-optimal solutions to industrial-sized problems in seconds through comparison to a computed lower bound. It is an iterative simulation-based procedure, whose objective is minimizing maximum lateness. Like many other job shop scheduling tools, the Virtual Factory has been evaluated primarily in a transient setting, even though a rolling horizon setting is more indicative of the situation in which scheduling algorithms are used in industry. Consequently, a rolling horizon procedure has been developed with which the Virtual Factory was tested. Experimental results indicate that the Virtual Factory also performs well under these circumstances.
引用
收藏
页码:1891 / 1896
页数:6
相关论文
共 9 条
[1]   SEQUENCING WITH DUE-DATES AND EARLY START TIMES TO MINIMIZE MAXIMUM TARDINESS [J].
BAKER, KR ;
SU, ZS .
NAVAL RESEARCH LOGISTICS, 1974, 21 (01) :171-176
[2]   Benchmarks for shop scheduling problems [J].
Demirkol, E ;
Mehta, S ;
Uzsoy, R .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 109 (01) :137-141
[3]  
Hodgson TJ, 2000, IIE TRANS, V32, P177
[4]   Note. Satisfying due dates in large job shops [J].
Hodgson, TJ ;
Cormier, D ;
Weintraub, AJ ;
Zozom, A .
MANAGEMENT SCIENCE, 1998, 44 (10) :1442-1446
[5]  
LAWRENCE SR, 1986, NBS SPEC PUBL, V724, P87
[6]   Satisfying due-dates in large multi-factory supply chains [J].
Thoney, KA ;
Hodgson, TJ ;
King, RE ;
Taner, MR ;
Wilson, AD .
IIE TRANSACTIONS, 2002, 34 (09) :803-811
[7]  
Vepsalainen A. P. J., 1988, Journal of Manufacturing and Operations Management, V1, P102
[8]  
Weintraub A, 1999, IIE TRANS, V31, P1093
[9]  
ZOZOM A, IN PRESS IIE T