Scheduling maintenance and semiresumable jobs on a single machine

Graves, Gregory H.; Lee, Chung Yee

doi:10.1002/(sici)1520-6750(199910)46:7<845::aid-nav6>3.0.co;2-#

Cited by 152 publications

(62 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We should point out that, in their context the maintenance interval is variable and thus that their model may not apply to scheduled maintenance (which is performed by specialist crews at fixed intervals); it may be more appropriate for routine maintenance performed by the machine operator (such as adjustment, lubrication and cleaning) within a specified period. More recently, Graves and Lee [8] has addressed a generalization of the Qi et al model and, in that sense, has a bearing on our work as well.…”

Section: Introductionmentioning

confidence: 88%

Scheduling with tool changes to minimize total completion time: Basic results and SPT performance

Aktürk

Ghosh

Güneş

2004

European Journal of Operational Research

View full text Add to dashboard Cite

We consider a single machine sequencing problem subject to tool wear, where the objective is to minimize the total completion time. We briefly describe the problem and discuss its properties, complexity and solution. Mainly, however, we focus on the performance of the SPT list-scheduling heuristic. We provide theoretical worst-case bounds on SPT performance and also demonstrate its empirical behavior.

show abstract

Section: Introductionmentioning

confidence: 88%

Scheduling with tool changes to minimize total completion time: Basic results and SPT performance

Aktürk

Ghosh

Güneş

2004

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…To show that the ratio cannot be smaller than 2, consider the following instance: Let T = 12, p 1 = 6, p 2 = p 3 = p 4 = 4, p 5 = p 6 = 3, and t be an arbitrary integer. Applying LP T , we obtain 6 }, and the makespan is C LP T = 2t + 27. However, an optimal solution has two batches, where the first batch contains J 1 , J 5 , J 6 while the second batch contains J 2 , J 3 , J 4 .…”

Section: Thus We Have C Op T = (T + T) + X and C Lp T = 2(t + T) + Ymentioning

confidence: 99%

“…Moreover, Lee [9] presented heuristics for other objectives, such as minimizing the maximum lateness, the number of tardy jobs, and the total weighted completion time, etc. Graves and Lee [6] extended the problem to consider semiresumable jobs. For details on related research, the reader may refer to the survey paper [14].…”

Section: Introductionmentioning

confidence: 99%

Single-machine scheduling with periodic maintenance to minimize makespan

Cheng

2007

Computers & Operations Research

159

View full text Add to dashboard Cite

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 nonresumable jobs.We first prove that the worst-case ratio of the classical LP T algorithm is 2. Then we show that there is no polynomial time approximation algorithm with a worst-case ratio less than 2 unless P = N P , which implies that the LP T algorithm is the best possible.

show abstract

“…Lee and Leon (2001) consider the decisions of when to schedule the rate modifying activity and sequence of jobs to optimize different regular scheduling measures, including total completion time, when there is a single maintenance period. Graves and Lee (1999) study the same problem and show that if there is exactly one maintenance period, then the total completion time problem can be solved polynomially by a modification of the SPT rule. Therefore, the main decision is to determine the set of jobs before and after the maintenance activity.…”

Section: Introductionmentioning

confidence: 99%

Scheduling preventive maintenance on a single CNC machine

Gürel

Aktürk

2008

International Journal of Production Research

View full text Add to dashboard Cite

In this study we attempt to deal with process planning, scheduling and preventive maintenance (PM) decisions, simultaneously. The objective is to minimize the total completion time of a set of jobs on a CNC machine. During the process planning, we decide on the processing times of the jobs which are controllable (i.e. they can be easily changed) on CNC machines. Using shorter processing times (higher production rates) would result in greater deterioration of the machine, and we would need to plan more frequent PM visits to the machine, during which it would not be available. Therefore, the selected processing times determine not only the completion times but also the PM visit times. We first provide optimality properties for the joint problem. We propose a new heuristic search algorithm to determine simultaneously the processing times of the jobs, their sequence and the PM schedule.

show abstract

Scheduling maintenance and semiresumable jobs on a single machine

Cited by 152 publications

References 28 publications

Scheduling with tool changes to minimize total completion time: Basic results and SPT performance

Scheduling with tool changes to minimize total completion time: Basic results and SPT performance

Single-machine scheduling with periodic maintenance to minimize makespan

Scheduling preventive maintenance on a single CNC machine

Contact Info

Product

Resources

About