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.
KeywordsGames/group decisions: cooperative Sequencing: deterministic
The authors want to thank the referees and an Associate Editor of JOS for there constructive suggestions and comments.
- 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
- Hamers, H., Borm, P., & Tijs, S. (1995). On games corresponding to sequencing situations with ready times. Mathematical Programming, 70, 1–13.Google Scholar
- 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
- Shapley, L. S., & Shubik, M. (1972). The assignment game I: the core. International Journal of Game Theory, 1–1, 111–130.Google Scholar
- Slikker, M. (2005). Balancedness of sequencing games with multiple parallel machines. Annals of Operations Research, 137, 177–189.Google Scholar
- Slikker, M. (2006a). Relaxed sequencing games have a nonempty core. Naval Research Logistics, 53, 235–242.Google Scholar