Fixed-sequence single machine scheduling and outbound delivery problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Fixed-sequence single machine scheduling and outbound delivery problems

Résumé

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.
Fichier principal
Vignette du fichier
icores_AC_etal.pdf (139.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01304785 , version 1 (26-08-2016)

Identifiants

  • HAL Id : hal-01304785 , version 1

Citer

Azeddine Cheref, Alessandro Agnetis, Christian Artigues, Jean-Charles Billaut. Fixed-sequence single machine scheduling and outbound delivery problems. 5th International Conference in Operations Research and Enterprise systems (ICORES’2016), Feb 2016, Rome, Italy. ⟨hal-01304785⟩
200 Consultations
147 Téléchargements

Partager

Gmail Facebook X LinkedIn More