Login / Signup
Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times.
Gur Mosheiov
Daniel Oron
Published in:
Comput. Oper. Res. (2012)
Keyphrases
</>
number of tardy jobs
processing times
flowshop
single machine
polynomially solvable
scheduling problem
special case
single machine scheduling problem
release dates
makespan minimization
setup times
total weighted tardiness
resource consumption
competitive ratio
bicriteria
sequence dependent setup times