Release Time:2019-03-10  Hits:

Indexed by: Journal Article

Date of Publication: 2011-10-01

Journal: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

Included Journals: Scopus、SSCI、EI、SCIE

Volume: 62

Issue: 10

Page Number: 1898-1902

ISSN: 0160-5682

Key Words: scheduling; parallel identical machines; maintenance activity; polynomial algorithm

Abstract: In this paper, we consider parallel identical machines scheduling problems with a deteriorating maintenance activity. In this model, each machine has a deteriorating maintenance activity, that is, delaying the maintenance increases the time required to perform it. We need to make a decision on when to schedule the deteriorating maintenance activities and the sequence of jobs to minimize total completion time. We provide a polynomial time algorithm to solve the total completion time minimization problem. Journal of the Operational Research Society (2011) 62, 1898-1902. doi:10.1057/jors.2010.143 Published online 20 October 2010