IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v45y2013i12p1278-1292.html
   My bibliography  Save this article

A dynamic programming approach to achieving an optimal end-state along a serial production line

Author

Listed:
  • Shih-Fen Cheng
  • Blake Nicholson
  • Marina Epelman
  • Daniel Reaume
  • Robert Smith

Abstract

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. This article proposes a mathematical formulation of this problem and a dynamic programming approach that efficiently finds optimal shutdown policies for deterministic serial production lines. An event-triggered re-optimization procedure that is based on the proposed deterministic dynamic programming approach is also introduced for handling uncertainties in the production line for the stochastic case. It is demonstrated numerically that in these cases with random breakdowns and repairs, the re-optimization procedure is efficient and even obtains results that are optimal or nearly optimal.

Suggested Citation

  • Shih-Fen Cheng & Blake Nicholson & Marina Epelman & Daniel Reaume & Robert Smith, 2013. "A dynamic programming approach to achieving an optimal end-state along a serial production line," IISE Transactions, Taylor & Francis Journals, vol. 45(12), pages 1278-1292.
  • Handle: RePEc:taf:uiiexx:v:45:y:2013:i:12:p:1278-1292
    DOI: 10.1080/0740817X.2013.770183
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2013.770183
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2013.770183?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uiiexx:v:45:y:2013:i:12:p:1278-1292. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.