Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness

Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness

0.00 Avg rating—0 Votes
Article ID: iaor19952069
Country: Germany
Volume: 39
Start Page Number: 321
End Page Number: 348
Publication Date: Jun 1994
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: , ,
Abstract:

Stochastic single-machine scheduling problems with special tree-like GERT precedence constraints and expected weighted flow time or maximum expected lateness as objective functions are considered. To obtain polynomial algorithms for these problems, Smith’s ratio rule and Lawler’s rule for the deterministic problems 1ℝouttreeℝΣwvCv and 1ℝprecℝfmax, respectively, are generalized.

Reviews

Required fields are marked *. Your email address will not be published.