On the complexity of scheduling with negative time lags - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

On the complexity of scheduling with negative time lags

Adel Manaa
  • Fonction : Auteur
  • PersonId : 980087
Claire Hanen

Résumé

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.
Fichier non déposé

Dates et versions

hal-01292249 , version 1 (22-03-2016)

Identifiants

  • HAL Id : hal-01292249 , version 1

Citer

Adel Manaa, Claire Hanen. On the complexity of scheduling with negative time lags. EURO conference, Jul 2010, Lisbon, Portugal. ⟨hal-01292249⟩
38 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More