Relaxed sequencing games have a nonempty core

DOI10.1002/nav.20137zbMath1151.91349OpenAlexW2096046683MaRDI QIDQ5438522

Marco Slikker

Publication date: 23 January 2008

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/relaxed-sequencing-games-have-a-nonempty-core(335ddd68-bcd0-4894-af1f-a3c64a0e6031).html

zbMATH Keywords

schedulingbalancednesscooperative game theory

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic scheduling theory in operations research (90B35) Other game-theoretic models (91A40)

Related Items

Partitioning sequencing situations and games ⋮ Step out-step in sequencing games ⋮ A rescheduling and cost allocation mechanism for delayed arrivals ⋮ Multiple-machine scheduling with learning effects and cooperative games ⋮ Shapley value for parallel machine sequencing situation without initial order ⋮ Batch sequencing and cooperation ⋮ The stable gain splitting rule for sequencing situations ⋮ Open shop scheduling games ⋮ Sequencing situations and games with non-linear cost functions under optimal order consistency ⋮ On the convexity of step out-step in sequencing games ⋮ Cost allocation in rescheduling with machine unavailable period ⋮ Games in sequencing situations with externalities ⋮ Multi-stage sequencing situations ⋮ On interactive sequencing situations with exponential cost functions ⋮ Job scheduling, cooperation, and control