Scheduling problems with rejection to minimize the maximum flow time.

Liqi Zhang Lingfa Lu

Published in: J. Syst. Sci. Complex. (2016)

Keyphrases

maximum flow
scheduling problem
minimum cut
single machine
completion times
directed graph
flowshop
processing times
push relabel
np hard
directed networks
precedence constraints
job shop scheduling problem
parallel machines
tabu search
min cut max flow
image processing