{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:49:41Z","timestamp":1743133781015,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642239373"},{"type":"electronic","value":"9783642239380"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23938-0_32","type":"book-chapter","created":{"date-parts":[[2011,9,11]],"date-time":"2011-09-11T20:40:55Z","timestamp":1315773655000},"page":"311-321","source":"Crossref","is-referenced-by-count":3,"title":["Double-Action Agents Solving the MRCPSP\/Max Problem"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Je\u0327drzejowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ewa","family":"Ratajczak-Ropel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-88071-4_4","volume-title":"Intelligent Agents in the Evolution of Web and Applications","author":"D. Barbucha","year":"2009","unstructured":"Barbucha, D., Czarnowski, I., Je\u0327drzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: E-JABAT An Implementation of the Web-Based A-Team. In: Nguyen, N.T., Jain, L.C. (eds.) Intelligent Agents in the Evolution of Web and Applications, pp. 57\u201386. Springer, Heidelberg (2009)"},{"key":"32_CR2","first-page":"201","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling Project Networks with Resource Constraints and Time Windows. Annual Operational Research\u00a016, 201\u2013240 (1988)","journal-title":"Annual Operational Research"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cor.2009.09.019","volume":"38","author":"A. Barrios","year":"2011","unstructured":"Barrios, A., Ballestin, F., Valls, V.: A double genetic algorithm for the MRCPSP\/max. Computers and Operations Research\u00a038, 33\u201343 (2011)","journal-title":"Computers and Operations Research"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/PL00013354","volume":"23","author":"R. Heilmann","year":"2001","unstructured":"Heilmann, R.: Resource-Constrained Project Scheduling: a Heuristic for the Multi-Mode Case. OR Spektrum\u00a023, 335\u2013357 (2001)","journal-title":"OR Spektrum"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/S0377-2217(02)00136-4","volume":"144","author":"R. Heilmann","year":"2003","unstructured":"Heilmann, R.: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. European Journal of Operational Research\u00a0144, 348\u2013365 (2003)","journal-title":"European Journal of Operational Research"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/11758532_94","volume-title":"Computational Science \u2013 ICCS 2006","author":"P. J\u0119drzejowicz","year":"2006","unstructured":"J\u0119drzejowicz, P., Wierzbowska, I.: JADE-Based A-Team Environment. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol.\u00a03993, pp. 719\u2013726. Springer, Heidelberg (2006)"},{"key":"32_CR7","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1007\/978-3-642-01665-3_74","volume-title":"Agent and Multi-Agent Systems: Technologies and Applications","author":"P. Jedrzejowicz","year":"2009","unstructured":"Jedrzejowicz, P., Ratajczak-Ropel, E.: Solving the rCPSP\/max problem by the team of agents. In: H\u00e5kansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2009. LNCS (LNAI), vol.\u00a05559, pp. 734\u2013743. Springer, Heidelberg (2009)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Je\u0327drzejowicz, P., Ratajczak-Ropel, E.: A-Team for Solving MRCPSP\/max Problem. Accepted for publication in LNCS\/LNAI series (2011)","DOI":"10.1007\/978-3-642-22000-5_48"},{"key":"32_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24800-2","volume-title":"Project Scheduling with Time Windows and Scarce Resources","author":"K. Neumann","year":"2003","unstructured":"Neumann, K., Schwindt, C., Zimmermann, J.: Project Scheduling with Time Windows and Scarce Resources, 2nd edn. Springer, Heidelberg (2003)","edition":"2"},{"key":"32_CR10","unstructured":"Nonobe, K., Ibaraki, T.: A Tabu Search Algorithm for a Generalized Resource Constrained Project Scheduling Problem. In: MIC 2003: The Fifth Metaheuristics International Conference, pp. 55-1\u201355-6 (2003)"},{"key":"32_CR11","unstructured":"PSPLIB, http:\/\/129.187.106.231\/psplib"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/S0377-2217(99)00151-4","volume":"119","author":"B. Reyck","year":"1999","unstructured":"Reyck, B., Herroelen, W.: The Multi-Mode Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations. European Journal of Operational Research\u00a0119, 538\u2013556 (1999)","journal-title":"European Journal of Operational Research"},{"key":"32_CR13","unstructured":"Talukdar, S., Baerentzen, L., Gove, A., de Souza, P.: Asynchronous Teams: Co-operation Schemes for Autonomous, Computer-Based Agents. Technical Report EDRC 18-59-96. Carnegie Mellon University, Pittsburgh (1996)"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence. Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23938-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T05:52:55Z","timestamp":1560577975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23938-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239373","9783642239380"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23938-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}