Sign in
A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines.
Chengwen Jiao
Wenhua Li
Jinjiang Yuan
Published in:
Asia Pac. J. Oper. Res. (2014)
Keyphrases
</>
maximum flow
k means
search space
online algorithms
np hard
dynamic programming
worst case
minimum spanning tree
clustering method
minimum cut
batch mode
parallel machines
graph structure
ant colony optimization
image processing
segmentation algorithm
linear programming
objective function