Stochastic scheduling of parallel queues with set-up costs

Queueing Systems

Volumn 19, Issue 4, 1995, Pages 421-444

  Duenyas, Izak ^a   Van Oyen, Mark P ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

control heuristic; polling system; set up cost; Stochastic scheduling

Indexed keywords

EID: 34249753159     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/BF01151932     Document Type: Article

References (30)

1. K competing queues with geometric service requirements and linear costs: the μc rule is always optimal
2. Efficient visit frequencies for polling tables: Minimization of waiting cost
3. The cμ-rule revisited
4. Heuristic scheduling of parallel heterogeneous queues with setups
5. A priority queue with discounted linear costs
6. Dynamic scheduling of a multiclass queue: Discount optimality
7. On the optimal control of two queues with server set-up times and its analysis
8. Time sharing service systems I
9. Time sharing service systems II
10. Assigning a single server to inhomogeneous queues with switching costs
11. Open bandit processes and optimal scheduling of queueing networks
12. Polling systems: applications, modelling, and optimization
13. Dominance relations in polling systems
14. On optimal polling policies
15. On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
16. Interchange arguments for classical scheduling problems in queues
17. Interchange arguments in stochastic scheduling
18. Optimal server allocation in homogeneous queueing systems with switching costs, preprint
19. Dynamic scheduling of a two-class queue with setups
20. Priority queues with set-up times
21. Optimal stochastic scheduling of queueing networks: Switching costs and partial information
22. Optimality of index policies for stochastic scheduling with switching penalties
23. Optimal stochastic scheduling of forest networks with switching penalties
24. Extensions of the multi-armed bandit problem