Login / Signup
A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination.
Yong Chen
An Zhang
Zhiyi Tan
Ying Xue
Guangting Chen
Published in:
J. Oper. Res. Soc. (2021)
Keyphrases
</>
parallel machines
scheduling problem
np hard
similarity measure
optimal solution
makespan minimization
objective function
worst case
search space
dynamic programming
probabilistic model
steady state
flowshop
precedence constraints
scheduling jobs