Decomposition heuristic to minimize total cost in a multi-level supply chain network
Authors:
- 1 May 2008
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 54 (4) , 945-959
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Minmax regret location–allocation problem on a network under uncertaintyEuropean Journal of Operational Research, 2007
- Genetic subgradient method for solving location–allocation problemsApplied Soft Computing, 2007
- Optimizing delivery lead time/inventory placement in a two-stage production/distribution systemEuropean Journal of Operational Research, 2006
- A hybrid genetic algorithm for production and distributionOmega, 2005
- Hierarchical design of an integrated production and 2-echelon distribution systemEuropean Journal of Operational Research, 1999
- Probabilistic Analyses and Algorithms for Three-Level Distribution SystemsManagement Science, 1998
- An Integrated Inventory Allocation and Vehicle Routing ProblemTransportation Science, 1989
- Inventory/routing: Reduction from an annual to a short-period problemNaval Research Logistics (NRL), 1987
- A vehicle routing improvement algorithm comparison of a “greedy” and a matching implementation for inventory routingComputers & Operations Research, 1986
- Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling OptimizerInterfaces, 1983