On the complexity of scheduling with negative time lags

Adel Manaa 1 Claire Hanen 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We investigate the scheduling problems with negative time lags to minimise the makespan. Unlike an ordinary precedence constraint, a negative time lag l between two tasks i and j, means that j cannot start earlier than —l time units before i. In such problems, the precedence graph may have cycles which may lead to unfeasibility. We identify polynomially solvable cases for different precedence graph structures on a single machine and on parallel machines. We also prove that for cyclic and star-like graphs, the problem with negative time lags is NP-complete.
Document type :
Conference papers
Complete list of metadatas

Contributor : Lip6 Publications <>
Submitted on : Tuesday, March 22, 2016 - 4:46:24 PM
Last modification on : Thursday, March 21, 2019 - 1:05:06 PM


  • HAL Id : hal-01292249, version 1


Adel Manaa, Claire Hanen. On the complexity of scheduling with negative time lags. EURO conference, Jul 2010, Lisbon, Portugal. ⟨hal-01292249⟩



Record views