{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T04:09:37Z","timestamp":1773461377207,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,6,28]],"date-time":"2008-06-28T00:00:00Z","timestamp":1214611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s00500-008-0337-5","type":"journal-article","created":{"date-parts":[[2008,6,27]],"date-time":"2008-06-27T08:31:58Z","timestamp":1214555518000},"page":"597-610","source":"Crossref","is-referenced-by-count":38,"title":["Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem"],"prefix":"10.1007","volume":"13","author":[{"given":"M. D.","family":"Mahdi Mobini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Rabbani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S.","family":"Amalnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Razmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. R.","family":"Rahimi-Vahed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,28]]},"reference":[{"key":"337_CR1","unstructured":"Alcaraz J, Maroto C, Ruiz R (2004) Improving the performance of genetic algorithms for the RCPS problem. In: Proceedings of the ninth international workshop on project management and scheduling, Nancy, pp 40\u201343"},{"key":"337_CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints. Discrete Appl Math 5: 11\u201324","journal-title":"Discrete Appl Math"},{"key":"337_CR3","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/S0377-2217(02)00761-0","volume":"149","author":"K Bouleimen","year":"2003","unstructured":"Bouleimen K, Lecocq H (2003) A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur J Oper Res 149: 268\u2013281","journal-title":"Eur J Oper Res"},{"key":"337_CR4","doi-asserted-by":"crossref","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 (1998) A branch-and-bound algorithm for the resource-constrained project scheduling problem. Eur J Oper Res 107: 272\u2013288","journal-title":"Eur J Oper Res"},{"key":"337_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker P, Drexl A, Mohring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: Notation, classification, models and methods. Eur J Oper Res 112: 3\u201341","journal-title":"Eur J Oper Res"},{"key":"337_CR6","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.ejor.2004.08.020","volume":"169","author":"D Debles","year":"2006","unstructured":"Debles D, Reyck BD, Leus R, Vanhoucke M (2006) A hybrid scatter search\/electromagnetism meta-heuristic for project scheduling. Eur J Oper Res 169: 638\u2013653","journal-title":"Eur J Oper Res"},{"key":"337_CR7","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/S0377-2217(02)00884-6","volume":"155","author":"K Fleszar","year":"2004","unstructured":"Fleszar K, Hindi KS (2004) Solving the resource-constrained project scheduling problem by a variable neighborhood search. Eur J Oper Res 155: 402\u2013413","journal-title":"Eur J Oper Res"},{"key":"337_CR8","doi-asserted-by":"crossref","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 (1998) A competitive genetic algorithm for resource-constrained project scheduling. Naval Res Logistics 45: 733\u201350","journal-title":"Naval Res Logistics"},{"key":"337_CR9","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/nav.10029","volume":"49","author":"S Hartmann","year":"2002","unstructured":"Hartmann S (2002) A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Res Logistics 49: 433\u2013448","journal-title":"Naval Res Logistics"},{"key":"337_CR10","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S Hartmann","year":"2000","unstructured":"Hartmann S, Kolisch R (2000) Experimental evaluation of state-of- the-art heuristics for the resource-constrained project scheduling problem. Eur J Oper Res 127: 394\u2013407","journal-title":"Eur J Oper Res"},{"issue":"4","key":"337_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0305-0548(97)00055-5","volume":"25","author":"W Herroelen","year":"1998","unstructured":"Herroelen W, Demeulemeester E, De Reyck B (1998) Resource constrained project scheduling\u2014a survey of recent developments. Comput Oper Res 25(4): 279\u2013302","journal-title":"Comput Oper Res"},{"key":"337_CR12","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur J Oper Res 90: 320\u201333","journal-title":"Eur J Oper Res"},{"key":"337_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-1-4615-5533-9_7","volume-title":"Project scheduling: recent models, algorithms and applications","author":"R Kolisch","year":"1999","unstructured":"Kolisch R, Hartmann S (1999) Heuristic algorithms for solving the resource-constrained project scheduling problem: classification computational analysis. In: Weglarz J(eds) Project scheduling: recent models, algorithms and applications. Kluwer, Berlin, pp 147\u2013178"},{"key":"337_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174: 23\u201337","journal-title":"Eur J Oper Res"},{"key":"337_CR15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0305-0483(00)00046-3","volume":"29","author":"R Kolisch","year":"2001","unstructured":"Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega 29: 249\u2013272","journal-title":"Omega"},{"key":"337_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch R, Sprecher A (1997) PSPLIB-a project scheduling problem library. Eur J Oper Res 96: 205\u2013216","journal-title":"Eur J Oper Res"},{"key":"337_CR17","unstructured":"Kochetov Y, Stolyar A (2003) Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem. In: Proceedings of the 3rd international workshop of computer science and information technologies, Russia"},{"key":"337_CR18","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/0377-2217(92)90320-9","volume":"56","author":"KY Li","year":"1992","unstructured":"Li KY, Willis RJ (1992) An iterative scheduling technique for resource-constrained project scheduling. Eur J Oper Res 56: 370\u2013379","journal-title":"Eur J Oper Res"},{"key":"337_CR19","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.ejor.2004.08.004","volume":"169","author":"R Marti","year":"2006","unstructured":"Marti R, Laguna M, Glover F (2006) Principles of scatter search. Eur J Oper Res 169: 359\u2013372","journal-title":"Eur J Oper Res"},{"key":"337_CR20","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/978-1-4615-1507-4_25","volume-title":"Essays and surveys in metaheuristics","author":"K Nonobe","year":"2002","unstructured":"Nonobe K, Ibaraki T (2002) Formulation and tabu search algorithm for the resource constrained project scheduling problem. In: Ribeiro CC, Hansen P(eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 557\u2013588"},{"key":"337_CR21","doi-asserted-by":"crossref","unstructured":"Palmer C, Kershenbaum A (1994) Representing trees in genetic algorithms. In: Proceedings of the first IEEE international conference on evolutionary computation, New York, pp 376\u2013384","DOI":"10.1109\/ICEC.1994.349921"},{"key":"337_CR22","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/B:ANOR.0000039521.26237.62","volume":"131","author":"M Palpant","year":"2004","unstructured":"Palpant M, Artigues C, Michelon P (2004) LSSPER: solving the resource-constrained project scheduling problem with large neighborhood search. Ann Oper Res 131: 237\u2013257","journal-title":"Ann Oper Res"},{"key":"337_CR23","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/S0305-0548(00)00048-4","volume":"28","author":"M Reza Zamani","year":"2001","unstructured":"Reza Zamani M (2001) A high-performance exact method for the resource-constrained project scheduling problem. Comput Oper Res 28: 1387\u20131401","journal-title":"Comput Oper Res"},{"key":"337_CR24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/A:1010997814183","volume":"102","author":"P Tormos","year":"2001","unstructured":"Tormos P, Lova A (2001) A competitive heuristic solution technique for resource-constrained project scheduling. Ann Oper Res 102: 65\u201381","journal-title":"Ann Oper Res"},{"key":"337_CR25","unstructured":"Tormos P, Lova A (2003) Integrating heuristics for resource constrained project scheduling: one step forward. Technical report, Department of Statistics and Operations Research, Universidad Politecnica de Valencia"},{"key":"337_CR26","unstructured":"Valls V, Ballestin F, Quintanilla MS (2003) A hybrid genetic algorithm for the RCPSP. Technical report, Department of Statistics and Operations Research, University of Valencia"},{"key":"337_CR27","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.ejor.2004.04.008","volume":"165","author":"V Valls","year":"2005","unstructured":"Valls V, Ballestin F, Quintanilla MS (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165: 375\u2013386","journal-title":"Eur J Oper Res"},{"key":"337_CR28","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/B:ANOR.0000039524.09792.c9","volume":"131","author":"V Valls","year":"2004","unstructured":"Valls V, Ballestin F, Quintanilla MS (2004) A population based approach to the resource-constrained project scheduling problem. Ann Oper Res 131: 305\u2013324","journal-title":"Ann Oper Res"},{"key":"337_CR29","doi-asserted-by":"crossref","first-page":"3159","DOI":"10.1080\/00207540110056919","volume":"39","author":"M Vanhoucke","year":"2001","unstructured":"Vanhoucke M, Demeulemeester E, Herroelen W (2001) Scheduling projects with linear time dependent cash flows to maximize the net present value. Int J Prod Res 39: 3159\u20133181","journal-title":"Int J Prod Res"},{"key":"337_CR30","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.ejor.2004.08.019","volume":"169","author":"DS Yamashita","year":"2006","unstructured":"Yamashita DS, Armentano VA, Laguna M (2006) Scatter search for project scheduling with resource availability cost. Eur J Oper Res 169: 623\u2013637","journal-title":"Eur J Oper Res"},{"key":"337_CR31","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ijproman.2005.06.006","volume":"24","author":"H Zhang","year":"2006","unstructured":"Zhang H, Li H, Tam CM (2006) Particle swarm optimization for resource-constrained project scheduling. Int J Project Manage 24: 83\u201392","journal-title":"Int J Project Manage"},{"key":"337_CR32","unstructured":"Zhu D, Padman R (1996) A tabu search approach for scheduling resource-constrained projects with cash flows, Working Paper 96-30, Carnegie-Mellon University"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0337-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-008-0337-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0337-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:39:54Z","timestamp":1559093994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-008-0337-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,28]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["337"],"URL":"https:\/\/doi.org\/10.1007\/s00500-008-0337-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,28]]}}}