{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:52:46Z","timestamp":1770814366476,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10479-005-2252-9","type":"journal-article","created":{"date-parts":[[2005,8,15]],"date-time":"2005-08-15T08:14:49Z","timestamp":1124093689000},"page":"161-175","source":"Crossref","is-referenced-by-count":23,"title":["On the Convexity of Precedence Sequencing Games"],"prefix":"10.1007","volume":"137","author":[{"given":"Herbert","family":"Hamers","sequence":"first","affiliation":[]},{"given":"Flip","family":"Klijn","sequence":"additional","affiliation":[]},{"given":"Bas","family":"van Velzen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2252_CR1","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., G. Fiestras-Janeiro, H. Hamers, E. Sanchez, and M. Voorneveld. (2002). \u201cOn the Convexity of Sequencing Games with DueDates.\u201d European Journal of Operational Research 136, 616\u2013634.","journal-title":"European Journal of Operational Research"},{"key":"2252_CR2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1016360404530","volume":"109","author":"P. Calleja","year":"2002","unstructured":"Calleja, P., P. Borm, H. Hamers, F. Klijn, and M. Slikker. (2002). \u201cOn a New Class of ParallelSequencing Situations and Related Games.\u201d Annals of Operations Research 109, 265\u2013277.","journal-title":"Annals of Operations Research"},{"key":"2252_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., G. Pederzoli, and S. Tijs. (1989). \u201cSequencing Games.\u201d European Journal of Operational Research 40, 344\u2013351.","journal-title":"European Journal of Operational Research"},{"key":"2252_CR4","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/opre.42.3.566","volume":"42","author":"I. Curiel","year":"1994","unstructured":"Curiel, I., J. Potters, V. Rajendra Prasad, S. Tijs, and B. Veltman. (1994). \u201cSequencing and cooperation.\u201d Operations Research 42, 566\u2013568.","journal-title":"Operations Research"},{"key":"2252_CR5","first-page":"1","volume":"70","author":"H. Hamers","year":"1995","unstructured":"Hamers, H., P. Borm, and S. Tijs. (1995). \u201cOn Games Corresponding to Sequencing Situations with Ready Times.\u201d Mathematical Programming 70, 1\u201313.","journal-title":"Mathematical Programming"},{"key":"2252_CR6","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., F. Klijn, and J. Suijs. (1999). \u201cOn the Balancedness of Multimachine Sequencing Games.\u201d European Journal of Operations Research 119, 678\u2013691.","journal-title":"European Journal of Operations Research"},{"key":"2252_CR7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1006\/game.1996.0064","volume":"15","author":"H. Hamers","year":"1996","unstructured":"Hamers, H., J. Suijs, S. Tijs, and P. Borm. (1996) \u201cThe Split Core for Sequencing Games.\u201d Games and Economic Behavior 15, 165\u2013176.","journal-title":"Games and Economic Behavior"},{"key":"2252_CR8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0022-0531(81)90007-7","volume":"25","author":"T Ichiishi","year":"1981","unstructured":"Ichiishi, T. (1981). \u201cSupermodularity: Applications to Convex Games and the Greedy Algorithm for LP.\u201d Journal of Economic Theory 25, 283\u2013286.","journal-title":"Journal of Economic Theory"},{"key":"2252_CR9","first-page":"73","volume":"2","author":"M. Maschler","year":"1972","unstructured":"Maschler, M., B. Peleg, and L. Shapley. (1972). \u201cThe Kernel and Bargaining Set of Convex Games.\u201d International Journal of Game Theory 2, 73\u201393.","journal-title":"International Journal of Game Theory"},{"key":"2252_CR10","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., M. Krabbenborg, and J. Potters. (1992). \u201cFlowshops with a Dominant Machine.\u201d European Journal of Operations Research 62, 38\u201346.","journal-title":"European Journal of Operations Research"},{"key":"2252_CR11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"L Shapley","year":"1971","unstructured":"Shapley, L. (1971). \u201cCores of Convex Games.\u201d International Journal of Game Theory 1, 11\u201326.","journal-title":"International Journal of Game Theory"},{"key":"2252_CR12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1287\/opre.23.2.283","volume":"23","author":"J Sidney","year":"1975","unstructured":"Sidney, J. (1975). \u201cDecomposition Algorithms or Single-Machine Sequencing with Precedence Relations andDeferral Costs.\u201d Operations Research 23, 283\u2013298.","journal-title":"Operations Research"},{"key":"2252_CR13","first-page":"123","volume-title":"Game Theory and Mathematical Economics","author":"S Tijs","year":"1981","unstructured":"Tijs, S. (1981). \u201cBounds for the Core and the \u03c4-Value.\u201d In O. Moeschlin and D. Pallaschke (eds.), Game Theory and Mathematical Economics,Amsterdam: North Holland Publishing Company, pp. 123\u2013132."},{"key":"2252_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s001860200243","volume":"57","author":"B Velzen van","year":"2003","unstructured":"van Velzen B. and H. Hamers. (2003). \u201cOn the Balancedness of Relaxed Sequencing Games.\u201d Mathematical Methods of Operations Research 57, 287\u2013297.","journal-title":"Mathematical Methods of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2252-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-2252-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2252-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:59:33Z","timestamp":1559138373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-2252-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["2252"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-2252-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}