Proportionate flow shop games

In a proportionate flow shop problem several jobs have to be processed through a fixed sequence of machines and the processing time of each job is equal on all machines. By identifying jobs with agents whose costs linearly depend on the completion time of their jobs and assuming an initial processing order on the jobs, we face two problems: the first is how to obtain an optimal order that minimizes the total processing cost, the second is how to allocate the cost savings obtained by ordering the jobs optimally. In this paper we focus on the allocation problem. PFS games are defined as cooperative games associated to proportionate flow shop problems. It is seen that PFS games have a nonempty core. Moreover, it is shown that PFS games are convex if the jobs are initially ordered in decreasing urgency. For this case an explicit game independent expression for the Shapley value is provided.

[1]  Refael Hassin,et al.  To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .

[2]  P. Borm,et al.  Sequencing games with repeated players , 2008, Ann. Oper. Res..

[3]  Lloyd S. Shapley,et al.  On balanced sets and cores , 1967 .

[4]  Herbert Hamers,et al.  Job scheduling, cooperation, and control , 2006, Oper. Res. Lett..

[5]  Ali Allahverdi,et al.  Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness , 1996, Comput. Oper. Res..

[6]  J. Suijs.  On the Balancedness of m-Sequencing Games Herbert Hamers Flip Klijn , 1999 .

[7]  Stef Tijs,et al.  Sequencing and Cooperation , 1994, Oper. Res..

[8]  Carmen Herrero,et al.  Optimal sharing of surgical costs in the presence of queues , 2004, Math. Methods Oper. Res..

[9]  Mehmet Savsar,et al.  Stochastic proportionate flowshop scheduling with setups , 2001 .

[10]  Catharina Gerardina Anna Maria van den Nouweland,et al.  Games and graphs in economic situations , 1993 .

[11]  Bas van Velzen,et al.  Sequencing Games with Controllable Processing Times , 2006, Eur. J. Oper. Res..

[12]  L. Shapley.  Cores of convex games , 1971 .

[13]  Justo Puerto,et al.  Cooperation in Markovian queueing models , 2008, Eur. J. Oper. Res..

[14]  M. Haviv,et al.  To Queue or Not to Queue , 2003 .

[15]  François Maniquet,et al.  A characterization of the Shapley value in queueing problems , 2003, J. Econ. Theory.

[16]  Shlomo Weber,et al.  Strongly balanced cooperative games , 1992 .

[17]  L. Shapley.  A Value for n-person Games , 1988 .

[18]  Herbert Hamers,et al.  On the balancedness of multiple machine sequencing games , 1999, Eur. J. Oper. Res..

[19]  A. Nouweland,et al.  Flow-shops with a dominant machine , 1992 .

[20]  Herbert Hamers,et al.  On games corresponding to sequencing situations with ready times , 1995, Math. Program..

[21]  Hans Peters,et al.  Chapters in Game Theory in Honor of Stef Tijs , 2002 .

[22]  T. C. Edwin Cheng,et al.  Proportionate flow shop with controllable processing times , 1999 .

[23]  Han Hoogeveen,et al.  Minimizing total weighted completion time in a proportionate flow shop , 1998 .

[24]  Herbert Hamers,et al.  On a New Class of Parallel Sequencing Situations and Related Games , 2002, Ann. Oper. Res..

[25]  Herbert Hamers,et al.  Sequencing games : A survey , 2002 .

[26]  Richard Stong,et al.  Fair Queuing and Other Probabilistic Allocation Methods , 2002, Math. Oper. Res..

[27]  Herbert Hamers,et al.  On the convexity of games corresponding to sequencing situations with due dates , 2002, Eur. J. Oper. Res..

[28]  Tatsuro Ichiishi,et al.  Super-modularity: Applications to convex games and to the greedy algorithm for LP , 1981 .