Open shop scheduling games

This paper takes a game theoretical approach to open shop scheduling problems minimize the sum of completion times. We assume that there is an initial schedule process jobs (consisting number operations) on machines and each job owned by different player. Thus, we can associate cooperative TU-game any problem, assigning coalition maximal cost savings it obtain through admissible rearrangements jobs’ operations. A approaches schedules for are introduced and, in main result paper, core allocation rule provided games arising from unit (execution times weights) most these approaches. To sharpen bounds set balanced, provide two counterexamples: one general another further relaxations definition coalition.