A note on valid inequalities for minimizing the total tardiness in a two-machine flow shop.
Sebastian SpindlerMatthias SoppertClaudius SteinhardtPublished in: J. Oper. Res. Soc. (2023)
Keyphrases
- total tardiness
- valid inequalities
- scheduling problem
- single machine
- integer programming
- processing times
- feasible solution
- np hard
- tabu search
- traveling salesman problem
- linear programming
- mixed integer programming
- mixed integer
- flowshop
- cutting plane
- setup times
- parallel machines
- lower and upper bounds
- convex hull
- column generation
- integer program
- primal dual
- lagrangian relaxation
- facet defining inequalities
- continuous variables
- linear program
- approximation algorithms
- single machine scheduling problem
- production planning
- network flow
- branch and bound