QQ客服 官方微博 反馈留言

	On-line service scheduling
	Wang, Zhenbo ; Xing, Wenxun ; Chen, Bo
	2010-10-12 ; 2010-10-12
关键词	Competitive ratio On-line Parallel machine scheduling Service policy evaluation ASYMPTOTIC OPTIMALITY PARALLEL SERVERS SYSTEM Engineering, Manufacturing Operations Research & Management Science
中文摘要	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.
语种	英语 ; 英语
出版者	SPRINGER ; DORDRECHT ; VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/81185]
专题	清华大学
推荐引用方式 GB/T 7714	Wang, Zhenbo,Xing, Wenxun,Chen, Bo. On-line service scheduling[J],2010, 2010.
APA	Wang, Zhenbo,Xing, Wenxun,&Chen, Bo.(2010).On-line service scheduling..
MLA	Wang, Zhenbo,et al."On-line service scheduling".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。