Multicommodity Production Planning: Qualitative Analysis and Applications

Published Online:https://doi.org/10.1287/msom.2015.0549

References

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
  • Anily S (1991) Multi-item replenishment and storage problem (MIRSP): Heuristics and bounds. Oper. Res. 39:233–243.LinkGoogle Scholar
  • Anily S, Tzur M (2006) Algorithms for the multi-item multi-vehicles dynamic lot sizing problem. Naval Res. Logist. 53:157–169.CrossrefGoogle Scholar
  • Bowman EH (1956) Production scheduling by the transportation method of linear programming. J. Oper. Res. Soc. Amer. 4: 100–103.LinkGoogle Scholar
  • Buffa ES, Taubert WH (1972) Production-Inventory Systems Planning and Control, revised ed. (Richard D. Irwin, Homewood, IL) Google Scholar
  • Ciurria-Infosino I, Granot F, Veinott AF Jr (2014) Substitutes, complements and ripples in multicommodity flows on suspension graphs. Networks 64:65–75.CrossrefGoogle Scholar
  • Dirac GA (1952) A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27:85–92.CrossrefGoogle Scholar
  • Duffin RJ (1965) Topology of series-parallel networks. J. Math. Anal. Appl. 10:303–318.CrossrefGoogle Scholar
  • Evans JR (1978) A single-commodity transformation for certain multi-commodity networks. Oper. Res. 26:673–680.LinkGoogle Scholar
  • Gale D, Politof T (1981) Substitutes and complements in network flow problems. Discrete Appl. Math. 3:175–186.CrossrefGoogle Scholar
  • Granot F, Veinott AF Jr (1985) Substitutes, complements and ripples in network flow. Math. Oper. Res. 10:471–497.LinkGoogle Scholar
  • Graves SC (2002) Manufacturing planning and control. Pardalos P, Resende M, eds. Handbook of Applied Optimization (Oxford University Press, New York), 728–746.Google Scholar
  • Hax AC, Candea D (1984) Production and Inventory Management (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
  • Hicks JR (1939) Value and Capital, 2nd ed. (Oxford University Press, Oxford, UK).Google Scholar
  • Hicks JR, Allen RGD (1934a) A reconsideration of the theory of value. Part I. Economica 1:52–76.CrossrefGoogle Scholar
  • Hicks JR, Allen RGD (1934b) A reconsideration of the theory of value. Part II. A mathematical theory of individual demand functions. Economica 1:196–219.CrossrefGoogle Scholar
  • Karush W (1958) On a class of minimum-cost problems. Management Sci. 4:136–153.LinkGoogle Scholar
  • Manne AS (1957) A note on the Modigliani-Hohn production smoothing model. Management Sci. 3:371–379.LinkGoogle Scholar
  • Modigliani F, Hohn F (1955) Production planning over time and the nature of expectation and planning horizon. Econometrica 23:46–66.CrossrefGoogle Scholar
  • Muckstadt JA, Roundy RO (1987) Multi-item, one-warehouse, multi-retailer distribution systems. Management Sci. 33:1613–1621.LinkGoogle Scholar
  • Perl Y, Shiloach Y (1978) Finding two disjoint paths between two pairs of vertices in a graph. J. ACM 25:1–9.CrossrefGoogle Scholar
  • Pochet Y, Wolsey LA (2003) Production Planning by Mixed Integer Programming (Springer, New York).Google Scholar
  • Roundy RO (1993) Efficient, effective lot-sizing for multi-product, multi-stage production systems. Oper. Res. 41:371–386.LinkGoogle Scholar
  • Samuelson PA (1971) Foundations of Economic Analysis (Antheneum, New York). [Orig. pub. 1947 (Harvard University Press, Cambridge, MA.] Google Scholar
  • Shapiro JF (1993) Mathematical programming models and methods for production planning and scheduling. Graves SC, Rinnooy Kan AHG, Zipkin PH, eds. Logistics of Production and Inventory Handbooks in Operations Research and Management Science, Vol. 4 (Elsevier Science, Amsterdam), 371–443.CrossrefGoogle Scholar
  • Shapley LS (1961) On network flow functions. Naval Res. Logist. Quart. 8:154–158.CrossrefGoogle Scholar
  • Shapley LS (1962) Complements and substitutes in the optimal assignment problem. Naval Res. Logist. Quart. 9:45–48.CrossrefGoogle Scholar
  • Soun Y, Truemper K (1980) Single commodity representation of multicommodity networks. SIAM J. Algebraic Discrete Methods 1:348–358.CrossrefGoogle Scholar
  • Topkis DM (1998) Supermodularity and Complementarity (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
  • Veinott AF Jr (1964) Production planning with convex costs: A parametric study. Management Sci. 10:441–460.LinkGoogle Scholar
  • Veinott AF Jr (1969) Minimum concave-cost solution of Leontief substitution models of multi-facility inventory systems. Oper. Res. 17:262–291.LinkGoogle Scholar
  • Wagner HM, Whitin TH (1958) Dynamic version of the economic lot size model. Management Sci. 5:89–96.LinkGoogle Scholar
  • Zangwill W (1969) A backlogging model and a multi-echelon model of a dynamic lot size production system. Management Sci. 15:506–527.LinkGoogle Scholar
  • Zipkin PH (2000) Foundations of Inventory Management (McGraw-Hill, New York).Google 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.