On the convexity of precedence sequencing games

DOI10.1007/s10479-005-2252-9zbMath1138.91326OpenAlexW1599660259MaRDI QIDQ816513

Herbert Hamers, Flip Klijn, Bas van Velzen

Publication date: 9 March 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-2252-9

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic scheduling theory in operations research (90B35)

Related Items

Sequencing games with controllable processing times ⋮ Subgroup additivity in the queueing problem ⋮ Partitioning sequencing situations and games ⋮ Multiple-machine scheduling with learning effects and cooperative games ⋮ Shapley value for parallel machine sequencing situation without initial order ⋮ Batch sequencing and cooperation ⋮ Sequencing situations and games with non-linear cost functions under optimal order consistency ⋮ Core stability in chain-component additive games ⋮ The bargaining set for almost-convex games ⋮ On games arising from multi-depot Chinese postman problems

Cites Work

• Unnamed Item
• Sequencing games
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Flow-shops with a dominant machine
• On the balancedness of relaxed sequencing games
• On a new class of parallel sequencing situations and related games
• On the balancedness of multiple machine sequencing games
• The split core for sequencing games
• On games corresponding to sequencing situations with ready times
• Cores of convex games
• The kernel and bargaining set for convex games
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Sequencing and Cooperation
• On the convexity of games corresponding to sequencing situations with due dates.