.png){kind=icon}
返回
Multi-agent single machine scheduling
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-006-0164-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform their respective jobs on one shared processing resource. Each agent wants to minimize a certain cost function, which depends on the completion times of its jobs only. The cost functions we consider in this paper are maximum of regular functions (associated with each job), number of late jobs and total weighted completion time. The different combinations of the cost functions of each agent lead to various problems, whose computational complexity is analysed in this paper. In particular, we investigate the problem of finding schedules whose cost for each agent does not exceed a given bound for each agent.
Keyword:
multi-agent
scheduling
complexity
multi-criteria
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容