| Optimal online algorithms for scheduling on two identical machines under a grade of service |
| |
| 作者姓名： | 蒋义伟 何勇 唐春梅 |
| |
| 作者单位： | Laboratory of Information and Optimization Technologies Ningbo Institute of Technology Zhejiang University Ningbo 315100 China Department of Mathematics Zhejiang University Hangzhou 310027 China，Department of Mathematics Zhejiang University Hangzhou 310027 China，Department of Mathematics Zhejiang University Hangzhou 310027 China |
| |
| 基金项目： | Project supported by the National Natural Science Foundation of China (No. 10271110) and the Teaching and Research Award Pro-gram for Outstanding Young Teachers in Higher Education, Institu-tions of MOE, China |
| |
| 摘 要： | INTRODUCTIONWe study the problem of online scheduling on two identical parallel machines with a new feature that service requests from various customers are entitled to many different grade of service (GoS) levels. The goal is to minimize the makespan under the constraint that all requests are satisfied. This problem was first proposed by Hwang et al.(2004) and is motivated by the following scenario. In the service industry, the service providers often have special customers, such as, go…
|
| 关 键 词： | 联机算法 竞争分析 并行计算机 服务等级 |
| 收稿时间： | 2005-02-10 |
| 修稿时间： | 2005-04-19 |
Optimal online algorithms for scheduling on two identical machines under a grade of service |
| |
| Yi-wei Jiang,Yong He,Chun-mei Tang.Optimal online algorithms for scheduling on two identical machines under a grade of service[J].Journal of Zhejiang University Science,2006,7(3):309-314. |
| |
| Authors: | Yi-wei Jiang Yong He Chun-mei Tang |
| |
| Institution: | (1) Laboratory of Information and Optimization Technologies, Ningbo Institute of Technology, Zhejiang University, Ningbo, 315100, China;(2) Department of Mathematics, Zhejiang University, Hangzhou, 310027, China |
| |
| Abstract: | This work is aimed at investigating the online scheduling problem on two parallel and identical machines with a new feature that service requests from various customers are entitled to many different grade of service (GoS) levels, so each job and machine are labelled with the GoS levels, and each job can be processed by a particular machine only when its GoS level is no less than that of the machine. The goal is to minimize the makespan. For non-preemptive version, we propose an optimal online al-gorithm with competitive ratio 5/3. For preemptive version, we propose an optimal online algorithm with competitive ratio 3/2. |
| |
| Keywords: | Online algorithm Competitive analysis Parallel machine scheduling Grade of service (GoS) |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
