Advertisement

Journal of Scheduling

, Volume 16, Issue 4, pp 405–415 | Cite as

Batch sequencing and cooperation

  • Barış Çiftçi
  • Peter Borm
  • Herbert HamersEmail author
  • Marco Slikker
Article

Abstract

Game theoretic analysis of sequencing situations has been restricted to manufacturing systems which consist of machines that can process only one job at a time. However, in many manufacturing systems, operations are carried out by batch machines which can simultaneously process multiple jobs. This paper aims to extend the game theoretical approach to the cost allocation problems arising from sequencing situations on systems that consist of batch machines. To analyze the allocation problem at hand, it focusses on the existence of core elements, convexity, and the Shapley value.

Keywords

Games/group decisions: cooperative  Sequencing: deterministic 

Notes

Acknowledgments

The authors want to thank the referees and an Associate Editor of JOS for there constructive suggestions and comments.

References

  1. Ahmadi, J. H., Ahmadi, R. H., Dasu, S., & Tang, C. S. (1992). Batching and scheduling jobs on batch and discrete processors. Operations Research, 40, 750–763.CrossRefGoogle Scholar
  2. Borm, P., Fiestras-Janeiro, G., Hamers, H., Sánchez, E., & Voorneveld, M. (2002). On the convexity of games corresponding to sequencing situations with due dates. European Journal of Operational Research, 136, 616–634.CrossRefGoogle Scholar
  3. Curiel, I., Pederzoli, G., & Tijs, S. (1989). Sequencing games. European Journal of Operational Research, 40, 344–351.CrossRefGoogle Scholar
  4. Curiel, I., Potters, J., Rajendra Prasad, V., Tijs, S., & Veltman, B. (1993). Cooperation in one machine scheduling. Zeitschrift fur Operations Research, 38, 113–129.Google Scholar
  5. Curiel, I., Potters, J., Tijs, S., & Veltman, B. (1994). Sequencing and cooperation. Operations Research, 42–3, 566–568.CrossRefGoogle Scholar
  6. Hamers, H., Borm, P., & Tijs, S. (1995). On games corresponding to sequencing situations with ready times. Mathematical Programming, 70, 1–13.Google Scholar
  7. Hamers, H., Klijn, F., & Suijs, J. (1999). On the balancedness of multimachine sequencing games. European Journal of Operational Research, 119, 678–691.CrossRefGoogle Scholar
  8. Hamers, H., Klijn, F., & van Velzen, B. (2005). On the convexity of precedence sequencing games. Annals of Operations Research, 137, 161–175.CrossRefGoogle Scholar
  9. Le Breton, M., Owen, G., & Weber, S. (1992). Strongly balanced cooperative games. International Journal of Game Theory, 20, 419–427.CrossRefGoogle Scholar
  10. Lee, C. Y., Uzsoy, R., & Martin-Vega, L. A. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40, 764–775.CrossRefGoogle Scholar
  11. Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3–24.CrossRefGoogle Scholar
  12. Potts, N. C., & Kovalyov, Y. M. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120, 228–249.CrossRefGoogle Scholar
  13. Shapley, L. S. (1953). A value for n-person games. In H. W. Kuhn & A. W. Tucker (Eds.), Contributions to the theory of games II. In: Annals of Mathematics Studies 28. (pp. 307–317). Princeton: Princeton University Press. Google Scholar
  14. Shapley, L. S., & Shubik, M. (1972). The assignment game I: the core. International Journal of Game Theory, 1–1, 111–130.Google Scholar
  15. Slikker, M. (2005). Balancedness of sequencing games with multiple parallel machines. Annals of Operations Research, 137, 177–189.Google Scholar
  16. Slikker, M. (2006a). Relaxed sequencing games have a nonempty core. Naval Research Logistics, 53, 235–242.Google Scholar
  17. Slikker, M. (2006b). Balancedness of multiple machine sequencing games revisited. European Journal of Operational Research, 174–3, 1944–1949.CrossRefGoogle Scholar
  18. Smith, W. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3, 59–66.CrossRefGoogle Scholar
  19. van den Nouweland, A., Krabbenborg, M., & Potters, J. (1992). Flow-shops with a dominant machine. European Journal of Operational Research, 62, 38–46.CrossRefGoogle Scholar
  20. van Velzen, B. (2006). Sequencing games with controllable processing times. European Journal of Operational Research, 172, 64–85.CrossRefGoogle Scholar
  21. Webster, S., & Baker, R. K. (1995). Scheduling groups of jobs on a single machine. Operations Research, 43, 692–703.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Barış Çiftçi
    • 1
  • Peter Borm
    • 1
  • Herbert Hamers
    • 1
    Email author
  • Marco Slikker
    • 2
  1. 1.Center and Department of Econometrics and ORTilburg UniversityTilburgThe Netherlands
  2. 2.School of Industrial EngineeringEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations