C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Optimal on-line algorithms for one batch machine with grouped processing times.
Yang Fang
Peihai Liu
Xiwen Lu
Published in:
J. Comb. Optim. (2011)
Keyphrases
</>
processing times
scheduling problem
worst case
flowshop
benchmark problems
scheduling jobs
upper bound
learning algorithm
single machine
parallel machines
optimal strategy
batch processing
strongly np hard
identical machines
shortest processing time