IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i10p3047-3062.html
   My bibliography  Save this article

A dynamic optimisation approach for a single machine scheduling problem with machine conditions and maintenance decisions

Author

Listed:
  • Wenhui Yang
  • Lu Chen
  • Stèphane Dauzère-Pèrés

Abstract

In modern production systems, considering machine conditions is becoming essential to achieving an overall optimisation of the production schedule. This paper studies a single machine scheduling problem, where the actual processing times of jobs depend on their position in the production sequence and maintenance is considered. Moreover, the machine is subject to an uncertain condition variation. There is a trade-off between rejecting a maintenance action, resulting in longer processing times, and accepting a maintenance action, leading to higher processing efficiency for future jobs. The problem is formulated as a finite-horizon Markov Decision Process. The objective is to minimise the makespan. Optimality properties are analysed, based on which a dynamic optimisation approach is developed. Computational experiments demonstrate the effectiveness of the proposed approach.

Suggested Citation

  • Wenhui Yang & Lu Chen & Stèphane Dauzère-Pèrés, 2022. "A dynamic optimisation approach for a single machine scheduling problem with machine conditions and maintenance decisions," International Journal of Production Research, Taylor & Francis Journals, vol. 60(10), pages 3047-3062, May.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:10:p:3047-3062
    DOI: 10.1080/00207543.2021.1910746
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1910746
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2021.1910746?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:tprsxx:v:60:y:2022:i:10:p:3047-3062. 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/TPRS20 .

    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.