Production and delivery scheduling problem with time windows

Authors:
J. M. Garcia;S. Lozano
Affiliations:
Escuela Superior de Ingenieros, Camino de los Descubrimientos, s/n, 41092 Sevilla, Spain;Escuela Superior de Ingenieros, Camino de los Descubrimientos, s/n, 41092 Sevilla, Spain
Venue:
Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
Year:
2005

Citing 5
Cited 0

Scheduling jobs with fixed start and end times

Discrete Applied Mathematics
A user's guide to tabu search

Annals of Operations Research - Special issue on Tabu search
Tabu Search

Tabu Search
Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs

Computers and Operations Research
Heuristic algorithms for the two-stage hybrid flowshop problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.