Efficient production-distribution system design

Management Science

Volumn 51, Issue 7, 2005, Pages 1151-1164

  Elhedhli, Samir ^a   Coffin, Jean Louis ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Branch and price; Interior point cutting plane methods; Lagrangean relaxation; Nested decomposition; Production distribution systems

Indexed keywords

HIERARCHICAL SYSTEMS; INTEGRAL EQUATIONS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; PRODUCTIVITY;

BRANCH AND PRICE; INTERIOR-POINT CUTTING-PLANE METHODS; LAGRANGEAN RELAXATION; NESTED DECOMPOSITION; PRODUCTION-DISTRIBUTION SYSTEMS;

SYSTEMS ANALYSIS;

EID: 25144453382     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.1050.0392     Document Type: Review

References (33)

1. Arntzen, B. C., G. G. Brown, T. P. Harrison, L. L. Trafton. 1995. Global supply chain management at Digital Equipment Corporation. Interfaces 25 69-93.
2. Barcelo, J., J. Casanovas. 1984. A heuristic Lagrangean algorithm for the capacitated facility location problem. Eur. J. Oper. Res. 15 212-222.
3. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46 316-329.
4. Beamon, B. M. 1998. Supply chain design and analysis: Models and methods. Internat. J. Production Econom. 55 281-294.
5. Beasley, J. E. 1993. Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65 383-399.
6. Cordeau, J.-F., G. Stojkovic, F. Soumis, J. Desrosiers. 2001. Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Sci. 35 375-388.
7. Cornuejols, G., R. Sridharan, J.-M. Thizy. 1991. A comparison of heuristics and relaxations for the capacitated plant location problem. Eur. J. Oper. Res. 50 280-297.
8. Diaz, J. A., E. Fernandez. 2002. A branch-and-price algorithm for the single source capacitated plant location problem. J. Oper Res. Soc. 53(7) 728-740.
9. Elhedhli, S., J.-L. Coffin. 2004. The integration of an interior-point cutting plane method within a branch and price algorithm. Math. Programming 100(2) 267-294.
10. Erenguc, S. S., N. C. Simpson, A. J. Vakharia. 1999. Integrated production/distribution planning in supply chains: An invited review. Eur. J. Oper. Res. 115 219-236.
11. Gao, L., E. P. Robinson. 1992. A dual based optimization procedure for the two-echelon uncapacitated facility location problem. Naval Res. Logist. 39 191-212.
12. Geoffrion, A. M. 1974. Lagrangean relaxation for integer programming. Math. Programming Study Sur. 2 82-114.
13. Geoffrion, A. M., G. Graves. 1974. Multicommodity distribution system design by Benders decomposition. Management Sci. 20 822-844.
14. Goffin, J. L., A. Haurie, J. P. Vial. 1992. Decomposition and nondifferentiable optimization with the projective algorithm. Management Sci. 38 284-302.
15. Gupta, A., C. D. Maranas. 1999. A hierarchical Lagrangean relaxation procedure for solving midterm planning problems. Indust. Engrg. Chemical Res. 38 1937-1947.
16. Holmberg, K., M. Ronnqvist, D. Yuan. 1999. An exact algorithm for the capacitated facility location problem with single sourcing. Eur. J. Oper. Res. 113 544-559.
17. Kelley, J. E. 1960. The cutting plane method for solving convex programs. J. SIAM 8 703-712.
18. Klincewicz, J. G., H. Luss. 1986. A Lagrangean relaxation heuristic for capacitated facility location with single-source constraints. J. Oper. Res. Soc. 37(5) 495-500.
19. Martello, S., P. Toth. 1990. Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, New York.
20. Martin, C. H., D. C. Dent, J. C. Eckhart. 1993. Integrated production distribution and inventory planning at Libbey-Owens-Ford. Interfaces 23 68-78.
21. Neebe, A. W., M. R. Rao. 1983. An algorithm for the fixed-charge assigning users to sources problem. J. Oper. Res. Soc. 34 1107-1113.
22. Pirkul, H. 1987. Efficient algorithms for the capacitated concentrator location problem. Comput. Oper. Res. 14(3) 197-208.
23. Pirkul, H., V. Jayaraman. 1996. Production transportation and distribution planning in a multi-commodity tri-echelon system. Transportation Sci. 30 291-302.
24. Pooley, J. 1994. Integrated production and distribution facility planning at Ault Foods. Interfaces 24 113-121.
25. Robinson, E. P., Jr., L. L. Gao, S. D. Muggenborg. 1993. Designing an integrated distribution system at DowBrands. Interfaces 23 107-117.
26. Ryan, D. M., B. A. Foster. 1981. An integer programming approach to scheduling. A. Wren, ed. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling. North-Holland, Amsterdam, The Netherlands, 269-280.
27. Sarkissian, R. 1997. Telecommunications networks: Routing and survivability optimization using a central cutting plane method. Ph.D. thesis, Ecole Polytechnique Federale, Lausanne, Switzerland.
28. Sarmiento, A. M., R. Nagi. 1999. A review of integrated analysis of production-distribution systems. IIE Trans. 31 1061-1074.
29. Sridharan, R. 1993. A Lagrangean heuristic for the capacitated facility location problem with single source constraints. Eur. J. Oper. Res. 66 305-312.
30. Vanderbeck, F. 2001. A nested decomposition approach to a 3-stage 2-dimensional cutting-stock problem. Management Sci. 47 864-879.
31. Verter, V., A. Dasci, M. A. Bulgak. 2001. The production-distribution system design problem. C. Floudas, P. Pardalos, eds. Encyclopedia of Optimization. Kluwer Academic Publishers, Boston, MA.
32. Vidal, C. J., M. Goetschalckx. 1997. Startegic production-distribution models: A critical review with emphasis on global supply chain models. Eur. J. Oper. Res. 98 1-18.
33. Ye, Y. 1997. Interior-Point Algorithms: Theory and Analysis. John Wiley & Sons, New York.