STOCHASTIC SEQUENTIAL ASSIGNMENT PROBLEM WITH ARRIVALS
STOCHASTIC SEQUENTIAL ASSIGNMENT PROBLEM WITH ARRIVALS
复制标题
到达的随机顺序分配问题
DOI：
10.1017/s0269964811000143
复制
发表时间：
2011
影响因子：
1.1
通讯作者：
Rhonda Righter
中科院分区：
文献类型：
--
作者：
Rhonda Righter
我们将经典的顺序随机分配问题扩展到包括工人的到达。当工人都是同一类型时，我们表明社会最优政策与个人最优政策相同，根据后到先服务的原则给予工人优先权。该结果在模型假设的几种变体下也成立。当工人有不同类型时，我们表明社会最优政策是由阈值决定的，这样更有价值的工作就会被分配给更有价值的工人，但现在个体最优政策不再是社会最优的。我们还表明，当工人或工作价值变得更加可变时，整体价值就会增加。
We extend the classic sequential stochastic assignment problem to include arrivals of workers. When workers are all of the same type, we show that the socially optimal policy is the same as the individually optimal policy for which workers are given priority according to last come–first served. This result also holds under several variants in the model assumptions. When workers have different types, we show that the socially optimal policy is determined by thresholds such that more valuable jobs are given to more valuable workers, but now the individually optimal policy is no longer socially optimal. We also show that the overall value increases when worker or job values become more variable.