On games corresponding to sequencing situations with ready times

Abstract

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