Abstract
We consider optimal scheduling of the server in a finite-population queueing system with multiple classes of customers, when preemption is allowed. A customer of class i has arrival rate λi, service rate μi, and holding cost ci per unit time. We derive conditions under which the cμ rule is optimal.
Original language | English (US) |
---|---|
Pages (from-to) | 301-304 |
Number of pages | 4 |
Journal | Operations Research Letters |
Volume | 33 |
Issue number | 3 |
DOIs | |
State | Published - May 2005 |
Keywords
- Finite-source queue
- Machine repairman problem; cμ rule; preemption
- Optimal scheduling
- Priority assignment
ASJC Scopus subject areas
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics