Login / Signup
A minimum-cost network flow approach to preemptive parallel-machine scheduling.
Ling-Huey Su
T. C. E. Cheng
Fuh-Der Chou
Published in:
Comput. Ind. Eng. (2013)
Keyphrases
</>
processing times
setup times
scheduling problem
single machine
priority queue
scheduling algorithm
lower bound
data structure
response time
competitive ratio
parallel machines
flowshop
neural network
np hard
search algorithm
optimal solution
machine learning