{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:34:23Z","timestamp":1774370063732,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030333935","type":"print"},{"value":"9783030333942","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-33394-2_4","type":"book-chapter","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T13:16:49Z","timestamp":1572441409000},"page":"39-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6843-8971","authenticated-orcid":false,"given":"Evgenii N.","family":"Goncharov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,27]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J. Blazewicz","year":"1983","unstructured":"Bla\u017cewicz, J., Lenstra, J.K., Rinnoy Kan, A.H.G.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1), 11\u201324 (1983)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","volume":"107","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Knust, S., Schoo, A., Thiele, O.: A branch and bound algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 107, 272\u2013288 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., et al.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3\u201341 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/j.ejor.2004.08.020","volume":"169","author":"D Debels","year":"2006","unstructured":"Debels, D., De Reyck Leus, B.R., Vanhoucke, M.: A hybrid scatter search electromagnetism meta-heuristic for project scheduling. Eur. J. Oper. Res. 169, 638\u2013653 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/opre.1060.0358","volume":"55","author":"D Debels","year":"2007","unstructured":"Debels, D., Vanhoucke, M.: Decomposition-based genetic algorithm for the resource-consrtained project scheduling problem. Oper. Res. 55, 457\u2013469 (2007)","journal-title":"Oper. Res."},{"key":"4_CR6","unstructured":"Gagnon, M., Boctor, F.F., d\u2019Avignon, G.: A Tabu Search Algorithm for the Resource-constrained Project Scheduling Problem. ASAC (2004)"},{"key":"4_CR7","unstructured":"Gimadi, E.Kh.: On some mathematical models and methods for planning large-scale projects. models and optimization methods. In: Proceedings AN USSR Sib. Branch, Math. Inst., Novosibirsk. Nauka, vol. 10, pp. 89\u2013115 (1988)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.2298\/YJOR171115025G","volume":"29","author":"E.Kh. Gimadi","year":"2019","unstructured":"Gimadi, E.Kh., Goncharov, E.N., Mishin, D.V.: On some implementations of solving the resource-constrained project scheduling problem. Yugoslav J. Oper. Res. 29(1), 31\u201342 (2019)","journal-title":"Yugoslav Journal of Operations Research"},{"key":"4_CR9","unstructured":"Gimadi, E.Kh., Zalyubovskii, V.V., Sevast\u2019yanov, S.V.: Polynomial solvability of scheduling problems with storable resources and deadlines. Diskretnyi Analiz i Issledovanie Operazii, Ser. 2 7(1), 9\u201334 (2000)"},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10732-010-9142-2","volume":"17","author":"J Goncalves","year":"2011","unstructured":"Goncalves, J., Resende, M.G.C., Mendes, J.: A biased random key genetic algorithm with forward-backward improvement for resource-constrained project scheduling problem. J. Heuristics 17, 467\u2013486 (2011)","journal-title":"J. Heuristics"},{"issue":"6","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1134\/S0005117917060108","volume":"78","author":"EN Goncharov","year":"2017","unstructured":"Goncharov, E.N., Leonov, V.V.: Genetic algorithm for the resource-constrained project scheduling problem. Autom. Remote Control 78(6), 1101\u20131114 (2017)","journal-title":"Autom. Remote Control"},{"issue":"3","key":"4_CR13","first-page":"10","volume":"21","author":"EN Goncharov","year":"2014","unstructured":"Goncharov, E.N.: Stochastic greedy algorithm for the resource-constrained project scheduling problem. Diskret. Anal. Issled. Oper. 21(3), 10\u201323 (2014)","journal-title":"Diskret. Anal. Issled. Oper."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-1-4615-1507-4_19","volume-title":"Essays and Surveys of Metaheuristics","author":"P Hansen","year":"2002","unstructured":"Hansen, P., Mladenovic, N.: Developments of variable neighborhood search. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys of Metaheuristics, pp. 415\u2013440. Kluwer Academic Publishers, Boston (2002)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann, S., Briskorn, D.: A survey of variants and extentions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 207, 1\u201314 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C","volume":"45","author":"S Hartmann","year":"1998","unstructured":"Hartmann, S.: A competitive genetic algorithm for the resource-constrained project scheduling. Naval Res. Logistics. 45, 733\u2013750 (1998)","journal-title":"Naval Res. Logistics."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/nav.10029","volume":"49","author":"S Hartmann","year":"2002","unstructured":"Hartmann, S.: A self-adaptive genetic algorithm for project scheduling under resource constraints. Naval Res. Logistics. 49, 433\u2013448 (2002)","journal-title":"Naval Res. Logistics."},{"issue":"4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0305-0548(97)00055-5","volume":"25","author":"W Herroelen","year":"1998","unstructured":"Herroelen, W., De Reyck, B., Demeulemeester, E.: Resource-constrained project scheduling: a survey of recent developments. Comput. Oper. Res. 25(4), 279\u2013302 (1998)","journal-title":"Comput. Oper. Res."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Herroelen, W., Demeulemeester, E., De Reyck, B.: A classification scheme for project scheduling. In: Weglarz, J. (Ed.) Project Scheduling-Recent Models, Algorithms and Applications, International Series in Operations Research and Management Science, vol. 14(1), pp. 77\u2013106. Kluwer Academic Publishers, Dordrecht (1998)","DOI":"10.1007\/978-1-4615-5533-9_1"},{"key":"4_CR20","unstructured":"Kochetov, Yu., Stolyar, A.: Evolutionary local search with variable neighborhood for the resource-constrained project scheduling problem. In: Proceedings of 3rd International Workshop of Computer Science and Information Technologies. Russia, pp. 96\u201399 (2003)"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0305-0483(00)00046-3","volume":"49","author":"R Kolisch","year":"2001","unstructured":"Kolisch, R., Padman, R.: An integrated survey of deterministic project scheduling. Omega 49(3), 249\u2013272 (2001)","journal-title":"Omega"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur. J. Oper. Res. 174, 23\u201337 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Kolisch, R., Hartmann, S.: Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In: Weglarz, J. (ed.) Project Scheduling: Recent Models, Algorithms and Applications, pp. 147\u2013178. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4615-5533-9_7"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R Kolisch","year":"1995","unstructured":"Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Manage. Sci. 41, 1693\u20131703 (1995)","journal-title":"Manage. Sci."},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"Rainer Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB - a project scheduling problem library. Eur. J. Oper. Res. 96, 205\u2013216 (1996). \n                    http:\/\/www.om-db.wi.tum.de\/psplib\/","journal-title":"European Journal of Operational Research"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.cor.2007.07.001","volume":"36","author":"JJM Mendes","year":"2009","unstructured":"Mendes, J.J.M., Goncalves, J.F., Resende, M.G.C.: A random key based genetic algorithm for the resource constrained project scheduling problem. Comput. Oper. Res. 36, 92\u2013109 (2009)","journal-title":"Comput. Oper. Res."},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A Mingozzi","year":"1998","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manage. Sci. 44, 715\u2013729 (1998)","journal-title":"Manage. Sci."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Mobini, M.D.M., Rabbani, M., Amalnik, M.S., et al.: Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem. Soft Comput. 13, 597\u2013610 (2009)","DOI":"10.1007\/s00500-008-0337-5"},{"issue":"1-4","key":"4_CR29","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/B:ANOR.0000039521.26237.62","volume":"131","author":"Mireille Palpant","year":"2004","unstructured":"Palpant, M., Artigues, C., Michelon, P.: LSSPER: solving the resource-constrained project scheduling problem with large neighborhood search. Ann. Oper. Res. 131, 237\u2013257 (2004)","journal-title":"Annals of Operations Research"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/nav.20439","volume":"58","author":"S Proon","year":"2011","unstructured":"Proon, S., Jin, M.: A genetic algorithm with neighborhood search for the resource-consrtained project scheduling problem. Naval Res. Logist. 58, 73\u201382 (2011)","journal-title":"Naval Res. Logist."},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1287\/mnsc.46.5.710.12044","volume":"46","author":"A Sprecher","year":"2000","unstructured":"Sprecher, A.: Scheduling resource-constrained projects competitively at modest resource requirements. Manage. Sci. 46, 710\u2013723 (2000)","journal-title":"Manage. Sci."},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/A:1010997814183","volume":"102","author":"P Tormos","year":"2001","unstructured":"Tormos, P., Lova, A.: A competitive heuristic solution techniques for resource-consrtained project scheduling. Ann. Oper. Res. 102, 65\u201381 (2001)","journal-title":"Ann. Oper. Res."},{"key":"4_CR33","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.ejor.2004.04.008","volume":"165","author":"V Valls","year":"2005","unstructured":"Valls, V., Ballestin, F., Quintanilla, M.S.: Justification and RCPSP: a technique that pays. Eur. J. Oper. Res. 165, 375\u2013386 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"4_CR34","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.ejor.2006.12.033","volume":"185","author":"V Valls","year":"2008","unstructured":"Valls, V., Ballestin, F., Quintanilla, S.: A hybrid genetic algorithm for the resource-consrtained project scheduling problem. Eur. J. Oper. Res. 185(2), 495\u2013508 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/B:ANOR.0000039524.09792.c9","volume":"131","author":"V Valls","year":"2004","unstructured":"Valls, V., Ballestin, F., Quintanilla, S.: A population-based approach to the resource-constrained project scheduling problem. Ann. Oper. Res. 131, 305\u2013324 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"4_CR36","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.ins.2009.11.044","volume":"180","author":"Wang Chen","year":"2010","unstructured":"Chen, W., Shi, Y.J., Teng, H.F., et al.: An efficient hybrid algorithm for resource-constrained project scheduling. Inf. Sci. 180(6), 1031\u20131039 (2010)","journal-title":"Information Sciences"},{"key":"4_CR37","unstructured":"Weglarz, J.: Project Scheduling. Recent Models, Algorithms and Applications. Kluwer Academic Publishers, Boston (1999)"}],"container-title":["Communications in Computer and Information Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33394-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T13:20:48Z","timestamp":1572441648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33394-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030333935","9783030333942"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33394-2_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"27 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/motor2019.uran.ru","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.34","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.64","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}