Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 437403, 6 pages
http://dx.doi.org/10.1155/2015/437403
Research Article

Shapley Value for Parallel Machine Sequencing Situation without Initial Order

Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China

Received 27 July 2014; Accepted 5 October 2014

Academic Editor: Dongdong Ge

Copyright © 2015 Shanshan Liu and Zhaohui Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. H. Hamers, F. Klijn, and J. Suijs, “On the balancedness of multiple machine sequencing games,” European Journal of Operational Research, vol. 119, no. 3, pp. 678–691, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. J. Bruno, E. G. Coffman Jr., and R. Sethi, “Scheduling independent tasks to reduce mean finishing time,” Communications of the ACM, vol. 17, no. 7, pp. 382–387, 1974. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. T. Kawaguchi and S. Kyan, “Worst case bound of an LRF schedule for the mean weighted flow-time problem,” SIAM Journal on Computing, vol. 15, no. 4, pp. 1119–1129, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. I. Curiel, G. Pederzoli, and S. Tijs, “Sequencing games,” European Journal of Operational Research, vol. 40, no. 3, pp. 344–351, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. H. Hamers, J. Suijs, S. Tijs, and P. Borm, “The split core for sequencing games,” Games and Economic Behavior, vol. 15, no. 2, pp. 165–176, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. B. van Velzen and H. Hamers, “On the balancedness of relaxed sequencing games,” Mathematical Methods of Operations Research, vol. 57, no. 2, pp. 287–297, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. M. Slikker, “Relaxed sequencing games have a nonempty core,” Naval Research Logistics, vol. 53, no. 4, pp. 235–242, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. I. Curiel, J. Potters, R. Prasad, S. Tijs, and B. Veltman, “Cooperation in one machine scheduling,” Mathematical Methods of Operations Research, vol. 38, no. 2, pp. 113–129, 1993. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. I. Curiel, J. Potters, R. Prasad, S. Tijs, and B. Veltman, “Sequencing and cooperation,” Operations Research, vol. 42, no. 3, pp. 566–568, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. H. Hamers, P. Borm, and S. Tijs, “On games corresponding to sequencing situations with ready times,” Mathematical Programming, vol. 69, no. 3, pp. 471–483, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. P. Borm, G. Fiestras-Janeiro, H. Hamers, E. Sánchez, and M. Voorneveld, “On the convexity of games corresponding to sequencing situations with due dates,” European Journal of Operational Research, vol. 136, no. 3, pp. 616–634, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. H. Hamers, F. Klijn, and B. van Velzen, “On the convexity of precedence sequencing games,” Annals of Operations Research, vol. 137, pp. 161–175, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. S. Grundel, B. Çiftçi, P. Borm, and H. Hamers, “Family sequencing and cooperation,” European Journal of Operational Research, vol. 226, no. 3, pp. 414–424, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. M. Slikker, “Balancedness of multiple machine sequencing games revisited,” European Journal of Operational Research, vol. 174, no. 3, pp. 1944–1949, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. F. Klijn and E. Sánchez, “Sequencing games without initial order,” Mathematical Methods of Operations Research, vol. 63, no. 1, pp. 53–62, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. D. Mishra and B. Rangarajan, “Cost sharing in a job scheduling problem,” Social Choice and Welfare, vol. 29, no. 3, pp. 369–382, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. L. S. Shapley, “A value for n-person games,” in Contributions to the Theory of Games II, H. W. Kuhn and A. W. Tucker, Eds., pp. 307–317, Princeton University Press, Princeton, NJ, USA, 1953. View at Google Scholar · View at MathSciNet