{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:33:44Z","timestamp":1759847624116},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,22]],"date-time":"2014-10-22T00:00:00Z","timestamp":1413936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s00186-014-0481-x","type":"journal-article","created":{"date-parts":[[2014,10,21]],"date-time":"2014-10-21T23:00:38Z","timestamp":1413932438000},"page":"285-305","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Sequencing situations with Just-in-Time arrival, and related games"],"prefix":"10.1007","volume":"80","author":[{"given":"Edwin","family":"Lohmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Borm","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":[[2014,10,22]]},"reference":[{"key":"481_CR1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0305-0548(90)90003-P","volume":"17","author":"B Ahn","year":"1990","unstructured":"Ahn B, Hyun J (1990) Single facility multi-class job scheduling. Comput Oper Res 17:265\u2013272","journal-title":"Comput Oper Res"},{"key":"481_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, Sanchez E, Voorneveld M (2002) On the convexity of games corresponding to sequencing situations with due dates. Eur J Oper Res 136:616\u2013634","journal-title":"Eur J Oper Res"},{"key":"481_CR3","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/S0036144596297514","volume":"40","author":"R Burkard","year":"1998","unstructured":"Burkard R, Dei\u0148eko V, van Dal R, Van der Veen J, Woeginger G (1998) Well-solvable special cases of the traveling salesman problem: a survey. SIAM Rev 40:496\u2013546","journal-title":"SIAM Rev"},{"key":"481_CR4","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 new class of parallel sequencing situations and related games. Ann Oper Res 109:263\u2013276","journal-title":"Ann Oper Res"},{"key":"481_CR5","unstructured":"\u00c7ift\u00e7i B (2009) A cooperative approach to sequencing and connection problems. Ph. D. thesis, Tilburg University, Tilburg"},{"key":"481_CR6","first-page":"27","volume-title":"Chapters in game theory","author":"I Curiel","year":"2002","unstructured":"Curiel I, Hamers H, Klijn F (2002) Sequencing games: a survey. In: Borm P, Peters H (eds) Chapters in game theory. Kluwer Academic Publishers, Dordrecht, pp 27\u201350"},{"key":"481_CR7","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. Eur J Oper Res 40:344\u2013351","journal-title":"Eur J Oper Res"},{"key":"481_CR8","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0377-2217(88)90252-4","volume":"8","author":"J Gupta","year":"1988","unstructured":"Gupta J (1988) Single facility scheduling with multiple job classes. Eur J Oper Res 8:42\u201345","journal-title":"Eur J Oper Res"},{"key":"481_CR9","volume-title":"The traveling salesman problem","author":"E Lawler","year":"1985","unstructured":"Lawler E, Lenstra J Rinnooy, Rinnooy Kan A, Shmoys D (1985) The traveling salesman problem. Wiley, Chichester"},{"key":"481_CR10","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s00182-005-0199-3","volume":"33","author":"M N\u00fa\u00f1ez","year":"2005","unstructured":"N\u00fa\u00f1ez M, Rafels C (2005) The B\u00f6hm-Bawerk horse market: a cooperative analysis. Int J Game Theory 33:421\u2013430","journal-title":"Int J Game Theory"},{"key":"481_CR11","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1287\/opre.28.6.1347","volume":"28","author":"H Psaraftis","year":"1980","unstructured":"Psaraftis H (1980) A dynamic programming approach for sequencing groups of identical jobs. Oper Res 28:1347\u20131359","journal-title":"Oper Res"},{"key":"481_CR12","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D Schmeidler","year":"1969","unstructured":"Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J Appl Math 17:1163\u20131170","journal-title":"SIAM J Appl Math"},{"key":"481_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L Shapley","year":"1972","unstructured":"Shapley L, Shubik M (1972) The assignment game I: the core. Int J Game Theory 1:111\u2013130","journal-title":"Int J Game Theory"},{"key":"481_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10479-005-2253-8","volume":"137","author":"M Slikker","year":"2005","unstructured":"Slikker M (2005) Balancedness of sequencing games with multiple parallel machines. Ann Oper Res 137:177\u2013189","journal-title":"Ann Oper Res"},{"key":"481_CR15","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 Res Logist Q 3:59\u201366","journal-title":"Naval Res Logist Q"},{"key":"481_CR16","first-page":"235","volume":"82","author":"J Veen van der","year":"1998","unstructured":"van der Veen J, Woeginger G, Zhang S (1998) Sequencing jobs that require common resources on a single machine: a solvable case of the TSP. Math Progr 82:235\u2013254","journal-title":"Math Progr"},{"key":"481_CR17","unstructured":"Verdaasdonk, L. (2007). Telephone sequencing. MSc thesis, Department of Econometrics and OR, Tilburg University, Tilburg"},{"key":"481_CR18","volume-title":"Positive theory of capital (translated by W. Smart)","author":"E B\u00f6hm-Bawerk von","year":"1891","unstructured":"von B\u00f6hm-Bawerk E (1891) Positive theory of capital (translated by W. Smart). Macmillan, London"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-014-0481-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-014-0481-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-014-0481-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T10:33:32Z","timestamp":1558607612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-014-0481-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,22]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["481"],"URL":"https:\/\/doi.org\/10.1007\/s00186-014-0481-x","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,22]]}}}