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

Eduardo Pérez, Rahul R. Ambati and Alex J. Ruiz-Torres

International Journal of Operational Research, 2018, vol. 32, issue 3, 267-289

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.

Keywords: parallel machines; machine deterioration; late jobs; on-time jobs; scheduling; maintenance. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=92735 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:32:y:2018:i:3:p:267-289

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().