No open-access location is known for this record yet.
No open-access location is known for this record yet.
This paper considers a multi-product dynamic lot-size problem. In addition to a separate set-up cost for each product ordered, a joint set-up cost is incurred when one or more products are ordered. We present a dynamic programming formulation for finding the optimal ordering policy that calls for a smaller state space than that proposed by Zangwill. As a convenient substitute, we also introduce a very simple heuristic procedure and two of its variants. For the two-product problem we report computational experience for evaluating the performance of these procedures.
Loading…
Stored only when both papers are in the corpus — 97 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.