2002
DOI: 10.1080/00207540210159527
|View full text |Cite
|
Sign up to set email alerts
|

Stability of Johnson's schedule with respect to limited machine availability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 29 publications
(10 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…Figure 6 shows plots for the average proportion of the variance covered by the stability radii at each scheduling method. This analysis departs from the two-station analysis proposed by Braun et al (2002) as it has been extended to multiple stations. In brief, the processing times were randomly generated 200 times for each Taillard problem, a sequence was generated by each scheduling method and the bottleneck station was identified.…”
Section: Resultsmentioning
confidence: 91%
See 1 more Smart Citation
“…Figure 6 shows plots for the average proportion of the variance covered by the stability radii at each scheduling method. This analysis departs from the two-station analysis proposed by Braun et al (2002) as it has been extended to multiple stations. In brief, the processing times were randomly generated 200 times for each Taillard problem, a sequence was generated by each scheduling method and the bottleneck station was identified.…”
Section: Resultsmentioning
confidence: 91%
“…In the stability radii approach, for a given sequence, a range of variation within the processing times is identified that does not affect the original solution (Braun et al 2002;Lai and Sotskov 1999;Sotskov, Tanaev, and Werner 1998). Stability radii has been explored for n-job, 2-machine flow-shop problems when minimising makespan, but has not been extended to a multiple machine flow line.…”
Section: Introductionmentioning
confidence: 99%
“…Kubzin, Potts, and Strusevich (2009) improve the R 6 1 error bound to R 6 1/2 by a fast heuristic for the problem when several holes occur on M 1 . Braun, Lai, Schmidt, and Sotskov (2002) study the question of whether Johnson's permutation remains optimal if there are w P 1 unavailability intervals on M 1 and M 2 in the two-machine flow shop problem (F2, h jw |r À a|C max , note that, in this place w is a fixed positive integer, so this notation F2, h jw |r À a|C max here is different from F2, h jk |r À a|C max ). It is well known that JA is optimal when all machines are continuously available (w = 0).…”
Section: Two-machine Flow Shop Without Storage Constraintsmentioning
confidence: 98%
“…Later, Lee (1999) extended the previous work to the semi-resumable case and the case where availability constraints are imposed on both machines. Braun, Lai, Schmidt, and Sotskov (2002) studied the scheduling problem of minimising the makespan in the two-machine flow shop with w unavailability intervals on each of the two machines. Blazewicz, Breit, Formanowicz, Kubiak, and Schmidt (2001) and Kubiak, Blazewicz, Formanowicz, Breit, and Schmidt (2002) studied twomachine flow shop problem with limited machine availability and resumable job processing to minimise the makespan.…”
Section: Introductionmentioning
confidence: 99%