Improved formulations and new valid inequalities for a Hybrid Flow Shop problem with time-varying resources and chaining time-lag.
Quoc Nhat Han TranNhan-Quy NguyenFarouk YalaouiLionel AmodeoHicham ChehadePublished in: Comput. Oper. Res. (2023)
Keyphrases
- valid inequalities
- flowshop
- scheduling problem
- integer programming
- feasible solution
- traveling salesman problem
- linear programming
- tabu search
- mixed integer
- convex hull
- cutting plane
- mixed integer programming
- lower and upper bounds
- column generation
- network design problem
- np hard
- linear programming relaxation
- primal dual
- special case
- integer program
- lot streaming
- ant colony optimization
- lp relaxation
- lagrangian relaxation
- resource allocation
- facet defining
- continuous variables
- solution quality
- single machine
- network flow
- mathematical model