A Note on Two-agent Single-machine Scheduling Problem with Deteriorating Jobs
【摘要】:正This paper considers the two-agent scheduling problems with decreasing linear deterioration on a single machine.Two agents compete to perform their respective jobs on a common single machine,and each agent has his own criterion to optimize.The processing times of jobs are defined as a decreasing linear function of their starting times.The goal is to minimize the maximum cost of the first agent with the restriction that the makespan of the second agent cannot exceed a given upper bound.We propose the optimal properties and present the optimal polynomial time algorithm to solve the scheduling problem.
|
|
|
|
1 |
贾书军;张瑞生;贺莹;;基于多Agent的远程教学系统研究[J];甘肃科技;2011年13期 |
2 |
余雷;段晨东;;基于Agent的垂直疏散模型研究[J];陕西科技大学学报(自然科学版);2011年04期 |
3 |
吴祎娴;苏诚;陈明;冯国富;池涛;;基于Agent的温室无线传感网络分簇管理模型[J];广西师范大学学报(自然科学版);2011年02期 |
4 |
;[J];;年期 |
5 |
;[J];;年期 |
6 |
;[J];;年期 |
7 |
;[J];;年期 |
8 |
;[J];;年期 |
9 |
;[J];;年期 |
10 |
;[J];;年期 |
11 |
;[J];;年期 |
12 |
;[J];;年期 |
13 |
;[J];;年期 |
14 |
;[J];;年期 |
15 |
;[J];;年期 |
16 |
;[J];;年期 |
17 |
;[J];;年期 |
18 |
;[J];;年期 |
19 |
;[J];;年期 |
20 |
;[J];;年期 |
|