The Scheduling of a Multi-Product Facility.
Abstract
The authors are concerned with obtaining the optimal schedule of N products over a single facility in the finite and infinite horizons. This is a generalization of the classical cyclical 'Economic Manufacturing Quantity' formulations. Through number-theoretic arguments. The authors discuss questions of feasibility, the existence of communicating classes, and sensitivity to 'saturation'. In the finite horizon case, the authors present an algorithm that generates the production plan, and another algorithm that generates the production schedule through a shortest-path interpretation. In the infinite horizon case, the authors do likewise: the optimal production plan is a Turnpike cycle. Due to the immensity of the state space, approximate procedures are also discussed. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 10, 1972
- Accession Number
- AD0750255
Entities
People
- Arup K. Mallik
- Salah E. Elmaghraby
Organizations
- North Carolina State University