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

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

No author found.

Publication date: 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

convexity; coalition games; due date; job queue; processing time; sequencing situation; tardiness penalty

Mathematics Subject Classification ID

91A12: Cooperative games

90B35: Deterministic scheduling theory in operations research

90B22: Queues and service in operations research

Related Items

Batch sequencing and cooperation, On the convexity of precedence sequencing games, Sequencing games with controllable processing times, Proportionate flow shop games, Operations research games: A survey. (With comments and rejoinder), Paired comparisons analysis: an axiomatic approach to ranking methods, Partitioning sequencing situations and games, Job scheduling, cooperation, and control

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