| 加工时间可变的总完工时间排序两人合作博弈问题 |
| |
| 引用本文： | 金霁. 加工时间可变的总完工时间排序两人合作博弈问题[J]. 苏州市职业大学学报, 2013, 0(3): 35-39,74 |
| |
| 作者姓名： | 金霁 |
| |
| 作者单位： | 苏州市职业大学 马列与公共教学部,江苏 苏州,215104 |
| |
| 摘 要： | 研究工件加工时间与开始加工时间有关的情况下，两人合作共同加工一批工件的纳什博弈问题．每人有一台机器用于工件加工，以最小的总完工时间作为加工成本，通过确定这批工件的一个合理划分，使参与合作加工的两人都能得到满意的合作收益．
|
| 关 键 词： | 排序 博弈 合作 收益 加工时间 线性函数 |
Two-Person Cooperative Games on Total Completion Time Scheduling with Changeable Processing Time |
| |
| JIN Ji. Two-Person Cooperative Games on Total Completion Time Scheduling with Changeable Processing Time[J]. Journal of Suzhou Vocational University, 2013, 0(3): 35-39,74 |
| |
| Authors: | JIN Ji |
| |
| Affiliation: | JIN Ji (Marxism Leninism and Public Education Department, Suzhou Vocational University, Suzhou 215104, China) |
| |
| Abstract: | This paper studies two-person Nash bargaining problem, in which job processing time depends on its start time, each person is equipped with one machine and the processing cost is defined as minimized total completion time. It focuses on how to divide the jobs reasonably in order to make every participant satisfied with cooperation profit. |
| |
| Keywords: | scheduling game cooperation profit processing time linear function |
| 本文献已被 维普 万方数据 等数据库收录！ |
