Exponential neighborhood search for a parallel machine scheduling problem

Yasmin Agueda Rios Solis Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We consider the parallel machine scheduling problem where jobs have different earliness-tardiness penalties and a restrictive common due date. This problem is NP-hard in the strong sense. In this paper we define an exponential size neighborhood for this problem and prove that finding the local minimum in it is an NP-hard problem. The main contribution of this paper is to propose a pseudo-polynomial algorithm that finds the best solution of the exponential neighborhood. Additionally, we present some computational results.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185213
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 2:18:34 PM
Last modification on : Thursday, November 22, 2018 - 2:07:25 PM

Identifiers

Collections

Citation

Yasmin Agueda Rios Solis, Francis Sourd. Exponential neighborhood search for a parallel machine scheduling problem. Computers and Operations Research, Elsevier, 2008, 35 (5), pp.1697-1712. 〈10.1016/j.cor.2006.10.008〉. 〈hal-01185213〉

Share

Metrics

Record views

93