开店调度小游戏
Open shop scheduling games
摘要：
本文采用对策论方法研究了以最小化完工时间之和为目标的具有单元执行时间的开放车间调度问题。通过假设一个初始的时间表和关联的每个工作（包括在一些操作）到不同的球员，我们可以构建一个合作TU游戏与任何开放的车间调度问题。我们分配给每个联盟的最大成本节约，它可以通过允许的重新安排作业的操作。通过提供核心分配，我们表明相关游戏是平衡的。最后，我们放宽了联盟的可接受重排的定义，以研究平衡性在多大程度上仍然成立。
英文摘要：
This paper takes a game theoretical approach to open shop scheduling problems with unit execution times to minimize the sum of completion times. By supposing an initial schedule and associating each job (consisting in a number of operations) to a different player, we can construct a cooperative TU-game associated with any open shop scheduling problem. We assign to each coalition the maximal cost savings it can obtain through admissible rearrangements of jobs' operations. By providing a core allocation, we show that the associated games are balanced. Finally, we relax the definition of admissible rearrangements for a coalition to study to what extend balancedness still holds.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
