3 papers
cs.RO2011
Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks
Asma Lahimer, Pierre Lopez, Mohamed Haouari
This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The problem even in its simplest form is NP-hard in the strong sense. The great de…
cs.DS2009
Parallel machine scheduling with precedence constraints and setup times
Bernat Gacias, Christian Artigues, Pierre Lopez
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search meth…
cs.CC2006
Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis
Christian Artigues, Pierre Lopez, Pierre-Dimitri Ayache
We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and…