Advanced search
Publication Cover
International Journal of Production Research Volume 61, 2023 - Issue 19
Submit an article Journal homepage
101
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

Stability of a schedule minimising the makespan for processing jobs on identical machines

Yuri N. SotskovUnited Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, BelarusCorrespondence[email protected]
View further author information
Pages 6434-6450 | Received 20 Nov 2021, Accepted 13 Sep 2022, Published online: 10 Oct 2022

References

  • Anglani, A., A. Grieco, E. Guerriero, and R. Musmanno. 2005. “Robust Scheduling of Parallel Machines with Sequence-dependent Set-up Cost.” European Journal of Operational Research 161 (3): 704–720.
  • Bekki, O., and M. Azizoglu. 2008. “Operational Fixed Interval Scheduling Problem on Uniform Parallel Machines.” International Journal of Production Economics 112: 756–768.
  • Bräsel, H., Y. Sotskov, and F. Werner. 1996. “Stability of a Schedule Minimizing Mean Flow Time.” Mathematical and Computer Modelling 24 (10): 39–53.
  • Braun, O., T.-C. Lai, G. Schmidt, and Y. Sotskov. 2002. “Stability of Johnson's Schedule with Respect to Limited Machine Availability.” International Journal of Production Research 40 (17): 4381–4400.
  • Brucker, P. 1995. Scheduling Algorithms. Berlin: Springer.
  • Duenas, A., and D. Petrovic. 2008. “An Approach to Predictive-reactive Scheduling of Parallel Machines Subject to Disruption.” Annals of Operations Research 159: 65–82.
  • Dunstall, S., and A. Wirth. 2005. “Heuristic Methods for the Identical Parallel Machine Problem with Set-up Times.” Computers and Operations Research 32: 2479–2491.
  • Emelichev, V., K. Kuz'min, and Y. Nikulin. 2005. “Stability Analysis of the Pareto Optimal Solutions for Some Vector Boolean Optimaization Problem.” Optimization 54 (6): 545–561.
  • Garey, M., and D. Johnson. 1979. Computers and Intractability – A Guide to the Theory of NP-Completeness. San Francisco, CA: W.H. Freeman and Company.
  • Gargeya, V., and R. Deane. 1996. “Scheduling Research in Multiple Resource Constrained Job Shops: A Review and Critique.” International Journal of Production Research 34 (8): 2077–2097.
  • Goren, S., and I. Sabuncuoglu. 2008. “Robustness and Stability Measures for Scheduling: Single-machine Environment.” IIE Transactions 40: 66–83.
  • Graham, R., E. Lawler, J. Lenstra, and A. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling.” Annals of Discrete Applied Mathematics 5: 287–326.
  • Herroelen, W., and R. Leus. 2004. “Robust and Reactive Project Scheduling: a Review and Classification Procedures.” International Journal of Production Research 42 (8): 1599–1620.
  • Kravchenko, S., Y. Sotskov, and F. Werner. 1995. “Optimal Schedules with Infinitely Large Stability Radius.” Optimization 33: 271–280.
  • Sotskov, Y. 1991. “Stability of An Optimal Schedule.” European Journal of Operational Research 55: 91–102.
  • Sotskov, Y., A. Dolgui, T.-C. Lai, and A. Zatsiupa. 2015. “Enumerations and Stability Analysis of Feasible and Optimal Line Balances for Simple Assembly Lines.” Computers & Industrial Engineering 90: 241–258.
  • Sotskov, Y., T.-C. Lai, and F. Werner. 2013. “Measures of Problem Uncertainty for Scheduling with Interval Processing Times.” Operations Research Spectrum 35 (3): 659–689.
  • Sotskov, Y., and F. Werner. 2014. Sequencing and Scheduling with Inaccurate Data. Hauppauge, New York: Nova Science Publishers.
  • Wang, S., and W. Cui. 2020. “Approximation Algorithms for the Min-Max Regret Identical Parallel Machine Scheduling Problem with Outsourcing and Uncertain Processing Time.” International Journal of Production Research 59 (1): 1–14.

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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

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.