Dynamic Capacity Expansion Problem with Deferred Expansion and Age-Dependent Shortage Cost

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

References

  • Aggarwal A., Park J. Improved algorithm for economic lot size problems. Oper. Res. (1993) 41:549–571LinkGoogle Scholar
  • Aggarwal A., Klawe M. M., Moran S., Shor P. W., Wilber R. Geometric applications of a matrix-searching algorithm. Algorithmica (1987) 2:195–208CrossrefGoogle Scholar
  • Bazaraa M. S., Shetty C. M.Nonlinear Programming—Theory and Algorithms (1979) (John Wiley & Sons, New York) Google Scholar
  • Chand S., McClurg T., Ward J. A model for parallel machine replacement with capacity expansion. Eur. J. Oper. Res. (2000) 121:519–531CrossrefGoogle Scholar
  • Eppstein D. Sequence comparison with mixed convex and concave costs. J. Algorithms (1990) 11:85–101CrossrefGoogle Scholar
  • Galil Z., Park K. A linear-time algorithm for concave one-dimensional dynamic programming. Inform. Processing Lett. (1990) 33:309–311CrossrefGoogle Scholar
  • Hsu V. N., Lowe T. J. Dynamic economic lot size models with period-pair-dependent backorder and inventory costs. Oper. Res. (2001) 49:316–321LinkGoogle Scholar
  • Hsu V. N., Lowe T. J., Tamir A. Structured p-facility location problems on the line solvable in polynomial time. Oper. Res. Lett. (1997) 21:159–164CrossrefGoogle Scholar
  • Jones P. C., Lowe T. J., Muller G., Xu N., Ye Y., Zydiak J. L. Specially structured uncapacitated facility location problems. Oper. Res. (1995) 43:661–669LinkGoogle Scholar
  • Klincewicz J., Luss H., Yu C. S. A large-scale multilocation capacity planning model. Eur. J. Oper. Res. (1988) 34:178–190CrossrefGoogle Scholar
  • Krarup J., Bilde O., Collatz L., et al. Plant location, set covering and economic lot size: An O(mn)-algorithm for structured problems. Optimierung Bei Graphentheoretischen und Ganzzahligen Probleme (1977) (Birkhäuser Verlag, Basel) 155–179ISNM 36CrossrefGoogle Scholar
  • Lee S. B., Luss H., Collatz L. Multifacility-type capacity expansion planning: Algorithms and complexities. Oper. Res. (1987) 35:249–253LinkGoogle Scholar
  • Li S., Tirupati D. Dynamic capacity expansion problem with multiple products: Technology selection and timing of capacity additions. Oper. Res. (1994) 42:958–976LinkGoogle Scholar
  • Luss H. A capacity expansion model for two facility types. Naval Res. Logist. Quart. (1979) 26:291–303CrossrefGoogle Scholar
  • Luss H. A network flow approach for capacity expansion problem with two facility types. Naval Res. Logist. Quart. (1980) 27:597–608CrossrefGoogle Scholar
  • Luss H. Operations research and capacity expansion problems: A survey. Oper. Res. (1982) 30:907–947LinkGoogle Scholar
  • Luss H. A multifacility capacity expansion model with joint expansion set-up costs. Naval Res. Logist. Quart. (1983) 30:97–111CrossrefGoogle Scholar
  • Rajagopalan S. Deterministic capacity expansion under deterioration. Management Sci. (1992) 38:525–539LinkGoogle Scholar
  • Rajagopalan S. Capacity expansion and equipment replacement: A unified approach. Oper. Res. (1998) 46:846–857LinkGoogle Scholar
  • Rajagopalan S., Soteriou A. Capacity acquisition and disposal with discrete facility sizes. Management Sci. (1994) 40:903–917LinkGoogle Scholar
  • Rajagopalan S., Singh M. R., Morton T. E. Capacity expansion and replacement with uncertain technological breakthroughs. Management Sci. (1998) 44:12–30LinkGoogle Scholar
  • Veinott A. F. Minimum concave cost solution of Leontief substitution models of multifacility inventory systems. Oper. Res. (1969) 17:262–291LinkGoogle Scholar
  • Wagner R., Whitin T. M. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96LinkGoogle 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.