On the Convexity of Precedence Sequencing Games

13 years 10 months ago

Download pareto.uab.es

: In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. It is shown that these sequencing games are convex.

Herbert Hamers, Flip Klijn, Bas van Velzen

Real-time Traffic

ANOR 2005 | Cooperative Sequencing Games | One-machine Sequencing Situations | Sequencing |

claim paper

» Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning

» Maximum causal entropy correlated equilibria for Markov games

» Ambiguity and Constraint in Mathematical Expression Recognition

» The Flow Set with Partial Order

» Distributed iterative regularization algorithms for monotone Nash games

» Playing games with approximation algorithms

» Gametheoretic analysis of an ancient Chinese horse race problem

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	ANOR
Authors	Herbert Hamers, Flip Klijn, Bas van Velzen

Comments (0)

Sciweavers

On the Convexity of Precedence Sequencing Games

ANOR 2005 | Cooperative Sequencing Games | One-machine Sequencing Situations | Sequencing |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers