Sequencing situations with just-in-time arrival, and related games
DOI10.1007/S00186-014-0481-XzbMATH Open1304.91050OpenAlexW2083061271MaRDI QIDQ486940FDOQ486940
Authors: Marco Slikker, Edwin Lohmann, Peter 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
Recommendations
Deterministic scheduling theory in operations research (90B35) Cooperative games (91A12) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- The Nucleolus of a Characteristic Function Game
- Sequencing games
- The assignment game. I: The core
- Balancedness of sequencing games with multiple parallel machines
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- Title not available (Why is that?)
- On the convexity of games corresponding to sequencing situations with due dates.
- A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
- Single facility scheduling with multiple job classes
- 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 Böhm-Bawerk horse market: a cooperative analysis
- Single facility multi-class job scheduling
Cited In (4)
This page was built for publication: Sequencing situations with just-in-time arrival, and related games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486940)