Login / Signup
Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times.
Daniel J. Rosenkrantz
Lin Yu
S. S. Ravi
Published in:
Algorithmica (2001)
Keyphrases
</>
fixed number
execution times
scheduling problem
computationally expensive
finite number
computationally efficient
processing times
np hard
closely related
lot sizing
construction process
setup times
identical parallel machines