C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Two parallel identical machines scheduling to minimise the maximum inter-completion time.
Feifeng Zheng
Yang Sui
E. Zhang
Yinfeng Xu
Ming Liu
Published in:
Int. J. Prod. Res. (2020)
Keyphrases
</>
identical machines
processing times
scheduling problem
single machine
job scheduling
scheduling jobs
polynomial time approximation
precedence constraints
np hard
search algorithm
lower bound
release dates