Single-machine scheduling problems with machine aging effect and an optional maintenance activity

This paper considers two single-machine scheduling problems with a new type of aging effect, which is dominated by the processing speed of the machine. During the whole scheduling horizon, the machine is subject to an optional maintenance, and the duration of the maintenance depends on the length of...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematical modelling Vol. 40; no. 21-22; pp. 8862 - 8871
Main Authors Gu, Manzhan, Lu, Xiwen, Gu, Jinwei, Zhang, Ying
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.11.2016
Subjects
Aging effect
Maintenance
Makespan
Total completion times
Aging effect
Makespan
Maintenance
Total completion times
Online AccessGet full text

Cover

More Information
Summary:This paper considers two single-machine scheduling problems with a new type of aging effect, which is dominated by the processing speed of the machine. During the whole scheduling horizon, the machine is subject to an optional maintenance, and the duration of the maintenance depends on the length of the uptime before it. The objective is to schedule all jobs and find the location of the maintenance so as to minimize the makespan or the total completion times. The two problems are proved to be NP-complete, and two dynamic programming algorithms are proposed to solve the problems. We analyze the computation complexity of the algorithms, and show that the problems under study are solvable in polynomial time if the processing loads of all jobs are uniformly bounded.
ISSN:0307-904X
DOI:10.1016/j.apm.2016.01.038