The Scheduling of a Multi-Product Facility

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Elmaghraby,Salah E, Mallik,Arup K
Format: Report
Language:English
Subjects:
DECISION THEORY
ECONOMICS
GRAPHS
INVENTORY CONTROL
LINEAR PROGRAMMING
MARKOV CHAINS
MATHEMATICAL MODELS
MULTIPLE OPERATION
NETWORK FLOWS
Operations Research
OPTIMIZATION
PRODUCTION
SCHEDULING
SHORTEST ROUTE PROBLEM
STOCHASTIC PROCESSES
THEOREMS
TURNPIKE THEOREM
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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) Prepared in cooperation with West Virginia Univ., Morgantown. Presented at the Symposium on Scheduling Theory and Its Applications, North Carolina State Univ., Raleigh, 15-17 May 72.