Efficient Production-Distribution System Design

Published Online:https://doi.org/10.1287/mnsc.1050.0392

References

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