Exponential neighborhood search for a parallel machine scheduling problem - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2008

Exponential neighborhood search for a parallel machine scheduling problem

Yasmin Agueda Rios Solis
  • Function : Author
Francis Sourd
  • Function : Author
  • PersonId : 836436

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.

Dates and versions

hal-01185213 , version 1 (19-08-2015)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More