Sequencing Capacity Expansion Projects in Continuous Time

DOI10.1287/MNSC.32.11.1467MaRDI QIDQ3757671zbMATH OpenOpenAlexFDO

Authors

Publication date 1986

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.32.11.1467

zbMATH Keywords

heuristicshortest pathbranch and boundLagrangean relaxationacyclic networkbackward dynamic programmingsequencing capacity expansion projects

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Selection of Capacity Expansion Projects
• Capacity expansion planning for a single facility product line
• The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic
• Optimal machine capacity expansions with nested limitations under stochastic demand
• Optimal capacity expansion under uncertainty

Cited in

(3)

• Optimizing the strategic patient mix combining queueing theory and dynamic programming
• Multi-facility capacity expansion in R&D projects
• The effect of discretizing the planning period on the optimal cost of capacity expansion systems

This page was built for publication: Sequencing Capacity Expansion Projects in Continuous Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757671)