Authors:
Azeddine Cheref
1
;
Alessandro Agnetis
2
;
Christian Artigues
3
and
Jean-Charles Billaut
4
Affiliations:
1
Université François-Rabelais Tours / CNRS,, CNRS and Univ. de Toulouse, France
;
2
Universitá degli Studi di Siena, Italy
;
3
CNRS and Univ. de Toulouse, France
;
4
Université François-Rabelais Tours / CNRS and, France
Keyword(s):
Scheduling, Batching and Delivery, Computational Complexity, Dynamic Programming.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Artificial Intelligence
;
Dynamic Programming
;
e-Business
;
Enterprise Information Systems
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Logistics
;
Methodologies and Technologies
;
Operational Research
;
Optimization
;
Pattern Recognition
;
Scheduling
;
Software Engineering
;
Symbolic Systems
Abstract:
In this paper, we study an integrated production an outbound delivery scheduling problem with a predefined
sequence. The manufacturer has to process a set of jobs on a single machine and deliver them in batches to
multiple customers. A single vehicle with limited capacity is used for the delivery. Each job has a processing
time and a specific customer location. Starting from the manufacturer location, the vehicle delivers a set of
jobs which constitute a batch by taking into account the transportation times. Since the production sequence
and delivery sequence are fixed and identical, the problem consists in deciding the composition of batches.
We prove that for any regular sum-type objective function of the delivery times, the problem in NP-hard in the
ordinary sense and can be solved in pseudopolynomial time. A dynamic programming algorithm is proposed.