Exact and approximate algorithms for the multi-period procurement problem where dedicated supplier capacity can be reserved

DOI10.1007/BF01540156zbMath0865.90035OpenAlexW2062349035MaRDI QIDQ2564336

Daniel Costa, Edward A. Silver

Publication date: 7 January 1997

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01540156

zbMATH Keywords

dynamic programmingbranch-and-boundmulti-period inventory problem

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (2)

Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research ⋮ Capacity reservation and utilization for a manufacturer with uncertain capacity and demand

Uses Software

• Tabu search

Cites Work

• A user's guide to tabu search
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact and approximate algorithms for the multi-period procurement problem where dedicated supplier capacity can be reserved