Login / Signup
The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays.
Aurélien Carlier
Claire Hanen
Alix Munier Kordon
Published in:
J. Sched. (2017)
Keyphrases
</>
scheduling algorithm
release dates
processing times
precedence constraints
setup times
single machine
computational grids
scheduling problem
single machine scheduling problem
parallel machines
response time
partial order
resource consumption
branch and bound algorithm
flowshop
special case