An algorithm for the multiple lot sizing problem with rigid demand and interrupted geometric yield

DOI10.1006/jmaa.1999.6376zbMath0937.90003OpenAlexW2067157021MaRDI QIDQ1301878

V. Pereyra

Publication date: 14 June 2000

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1999.6376

zbMATH Keywords

dynamic programminggeometric yield distributionmultiple lot sizing problem

Mathematics Subject Classification ID

Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (2)

The multiple lot sizing problem of a serial production system with interrupted geometric yields, rigid demand and Pentico's heuristic ⋮ The finite multiple lot sizing problem with interrupted geometric yield and holding costs

Cites Work

• Multiple lotsizing with random common-cause yield and rigid demand
• Properties of the multiple lot-sizing problem with rigid demands and general yield distributions
• Multiple lotsizing in production to order with random yields: review of recent advances
• Optimal Lot Sizing, Process Quality Improvement and Setup Cost Reduction
• Optimal reject allowance with constant marginal production efficiency
• A Single Bottleneck System with Binomial Yields and Rigid Demand
• Lot Sizing with Random Yields: A Review
• Quality Control under Markovian Deterioration
• Note—The Impact of Inspection Delay on Process and Inspection Lot Sizing

This page was built for publication: An algorithm for the multiple lot sizing problem with rigid demand and interrupted geometric yield