Algorithms and heuristics for variable-yield lot sizing

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(198702)34:1<67::AID-NAV3220340107>3.0.CO;2-R" /><67::AID-NAV3220340107>3.0.CO;2-R 10.1002/1520-6750(198702)34:1<67::AID-NAV3220340107>3.0.CO;2-RzbMath0609.90032OpenAlexW2023168491MaRDI QIDQ3750464

Wagner, Harvey M., Joseph B. Mazzola, William F. McCoy

Publication date: 1987

Full work available at URL: https://doi.org/10.1002/1520-6750(198702)34:1<67::aid-nav3220340107>3.0.co;2-r

zbMATH Keywords

heuristicscomputational evaluationmultiperiod lot-sizingnear-optimal lot-sizing policiesstationary demand continuous-time problemsupply safety stocktwo economic order quantity

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (8)

Yield randomness, cost tradeoffs, and diversification in the EOQ model ⋮ Approaches for periodic inventory control under random production yield and fixed setup cost ⋮ Control policy for a manufacturing system with random yield and rework ⋮ Multi-sourcing under supply uncertainty and buyer's risk aversion ⋮ Dynamic Volunteer Staffing in Multicrop Gleaning Operations ⋮ Periodic review inventory systems with fixed order cost and uniform random yield ⋮ Supplier diversification under binomial yield ⋮ Optimal policies for inventory systems with discretionary sales, random yield and lost sales

This page was built for publication: Algorithms and heuristics for variable-yield lot sizing