On the convexity of games corresponding to sequencing situations with due dates.

DOI10.1016/S0377-2217(01)00070-4zbMath1049.91007OpenAlexW2569217334MaRDI QIDQ5953347

No author found.

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

zbMATH Keywords

convexitycoalition gamesdue datejob queueprocessing timesequencing situationtardiness penalty

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (21)

Sequencing games with controllable processing times ⋮ Proportionate flow shop games ⋮ Subgroup additivity in the queueing problem ⋮ A cooperative approach to service booking and scheduling in cloud manufacturing ⋮ Partitioning sequencing situations and games ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Multiple-machine scheduling with learning effects and cooperative games ⋮ Shapley value for parallel machine sequencing situation without initial order ⋮ Cooperative sequencing games with position-dependent learning effect ⋮ Batch sequencing and cooperation ⋮ Sequencing situations with just-in-time arrival, and related games ⋮ Open shop scheduling games ⋮ Sequencing situations and games with non-linear cost functions under optimal order consistency ⋮ Paired comparisons analysis: an axiomatic approach to ranking methods ⋮ Cost allocation in rescheduling with machine unavailable period ⋮ Games in sequencing situations with externalities ⋮ On interactive sequencing situations with exponential cost functions ⋮ Job scheduling, cooperation, and control ⋮ The bargaining set for almost-convex games ⋮ Compensation rules for multi-stage sequencing games ⋮ On the convexity of precedence sequencing games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequencing games
• Convex games without side payments
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Stochastic cooperative games: Superadditivity, convexity, and certainty equivalents
• On games corresponding to sequencing situations with ready times
• Cores of convex games
• Cooperation in one machine scheduling
• Values of Graph-Restricted Games

This page was built for publication: On the convexity of games corresponding to sequencing situations with due dates.