Open shop scheduling games

DOI10.1016/J.EJOR.2021.02.030MaRDI QIDQ2239840zbMATH OpenOpenAlexFDO

Authors Ata Atay, Pedro Calleja, Sergio Soteras

Publication date 5 November 2021

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.12909

zbMATH Keywords

balancednesscooperative game theorycore allocation ruleopen shopscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Cooperative games (91A12)

Abstract: 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.

Recommendations

• Proportionate flow shop games
• Sequencing and Cooperation
• Job scheduling, cooperation, and control
• Cooperation in one machine scheduling
• Multiple-machine scheduling with learning effects and cooperative games

Cites work

• Cooperation in one machine scheduling
• Cores of convex games
• Flow-shops with a dominant machine
• scientific article; zbMATH DE number 3139280 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• On a new class of parallel sequencing situations and related games
• On games corresponding to sequencing situations with ready times
• On the balancedness of multiple machine sequencing games
• On the balancedness of relaxed sequencing games
• On the convexity of games corresponding to sequencing situations with due dates.
• On the convexity of step out-step in sequencing games
• Open Shop Scheduling to Minimize Finish Time
• Openshop and flowshop scheduling to minimize sum of completion times
• Proportionate flow shop games
• Relaxed sequencing games have a nonempty core
• Scheduling the Open Shop to Minimize Mean Flow Time
• Scheduling. Theory, algorithms, and systems.
• Sequencing and Cooperation
• Sequencing games
• Step out-step in sequencing games

Cited in

(6)

• Lot streaming in open shops
• Lot streaming in open shop
• Queueing games with an endogenous number of machines
• Cooperative game theory based coordinated scheduling of two-machine flow-shop and transportation
• Optimistic and pessimistic approaches for cooperative games
• Proportionate flow shop games

This page was built for publication: Open shop scheduling games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239840)