Calculating safety stocks for assembly systems with random component procurement lead times: A branch and bound algorithm.
Mohamed Aly Ould LoulyAlexandre DolguiPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- assembly systems
- branch and bound algorithm
- lead time
- lower bound
- branch and bound
- lot sizing
- inventory control
- upper bound
- supply chain
- single machine scheduling problem
- np hard
- optimal solution
- release dates
- combinatorial optimization
- multistage
- distribution systems
- supply chain management
- precedence constraints
- service level
- optimal control
- lagrangian relaxation
- total cost
- single item
- planning horizon
- search algorithm
- holding cost
- reinforcement learning
- search space
- production planning
- objective function