Sequencing games with controllable processing times

DOI10.1016/J.EJOR.2004.09.037zbMATH Open1115.91007OpenAlexW2134081531MaRDI QIDQ818079FDOQ818079

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

Recommendations

• On games corresponding to sequencing situations with ready times
• Sequencing games with repeated players
• Partitioning sequencing situations and games
• On the convexity of games corresponding to sequencing situations with due dates.
• Sequencing games

zbMATH Keywords

game theorysequencing situationscontrollable processing times

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• Network flow problems and permutationally concave games
• On the convexity of precedence sequencing games
• Sequencing games with repeated players
• Sequencing games
• On interactive sequencing situations with exponential cost functions
• Cooperative game theory based coordinated scheduling of two-machine flow-shop and transportation
• Subgroup additivity in the queueing problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the convexity of games corresponding to sequencing situations with due dates.
• Batch sequencing and cooperation
• Relaxed sequencing games have a nonempty core
• Multiple-machine scheduling with learning effects and cooperative games
• Proportionate flow shop games
• Sequencing situations with position-dependent effects under cooperation
• On games corresponding to sequencing situations with ready times
• Playing for time: a sequential inspection game
• Partitioning sequencing situations and games

This page was built for publication: Sequencing games with controllable processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818079)