Single machine flow-time scheduling with a single breakdown

Adiri, I.; Bruno, John; Frostig, Esther; Kan, Rinnooy

doi:10.1007/bf00288977

Cited by 198 publications

(150 citation statements)

References 2 publications

Supporting

Mentioning

150

Contrasting

Order By: Relevance

“…We try three levels of n (20, 25 and 30), two levels of m (4 and 5) and three levels of T C =T L (0.1, 1.0 and 10.0); for each combination of n and m, an appropriate value of T L (as shown in Table 1) is used and the integer T C value for each such combination is derived based on the T C =T L ratio and through rounding. There is thus a total of 18 combinations of n, m and T C =T L ; for each, 10 problem instances are randomly generated by drawing the p j Õs from a discrete uniform distribution over [1,10].…”

Section: Spt Performancementioning

confidence: 99%

“…Only recently has this issue begun to get the attention that it deserves. For example, see Adiri et al [1] and Albers and Schmidt [5] for research on scheduling subject to random machine breakdown, Lee [12] for scheduling research in presence of preventive maintenance, and Schmidt [15] for a review on machine availability. Scheduling subject to tool change, while it is more common and frequent, has not been addressed thus far.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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: Spt Performancementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

“…A similar problem de®nition with a single disruption due to either a machine breakdown or preventive maintenance during the scheduling period is formulated as a machine scheduling problem with an availability constraint in the literature. Adiri et al [1] consider the single machine scheduling problem with the objective of minimizing the total completion time where the machine is not available in some periods due to a machine breakdown. They assume that a job that is preempted due to a breakdown must be restarted.…”

Section: Problem Statementmentioning

confidence: 99%

Match-up scheduling under a machine breakdown

Aktürk

Gorgulu

1999

European Journal of Operational Research

115

View full text Add to dashboard Cite

When a machine breakdown forces a modi®ed¯ow shop (MFS) out of the prescribed state, the proposed strategy reschedules part of the initial schedule to match up with the preschedule at some point. The objective is to create a new schedule that is consistent with the other production planning decisions like material¯ow, tooling and purchasing by utilizing the time critical decision making concept. We propose a new rescheduling strategy and a match-up point determination procedure through a feedback mechanism to increase both the schedule quality and stability. The proposed approach is compared with alternative reactive scheduling methods under di erent experimental settings. Ó

show abstract

“…Adiri et al [4] and Lee and Liman [5] proved that the problem 1, ℎ 1 || ∑ =1 is NP-hard. Lee and Liman [5] showed that the worst case boundary of the SPT rule for this problem was 9/7.…”

Section: Introductionmentioning

confidence: 99%

Minimizing the Number of Tardy Jobs on a Single Machine with an Availability Constraint

Molaee

Moslehi

2014

Journal of Industrial Engineering

View full text Add to dashboard Cite

Most scheduling problems are based on the assumption that machines work continuously during the planning horizon. This assumption is not true in many production environments because the machine may not be available during one or more periods such as during breakdowns or maintenance operations. In this paper, the problem of the single machine scheduling with one unavailability period and nonresumable jobs with the aim of minimizing the number of tardy jobs is studied. A number of theorems are proved and a heuristic procedure is developed to solve the problem. A branch-and-bound approach is also presented which includes upper and lower bounds and efficient dominance rules. Computational results for 2680 problem instances show that the branch-and-bound approach is capable of solving 98.7% of the instances optimally, bearing witness to the efficiency of the proposed procedure. Our results also indicate that the proposed approaches are more efficient when compared to other methods.

show abstract

Single machine flow-time scheduling with a single breakdown

Cited by 198 publications

References 2 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

Match-up scheduling under a machine breakdown

Minimizing the Number of Tardy Jobs on a Single Machine with an Availability Constraint

Contact Info

Product

Resources

About