The Basic Core of a Parallel Machines Scheduling Game

Published Online:https://doi.org/10.1287/msom.2021.0337

References

  • Alon T, Haviv M (2020) Pooling risk games. Internat. Game Theory Rev. 22(3):1950015.CrossrefGoogle Scholar
  • Anily S (2018) Full characterization of the nonnegative core of some cooperative games. Naval Res. Logist. 65(4):303–316.CrossrefGoogle Scholar
  • Anily S, Haviv M (2007) The cost allocation problem for the first order interaction joint replenishment model. Oper. Res. 55(2):292–302.LinkGoogle Scholar
  • Anily S, Haviv M (2010) Cooperation in service systems. Oper. Res. 58(3):660–673.LinkGoogle Scholar
  • Bird CG (1976) On cost allocation for a spanning tree: A game theoretic approach. Networks 6(4):335–350.CrossrefGoogle Scholar
  • Curiel I (2010) Cooperative Game Theory and Applications (Kluwer Academic Publishers, New York).Google Scholar
  • Curiel I, Hamers H, Klijn F (2002) Sequencing games: A survey. Borm P, Peters H, eds. Chapters in Game Theory, Theory and Decision Library C, vol. 31 (Springer, Boston), 27–50.Google Scholar
  • Curiel I, Pederzoli G, Tijs S (1989) Sequencing games. Eur. J. Oper. Res. 40(3):344–351.CrossrefGoogle Scholar
  • Curiel I, Potters J, Prasad R, Tijs S, Veltman B (1994) Sequencing and cooperation. Oper. Res. 42(3):566–568.LinkGoogle Scholar
  • Gillies D (1953) Some theorems on n-person games. PhD dissertation, Princeton University, Princeton, NJ.Google Scholar
  • Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5:287–326.CrossrefGoogle Scholar
  • Hamers H, Klijn F, Suijs J (1999) On the balancedness of multiple machine sequencing games. Eur. J. Oper. Res. 119(3):678–691.CrossrefGoogle Scholar
  • Hamers H, Suijs J, Borm P (1996) The split core for sequencing games. Games Econom. Behav. 15(2):165–176.CrossrefGoogle Scholar
  • Kushwaha M, Gupta S (2015) Various schemes of load balancing in distributed systems—A review. Internat. J. Sci. Res. Sci. Engrg. Tech. 4(7):741–748.Google Scholar
  • Moulin H (2007) On scheduling fees to prevent merging, splitting, and transferring of jobs. Math. Oper. Res. 32(2):266–283.LinkGoogle Scholar
  • Moulin H (2008) Proportional scheduling, split-proofness, and merge-proofness. Games Econom. Behav. 63(2):567–587.CrossrefGoogle Scholar
  • Peleg B, Sudhölter P (2007) Introduction to the Theory of Cooperative Games (Springer Science & Business Media, New York).Google Scholar
  • Penmatsa S, Chronopoulos AT (2011) Game theoretic static load balancing for distributed systems. J. Parallel Distributed Comput. 71(4):537–555.CrossrefGoogle Scholar
  • Pinedo M (2016) Scheduling: Theory, Algorithms and Systems, 4th ed. (Springer International Publishing, Cham, Switzerland).CrossrefGoogle Scholar
  • Potts CN, Van Wassenhove LN (1992) Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. J. Oper. Res. Soc. 43(5):395–406.CrossrefGoogle Scholar
  • Serafini P (1996) Scheduling jobs on several machines with the job splitting property. Oper. Res. 44(4):617–628.LinkGoogle Scholar
  • Shapley LS (1971) Cores of convex games. Internat. J. Game Theory 1:11–26.CrossrefGoogle Scholar
  • Shapley LS, Shubik M (1972) The assignment game I: The core. Internat. J. Game Theory 1(1):111–130.CrossrefGoogle Scholar
  • Slikker M (2006) Balancedness of multiple machine sequencing games revisited. Eur. J. Oper. Res. 174(3):1944–1949.CrossrefGoogle Scholar
  • Smith WE (1956) Various optimizers for single-stage production. Naval Res. Logist. Quart. 3(1–2):59–66.CrossrefGoogle Scholar
  • Tahar DN, Yalaoui F, Chu C, Amodeo L (2006) A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times. Internat. J. Production Econom. 99(1–2):63–73.CrossrefGoogle Scholar
  • Tijs SH, Parthasarathy T, Potters JAM, Rajendra Prasad V (1984) Permutation games: Another class of totally balanced games. OR Spectrum 6:119–123.CrossrefGoogle Scholar
  • Xing W, Zhang J (2000) Parallel machine scheduling with splitting jobs. Discrete Appl. Math. 103(1–3):259–269.CrossrefGoogle Scholar
  • Yu Y, Benjaafar S, Gerchak Y (2015) Capacity sharing and cost allocation among independent firms with congestion. Production Oper. Management 24(8):1285–1310.CrossrefGoogle Scholar
  • Zhang J (2009) Cost allocations for joint replenishment models. Oper. Res. 57(1):146–156.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.