{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:31:08Z","timestamp":1759847468708,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T00:00:00Z","timestamp":1490140800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ANR","award":["08-BLAN-0331-02"],"award-info":[{"award-number":["08-BLAN-0331-02"]}]},{"DOI":"10.13039\/501100001824","name":"Grant Agency of the Czech Republic","doi-asserted-by":"crossref","award":["P103-16-23509S"],"award-info":[{"award-number":["P103-16-23509S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10951-017-0516-2","type":"journal-article","created":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T02:45:26Z","timestamp":1490237126000},"page":"475-491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Finding an optimal Nash equilibrium to the multi-agent project scheduling problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Cyril","family":"Briand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandra Ulrich","family":"Ngueveu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4895-157X","authenticated-orcid":false,"given":"P\u0159emysl","family":"\u0160\u016fcha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"issue":"1","key":"516_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10951-014-0393-x","volume":"18","author":"A Agnetis","year":"2015","unstructured":"Agnetis, A., Briand, C., Billaut, J. C., & \u0160\u016fcha, P. (2015). Nash equilibria for the multi-agent project scheduling problem with controllable processing times. Journal of Scheduling, 18(1), 15\u201327.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"516_CR2","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.ejor.2010.02.012","volume":"205","author":"I Averbakh","year":"2010","unstructured":"Averbakh, I. (2010). Nash equilibria in competitive project scheduling. European Journal of Operational Research, 205(3), 552\u2013556.","journal-title":"European Journal of Operational Research"},{"key":"516_CR3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1051\/ro:2004202","volume":"37","author":"B Bachelet","year":"2003","unstructured":"Bachelet, B., & Mahey, P. (2003). Minimum convex-cost tension problems on series-parallel graphs. RAIRO - Operations Research, 37, 221\u2013234.","journal-title":"RAIRO - Operations Research"},{"key":"516_CR4","doi-asserted-by":"publisher","unstructured":"Bahrami, F., & Moslehi, G. (2012). Study of payment scheduling problem to achieve client\u2013contractor agreement. The International Journal of Advanced Manufacturing Technology. doi:\n                        10.1007\/s00170-012-4023-5\n                        \n                    .","DOI":"10.1007\/s00170-012-4023-5"},{"key":"516_CR5","first-page":"35","volume":"12","author":"RB Bey","year":"1981","unstructured":"Bey, R. B., Doersch, R. H., & Patterson, J. H. (1981). The net present value criterion: Its impact on project scheduling. Project Management Quarterly, 12, 35\u201345.","journal-title":"Project Management Quarterly"},{"key":"516_CR6","unstructured":"Briand, C., Agnetis, A., & Billaut, J. C. (2012). The multiagent project scheduling problem: complexity of finding an optimal Nash equilibrium. In 13th international conference on project management and scheduling, pp. 106\u2013109"},{"key":"516_CR7","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1287\/mnsc.47.12.1654.10242","volume":"47","author":"N Dayanand","year":"2001","unstructured":"Dayanand, N., & Padman, R. (2001). Project contracts and payment schedules: The client\u2019s problem. Management Science, 47, 1654\u20131667.","journal-title":"Management Science"},{"key":"516_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0377-2217(94)00187-H","volume":"81","author":"P De","year":"1995","unstructured":"De, P., Dunne, E. J., Ghosh, J. B., & Wells, C. E. (1995). The discrete time-cost tradeoff problem revisited. European Journal of Operations Research, 81, 225\u2013238.","journal-title":"European Journal of Operations Research"},{"key":"516_CR9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1022283403119","volume":"6","author":"E Demeulemeester","year":"2003","unstructured":"Demeulemeester, E., Vanhoucke, M., & Herroelen, W. (2003). Rangen: A random network generator for activity-on-the-node networks. Journal of Scheduling, 6, 17\u201338.","journal-title":"Journal of Scheduling"},{"key":"516_CR10","unstructured":"Demeulemeester, E. L., & Herroelen, W. S. (2002). Project scheduling: A research handbook. Kluwer Academic Publishers, chap 2-1.3.4. Transforming an AoN network into an AoA network with minimal reduction complexity, pp. 44\u201348"},{"key":"516_CR11","doi-asserted-by":"crossref","unstructured":"Diaby, M., Cruz, J. M., & Nsakanda, A. L. (2011). Project crashing in the presence of general non-linear activity time reduction costs. International Journal of Operational Research, 12, 318\u2013332.","DOI":"10.1504\/IJOR.2011.042919"},{"issue":"3","key":"516_CR12","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.ejor.2011.08.015","volume":"216","author":"A Est\u00e9vez-Fern\u00e1ndez","year":"2012","unstructured":"Est\u00e9vez-Fern\u00e1ndez, A. (2012). A game theoretical approach to sharing penalties and rewards in projects. European Journal of Operational Research, 216(3), 647\u2013657.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"516_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/0020-0190(82)90125-9","volume":"15","author":"AM Farley","year":"1982","unstructured":"Farley, A. M., & Proskurowski, A. (1982). Directed maximal-cut problems. Information Processing Letters, 15(5), 238\u2013241. doi:\n                        10.1016\/0020-0190(82)90125-9\n                        \n                    .","journal-title":"Information Processing Letters"},{"issue":"1","key":"516_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 207(1), 1\u201314.","journal-title":"European Journal of Operational Research"},{"key":"516_CR15","volume-title":"An introduction to allocation rules","author":"JL Hougaard","year":"1990","unstructured":"Hougaard, J. L. (1990). An introduction to allocation rules. Berlin: Springer."},{"key":"516_CR16","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.2307\/2951537","volume":"60","author":"H Moulin","year":"1992","unstructured":"Moulin, H., & Shenker, S. (1992). Serial cost sharing. Econometrica, 60, 1009\u20131037.","journal-title":"Econometrica"},{"key":"516_CR17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/mnsc.24.4.393","volume":"24","author":"S Phillips","year":"1977","unstructured":"Phillips, S., & Dessouky, M. I. (1977). Solving the project time\/cost tradeoff problem using the minimal cut concept. Management Science, 24, 393\u2013400.","journal-title":"Management Science"},{"key":"516_CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cor.2014.01.009","volume":"47","author":"M Sasaki","year":"2014","unstructured":"Sasaki, M., Campbell, J. F., Krishnamoorthy, M., & Ernst, A. T. (2014). A stackelberg hub arc location model for a competitive environment. Computers & Operations Research, 47, 27\u201341.","journal-title":"Computers & Operations Research"},{"key":"516_CR19","volume-title":"Combinatorial optimization\u2014Polyhedra and efficiency","author":"A Schrijver","year":"2004","unstructured":"Schrijver, A. (2004). Combinatorial optimization\u2014Polyhedra and efficiency. Berlin: Springer."},{"key":"516_CR20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s00182-008-0119-4","volume":"37","author":"Y Sprumont","year":"2008","unstructured":"Sprumont, Y. (2008). Nearly serial sharing methods. International Journal of Game Theory, 37, 155\u2013184.","journal-title":"International Journal of Game Theory"},{"key":"516_CR21","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1287\/mnsc.1040.0319","volume":"51","author":"JG Szmerekovsky","year":"2005","unstructured":"Szmerekovsky, J. G. (2005). The impact of contractor behavior on the client\u2019s payment-scheduling problem. Management Science, 51, 629\u2013640.","journal-title":"Management Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0516-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0516-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0516-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T10:00:04Z","timestamp":1506506404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0516-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,22]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["516"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0516-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2017,3,22]]}}}