Skip navigation
Please use this identifier to cite or link to this item:
Title: A stability approach for minimizing total weighted completion time with uncertain data
Authors: Egorova, N. G.
Sotskov, Y. N.
Werner, Frank
Keywords: публикации ученых;построение расписаний;одностадийное обслуживания требований;взвешенные моменты завершения обслуживания требований;устойчивость;неопределенность;мера неопределенность;интервальные длительности обслуживания требований;scheduling;single machine problems;total weighted completion time;stability;uncertainty;interval processing times
Issue Date: 2010
Publisher: Otto-von-Guericke-Universität
Citation: Egorova, N. G. A stability approach for minimizing total weighted completion time with uncertain data / N. G. Egorova, Y. N. Sotskov, Frank Werner // Otto-von-Guericke-Universitet. - № 2. - Magdeburg, 2010. – 19 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 
041006.pdf716.45 kBAdobe PDFView/Open
Show full item record Google Scholar

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