Online deadline scheduling with preemption penalties |
| |
| Authors: | Feifeng Zheng Yinfeng Xu Chung Keung Poon E. Zhang Xiaoping Wu |
| |
| Affiliation: | 1. School of Management, Xi’an JiaoTong University, Xi’an 710049, China;2. The State Key Lab for Manufacturing Systems Engineering, Xi’an 710049, China;3. Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong, Hong Kong, China;4. Shanghai University of Finance and Economics, Shanghai 200433, China;5. Xi’an University of Posts and Telecommunications, Xi’an 710049, China |
| |
| Abstract: | This paper presents a study of the problem of online deadline scheduling under the preemption penalty model of Zheng, Xu, and Zhang (2007). In that model, each preemption incurs a penalty of ρ times the weight of the preempted job, where ρ ? 0 is the preemption penalty parameter. The objective is to maximise the total weight of jobs completed on time minus the total penalty. |
| |
| Keywords: | Deadline scheduling Online scheduling algorithms Competitive analysis Preemption penalty |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
