{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:08:00Z","timestamp":1778861280433,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,9]],"date-time":"2014-09-09T00:00:00Z","timestamp":1410220800000},"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":["J Sched"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10951-014-0393-x","type":"journal-article","created":{"date-parts":[[2014,9,8]],"date-time":"2014-09-08T04:46:37Z","timestamp":1410151597000},"page":"15-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Nash equilibria for the multi-agent project scheduling problem with controllable processing times"],"prefix":"10.1007","volume":"18","author":[{"given":"Alessandro","family":"Agnetis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Briand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Charles","family":"Billaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u0159emysl","family":"\u0160\u016fcha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,9]]},"reference":[{"issue":"8","key":"393_CR1","doi-asserted-by":"crossref","first-page":"1738","DOI":"10.1016\/j.engappai.2011.12.003","volume":"25","author":"S Adhau","year":"2012","unstructured":"Adhau, S., Mittal, M. L., & Mittal, A. (2012). A multi-agent system for distributed multi-project scheduling: An auction-based negotiation approach. Engineering Applications of Artificial Intelligence, 25(8), 1738\u20131751.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"393_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229\u2013242.","journal-title":"Operations Research"},{"key":"393_CR3","volume-title":"Network flows","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows. Upper Saddle River, NJ: Prentice-Hall."},{"key":"393_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1051\/ro:2004202","volume":"37\u20134","author":"B Bachelet","year":"2003","unstructured":"Bachelet, B., & Mahey, P. (2003). Minimum convex-cost tension problems on series-parallel graphs. RAIRO Operations Research, 37\u20134, 221\u2013234.","journal-title":"RAIRO Operations Research"},{"key":"393_CR5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1023\/A:1016372707256","volume":"109","author":"R Br\u00e2nzei","year":"2002","unstructured":"Br\u00e2nzei, R., Ferrari, G., Fragnelli, V., & Tijs, S. (2002). Two approaches to the problem of sharing delay costs in joint projects. Annals of Operations Research, 109, 359\u2013374.","journal-title":"Annals of Operations Research"},{"key":"393_CR6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02935746","volume":"15","author":"E Ciurea","year":"2004","unstructured":"Ciurea, E., & Ciupal\u00e2, L. (2004). Sequential and parallel algorithms for minimum flows. Journal of Applied Mathematics and Computing, 15, 53\u201375.","journal-title":"Journal of Applied Mathematics and Computing"},{"key":"393_CR7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10479-006-0158-9","volume":"150","author":"G Confessore","year":"2007","unstructured":"Confessore, G., Giordani, S., & Rismondo, S. (2007). A market-based multi-agent system model for decentralized multi-project scheduling. Annals of Operations Research, 150, 115\u2013135.","journal-title":"Annals of Operations Research"},{"key":"393_CR8","volume-title":"Project scheduling\u2014a research handbook","author":"EL Demeulemeester","year":"2002","unstructured":"Demeulemeester, E. L., & Herroelen, W. S. (2002). Project scheduling\u2014a research handbook. Dordrecht: Kluwer Academic Publishers."},{"issue":"3","key":"393_CR9","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":"393_CR10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0263-7863(98)00041-6","volume":"17","author":"R Evaristo","year":"1999","unstructured":"Evaristo, R., & van Fenema, P. C. (1999). A typology of project management: Emergence and evolution of new forms. International Journal of Project Management, 17(5), 275\u2013281.","journal-title":"International Journal of Project Management"},{"key":"393_CR11","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman & Co."},{"issue":"1","key":"393_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00291-009-0178-3","volume":"34","author":"J Homberger","year":"2012","unstructured":"Homberger, J. (2012). A (mu, lambda)-coordination mechanism for agent-based multi-project scheduling. OR Spectrum, 34(1), 107\u2013132.","journal-title":"OR Spectrum"},{"issue":"2","key":"393_CR13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/07408170304381","volume":"35","author":"G Knotts","year":"2003","unstructured":"Knotts, G., & Dror, M. (2003). Agent-based project scheduling: Computational study of large problems. IIE Transactions, 35(2), 143\u2013159.","journal-title":"IIE Transactions"},{"issue":"5","key":"393_CR14","first-page":"387","volume":"32","author":"G Knotts","year":"2000","unstructured":"Knotts, G., Dror, M., & Hartman, B. C. (2000). Agent-based project scheduling. IIE Transactions, 32(5), 387\u2013401.","journal-title":"IIE Transactions"},{"issue":"22","key":"393_CR15","doi-asserted-by":"crossref","first-page":"4813","DOI":"10.1080\/00207540500066796","volume":"43","author":"JSK Lau","year":"2005","unstructured":"Lau, J. S. K., Huang, G. Q., Mak, K. L., & Liang, L. (2005a). Distributed project scheduling with information sharing in supply chains: Part I an agent-based negotiation model. International Journal of Production Research, 43(22), 4813\u20134838.","journal-title":"International Journal of Production Research"},{"key":"393_CR16","doi-asserted-by":"crossref","unstructured":"Lau, J. S. K., Huang, G. Q., Mak, K. L., & Liang, L. (2005b). Distributed project scheduling with information sharing in supply theoretical analysis and computational study. International Journal of Production Research, 43(23), 4899\u20134927.","DOI":"10.1080\/00207540500232240"},{"key":"393_CR17","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JY-T Leung","year":"2010","unstructured":"Leung, J. Y.-T., Pinedo, M. L., & Wan, G. (2010). Competitive two-agent scheduling and its applications. Operations Research, 58, 458\u2013469.","journal-title":"Operations Research"},{"key":"393_CR18","first-page":"18","volume":"15","author":"Z Li","year":"2012","unstructured":"Li, Z., & Zhou, H. (2012). Coordination mechanism of economic lot and delivery scheduling problem. Industrial Engineering Journal, 15, 18\u201322.","journal-title":"Industrial Engineering Journal"},{"key":"393_CR19","doi-asserted-by":"crossref","unstructured":"Phillips, S., & Dessouky, M. I. (1977). Solving the project time\/cost tradeoff problem using the minimal cut concept. Management Science, 24(4), 393\u2013400.","DOI":"10.1287\/mnsc.24.4.393"},{"key":"393_CR20","unstructured":"Wang, L., Zhan, D., Nie, L., & Xu, X. (2011). Research framework for decentralized multi-project scheduling problem. In 2011 International Conference on Information Science and Technology, ICIST 2011, pp. 802\u2013806."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0393-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0393-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0393-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:50Z","timestamp":1559468390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0393-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,9]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["393"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0393-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,9]]}}}