Login / Signup
Improved Combinatorial Benders Decomposition for a Scheduling Problem with Unrelated Parallel Machines.
Francisco Regis Abreu Gomes
Geraldo Robson Mateus
Published in:
J. Appl. Math. (2017)
Keyphrases
</>
unrelated parallel machines
scheduling problem
benders decomposition
parallel machines
setup times
flowshop
single machine
mixed integer
np hard
tabu search
processing times
network design problem
lot sizing
job shop
exact algorithms
precedence constraints
approximation algorithms
scheduling jobs
upper bound