C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Online Makespan Minimization: Beat LPT by Dynamic Locking.
Zhaozi Wang
Zhiwei Ying
Yuhao Zhang
Published in:
CoRR (2023)
Keyphrases
</>
makespan minimization
polynomial time approximation
processing times
special case
worst case
multi objective
np hard
parallel machines
scheduling problem
linear programming
error bounds