Efficient Algorithms for Finding Optimal Power-of-Two Policies for Production/Distribution Systems with General Joint Setup Costs

DOI10.1287/opre.43.3.458zbMath0839.90056OpenAlexW1975533380WikidataQ114967770 ScholiaQ114967770MaRDI QIDQ4861359

Awi Federgruen, Yu-Sheng Zheng

Publication date: 23 June 1996

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

Full work available at URL: https://semanticscholar.org/paper/79e8d9db4f2521232a75cd45fa1421ff59fe7fd2

zbMATH Keywords

directed acyclic networkpolymatroidal maximum flow-calculations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Production models (90B30)

Related Items (2)

A serial inventory system with supplier selection and order quantity allocation ⋮ A cyclic versus flexible approach to materials ordering in make-to-order assembly

This page was built for publication: Efficient Algorithms for Finding Optimal Power-of-Two Policies for Production/Distribution Systems with General Joint Setup Costs