The Library
On-line service scheduling
Tools
Tools
Tools
Wang, Zhenbo, Xing, Wenxun and Chen, Bo, Dr.. (2009) On-line service scheduling. Journal of Scheduling, Vol.12 (No.1). pp. 31-43. ISSN 1094-6136
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/s10951-008-0075-7
Abstract
This paper is concerned with a scheduling problem that occurs in service systems where customers are classified as 'ordinary' and 'special'. Ordinary customers can be served on any service facility, while special customers can be served only on the flexible service facilities. Customers arrive dynamically over time and their needs become known upon arrival. We assume any service, once started, will be carried out to its completion. In this paper, we study the worst-case performance of service policies used in practice. In particular, we evaluate three classes of service policies: policies with priority, policies without priority, and their combinations. We obtain tight worst-case performance bounds for all service policies considered.
| Item Type: | Journal Article |
|---|---|
| Subjects: | T Technology > TS Manufactures H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management |
| Divisions: | Faculty of Social Sciences > Warwick Business School |
| Journal or Publication Title: | Journal of Scheduling |
| Publisher: | Springer New York LLC |
| ISSN: | 1094-6136 |
| Date: | February 2009 |
| Volume: | Vol.12 |
| Number: | No.1 |
| Number of Pages: | 13 |
| Page Range: | pp. 31-43 |
| Identification Number: | 10.1007/s10951-008-0075-7 |
| Status: | Peer Reviewed |
| Publication Status: | Published |
| Access rights to Published version: | Restricted or Subscription Access |
| Funder: | Chinese Ministry of Education, Tsinghua Basic Research Foundation |
| Grant number: | 108005, 052201070 |
| URI: | http://wrap.warwick.ac.uk/id/eprint/28460 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
