Dynamic Scheduling with Convex Delay Costs: The Generalized CU Rule
暂无分享,去创建一个
[1] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[2] G. F. Newell,et al. Optimal Strategies for Priority Queues with Nonlinear Costs of Delay , 1971 .
[3] J. Michael Harrison,et al. Dynamic Scheduling of a Multiclass Queue: Discount Optimality , 1975, Oper. Res..
[4] Dong-Wan Tcha,et al. Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback , 1977, Oper. Res..
[5] Arvind J. Thadhani. Interactive User Productivity , 1981, IBM Syst. J..
[6] Michael Pinedo,et al. Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..
[7] Michael H. Rothkopf,et al. Technical Note - There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs , 1984, Oper. Res..
[8] Jean Walrand,et al. The c# rule revisited , 1985 .
[9] J. Harrison,et al. Brownian motion and stochastic flow systems , 1986 .
[10] Pierre Chardaire,et al. Grade of Service and Optimization of Distributed Packet-Switched Networks , 1986, Comput. Networks.
[11] J. Michael Harrison,et al. Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .
[12] Richard Weber,et al. Stochastic Scheduling on Parallel Processors and Minimization of Concave Functions of Completion Times , 1988 .
[13] Lawrence M. Wein,et al. Scheduling networks of queues: Heavy traffic analysis of a simple open network , 1989, Queueing Syst. Theory Appl..
[14] P. Nain,et al. Interchange arguments for classical scheduling problems in queues , 1989 .
[15] H. Kushner,et al. Optimal and approximately optimal control policies for queues in heavy traffic , 1989 .
[16] M. Kijima,et al. FURTHER RESULTS FOR DYNAMIC SCHEDULING OF MULTICLASS G/G/1 QUEUES , 1989 .
[17] Eugene Veklerov. Technical Note - On Rothkopf and Smith's Statement Regarding Optimal Priority Assignment , 1989, Oper. Res..
[18] Lawrence M. Wein,et al. Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs , 1990, Oper. Res..
[19] Lawrence M. Wein,et al. Optimal Control of a Two-Station Brownian Network , 2015, Math. Oper. Res..
[20] Lawrence M. Wein,et al. Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..
[21] L. F. Martins,et al. Routing and singular control for queueing networks in heavy traffic , 1990 .
[22] H. Mendelson,et al. User delay costs and internal pricing for a service facility , 1990 .
[23] Lawrence M. Wein,et al. The Impact of Processing Time Knowledge on Dynamic Job-Shop Scheduling , 1991 .
[24] Yves De Serres,et al. Simultaneous optimization of flow control and scheduling in a single server queue with two job classes , 1991, Oper. Res. Lett..
[25] Rhonda Righter,et al. Scheduling jobs on non-identical IFR processors to minimize general cost functions , 1991 .
[26] Lawrence M. Wein,et al. A broader view of the job-shop scheduling problem , 1992 .
[27] David D. Yao,et al. Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..
[28] F. P. Kelly,et al. Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling , 1993, Queueing Syst. Theory Appl..
[29] Hong Chen,et al. Dynamic Scheduling of a Multiclass Fluid Network , 1993, Oper. Res..
[30] E. V. Krichagina,et al. Production Control in a Failure-Prone Manufacturing System: Diffusion Approximation and Asymptotic Optimality , 1993 .
[31] M. Reiman,et al. Polling Systems with Zero Switchover Times: A Heavy-Traffic Averaging Principle , 1995 .