Fixed-sequence Single Machine Scheduling and Outbound Delivery Problems

Azeddine Cheref, Alessandro Agnetis, Christian Artigues, Jean-Charles Billaut
2016 Proceedings of 5th the International Conference on Operations Research and Enterprise Systems  
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
more » ... tation 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.
doi:10.5220/0005701201450151 dblp:conf/icores/CherefAAB16 fatcat:3fob276wfra2big6iww6bq77cq