65
Views
25
CrossRef citations to date
0
Altmetric
Original Articles

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

Pages 4381-4400 | Published online: 14 Nov 2010

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (9)

Yuri N. Sotskov. (2023) Stability of a schedule minimising the makespan for processing jobs on identical machines. International Journal of Production Research 61:19, pages 6434-6450.
Read now
Tsung-Chyan Lai, Yuri N. Sotskov, Natalja G. Egorova & Frank Werner. (2018) The optimality box in uncertain data for minimising the sum of the weighted job completion times. International Journal of Production Research 56:19, pages 6336-6362.
Read now
Theodor Freiheit & Wei Li. (2017) The effect of work content imbalance and its interaction with scheduling method on sequential flow line performance. International Journal of Production Research 55:10, pages 2791-2805.
Read now
Wei-Wei Cui, Zhiqiang Lu, Binghai Zhou, Chen Li & Xiaole Han. (2016) A hybrid genetic algorithm for non-permutation flow shop scheduling problems with unavailability constraints. International Journal of Computer Integrated Manufacturing 29:9, pages 944-961.
Read now
Shijin Wang & Ming Liu. (2016) Two-machine flow shop scheduling integrated with preventive maintenance planning. International Journal of Systems Science 47:3, pages 672-690.
Read now
Asiye Aydilek, Harun Aydilek & Ali Allahverdi. (2015) Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan. International Journal of Production Research 53:9, pages 2803-2819.
Read now
Ming Dong. (2013) Parallel machine scheduling with limited controllable machine availability. International Journal of Production Research 51:8, pages 2240-2252.
Read now
Tadeusz Sawik. (2012) Batch versus cyclic scheduling of flexible flow shops by mixed-integer programming. International Journal of Production Research 50:18, pages 5017-5034.
Read now
H.-S. Gan & A. Wirth . (2005) Comparing deterministic, robust and online scheduling using entropy. International Journal of Production Research 43:10, pages 2113-2134.
Read now

Articles from other publishers (16)

Mario Levorato, Rosa Figueiredo & Yuri Frota. (2022) Exact solutions for the two-machine robust flow shop with budgeted uncertainty. European Journal of Operational Research 300:1, pages 46-57.
Crossref
Muberra Allahverdi, Harun Aydilek, Asiye Aydilek & Ali Allahverdi. (2021) A better dominance relation and heuristics for Two-Machine No-Wait Flowshops with Maximum Lateness Performance Measure. Journal of Industrial & Management Optimization 17:4, pages 1973.
Crossref
Yu. N. Sotskov. (2020) Optimality Region for Job Permutation in Single-Machine Scheduling with Uncertain Processing Times. Automation and Remote Control 81:5, pages 819-842.
Crossref
Yuri N. Sotskov, Natalja G. Egorova & Frank Werner. (2019) The Optimality Box and Region for Single-Machine Scheduling of a Set of Jobs with Uncertain Durations. IFAC-PapersOnLine 52:13, pages 88-93.
Crossref
Assia Sadiqi, Ikram El Abbassi, Abdellah El Barkany & Ahmed El Biyaali. (2018) Joint Scheduling of Jobs and Variable Maintenance Activities in the Flowshop Sequencing Problems: Review, Classification and Opportunities. International Journal of Engineering Research in Africa 39, pages 170-190.
Crossref
Ali Allahverdi & Muberra Allahverdi. (2018) Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness. Computational and Applied Mathematics 37:5, pages 6774-6794.
Crossref
Yuri Sotskov & Natalja Egorova. (2018) Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective. Algorithms 11:5, pages 66.
Crossref
Sadiqi Assia, El Abbassi Ikram, El Barkany Abdellah & El Biyaali Ahmed. (2018) Comparative analysis the simultaneous scheduling problems of production and maintenance activities. Comparative analysis the simultaneous scheduling problems of production and maintenance activities.
Donya Rahmani & Mahdi Heydari. (2014) Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times. Journal of Manufacturing Systems 33:1, pages 84-92.
Crossref
Hamid Allaoui & Abdelhakim Artiba. 2014. Essays in Production, Project Planning and Scheduling. Essays in Production, Project Planning and Scheduling 277 299 .
Ying Ma, Chengbin Chu & Chunrong Zuo. (2010) A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering 58:2, pages 199-211.
Crossref
Hamid Allaoui & AbdelHakim Artiba. (2009) Johnson's algorithm: A key to solve optimally or approximately flow shop scheduling problems with unavailability periods. International Journal of Production Economics 121:1, pages 81-87.
Crossref
Natalia M. Matsveichuk, Yuri N. Sotskov & Frank Werner. (2009) Partial job order for solving the two-machine flow-shop minimum-length problem with uncertain processing times. IFAC Proceedings Volumes 42:4, pages 1517-1522.
Crossref
. 2007. Handbook on Scheduling. Handbook on Scheduling 397 424 .
Hamid Allaoui, Samir Lamouri & Abdelhakim Artiba. (2006) USING JOHNSON'S ALGORITHM TO APPROXIMATE SOME FLOW SHOP SCHEDULING PROBLEMS WITH UNAVAILABILITY PERIODS. IFAC Proceedings Volumes 39:3, pages 45-50.
Crossref
Oliver Braun, Natalja M. Leshchenko & Yuri N. Sotskov. (2006) Optimality of Jackson's permutations with respect to limited machine availability. International Transactions in Operational Research 13:1, pages 59-74.
Crossref

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.