科研之友
微信
新浪微博
Facebook
分享链接
摘要
We consider a competitive two-agent scheduling problem on multiple identical machines with release dates and preemption. In the scheduling model, there are two agents a and b each having their own job sets J(a) = {J(1)(a),..., J(na)(a)} and J(b) = {J(1)(b),..., J(nb)(b)}, respectively. Each job J(j) epsilon J(a) boolean OR J(b) has a release date r(i) and the n = n(a) + n(b) jobs need to be preemptively scheduled on m identical machines. For m = 2, we show that the trade-off curve of all the Pareto optimal points can be characterized in polynomial time. When m is input, we show that P vertical bar r(j), pmtn vertical bar L-max(a) : L-max(b) < Q can be solved in strongly polynomial time.
- 出版日期2013
- 单位江西财经大学
