Skip navigation
Please use this identifier to cite or link to this item:
Title: Sequencing jobs with uncertain processing times and minimizing the weighted total flow time
Authors: Egorova, N. G.
Sotskov, Y. N.
Keywords: публикации ученых;scheduling;robustness and sensitivity analysis
Issue Date: 2008
Citation: Egorova, N. G. Sequencing jobs with uncertain processing times and minimizing the weighted total flow time / N. G. Egorova, Y. N. Sotskov // International Journal «Information Theories and Applications». – 2008. – Р. 1–8.
Abstract: We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is unknown random variable before the actual occurrence of this time, where probability distribution of such a variable between the given lower and upper bounds is unknown before scheduling. We develop the dominance relations on a set of jobs J. The necessary and sufficient conditions for a job domination may be tested in polynomial time of the number n=|J| of jobs. If there is no a domination within some subset of set J, heuristic procedure to minimize the weighted total flow time is used for sequencing the jobs from such a subset.
Appears in Collections:Публикации в зарубежных изданиях

Files in This Item:
File Description SizeFormat 
051001.pdf455.24 kBAdobe PDFView/Open
Show full item record Google Scholar

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