Production and delivery scheduling problem with time windows

被引:54
作者
Garcia, JM [1 ]
Lozano, S [1 ]
机构
[1] Escuela Super Ingn, Seville 41092, Spain
关键词
scheduling; no wait; time windows; finite capacity; Tabu search;
D O I
10.1016/j.cie.2004.12.004
中图分类号
TP39 [计算机的应用];
学科分类号
081203 [计算机应用技术]; 0835 [软件工程];
摘要
This paper deals with the problem of selecting and scheduling the orders to be processed by a manufacturing plant for immediate delivery to the customer site. Among the constraints to be considered are the limited production capacity, the available number of vehicles and the time windows within which orders must be served. We first describe the problem as it occurs in practice in some industrial environments, and then present an integer programming model that maximizes the profit due to the customer orders to be processed. A tabu search-based solution procedure to solve this problem is developed and tested empirically with randomly generated problems. Comparisons with an exact procedure show that the method finds very good-quality solutions with small computation requirements. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:733 / 742
页数:10
相关论文
共 16 条
[1]
[Anonymous], 1997, Tabu Search
[2]
SCHEDULING JOBS WITH FIXED START AND END TIMES [J].
ARKIN, EM ;
SILVERBERG, EB .
DISCRETE APPLIED MATHEMATICS, 1987, 18 (01) :1-8
[4]
García JM, 2002, ADV SOFT COMP, P431
[5]
MINIMAL RESOURCES FOR FIXED AND VARIABLE JOB SCHEDULES [J].
GERTSBAKH, I ;
STERN, HI .
OPERATIONS RESEARCH, 1978, 26 (01) :68-85
[6]
Glover F., 1993, Annals of Operations Research, V41, P3
[7]
Glover F., 1990, ORSA Journal on Computing, V2, P4, DOI DOI 10.1287/IJOC.2.1.4
[8]
Glover F., 1989, J COMPUTING, V1, P190
[9]
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
[10]
Heuristic algorithms for the two-stage hybrid flowshop problem [J].
Haouari, M ;
M'Hallah, R .
OPERATIONS RESEARCH LETTERS, 1997, 21 (01) :43-53