Login / Signup
Minimizing Makespan for the Lazy Bureaucrat Problem.
Clint Hepner
Clifford Stein
Published in:
SWAT (2002)
Keyphrases
</>
minimizing makespan
scheduling problem
total flowtime
flowshop
lazy learning
parallel machines
search algorithm
np hard
single machine
averaged one dependence estimators
optimal solution
special case
higher order
multistage
multiply sectioned bayesian networks