Sequencing games with controllable processing times

DOI10.1016/J.EJOR.2004.09.037MaRDI QIDQ818079zbMATH OpenOpenAlexFDO

Authors 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

controllable processing timesgame theorysequencing situations

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(24)

• Convex games with an infinite number of players and sequencing situations
• Processing games with restricted capacities
• Network flow problems and permutationally concave games
• Sequencing games
• Multiple-machine scheduling with learning effects and cooperative games
• On the convexity of step out-step in sequencing games
• On games corresponding to sequencing situations with ready times
• Family sequencing and cooperation
• On interactive sequencing situations with exponential cost functions
• Partitioning sequencing situations and games
• Playing for time: a sequential inspection game
• Subgroup additivity in the queueing problem
• Step out-step in sequencing games
• scientific article; zbMATH DE number 4045161 (Why is no real title available?)
• Batch sequencing and cooperation
• scientific article; zbMATH DE number 764439 (Why is no real title available?)
• Relaxed sequencing games have a nonempty core
• On the convexity of games corresponding to sequencing situations with due dates.
• Cooperative game theory based coordinated scheduling of two-machine flow-shop and transportation
• Sequencing situations with position-dependent effects under cooperation
• A bargaining game for implementing the equal gain splitting rule in sequencing situations
• On the convexity of precedence sequencing games
• Proportionate flow shop games
• Sequencing games with repeated players

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)