Sequencing games with controllable processing times

DOI10.1016/j.ejor.2004.09.037zbMath1115.91007OpenAlexW2134081531MaRDI QIDQ818079

Bas van Velzen

Publication date: 24 March 2006

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.037

zbMATH Keywords

game theorysequencing situationscontrollable processing times

Mathematics Subject Classification ID

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

Related Items

Proportionate flow shop games ⋮ Subgroup additivity in the queueing problem ⋮ Partitioning sequencing situations and games ⋮ Multiple-machine scheduling with learning effects and cooperative games ⋮ Batch sequencing and cooperation ⋮ On interactive sequencing situations with exponential cost functions ⋮ Network flow problems and permutationally concave games

Cites Work

• On the convexity of precedence sequencing games
• A survey of results for sequencing problems with controllable processing times
• Sequencing games
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Flow-shops with a dominant machine
• Two parallel machine sequencing problems involving controllable job processing times
• On a new class of parallel sequencing situations and related games
• On the balancedness of multiple machine sequencing games
• On games corresponding to sequencing situations with ready times
• Cores of convex games
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
• Sequencing and Cooperation
• On the convexity of games corresponding to sequencing situations with due dates.