SOLVING ONE-TO-ONE INTEGRATED PRODUCTION AND OUTBOUND DISTRIBUTION SCHEDULING PROBLEMS WITH JOB RELEASE DATES AND DEADLINES

Colloque avec actes et comité de lecture. internationale.International audience"In this paper, we study an integrated production and outbound distribution scheduling problem with one manufacturer and one customer. The manufacturer has to process a set of jobs and deliver them in batches to the customer. Each job has a release date and a delivery deadline. The objective of the problem is to decide a feasible integrated production and distribution schedule minimizing the transportation cost subject to the delivery deadline constraints.We consider three problems with different ways how a job can be produced and delivered: Non-splittable production and delivery (NSP-NSD) problem, Splittable production and non-splittable delivery (SP-NSD) problem and Splittable production and delivery (SP-SD) problem.We provide a polynomial-time algorithm that solves two special cases of problems SP-NSD and SP-SD.We also develop a B&B algorithm that solves the NP-hard problem NSP-NSD. The computational results show that the B&B algorithm outperforms an ILP formulation of the problem implemented on a commercial solver.