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.F. Klijn's research has been 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.