{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:28:42Z","timestamp":1762018122019,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T00:00:00Z","timestamp":1533340800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"AGAUR-Generalitat de Catalunya","award":["2014-SGR-1064","2017-SGR-1359"],"award-info":[{"award-number":["2014-SGR-1064","2017-SGR-1359"]}]},{"name":"Spanish Ministry of Economy and Competitiveness","award":["ECO2014-59302-P","ECO2017-88130-P"],"award-info":[{"award-number":["ECO2014-59302-P","ECO2017-88130-P"]}]},{"name":"Severo Ochoa Programme for Centres of Excellence in R&D","award":["SEV-2015-0563"],"award-info":[{"award-number":["SEV-2015-0563"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s00186-018-0645-1","type":"journal-article","created":{"date-parts":[[2018,8,3]],"date-time":"2018-08-03T23:17:43Z","timestamp":1533338263000},"page":"173-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Implementation of optimal schedules in outsourcing with identical suppliers"],"prefix":"10.1007","volume":"89","author":[{"given":"Herbert","family":"Hamers","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7255-6954","authenticated-orcid":false,"given":"Flip","family":"Klijn","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Slikker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,4]]},"reference":[{"key":"645_CR1","doi-asserted-by":"crossref","unstructured":"Abed F, Correa JR, Huang CC (2014) Optimal coordination mechanisms for multi-job scheduling games. In: Schulz AS, Wagner D (eds) Algorithms\u2014ESA 2014. Lecture notes in computer science, vol 8737. Springer, Berlin, Heidelberg, pp 13\u201324","DOI":"10.1007\/978-3-662-44777-2_2"},{"issue":"4","key":"645_CR2","first-page":"305","volume":"7","author":"L Agussurja","year":"2009","unstructured":"Agussurja L, Lau HC (2009) The price of stability in selfish scheduling games. Web Intell Agent Syst 7(4):305\u2013311","journal-title":"Web Intell Agent Syst"},{"key":"645_CR3","doi-asserted-by":"crossref","unstructured":"Angel E, Bampis E, Pascual F, Thibault N (2016) Truthfulness for the sum of weighted completion times. In: Dinh T, Thai M (eds) Computing and combinatorics. COCOON 2016. Lecture notes in computer science, vol 9797. Springer, Cham, pp 15\u201326","DOI":"10.1007\/978-3-319-42634-1_2"},{"issue":"4","key":"645_CR4","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich E, Dasgupta A, Kleinberg J, Tardos \u00c9, Wexler T, Roughgarden T (2008) The price of stability for network design with fair cost allocation. SIAM J Comput 38(4):1602\u20131623","journal-title":"SIAM J Comput"},{"issue":"4","key":"645_CR5","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1086\/256963","volume":"58","author":"KJ Arrow","year":"1950","unstructured":"Arrow KJ (1950) A difficulty in the concept of social welfare. J Polit Econ 58(4):328\u2013346","journal-title":"J Polit Econ"},{"key":"645_CR6","doi-asserted-by":"crossref","unstructured":"Aumann Y, Dombb Y (2010) Pareto efficiency and approximate pareto efficiency in routing and load balancing games. In: Proceedings of the 3rd international symposium on algorithmic game theory. pp 66\u201377","DOI":"10.1007\/978-3-642-16170-4_7"},{"key":"645_CR7","unstructured":"Braat J, Hamers H, Klijn F, Slikker M (2016) A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis. Tilburg University, Working Paper"},{"issue":"3","key":"645_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1287\/msom.1070.0152","volume":"9","author":"Y Bukchin","year":"2007","unstructured":"Bukchin Y, Hanany E (2007) Decentralization cost in scheduling: a game-theoretic approach. Manuf Serv Oper Manag 9(3):263\u2013275","journal-title":"Manuf Serv Oper Manag"},{"key":"645_CR9","unstructured":"Bukchin Y, Hanany E (2011) Decentralization cost in supply chain jobshop scheduling with minimum flowtime objective. Tel Aviv University, Working Paper"},{"key":"645_CR10","unstructured":"Cachon GP, Netessine S (2004) Game theory in supply chain analysis. In: Simchi-Levi D, Wu SD, Shen Z-J (eds) Handbook of quantitative supply chain analysis, vol 34. Springer, New York, pp 13\u201365"},{"issue":"3","key":"645_CR11","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s00453-012-9650-6","volume":"66","author":"I Caragiannis","year":"2013","unstructured":"Caragiannis I (2013) Efficient coordination mechanisms for unrelated machine scheduling. Algorithmica 66(3):512\u2013540","journal-title":"Algorithmica"},{"key":"645_CR12","doi-asserted-by":"crossref","unstructured":"Cohen J, Pascual F (2015) Scheduling tasks from selfish multi-tasks agents. In: Tr\u00e4ff J, Hunold S, Versaci F (eds) Euro-Par 2015: Parallel Processing. Euro\u2013Par 2015. Lecture Notes in Computer Science, vol 9233. Springer, Berlin, Heidelberg, pp 183\u2013195","DOI":"10.1007\/978-3-662-48096-0_15"},{"key":"645_CR13","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.geb.2013.03.011","volume":"92","author":"R Cole","year":"2015","unstructured":"Cole R, Correa J, Gkatzelis V, Mirrokni V, Olver N (2015) Decentralized utilitarian mechanisms for scheduling games. Games Econ Behav 92:306\u2013326","journal-title":"Games Econ Behav"},{"issue":"5","key":"645_CR14","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1002\/nav.21497","volume":"59","author":"JR Correa","year":"2012","unstructured":"Correa JR, Queyranne M (2012) Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost. Naval Res Logist 59(5):384\u2013395","journal-title":"Naval Res Logist"},{"issue":"1","key":"645_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.11.1.1","volume":"11","author":"P Dubey","year":"1986","unstructured":"Dubey P (1986) Inefficiency of Nash equilibria. Math Oper Res 11(1):1\u20138","journal-title":"Math Oper Res"},{"key":"645_CR16","unstructured":"Epstein L, Kleiman E (2011) On the quality and complexity of pareto equilibria in the job scheduling game. In: Proceedings of the 10th international conference on autonomous agents and multiagent systems, vol 2. pp 525\u2013532"},{"key":"645_CR17","doi-asserted-by":"crossref","unstructured":"Hoeksma R, Uetz M (2012) The price of anarchy for minsum related machine scheduling. In: Solis\u2013Oba R, Persiano G (eds) 9th Workshop on approximation and online algorithms. lecture notes in computer science studies in economic theory, vol 7164. Springer, Berlin, pp 261\u2013273","DOI":"10.1007\/978-3-642-29116-6_22"},{"issue":"2","key":"645_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E Horowitz","year":"1976","unstructured":"Horowitz E, Sahni S (1976) Exact and approximate algorithms for scheduling nonidentical processors. J ACM 23(2):317\u2013327","journal-title":"J ACM"},{"issue":"2","key":"645_CR19","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/322003.322011","volume":"24","author":"O Ibarra","year":"1977","unstructured":"Ibarra O, Kim C (1977) Heuristic algorithms for scheduling independent tasks on nonidentical processors. J ACM 24(2):280\u2013289","journal-title":"J ACM"},{"issue":"17","key":"645_CR20","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","volume":"410","author":"N Immorlica","year":"2009","unstructured":"Immorlica N, Li L, Mirrokni V, Schulz A (2009) Coordination mechanisms for selfish scheduling. Theor Comput Sci 410(17):1589\u20131598","journal-title":"Theor Comput Sci"},{"issue":"4","key":"645_CR21","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s003550100152","volume":"18","author":"MO Jackson","year":"2001","unstructured":"Jackson MO (2001) A crash course in implementation theory. Soc Choice Welf 18(4):655\u2013708","journal-title":"Soc Choice Welf"},{"issue":"2","key":"645_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias E, Papadimitriou C (2009) Worst-case equilibria. Comput Sci Rev 3(2):65\u201369","journal-title":"Worst-case equilibria. Comput Sci Rev"},{"issue":"2","key":"645_CR23","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ejor.2012.02.001","volume":"220","author":"K Lee","year":"2012","unstructured":"Lee K, Leung JY-T, Pinedo ML (2012) Coordination mechanisms for parallel machine scheduling. Eur J Oper Res 220(2):305\u2013313","journal-title":"Eur J Oper Res"},{"issue":"1","key":"645_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2006.06.023","volume":"179","author":"X Li","year":"2007","unstructured":"Li X, Wang Q (2007) Coordination mechanisms of supply chain systems. Eur J Oper Res 179(1):1\u201316","journal-title":"Eur J Oper Res"},{"key":"645_CR25","first-page":"95","volume-title":"Game theory and business applications","author":"L Li","year":"2001","unstructured":"Li L, Whang S (2001) Game theory models in operations management and information systems. In: Chatterjee K, Samuelson WF (eds) Game theory and business applications. Kluwer Academic Publishers, New York, pp 95\u2013131"},{"key":"645_CR26","unstructured":"Maskin E (1985) The theory of implementation in nash equilibrium: a survey. In: Hurwicz L, Schmeidler D, Sonnenschein H (eds) Social goals and social organization: volume in memory of Elisha Pazner. Cambridge University Press, Cambridge, pp 173\u2013204"},{"issue":"2","key":"645_CR27","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0531(83)90048-0","volume":"29","author":"RB Myerson","year":"1983","unstructured":"Myerson RB, Satterthwaite MA (1983) Efficient mechanisms for bilateral trading. J Econ Theory 29(2):265\u2013281","journal-title":"J Econ Theory"},{"key":"645_CR28","doi-asserted-by":"crossref","unstructured":"Papadimitriou C (2001) Algorithms, games, and the internet. In: Proceedings of the 33rd annual acm symposium on the theory of computing, pp 749\u2013753","DOI":"10.1145\/380752.380883"},{"issue":"8","key":"645_CR29","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1287\/mnsc.1060.0656","volume":"53","author":"G Perakis","year":"2007","unstructured":"Perakis G, Roels G (2007) The price of anarchy in supply chains: quantifying the efficiency of price-only contracts. Manag Sci 53(8):1249\u20131268","journal-title":"Manag Sci"},{"key":"645_CR30","unstructured":"Schulzan A, Stier Moses N (2003) On the performance of user equilibria in traffic networks. In: Proceedings of the 14th annual ACM-SIAM symposium on discrete algorithms, pp 86\u201387"},{"issue":"1\u20132","key":"645_CR31","doi-asserted-by":"publisher","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(1\u20132):59\u201366","journal-title":"Naval Res Logist Q"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-018-0645-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-018-0645-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-018-0645-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:11:04Z","timestamp":1579259464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-018-0645-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,4]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["645"],"URL":"https:\/\/doi.org\/10.1007\/s00186-018-0645-1","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2018,8,4]]},"assertion":[{"value":"2 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}