Login / Signup
An improved formulation and efficient heuristics for the discrete parallel-machine makespan ScheLoc problem.
Shijin Wang
Ruochen Wu
Feng Chu
Jianbo Yu
Xin Liu
Published in:
Comput. Ind. Eng. (2020)
Keyphrases
</>
scheduling problem
parallel machines
list scheduling
unrelated parallel machines
release dates
single machine
scheduling jobs
flowshop
minimizing makespan
earliness tardiness
processing times
open shop
total tardiness
setup times
ibm sp
special case
single machine scheduling problem
precedence constraints
np hard