Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs.
Céline GicquelAbdel LisserPublished in: OR (2011)
Keyphrases
- scheduling problem
- lower bound
- semidefinite
- lot sizing
- setup times
- single item
- np hard
- upper bound
- setup cost
- multistage
- convex relaxation
- semidefinite programming
- single machine
- flowshop
- branch and bound
- branch and bound algorithm
- multi item
- worst case
- parallel machines
- sufficient conditions
- objective function
- linear programming
- processing times
- tabu search
- lead time
- optimal solution
- convex sets
- approximation algorithms
- lower and upper bounds
- production planning
- mixed integer
- higher dimensional
- total cost
- mixed integer programming
- interior point methods
- lagrangian relaxation
- linear programming relaxation
- planning horizon
- lot size
- finite dimensional
- holding cost
- production cost
- integer programming
- long run
- convex optimization
- high dimensional
- finite number
- supply chain