Population monotonic allocation schemes on externality games
Population monotonic allocation schemes on externality games
复制标题
外部性博弈的人口单调分配方案
DOI：
10.1007/s001860050012
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
J. Zarzuelo
中科院分区：
文献类型：
--
作者：
F. Grafe;M. E. García;J. Zarzuelo
结果表明，具有平均流程时间或完工时间目标函数、三个作业的两机抢占式作业车间问题是NP-hard问题。这与以下事实形成鲜明对比：如果作业数量任意但固定，则这些问题的非抢占版本可以多项式求解。还表明，如果机器数量和作业数量都固定，则抢占问题可以通过伪多项式求解。
It is shown that the two machine preemptive job-shop problem with mean flow-time or makespan objective function and three jobs isNP-hard. This contrasts the fact that the nonpreemptive versions of these problems are polynomially solvable if the number of jobs is arbitrary but fixed. It is also shown that the preemptive problems can be solved pseudopolynomially if both the number of machines and the number of jobs is fixed.