On the Convexity of Precedence Sequencing Games

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. We show that these sequencing games are convex if the initial order of the jobs is a concatenation of chains. F. Klijn's research is supported by a Ramón y Cajal contract of the Spanish Ministerio de Ciencia y Tecnología. The main part of F. Klijn's work was supported by a Marie Curie Fellowship of the European Community programme “Improving Human Research Potential and the Socio-economic Knowledge Base” under contract number HPMF-CT-2001-01232, carried out at the Departament d'Economia i d'Història Econòmica, Universitat Autònoma de Barcelona. His work is also partially supported by Research Grant BEC2002-02130 from the Spanish Ministerio de Ciencia y Tecnología and by the Barcelona Economics Program of CREA