On games corresponding to sequencing situations with ready times

DOI10.1007/BF01585572zbMath0844.90120OpenAlexW1986184589MaRDI QIDQ1906283

P. E. M. Borm, S. H. Tijs, Herbert Hamers

Publication date: 12 February 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585572

zbMATH Keywords

equal processing timesone-machine sequencingcooperative sequencing games

Mathematics Subject Classification ID

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

Related Items (33)

Sequencing games with controllable processing times ⋮ Proportionate flow shop games ⋮ Partitioning sequencing situations and games ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Multiple-machine scheduling with learning effects and cooperative games ⋮ Shapley value for parallel machine sequencing situation without initial order ⋮ On the convexity of independent set games ⋮ Cooperative sequencing games with position-dependent learning effect ⋮ Batch sequencing and cooperation ⋮ The pairwise egalitarian solution. ⋮ Two-agent scheduling to minimize the total cost ⋮ Pairwise solutions and the core of transportation situations ⋮ Open shop scheduling games ⋮ Sequencing situations and games with non-linear cost functions under optimal order consistency ⋮ Multi-agent scheduling on a single machine with max-form criteria ⋮ Games in sequencing situations with externalities ⋮ Multi-stage sequencing situations ⋮ Core stability in chain-component additive games ⋮ Solving a two-agent single-machine scheduling problem considering learning effect ⋮ A two-machine flowshop problem with two agents ⋮ On interactive sequencing situations with exponential cost functions ⋮ On the convexity of games corresponding to sequencing situations with due dates. ⋮ A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs ⋮ Cooperative games with stochastic payoffs ⋮ On the balancedness of multiple machine sequencing games ⋮ On the concavity of delivery games ⋮ Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost ⋮ Two-agent scheduling with rejection on a single machine ⋮ Job scheduling, cooperation, and control ⋮ Compensation rules for multi-stage sequencing games ⋮ On the convexity of precedence sequencing games

Cites Work

• Sequencing games
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Cores of convex games
• Sequencing and Cooperation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On games corresponding to sequencing situations with ready times