Publication Type
Journal Article
Version
acceptedVersion
Publication Date
5-1992
Abstract
Production planning problems where multiple item categories are produced simultaneously are examined. The items have random yields and are used to satisfy the demands of many products. These products have specification requirements that overlap. An item originally targeted to satisfy the demand of one product may be used to satisfy the demand of other products when it conforms to their specifications. Customers' demand must be satisfied from inventory. The problem is formulated with service constraints and a near-optimal solution is provided to the problem with a fixed planning horizon. Simple heuristics are proposed for the problem solved with a rolling horizon. Some of the heuristics performed very well over a wide range of parameters.
Keywords
simultaneous production, production planning with uncertain yields, co-production, by-products, dynamic programming, substitutability
Discipline
Computer Sciences | Management Information Systems | Operations Research, Systems Engineering and Industrial Engineering
Research Areas
Intelligent Systems and Optimization
Publication
Management Science
Volume
38
Issue
5
First Page
724
Last Page
742
ISSN
0025-1909
Identifier
10.1287/mnsc.38.5.724
Publisher
INFORMS
Citation
BITRAN, Gabriel R. and LEONG, Thin Yin.
Deterministic Approximations to Co-Production Problems with Service Constraints and Random Yields. (1992). Management Science. 38, (5), 724-742.
Available at: https://ink.library.smu.edu.sg/sis_research/155
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1287/mnsc.38.5.724
Included in
Computer Sciences Commons, Management Information Systems Commons, Operations Research, Systems Engineering and Industrial Engineering Commons