The Discrete-Time Sequencing Expansion Problem

DOI10.1287/OPRE.31.3.546zbMath0514.90017OpenAlexW2151515023MaRDI QIDQ3661268

No author found.

Publication date: 1983

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.31.3.546

zbMATH Keywords

Lagrangian relaxationcomputational resultslogisticsdiscrete-time formulationsequencing expansion problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items (3)

Optimizing the strategic patient mix combining queueing theory and dynamic programming ⋮ Technology acquisition with technological progress: Effects of expectations, rivalry and uncertainty ⋮ Multi-facility capacity expansion in R&D projects

This page was built for publication: The Discrete-Time Sequencing Expansion Problem