Sign in
A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem.
Ivar Massabò
Giuseppe Paletta
Alex J. Ruiz-Torres
Published in:
J. Sched. (2016)
Keyphrases
</>
parallel machines
makespan minimization
scheduling problem
sequence dependent setup times
precedence constraints
computational complexity
lot sizing
parallel computing
single server
release dates
worst case
error bounds
single machine
combinatorial optimization problems
total weighted tardiness