Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem.

Carla Juvin Laurent Houssin Pierre Lopez

Published in: Comput. Oper. Res. (2023)

Keyphrases

benders decomposition
mixed integer
network design problem
multi objective
exact algorithms
scheduling problem
lower bound
network design
approximation algorithms
minimal cost
special case
knapsack problem
lagrangian relaxation
nonlinear programming