Submodular Returns and Greedy Heuristics for Queueing Scheduling Problems
暂无分享,去创建一个
[1] Awi Federgruen,et al. Characterization and Optimization of Achievable Performance in General Queueing Systems , 1988, Oper. Res..
[2] R. Weber. On the Gittins Index for Multiarmed Bandits , 1992 .
[3] P. Whittle. Arm-Acquiring Bandits , 1981 .
[4] David D. Yao,et al. Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..
[5] Richard Weber. Note-On the Marginal Benefit of Adding Servers to G/GI/m Queues , 1980 .
[6] Laurence A. Wolsey,et al. Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..
[7] Wolfgang Stadje,et al. Selecting Jobs for Scheduling on a Machine Subject to Failure , 1995, Discret. Appl. Math..
[8] K. Glazebrook. On the evaluation of fixed permutations as strategies in stochastic scheduling , 1982 .
[9] Prabuddha De,et al. Job selection and sequencing on a single machine in a random environment , 1993 .
[10] David D. Yao,et al. Optimal load balancing and scheduling in a distributed computer system , 1991, JACM.
[11] Richard Weber,et al. Stochastic Scheduling on Parallel Processors and Minimization of Concave Functions of Completion Times , 1988 .
[12] A. Federgruen,et al. M / G / c queueing systems with multiple customer classes: characterization and control of achievable performance under nonpreemptive priority rules , 1988 .
[13] Bengt Aspvall,et al. Selecting among scheduled projects , 1995, Oper. Res. Lett..
[14] A. Federgruen,et al. The impact of the composition of the customer base in general queueing models , 1987 .