Production Runs for Multiple Products: The Two-Product Heuristic

Alan L. Saipe

30 citations0/0 files storedManagement Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Supply Chain and Inventory Management Management and Optimization Techniques Scheduling and Optimization Algorithms

Abstract

The optimal solution is presented for the problem of determining production run sizes for two products which must be produced on the same machine. This solution forms the basis for a heuristic solution to the N product problem. This heuristic provides uniformly better results than the complete-cycle heuristic for this problem. Numerical examples are presented to illustrate the method.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 30 citations exist upstream.

References

1958Production planning and inventory control 1968Decision Rules for Inventory Management 1969Production-Inventory Systems: Planning and Control 1963Elements of Production Planning and Control

Cited by

2007Economic lot scheduling with uncontrolled co-production 1979Integrated Production Inventory Policies for Multistage Multiproduct Batch Production Systems 2008Simultaneous determination of multiproduct batch and full truckload shipment schedules

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.