{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T01:37:42Z","timestamp":1791077862617,"version":"4.1.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10951-008-0062-z","type":"journal-article","created":{"date-parts":[[2008,3,28]],"date-time":"2008-03-28T20:11:29Z","timestamp":1206735089000},"page":"433-447","source":"Crossref","is-referenced-by-count":21,"title":["Proportionate flow shop games"],"prefix":"10.1007","volume":"11","author":[{"given":"Arantza","family":"Est\u00e9vez-Fern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manuel A.","family":"Mosquera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Borm","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Herbert","family":"Hamers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,3,29]]},"reference":[{"issue":"10","key":"62_CR1","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/0305-0548(96)00012-3","volume":"23","author":"A. Allahverdi","year":"1996","unstructured":"Allahverdi, A. (1996). Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computers & Operations Research, 23(10), 909\u2013916.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"62_CR2","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0360-8352(01)00011-0","volume":"39","author":"A. Allahverdi","year":"2001","unstructured":"Allahverdi, A., & Savsar, M. (2001). Stochastic proportionate flowshop scheduling with setups. Computers & Industrial Engineering, 39(3), 357\u2013369.","journal-title":"Computers & Industrial Engineering"},{"key":"62_CR3","first-page":"119","volume":"10","author":"O. N. Bondareva","year":"1963","unstructured":"Bondareva, O. N. (1963). Some applications of linear programming methods to the theory of cooperative games. Problemy Kibernitiki, 10, 119\u2013139 (in Russian).","journal-title":"Problemy Kibernitiki"},{"key":"62_CR4","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/S0377-2217(01)00070-4","volume":"136","author":"P. Borm","year":"2002","unstructured":"Borm, P., Fiestras-Janeiro, G., Hamers, H., S\u00e1nchez, E., & Voorneveld, M. (2002). On the convexity of games corresponding to sequencing situations with due dates. European Journal of Operational Research, 136, 616\u2013634.","journal-title":"European Journal of Operational Research"},{"key":"62_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1016360404530","volume":"109","author":"P. Calleja","year":"2002","unstructured":"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\u2013276.","journal-title":"Annals of Operations Research"},{"key":"62_CR6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.orl.2005.01.007","volume":"34","author":"P. Calleja","year":"2006","unstructured":"Calleja, P., Est\u00e9vez-Fern\u00e1ndez, A., Borm, P., & Hamers, H. (2006). Job scheduling, cooperation, and control. Operations Research Letters, 34, 22\u201328.","journal-title":"Operations Research Letters"},{"issue":"6","key":"62_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<253::AID-JOS30>3.0.CO;2-R","volume":"2","author":"T. C. E. Cheng","year":"1999","unstructured":"Cheng, T. C. E., & Shakhlevich, N. (1999). Proportionate flow shop with controllable processing times. Journal of Scheduling, 2(6), 253\u2013265.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"62_CR8","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/0377-2217(89)90427-X","volume":"40","author":"I. Curiel","year":"1989","unstructured":"Curiel, I., Pederzoli, G., & Tijs, S. H. (1989). Sequencing games. European Journal of Operational Research, 40(3), 344\u2013351.","journal-title":"European Journal of Operational Research"},{"key":"62_CR9","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/opre.42.3.566","volume":"42","author":"I. Curiel","year":"1994","unstructured":"Curiel, I., Potters, J., Prasad, R., Tijs, S., & Veltman, B. (1994). Sequencing and cooperation. Operations Research, 42, 566\u2013568.","journal-title":"Operations Research"},{"key":"62_CR10","first-page":"27","volume-title":"Chapters in game theory: in honor of Stef Tijs","author":"I. Curiel","year":"2002","unstructured":"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\u201350). Boston: Kluwer Academic."},{"key":"62_CR11","unstructured":"Est\u00e9vez-Fern\u00e1ndez, A., Calleja, P., Borm, P., & Hamers, H. (2004). Sequencing games with repeated players (CentER Discussion Paper 2004-128). Tilburg University, Tilburg, The Netherlands."},{"key":"62_CR12","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.ejor.2007.04.053","volume":"188","author":"M. D. Garc\u00eda-Sanz","year":"2008","unstructured":"Garc\u00eda-Sanz, M. D., Fern\u00e1ndez, F. R., Fiestras-Janeiro, M. G., Garc\u00eda-Jurado, I., & Puerto, J. (2008). Cooperation in Markovian queuing models. European Journal of Operational Research, 188, 485\u2013495.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"62_CR13","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s001860400350","volume":"59","author":"P. Gonz\u00e1lez","year":"2004","unstructured":"Gonz\u00e1lez, P., & Herrero, C. (2004). Optimal sharing of surgical costs in the presence of queues. Mathematical Methods of Operations Research, 59(3), 435\u2013436.","journal-title":"Mathematical Methods of Operations Research"},{"key":"62_CR14","first-page":"471","volume":"69","author":"H. Hamers","year":"1995","unstructured":"Hamers, H., Borm, P., & Tijs, S. (1995). On games corresponding to sequencing situations with ready times. Mathematical Programming, 69, 471\u2013483.","journal-title":"Mathematical Programming"},{"key":"62_CR15","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/S0377-2217(98)00355-5","volume":"119","author":"H. Hamers","year":"1999","unstructured":"Hamers, H., Klijn, F., & Suijs, J. (1999). On the balancedness of m-sequencing games. European Journal of Operational Research, 119, 678\u2013691.","journal-title":"European Journal of Operational Research"},{"key":"62_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0359-0","volume-title":"To queue or not to queue: equilibrium behavior in queuing systems","author":"R. Hassin","year":"2003","unstructured":"Hassin, R., & Haviv, M. (2003). To queue or not to queue: equilibrium behavior in queuing systems. Boston: Kluwer Academic."},{"key":"62_CR17","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF01271134","volume":"20","author":"M. LeBreton","year":"1992","unstructured":"LeBreton, M., Owen, G., & Weber, S. (1992). Strongly balanced cooperative games. International Journal of Game Theory, 20, 419\u2013427.","journal-title":"International Journal of Game Theory"},{"issue":"1","key":"62_CR18","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/S0022-0531(02)00036-4","volume":"109","author":"F. Maniquet","year":"2003","unstructured":"Maniquet, F. (2003). A characterization of the Shapley value in queuing problems. Journal of Economic Theory, 109(1), 90\u2013103.","journal-title":"Journal of Economic Theory"},{"issue":"1","key":"62_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.27.1.1.336","volume":"27","author":"H. Moulin","year":"2002","unstructured":"Moulin, H., & Stong, R. (2002). Fair queuing and other probabilistic allocation methods. Mathematics of Operations Research, 27(1), 1\u201330.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"62_CR20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y","volume":"1","author":"N. Shakhlevich","year":"1998","unstructured":"Shakhlevich, N., Hoogeveen, H., & Pinedo, M. (1998). Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling, 1(3), 157\u2013168.","journal-title":"Journal of Scheduling"},{"key":"62_CR21","series-title":"Annals of mathematics studies","first-page":"307","volume-title":"Contribution to the theory of games\u00a0II","author":"L. S. Shapley","year":"1953","unstructured":"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\u00a0II (pp. 307\u2013317). Princeton: Princeton University Press."},{"key":"62_CR22","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/nav.3800140404","volume":"14","author":"L. S. Shapley","year":"1967","unstructured":"Shapley, L. S. (1967). On balanced sets and cores. Naval Research Logistics Quarterly, 14, 453\u2013460.","journal-title":"Naval Research Logistics Quarterly"},{"key":"62_CR23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"L. S. Shapley","year":"1971","unstructured":"Shapley, L. S. (1971). Cores of convex games. International Journal of Game Theory, 1, 11\u201326.","journal-title":"International Journal of Game Theory"},{"key":"62_CR24","unstructured":"Shiau, D. F., & Huang, Y. M. (2004). Solving proportionate flexible flow shop scheduling problems: a\u00a0column generation approach. In M. Hamza (Ed.), Modelling, simulation, and optimization."},{"issue":"1","key":"62_CR25","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0377-2217(92)90175-9","volume":"62","author":"A. Nouweland van den","year":"1990","unstructured":"van den Nouweland, A., Krabbenborg, M., & Potters, J. (1990). Flow-shops with a dominant machine. European Journal of Operational Research, 62(1), 38\u201346.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"62_CR26","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2004.09.037","volume":"172","author":"B. Velzen van","year":"2006","unstructured":"van Velzen, B. (2006). Sequencing games with controllable processing times. European Journal of Operational Research, 172(1), 64\u201385.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0062-z.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:15:07Z","timestamp":1555575307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0062-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,29]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["62"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0062-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,29]]}}}