| 工件可拒绝排序问题的研究 |
| |
| 引用本文： | 张峰,唐国春.工件可拒绝排序问题的研究[J].同济大学学报(自然科学版),2006,34(1):116-119,125. |
| |
| 作者姓名： | 张峰 唐国春 |
| |
| 作者单位： | 1. 同济大学,应用数学系,上海,200092;上海第二工业大学,应用数学系,上海,201209
2. 上海第二工业大学,应用数学系,上海,201209 |
| |
| 基金项目： | 中国科学院资助项目;上海市自然科学基金;上海市教委资助项目 |
| |
| 摘 要： | 用凸二次规划松弛方法研究工件具有就绪时间，目标函数为工件总拒绝费用与接受工件的带权总完工时间之和的工件可拒绝排序问题，得到界为2的多项式时间近似算法．
|
| 关 键 词： | 拒绝 排序 二次规划 近似算法 |
| 文章编号： | 0253-374X（2006）01-0116-04 |
| 收稿时间： | 2004-03-22 |
| 修稿时间： | 2004-03-22 |
Scheduling with Rejection |
| |
| ZHANG Feng,TANG Guochun.Scheduling with Rejection[J].Journal of Tongji University(Natural Science),2006,34(1):116-119,125. |
| |
| Authors: | ZHANG Feng TANG Guochun |
| |
| Institution: | 1. Department of Applied Mathematics, Tongji University, Shanghai 200092, China; 2. Department of Applied Mathematics, Shanghai Second Polytechnic University, Shanghai 201209, China |
| |
| Abstract: | The method of convex quadratic programming relaxation has been used for the scheduling with rejection. The jobs have different release times. The objection function is total weighted completion times of the remaining jobs plus the sum of the penalties of the jobs rejected. A 2-approximation algorithm has been obtained. |
| |
| Keywords: | rejection scheduling quadratic programming approximation algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
