IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v32y2018i3p267-289.html
   My bibliography  Save this article

Maximising the number of on-time jobs on parallel servers with sequence dependent deteriorating processing times and periodic maintenance

Author

Listed:
  • Eduardo Pérez
  • Rahul R. Ambati
  • Alex J. Ruiz-Torres

Abstract

This paper considers a parallel-machine scheduling problem with sequence dependent processing times and periodic maintenance. The time to complete jobs increases as the machines deteriorate and the machine deterioration depends on the particular job sequence assigned to a machine. The planned maintenance activity returns the machine to its optimal condition, and all machines undergo this maintenance activity at the same time. The objective is to find the job schedule that maximises the number of on-time jobs given a specified maintenance schedule. The paper presents a mathematical programming formulation, several solution algorithms, and evaluates their performance under various experimental conditions.

Suggested Citation

  • Eduardo Pérez & Rahul R. Ambati & Alex J. Ruiz-Torres, 2018. "Maximising the number of on-time jobs on parallel servers with sequence dependent deteriorating processing times and periodic maintenance," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 32(3), pages 267-289.
    • Handle: RePEc:ids:ijores:v:32:y:2018:i:3:p:267-289
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=92735
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Julio Mar-Ortiz & Alex J. Ruiz Torres & Belarmino Adenso-Díaz, 2022. "Scheduling in parallel machines with two objectives: analysis of factors that influence the Pareto frontier," Operational Research, Springer, vol. 22(4), pages 4585-4605, September.

    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:ids:ijores:v:32:y:2018:i:3:p:267-289. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.