|
|||||
|
|
| 一个具有退化的两个代理的排序问题 | |
| 引用本文： | 冯琪,孙晓梅,刘瑞芳.一个具有退化的两个代理的排序问题[J].数学的实践与认识,2012,42(5):133-136. |
| 作者姓名： | 冯琪 孙晓梅 刘瑞芳 |
| 作者单位： | 1. 郑州大学数学系,河南郑州450052;中原工学院理学院,河南郑州450007 2. 河南工程学院数理科学系,河南郑州,451191 3. 郑州大学数学系,河南郑州,450052 |
| 基金项目： | 国家自然科学基金，河南省教育厅自然科学研究计划项目，河南省教育厅自然科学基金 |
| 摘 要： | 考虑两个代理的带有退化的单机排序问题.第一个代理J以完工时间和为目标函数,第二个代理J以最大延迟为目标函数,并且两个代理的加工时间是按时间退化的,所谓按时间退化就是每个工件的加工时间是其开始加工时间的函数.问题的目标是寻找一种排序,使得两个代理的目标函数之和达到最小.证明该问题可在O(n_1n_2(n_1+n_2))时间内求解. |
| 关 键 词： | 排序 两个代理 多项式时间算法 |
A Two-agent Scheduling Problem with Deterioration |
|
| FENG Qi , SUN Xiao-mei , LIU Rui-fang.A Two-agent Scheduling Problem with Deterioration[J].Mathematics in Practice and Theory,2012,42(5):133-136. | |
| Authors: | FENG Qi SUN Xiao-mei LIU Rui-fang |
| Institution: | 1 (1.Department of Mathematics,Zhengzhou University,Zhengzhou,Henan 450001,China) (2.College of Science,Zhongyuan University of Technology,Zhengzhou 450007,China) (3.Department of Mathematical and Physical Science,Henan Institution of Engineering,Zhengzhou 451191, China) |
| Abstract: | We consider a two-agent scheduling problem on a single-machine with deterioration. The first agent J1 has the total completion time as its objective function,and the second agent J2 has the maximum lateness as its objective function.Moreover,the processing time of each job in each agent is deteriorating by time,i.e.,the processing time of each job is the function of its starting time.The goal of the problem is to seek for a schedule such that the sum of the two objective function of the two agents is minimized.We show in this paper that the problem can be solved in O（n1n2（n1+n2）） time. |
| Keywords: | scheduling two-agent polynomial time algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |