• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Solving one-to-one integrated production and outbound distribution scheduling problems with job release dates and deadlines

Thumbnail
Date
2014
Link to item file
https://hal.archives-ouvertes.fr/hal-01166588
Dewey
Recherche opérationnelle
Sujet
Delivery deadlines; Release dates; Single customer; Supply chain scheduling; Batching and delivery; Single manufacturer
Conference name
MOSIM 2014, 10ème Conférence Francophone de Modélisation, Optimisation et Simulation
Conference date
11-2014
Conference city
Nancy
Conference country
France
URI
https://basepub.dauphine.fr/handle/123456789/15674
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Fu, Liangliang
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Aloulou, Mohamed Ali
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Artigues, Christian
459 Laboratoire d'analyse et d'architecture des systèmes [LAAS]
Type
Communication / Conférence
Abstract (EN)
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.