96-03

Stability of a Schedule Minimizing Mean Flow Time

by Bräsel, H.; Sotskov, Yu. N.; Werner, F.

 

Preprint series: 96-03, Preprints

The paper is published: Mathematical and Computer Modelling, Vol. 24, 1996, 39 - 56.

MSC:
90B35 Scheduling theory, See also {68M20}

 

Abstract: This paper is devoted to the calculation of the stability radius ofan optimal schedule for a general shop scheduling problem, where theobjective is to minimize mean flow time. The stability raduis denotesthe largest quantity of independent variations of the processing timesof the operations such that an optimal schedule of the problem remainsoptimal. We derive formulas for calculating the stability radius, andnecessary and sufficient conditions when it is equal to zero. Moreover,computational results on the calculation of the stability radius forrandomly generated job shop scheduling problems are discussed

Keywords: Optimal schedule, Disjunctive graph, Stability


The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.

Letzte Änderung: 01.03.2018 - Ansprechpartner: Webmaster