Large neighborhood for a parallel scheduling problem with earliness-tardiness penalties and a common due date

Yasmin Agueda Rios Solis 1 Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper addresses the parallel machine scheduling problem where jobs have different earliness-tardiness penalties and a common due date. Since the problem is conjectured NP-hard in the strong sense, we propose a large neighborhood search that can be explored by a pseudo polynomial dynamic program algorithm. Computational experiments are presented and compared to a lower bound in order to verify that their gap is reasonable. They are also compared to simple local search based on moves and swaps between jobs.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01420609
Contributor : Lip6 Publications <>
Submitted on : Tuesday, December 20, 2016 - 5:44:57 PM
Last modification on : Thursday, March 21, 2019 - 2:33:34 PM

Identifiers

  • HAL Id : hal-01420609, version 1

Citation

Yasmin Agueda Rios Solis, Francis Sourd. Large neighborhood for a parallel scheduling problem with earliness-tardiness penalties and a common due date. Multidisciplinary International Conference on Scheduling: Theory and Applications, Jul 2005, New York, United States. pp.169-184. ⟨hal-01420609⟩

Share

Metrics

Record views

55