Skip navigation
Please use this identifier to cite or link to this item:
Title: Measures of problem uncertainty for total weighted flow time scheduling on a single machine
Authors: Egorova, N. G.
Sotskov, Y. N.
Werner, Frank
Tsung-Chyan Lai
Keywords: публикации ученых;одностадийное обслуживания требований;взвешенные моменты завершения обслуживания требований;неопределенные;длительности обслуживания требований;мера неопределенности;single-machine scheduling;total weighted flow time;uncertain processing times;measure of uncertainty
Issue Date: 2010
Publisher: Otto-von-Guericke-Universität
Citation: Measures of problem uncertainty for total weighted flow time scheduling on a single machine / N. G. Egorova and others // Otto-von-Guericke-Universitet. - № 17. - Magdeburg, 2010. – 16 p.
Abstract: A single-machine scheduling problem is investigated under the assumption that the processing time of a job can take any real value from a given closed interval. The criterion is to minimize the total weighted completion time for a set of given jobs. As a measure of uncertainty for such a scheduling problem, it is reasonable to consider the cardinality of a minimal dominant set of job permutations containing an optimal permutation for each possible realization of the job processing times. We show that a minimal dominant set may be uniquely determined and demonstrate how to select a suitable solution method for the individual problem using the value of an uncertainty measure.
Appears in Collections:Публикации в зарубежных изданиях

Files in This Item:
File Description SizeFormat 
051003.pdf538.52 kBAdobe PDFView/Open
Show full item record Google Scholar

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.