Partitioning sequencing situations and games
From MaRDI portal
Publication:2378467
DOI10.1016/j.ejor.2008.03.003zbMath1159.91313MaRDI QIDQ2378467
Herbert Hamers, Marloes Gerichhausen
Publication date: 8 January 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://pure.uvt.nl/portal/en/publications/partitioning-sequencing-situations-and-games(2bddbf5c-c56d-4b10-ba47-58c048d27b4b).html
91A12: Cooperative games
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convexity of precedence sequencing games
- Balancedness of sequencing games with multiple parallel machines
- Sequencing games with controllable processing times
- Sequencing games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Strongly balanced cooperative games
- Rescheduling on a single machine with part-type dependent setup times and deadlines
- On the balancedness of relaxed sequencing games
- On the balancedness of multiple machine sequencing games
- On games corresponding to sequencing situations with ready times
- Cores of convex games
- Simple flow games
- Job scheduling, cooperation, and control
- Cooperation in one machine scheduling
- HOW TO HANDLE INTERVAL SOLUTIONS FOR COOPERATIVE INTERVAL GAMES
- Rescheduling for New Orders
- Sequencing and Cooperation
- Relaxed sequencing games have a nonempty core
- On the convexity of games corresponding to sequencing situations with due dates.
