This paper considers the special class of cooperative sequencing games
that arise from one-machine sequencing situations in which all jobs h
ave equal processing times and the ready time of each job is a multipl
e of the processing time. By establishing relations between optimal or
ders of subcoalitions, it is shown that each sequencing game within th
is class is convex.