Complexity results and algorithms for an integrated single machine scheduling and outbound delivery problem with fixed sequence - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Accéder directement au contenu
Article Dans Une Revue Journal of Scheduling Année : 2017

Complexity results and algorithms for an integrated single machine scheduling and outbound delivery problem with fixed sequence

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 NP-hardness proofs and polynomial time algorithms are given. Finally, a fixed-parameter tractability result is given.
Fichier principal
Vignette du fichier
abc_revised_v11 (soumis_rapport).pdf (409.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01529299 , version 1 (30-05-2017)

Identifiants

Citer

Azeddine Cheref, Alessandro Agnetis, Christian Artigues, Jean-Charles Billaut. Complexity results and algorithms for an integrated single machine scheduling and outbound delivery problem with fixed sequence. Journal of Scheduling, 2017, 20 (6), pp.681-693. ⟨10.1007/s10951-017-0540-2⟩. ⟨hal-01529299⟩
156 Consultations
117 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More