Fixed-sequence Single Machine Scheduling and Outbound Delivery Problems - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

Fixed-sequence Single Machine Scheduling and Outbound Delivery Problems

Résumé

In this paper, we consider an integrated production and outbound delivery scheduling problem. In particular, we address the situation in which the scheduling sequence and the delivery sequence are the same and predefined. A set of jobs are processed on a single machine and finished jobs are delivered to the customers by a single capacitated vehicle. Each job has a processing time and transportation times between customers are taken into account. Since the sequence is given, the problem consists to form batches of jobs and our objective is to minimize the sum of the delivery times or general functions of the delivery times. The NP-hardness of the general problem is established and a pseudopolynomial time dynamic programming algorithm is given. Some particular cases are treated, for which complexity proofs or polynomial time algorithms are given.
Fichier principal
Vignette du fichier
JoS_Cheref_Agnetis_Artigues_Billaut.pdf (395.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01351497 , version 1 (03-08-2016)

Identifiants

  • HAL Id : hal-01351497 , version 1

Citer

Azeddine Cheref, Alessandro Agnetis, Christian Artigues, Jean-Charles Billaut. Fixed-sequence Single Machine Scheduling and Outbound Delivery Problems. 2016. ⟨hal-01351497⟩
147 Consultations
301 Téléchargements

Partager

Gmail Facebook X LinkedIn More