Sequencing situations with just-in-time arrival, and related games

DOI10.1007/s00186-014-0481-xzbMath1304.91050MaRDI QIDQ486940

Marco Slikker, Edwin Lohmann, P. E. M. Borm

Publication date: 19 January 2015

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/8a501ea4-0ca9-49d4-90d0-6c55ea2d7593

zbMATH Keywords

core; cooperative game theory; nucleolus; sequencing situations; just-in-time arrival; set-up time

Mathematics Subject Classification ID

91A12: Cooperative games

91A80: Applications of game theory

90B35: Deterministic scheduling theory in operations research

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

Step out-step in sequencing games, On interactive sequencing situations with exponential cost functions

Cites Work

• Unnamed Item
• Balancedness of sequencing games with multiple parallel machines
• Single facility multi-class job scheduling
• Single facility scheduling with multiple job classes
• Sequencing games
• Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
• On a new class of parallel sequencing situations and related games
• The assignment game. I: The core
• The Böhm-Bawerk horse market: a cooperative analysis
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• The Nucleolus of a Characteristic Function Game
• On the convexity of games corresponding to sequencing situations with due dates.