Login / Signup
A new formulation for scheduling unrelated processor under precedence constraints.
Nelson Maculan
Stella C. S. Porto
Celso C. Ribeiro
Cid Carvalho de Souza
Published in:
RAIRO Oper. Res. (1999)
Keyphrases
</>
precedence constraints
parallel processors
scheduling problem
branch and bound algorithm
precedence relations
parallel machines
release dates
vertex cover
sequence dependent setup times
maximum lateness
approximation algorithms
partially ordered
single machine scheduling problem
setup times
partial order
global constraints
unit length
single machine
np hard
total tardiness
series parallel
tabu search
partially ordered sets
computational complexity
linear programming
lower bound