Login / Signup
Efficient algorithms to minimize makespan of the unrelated parallel batch-processing machines scheduling problem with unequal job ready times.
Yaser Zarook
Javad Rezaeian
Iraj Mahdavi
Masoud Yaghini
Published in:
RAIRO Oper. Res. (2021)
Keyphrases
</>
batch processing machines
maximum lateness
scheduling problem
single machine
flowshop
precedence constraints
release dates
parallel machines
sequence dependent setup times
processing times
tabu search
setup times
np hard
special case
minimizing makespan
lower bound