On the convexity of games corresponding to sequencing situations with due dates.
DOI10.1016/S0377-2217(01)00070-4zbMATH Open1049.91007OpenAlexW2569217334MaRDI QIDQ5953347FDOQ5953347
Authors: Peter Borm, Gloria Fiestras-Janeiro, Herbert Hamers, Estela Sánchez Rodríguez, Mark Voorneveld 
Publication date: 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00070-4
Recommendations
- Sequencing games with controllable processing times
- On games corresponding to sequencing situations with ready times
- On the convexity of precedence sequencing games
- Sequencing games
- Partitioning sequencing situations and games
- A short proof of convexity of step-out-step-in sequencing games
- Sequencing games with repeated players
- scientific article; zbMATH DE number 1248150
- scientific article; zbMATH DE number 6875266
- Games in sequencing situations with externalities
Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Cooperative games (91A12)
Cites Work
- Title not available (Why is that?)
- Sequencing games
- Cores of convex games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Values of Graph-Restricted Games
- Stochastic cooperative games: Superadditivity, convexity, and certainty equivalents
- Cooperation in one machine scheduling
- Convex games without side payments
- On games corresponding to sequencing situations with ready times
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (26)
- Games in sequencing situations with externalities
- On the convexity of precedence sequencing games
- A cooperative approach to service booking and scheduling in cloud manufacturing
- Sequencing situations and games with non-linear cost functions under optimal order consistency
- On the convexity of step out-step in sequencing games
- On interactive sequencing situations with exponential cost functions
- Cost allocation in rescheduling with machine unavailable period
- The bargaining set for almost-convex games
- Cooperative game theory based coordinated scheduling of two-machine flow-shop and transportation
- Subgroup additivity in the queueing problem
- Sequencing games with controllable processing times
- Batch sequencing and cooperation
- Sequencing situations with just-in-time arrival, and related games
- Multiple-machine scheduling with learning effects and cooperative games
- Job scheduling, cooperation, and control
- Cooperative sequencing games with position-dependent learning effect
- Proportionate flow shop games
- Shapley value for parallel machine sequencing situation without initial order
- Operations research games: A survey. (With comments and rejoinder)
- Convex games with an infinite number of players and sequencing situations
- Open shop scheduling games
- Paired comparisons analysis: an axiomatic approach to ranking methods
- Sequencing situations with position-dependent effects under cooperation
- On games corresponding to sequencing situations with ready times
- Compensation rules for multi-stage sequencing games
- Partitioning sequencing situations and games
This page was built for publication: On the convexity of games corresponding to sequencing situations with due dates.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953347)
