Abstract
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.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Allahverdi, A. (1996). Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computers & Operations Research, 23(10), 909–916.
Allahverdi, A., & Savsar, M. (2001). Stochastic proportionate flowshop scheduling with setups. Computers & Industrial Engineering, 39(3), 357–369.
Bondareva, O. N. (1963). Some applications of linear programming methods to the theory of cooperative games. Problemy Kibernitiki, 10, 119–139 (in Russian).
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.
Calleja, P., Borm, P., Hamers, H., Klijn, F., & Slikker, M. (2002). On a class of parallel sequencing situations and related games. Annals of Operations Research, 109, 263–276.
Calleja, P., Estévez-Fernández, A., Borm, P., & Hamers, H. (2006). Job scheduling, cooperation, and control. Operations Research Letters, 34, 22–28.
Cheng, T. C. E., & Shakhlevich, N. (1999). Proportionate flow shop with controllable processing times. Journal of Scheduling, 2(6), 253–265.
Curiel, I., Pederzoli, G., & Tijs, S. H. (1989). Sequencing games. European Journal of Operational Research, 40(3), 344–351.
Curiel, I., Potters, J., Prasad, R., Tijs, S., & Veltman, B. (1994). Sequencing and cooperation. Operations Research, 42, 566–568.
Curiel, I., Hamers, H., & Klijn, F. (2002). Sequencing games: a survey. In P. Borm & H. Peters (Eds.), Chapters in game theory: in honor of Stef Tijs (pp. 27–50). Boston: Kluwer Academic.
Estévez-Fernández, A., Calleja, P., Borm, P., & Hamers, H. (2004). Sequencing games with repeated players (CentER Discussion Paper 2004-128). Tilburg University, Tilburg, The Netherlands.
García-Sanz, M. D., Fernández, F. R., Fiestras-Janeiro, M. G., García-Jurado, I., & Puerto, J. (2008). Cooperation in Markovian queuing models. European Journal of Operational Research, 188, 485–495.
González, P., & Herrero, C. (2004). Optimal sharing of surgical costs in the presence of queues. Mathematical Methods of Operations Research, 59(3), 435–436.
Hamers, H., Borm, P., & Tijs, S. (1995). On games corresponding to sequencing situations with ready times. Mathematical Programming, 69, 471–483.
Hamers, H., Klijn, F., & Suijs, J. (1999). On the balancedness of m-sequencing games. European Journal of Operational Research, 119, 678–691.
Hassin, R., & Haviv, M. (2003). To queue or not to queue: equilibrium behavior in queuing systems. Boston: Kluwer Academic.
LeBreton, M., Owen, G., & Weber, S. (1992). Strongly balanced cooperative games. International Journal of Game Theory, 20, 419–427.
Maniquet, F. (2003). A characterization of the Shapley value in queuing problems. Journal of Economic Theory, 109(1), 90–103.
Moulin, H., & Stong, R. (2002). Fair queuing and other probabilistic allocation methods. Mathematics of Operations Research, 27(1), 1–30.
Shakhlevich, N., Hoogeveen, H., & Pinedo, M. (1998). Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling, 1(3), 157–168.
Shapley, L. S. (1953). A value for n-person games. In H. Kuhn & A. W. Tucker (Eds.), Annals of mathematics studies : Vol. 28. Contribution to the theory of games II (pp. 307–317). Princeton: Princeton University Press.
Shapley, L. S. (1967). On balanced sets and cores. Naval Research Logistics Quarterly, 14, 453–460.
Shapley, L. S. (1971). Cores of convex games. International Journal of Game Theory, 1, 11–26.
Shiau, D. F., & Huang, Y. M. (2004). Solving proportionate flexible flow shop scheduling problems: a column generation approach. In M. Hamza (Ed.), Modelling, simulation, and optimization.
van den Nouweland, A., Krabbenborg, M., & Potters, J. (1990). Flow-shops with a dominant machine. European Journal of Operational Research, 62(1), 38–46.
van Velzen, B. (2006). Sequencing games with controllable processing times. European Journal of Operational Research, 172(1), 64–85.
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors thank two referees for their valuable suggestions for improvement. M.A. Mosquera acknowledges the financial support of Ministerio de Ciencia y Tecnología, FEDER, Xunta de Galicia (projects SEJ2005-07637-C02-02 and PGIDIT06PXIC207038PN).
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Estévez-Fernández, A., Mosquera, M.A., Borm, P. et al. Proportionate flow shop games. J Sched 11, 433–447 (2008). https://doi.org/10.1007/s10951-008-0062-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-008-0062-z