{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:40:16Z","timestamp":1648867216167},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T00:00:00Z","timestamp":1321401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10878-011-9434-y","type":"journal-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T14:02:33Z","timestamp":1321452153000},"page":"71-81","source":"Crossref","is-referenced-by-count":7,"title":["Maximum latency scheduling problem on two-person cooperative games"],"prefix":"10.1007","volume":"26","author":[{"given":"Yanhong","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochun","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaofei","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,16]]},"reference":[{"issue":"2","key":"9434_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52(2):229\u2013242","journal-title":"Oper Res"},{"issue":"1","key":"9434_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker KR, Smith JC (2003) A multiple-criterion model for machine scheduling. J Sched 6(1):7\u201316","journal-title":"J Sched"},{"key":"9434_CR3","unstructured":"Chen Q (2006) A new discrete bargaining model on job partition between two manufacturers. PhD diss, Faculty of Engineering, The Chinese University of Hong Kong, Hong Kong"},{"issue":"1","key":"9434_CR4","first-page":"14","volume":"28","author":"J Jin","year":"2011","unstructured":"Jin J, Gu Y, Tang G (2011) Two-person cooperative games on makespan scheduling. J Shanghai Second Polytech Univ, 28(1):14\u201317","journal-title":"J Shanghai Second Polytech Univ"},{"issue":"3","key":"9434_CR5","first-page":"207","volume":"14","author":"S Lahiri","year":"2003","unstructured":"Lahiri S (2003) Axiomatic characterization of the Nash and Kalai-Smorodinsky solutions for discrete bargaining problems. Pure Math Appl, 14(3):207\u2013220","journal-title":"Pure Math Appl"},{"issue":"3","key":"9434_CR6","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s003550050114","volume":"15","author":"M Mariotti","year":"1998","unstructured":"Mariotti M (1998) Nash bargaining theory when the number of alternatives can be finite. Soc Choice Welf 15(3):413\u2013421","journal-title":"Soc Choice Welf"},{"key":"9434_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511607950","volume-title":"Bargaining theory with applications","author":"A Muthoo","year":"1999","unstructured":"Muthoo A (1999) Bargaining theory with applications. Cambridge University Press, Cambridge,"},{"issue":"4","key":"9434_CR8","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s003550100150","volume":"19","author":"R Nagahisa","year":"2002","unstructured":"Nagahisa R, Tanaka M (2002) An axiomatization of the Kalai-Smorodinsky solution when the feasible sets can be finite. Soc Choice Welf 19(4):751\u2013761","journal-title":"Soc Choice Welf"},{"issue":"1","key":"9434_CR9","doi-asserted-by":"crossref","first-page":"128","DOI":"10.2307\/1906951","volume":"21","author":"JF Nash","year":"1953","unstructured":"Nash JF (1953) Two person cooperative games. Econometrica 21(1):128\u2013140","journal-title":"Econometrica"},{"issue":"2","key":"9434_CR10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"JF Nash","year":"1950","unstructured":"Nash JF (1950) The bargaining problem. Econometrica 18(2):155\u2013162","journal-title":"Econometrica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9434-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9434-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9434-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:16Z","timestamp":1559276596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9434-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,16]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9434"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9434-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,16]]}}}