Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Series

Computer Sciences

Singapore Management University

Dynamic programming

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

A Dynamic Programming Approach To Achieving An Optimal End State Along A Serial Production Line, Shih-Fen Cheng, Blake E. Nicholson, Marina A. Epelman, Daniel J. Reaume, Robert L. Smith Dec 2013

A Dynamic Programming Approach To Achieving An Optimal End State Along A Serial Production Line, Shih-Fen Cheng, Blake E. Nicholson, Marina A. Epelman, Daniel J. Reaume, Robert L. Smith

Research Collection School Of Computing and Information Systems

In modern production systems, it is critical to perform maintenance, calibration, installation, and upgrade tasks during planned downtime. Otherwise, the systems become unreliable and new product introductions are delayed. For reasons of safety, testing, and access, task performance often requires the vicinity of impacted equipment to be left in a specific “end state” when production halts. Therefore, planning the shutdown of a production system to balance production goals against enabling non-production tasks yields a challenging optimization problem. In this paper, we propose a mathematical formulation of this problem and a dynamic programming approach that efficiently finds optimal shutdown policies for …


Deterministic Approximations To Co-Production Problems With Service Constraints And Random Yields, Gabriel R. Bitran, Thin Yin Leong May 1992

Deterministic Approximations To Co-Production Problems With Service Constraints And Random Yields, Gabriel R. Bitran, Thin Yin Leong

Research Collection School Of Computing and Information Systems

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 …