Deterministic Approximations to Co-Production Problems with Service Constraints and Random Yields
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.
Computer Sciences | Management Information Systems
Information Systems and Management
BITRAN, G. and LEONG, Thin Yin.
Deterministic Approximations to Co-Production Problems with Service Constraints and Random Yields. (1992). Management Science. 38, (5), 724-742. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/155