M. Verdés Enrich, S. Miquel Fernández, P. Calleja Cortés, A. Atay
Atay et al. (2021) address open shop scheduling problems using a cooperative game-theoretical approach to minimize the sum of completion times. In their work, each job is owned by a different player, and a cooperative TU-game is associated with the problem, assigning to each coalition the maximum cost savings achievable through admissible rearrangements of the jobs’ operations.
In our work, we generalize the results of Atay et al. (2021) by considering the specific case where the waiting costs per unit of time can differ among players.
Palabras clave: cooperative game theory, parallel machine scheduling, open shop scheduling, permutation games, balencedness
Programado
Game practice and OR Games II
13 de junio de 2025 09:00
MR 2