On the convexity of precedence sequencing games

On the convexity of precedence sequencing games

0.00 Avg rating0 Votes
Article ID: iaor2006298
Country: Netherlands
Volume: 137
Issue: 1
Start Page Number: 161
End Page Number: 175
Publication Date: Jul 2005
Journal: Annals of Operations Research
Authors: , ,
Keywords: scheduling
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.