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 sufficient conditions for optimality of Johnson's permutation in the case of the given w S 1 non-availability intervals. The instrument we use is stability analysis, which answers the question of how stable an optimal schedule is if there are independent changes in the processing times of the jobs. The stability analysis is demonstrated on a huge number of randomly generated two -machine flow-shop problems with 5 h n h 10 000 and 1 h w h 1000.
Stability of Johnson's schedule with respect to limited machine availability
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related Research Data
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.