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

Yuri N. Sotskov

International Journal of Production Research, 2023, vol. 61, issue 19, 6434-6450

Abstract: A set of jobs has to be processed on identical machines. Every job may be processed on any available machine without preemptions. The criterion is to minimise the makespan (i.e. the completion time of the last job in a schedule). During the realisation of a schedule, durations of some jobs may deviate from the initial values estimated before scheduling. Other jobs have fixed durations that are known before scheduling. We conduct a stability analysis of the optimal semi-active schedule. First, we derive necessary and sufficient conditions for an optimal schedule to be unstable with respect to infinitely small variations of the non-fixed durations (the stability radius of an unstable schedule is equal to zero). Second, we show that the stability radius of an optimal schedule could be infinitely large. Furthermore, several lower and upper bounds on the stability radius have been established. Third, we derive a formula and develop an algorithm for calculating stability radii.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2022.2128919 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:61:y:2023:i:19:p:6434-6450

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2022.2128919

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().