{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:03Z","timestamp":1759847643791},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,2,23]],"date-time":"2013-02-23T00:00:00Z","timestamp":1361577600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10951-013-0318-0","type":"journal-article","created":{"date-parts":[[2013,2,22]],"date-time":"2013-02-22T03:54:01Z","timestamp":1361505241000},"page":"405-415","source":"Crossref","is-referenced-by-count":11,"title":["Batch sequencing and cooperation"],"prefix":"10.1007","volume":"16","author":[{"given":"Bar\u0131\u015f","family":"\u00c7ift\u00e7i","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Borm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert","family":"Hamers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Slikker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,23]]},"reference":[{"key":"318_CR1","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.40.4.750","volume":"40","author":"JH Ahmadi","year":"1992","unstructured":"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\u2013763.","journal-title":"Operations Research"},{"key":"318_CR2","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":"318_CR3","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. (1989). Sequencing games. European Journal of Operational Research, 40, 344\u2013351.","journal-title":"European Journal of Operational Research"},{"key":"318_CR4","doi-asserted-by":"crossref","unstructured":"Curiel, I., Potters, J., Rajendra Prasad, V., Tijs, S., & Veltman, B. (1993). Cooperation in one machine scheduling. Zeitschrift fur Operations Research, 38, 113\u2013129.","DOI":"10.1007\/BF01414208"},{"key":"318_CR5","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/opre.42.3.566","volume":"42\u20133","author":"I Curiel","year":"1994","unstructured":"Curiel, I., Potters, J., Tijs, S., & Veltman, B. (1994). Sequencing and cooperation. Operations Research, 42\u20133, 566\u2013568.","journal-title":"Operations Research"},{"key":"318_CR6","first-page":"1","volume":"70","author":"H Hamers","year":"1995","unstructured":"Hamers, H., Borm, P., & Tijs, S. (1995). On games corresponding to sequencing situations with ready times. Mathematical Programming, 70, 1\u201313.","journal-title":"Mathematical Programming"},{"key":"318_CR7","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 multimachine sequencing games. European Journal of Operational Research, 119, 678\u2013691.","journal-title":"European Journal of Operational Research"},{"key":"318_CR8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10479-005-2252-9","volume":"137","author":"H Hamers","year":"2005","unstructured":"Hamers, H., Klijn, F., & van Velzen, B. (2005). On the convexity of precedence sequencing games. Annals of Operations Research, 137, 161\u2013175.","journal-title":"Annals of Operations Research"},{"key":"318_CR9","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF01271134","volume":"20","author":"M Breton Le","year":"1992","unstructured":"Le Breton, 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"},{"key":"318_CR10","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee, C. Y., Uzsoy, R., & Martin-Vega, L. A. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40, 764\u2013775.","journal-title":"Operations Research"},{"key":"318_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/1099-1425(200101\/02)4:1<3::AID-JOS57>3.0.CO;2-D","volume":"4","author":"CY Lee","year":"2001","unstructured":"Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3\u201324.","journal-title":"Journal of Scheduling"},{"key":"318_CR12","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"NC Potts","year":"2000","unstructured":"Potts, N. C., & Kovalyov, Y. M. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120, 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"318_CR13","unstructured":"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\u2013317). Princeton: Princeton University Press."},{"key":"318_CR14","unstructured":"Shapley, L. S., & Shubik, M. (1972). The assignment game I: the core. International Journal of Game Theory, 1\u20131, 111\u2013130."},{"key":"318_CR15","doi-asserted-by":"crossref","unstructured":"Slikker, M. (2005). Balancedness of sequencing games with multiple parallel machines. Annals of Operations Research, 137, 177\u2013189.","DOI":"10.1007\/s10479-005-2253-8"},{"key":"318_CR16","doi-asserted-by":"crossref","unstructured":"Slikker, M. (2006a). Relaxed sequencing games have a nonempty core. Naval Research Logistics, 53, 235\u2013242.","DOI":"10.1002\/nav.20137"},{"key":"318_CR17","doi-asserted-by":"crossref","first-page":"1944","DOI":"10.1016\/j.ejor.2005.03.031","volume":"174\u20133","author":"M Slikker","year":"2006","unstructured":"Slikker, M. (2006b). Balancedness of multiple machine sequencing games revisited. European Journal of Operational Research, 174\u20133, 1944\u20131949.","journal-title":"European Journal of Operational Research"},{"key":"318_CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W Smith","year":"1956","unstructured":"Smith, W. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"318_CR19","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0377-2217(92)90175-9","volume":"62","author":"A Nouweland van den","year":"1992","unstructured":"van den Nouweland, A., Krabbenborg, M., & Potters, J. (1992). Flow-shops with a dominant machine. European Journal of Operational Research, 62, 38\u201346.","journal-title":"European Journal of Operational Research"},{"key":"318_CR20","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, 64\u201385.","journal-title":"European Journal of Operational Research"},{"key":"318_CR21","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S Webster","year":"1995","unstructured":"Webster, S., & Baker, R. K. (1995). Scheduling groups of jobs on a single machine. Operations Research, 43, 692\u2013703.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0318-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0318-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0318-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T01:02:53Z","timestamp":1562720573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0318-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,23]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["318"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0318-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,23]]}}}