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

@inproceedings{Braun2002StabilityOJ,
  title={Stability of Johnson's schedule with respect to limited machine availability},
  author={Oliver Braun and T.-C. Lai and G{\"u}nter Schmidt and Yuri N. Sotskov},
  year={2002}
}
The paper deals with the scheduling problem of minimizing the makespan in the two -machine n -job flow-shop with w non-availability intervals on each of the two machines. This problem is binary NP-hard even if there is only one non-availability interval ( w = 1) either on the first machine or on the second machine. If there are no non-availability intervals on any machine ( w = 0), the two-machine flow-shop problem may be easily solved using Johnson's permutation of n jobs. We derived… CONTINUE READING