2007
DOI: 10.1016/j.cor.2005.05.034
|View full text |Cite
|
Sign up to set email alerts
|

Single-machine scheduling with periodic maintenance to minimize makespan

Abstract: This is the Pre-Published Version. AbstractWe consider a single-machine scheduling problem with periodic maintenance activities. Although the scheduling problem with maintenance has attracted researchers' attention, most of past studies considered only one maintenance period. In this research several maintenance periods are considered where each maintenance activity is scheduled after a periodic time interval. The objective is to find a schedule that minimizes the makespan, subject to periodic maintenance and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
77
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 159 publications
(86 citation statements)
references
References 12 publications
0
77
0
Order By: Relevance
“…Despite there being some interesting papers dealing simultaneously with a maintenance and a production schedule, most of them consider only one decision criterion (Alardhi et al 2007;Benmansour et al 2011;Ji et al 2007;Sortrakul and Cassady 2007;Su and Tsai 2010). In fact, since these integrated models derive from the original problem of the production schedule, some of these papers still consider only the original objectives such as total weighted expected tardiness.…”
Section: Integrated Production and Maintenance Schedulingmentioning
confidence: 96%
“…Despite there being some interesting papers dealing simultaneously with a maintenance and a production schedule, most of them consider only one decision criterion (Alardhi et al 2007;Benmansour et al 2011;Ji et al 2007;Sortrakul and Cassady 2007;Su and Tsai 2010). In fact, since these integrated models derive from the original problem of the production schedule, some of these papers still consider only the original objectives such as total weighted expected tardiness.…”
Section: Integrated Production and Maintenance Schedulingmentioning
confidence: 96%
“…One or several unavailability intervals (maintenance periods) might be considered where their start and end times are either known or decision variables. A number of different combinations of the unavailability intervals and job characteristics have been studied (Lee 1996;Liao and Chen 2003;Akturk et al 2004;Chen 2006;Ji et al 2007;Kovacs and Beck 2007;Xu et al 2010;Yu et al 2014).…”
Section: Integrated Maintenance Planning and Production Schedulingmentioning
confidence: 99%
“…In addition one may hope better approximation algorithms due to the regular structure of the problem. In the following a subset S of tasks is said to fit before a period j if p(S) ≤ s. If Ona period j is covered by task i then S matches the period if s − δ i ≤ p(S) ≤ s. For the periodic problem with machine unavailability periods and non-resumable jobs, Ji, He and Cheng [11] show that minimizing the makespan can not be approximated within a factor 2. In addition they establish that LPT list schedule has precisely a performance guarantee of 2.…”
Section: Periodic Onasmentioning
confidence: 99%