Open shop scheduling games

DOI10.1016/J.EJOR.2021.02.030zbMath1487.90266arXiv1907.12909OpenAlexW3129992152MaRDI QIDQ2239840

Pedro Calleja, Ata Atay, 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

schedulingbalancednessopen shopcooperative game theorycore allocation rule

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Step out-step in sequencing games
• Proportionate flow shop games
• Openshop and flowshop scheduling to minimize sum of completion times
• Sequencing games
• Flow-shops with a dominant machine
• On the balancedness of relaxed sequencing games
• On a new class of parallel sequencing situations and related games
• On the convexity of step out-step in sequencing games
• On the balancedness of multiple machine sequencing games
• On games corresponding to sequencing situations with ready times
• Cores of convex games
• Cooperation in one machine scheduling
• Scheduling the Open Shop to Minimize Mean Flow Time
• Open Shop Scheduling to Minimize Finish Time
• Sequencing and Cooperation
• Relaxed sequencing games have a nonempty core
• Scheduling
• On the convexity of games corresponding to sequencing situations with due dates.

This page was built for publication: Open shop scheduling games