Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs.
Esaignani SelvarajahGeorge SteinerPublished in: Oper. Res. (2009)
Keyphrases
- supply chain
- approximation algorithms
- operating costs
- scheduling problem
- np hard
- special case
- single machine
- flowshop
- supply chain management
- lead time
- supplier selection
- service level
- completion times
- planning horizon
- limited capacity
- inventory holding costs
- worst case
- network design problem
- facility location problem
- integer programming
- optimal solution
- lower bound
- capacity planning
- decision making
- inventory control
- linear programming
- combinatorial auctions
- tabu search
- parallel machines
- computational complexity
- lagrangian relaxation
- vehicle routing problem
- branch and bound algorithm
- greedy algorithm
- customer demand