{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:41:12Z","timestamp":1759848072984},"reference-count":41,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1051\/ro\/2012006","type":"journal-article","created":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T07:38:35Z","timestamp":1337067515000},"page":"23-39","source":"Crossref","is-referenced-by-count":5,"title":["A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem"],"prefix":"10.1051","volume":"46","author":[{"given":"Reza","family":"Zamani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2012,5,15]]},"reference":[{"key":"R1","unstructured":"D.D. Bedworth and J.E. Bailey,Integrated production control systems-management, analysis, design. Wiley, New York (1982)."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Bouleimen K. and Lecocq H., A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.Eur. J. Oper. Res.149(2003) 268\u2013281.","DOI":"10.1016\/S0377-2217(02)00761-0"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Brucker P. et al., A branch and bound algorithm for the resource-constrained project scheduling problem.Eur. J. Oper. Res.107(1998) 272\u2013288.","DOI":"10.1016\/S0377-2217(97)00335-4"},{"key":"R4","unstructured":"Charon I. and Hudry O., The noising method : a new method for combinatorial optimization.Oper. Res. Lett.14(1993) 133\u2013137."},{"key":"R5","unstructured":"Chen R.-M. and Lo S.-T., Using an enhanced ant colony system to solve resource-constrained project scheduling problem.Int. J. Comput. Sci. Netw. Secur.6(2006) 75\u201384."},{"key":"R6","unstructured":"Cho J.H. and Kim Y.D., A simulated annealing algorithm for resource constrained project scheduling problems.Oper. Res. Soc.48(1997) 736\u2013744."},{"key":"R7","unstructured":"Chr\u00e9tienne P. and Sourd F., PERT scheduling with convex cost functions.Theor. Comput. Sci.292(2003) 145\u2013164."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"De Reyck B. and Herroelen W., A branch-and-bound procedure for the resource-constrained project scheduling problem with generalised precedence relations.Eur. J. Oper. Res.111(1998) 152\u2013174.","DOI":"10.1016\/S0377-2217(97)00305-6"},{"key":"R9","unstructured":"Demeulemeester E. and Herroelen W., A branch-and-bound procedure for multiple resource-constrained project scheduling problem.Manage. Sci.38(1992) 1803\u20131818."},{"key":"R10","unstructured":"Demeulemeester E. and Herroelen W., A new benchmark results for the resource-constrained project scheduling problem.Manage. Sci.43(1997) 1485\u20131492."},{"key":"R11","unstructured":"Dorndorf U., Pesch E. and Phan-Huy T., A branch-and-bound algorithm for the resource-constrained project scheduling problem.Math. Methods Oper. Res.52(2000) 413\u2013439."},{"key":"R12","unstructured":"Hartmann S., A competitive genetic algorithm for resource-constrained project scheduling.Nav. Res. Logist.45(1998) 733\u2013750."},{"key":"R13","unstructured":"Hartmann S., A self-adapting genetic algorithm for project scheduling under resource constraints.Nav. Res. Logist.49(2002) 433\u2013448."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Hartmann S. and Kolisch R., Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem.Eur. J. Oper. Res.127(2000) 394\u2013407.","DOI":"10.1016\/S0377-2217(99)00485-3"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Herroelen W., De Reyck B. and Demeulemeester E., Resource-constrained project scheduling : A survey of recent developments.Comput. Oper. Res.25(1998) 279\u2013302.","DOI":"10.1016\/S0305-0548(97)00055-5"},{"key":"R16","first-page":"480","volume":"4431","author":"Jedrzejowicz","year":"2007","journal-title":"Springer LNCS"},{"key":"R17","unstructured":"J. Kelley,The critical-path method : resource planning and scheduling, inIndustrial scheduling, edited by J.F. Muth and G.L. Thompson. Prentice-Hall, New Jersey (1963) 347\u2013365."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"R. Kolisch,Project scheduling under resource constraints \u2013 efficient heuristics for several problem classes. Heidelberg Physica (1995).","DOI":"10.1007\/978-3-642-50296-5"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Kolisch R., Serial and parallel resource-constrained project scheduling methods revisited : Theory and computation.Eur. J. Oper. Res90(1996) 320\u2013333.","DOI":"10.1016\/0377-2217(95)00357-6"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"Kolisch R., Efficient priority rules for the resource-constrained project scheduling problem.J. Oper. Manage.14(1996) 179\u2013192.","DOI":"10.1016\/0272-6963(95)00032-1"},{"key":"R21","unstructured":"Kolisch R. and Drexl A., Adaptive search for solving hard project scheduling problems.Nav. Res. Logist.43(1996) 23\u201340."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"Kolisch R. and Hartmann S., Experimental investigation of heuristics for resource-constrained project scheduling : An update.Eur. J. Oper. Res.174(2006) 23\u201337.","DOI":"10.1016\/j.ejor.2005.01.065"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"Kolisch R. and Sprecher A., PSPLIB \u2013 A project scheduling library.Eur. J. Oper. Res.96(1996) 205\u2013216.","DOI":"10.1016\/S0377-2217(96)00170-1"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"Li K., and Willis R., An iterative scheduling technique for resource-constrained project. scheduling.Eur. J. Oper. Res.56(1992) 370\u2013379.","DOI":"10.1016\/0377-2217(92)90320-9"},{"key":"R25","unstructured":"Mendes J.J.M., Goncalves J.F. and Resende M.G.C., A random key based genetic algorithm for the resource constrained project scheduling problem.Comput. Oper. Res.36(2009) 92\u2013109."},{"key":"R26","unstructured":"Mingozzi A., et al., An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation.Manage. Sci.44(1998) 714\u2013729."},{"key":"R27","unstructured":"M\u00f6hring R.H. et al. Solving project scheduling problems by minimum cut computations.Manage. Sci.49(2003) 330\u2013350."},{"key":"R28","doi-asserted-by":"crossref","unstructured":"Mori M. and Tseng C., A genetic algorithm for multi-mode resource constrained project scheduling problem.Eur. J. Oper. Res.100(1997) 134\u2013141.","DOI":"10.1016\/S0377-2217(96)00180-4"},{"key":"R29","unstructured":"Nazareth T. et al., The multiple resource constrained project scheduling problem : A breadth-first approach.Eur. J. Oper. Res.112(1999) 347\u2013366."},{"key":"R30","unstructured":"Orlin J. et al., Very large scale neighborhood search.Int. Trans. Oper. Res.7(2000) 301\u2013317."},{"key":"R31","unstructured":"\u00d6zdamar L. and Ulusoy G., A survey on the resource-constrained project scheduling problem.IIE Trans.27(1995) 574\u2013586."},{"key":"R32","unstructured":"Palpant M., Artigues C. and Michelon P., LSSPER : Solving the resource-constrained project scheduling problem with large neighbourhood search.Ann. Oper. Res.131(2004) 237\u2013257."},{"key":"R33","doi-asserted-by":"crossref","unstructured":"Panagiotakopoulos D., A CPM time-cost computational algorithm for arbitrary activity cost functions.INFOR15(1977) 183\u2013195.","DOI":"10.1080\/03155986.1977.11731665"},{"key":"R34","unstructured":"Sprecher A., Scheduling resource-constrained projects competitively at modest memory requirement.Manage. Sci.46(2000) 710\u2013723."},{"key":"R35","unstructured":"Tormos P. and Lova A., A competitive heuristic solution technique for resource-constrained project scheduling.Ann. Oper. Res.102(2001) 65\u201381."},{"key":"R36","doi-asserted-by":"crossref","unstructured":"Tseng L.-Y. and Chen S.-C., A hybrid metaheuristic for the resource-constrained project scheduling problem.Eur. J. Oper. Res.175(2006) 707\u2013721.","DOI":"10.1016\/j.ejor.2005.06.014"},{"key":"R37","unstructured":"Valls V., Ballestin F., and Quintanilla S., A population-based approach to the resource-constrained project scheduling problem.Ann. Oper. Res.131(2004) 305\u2013324."},{"key":"R38","doi-asserted-by":"crossref","unstructured":"Valls V., Ballestin F. and Quintanilla S., Justification and RCPSP : A technique that pays.Eur. Oper. Res.165(2005) 375\u2013386.","DOI":"10.1016\/j.ejor.2004.04.008"},{"key":"R39","unstructured":"Zamani R., An effective near-optimal state-space search method : an application to a scheduling problem.Artif. Intell. Rev.22(2004) 41\u201369."},{"key":"R40","unstructured":"Zamani R., An accelerating two-layer anchor search with application to the resource-constrained project scheduling problem.IEEE Trans. Evol. Comput.14(2010) 975\u2013984."},{"key":"R41","unstructured":"Zamani R. and Lau S.K., Embedding learning capability in lagrangean relaxation : An application to the travelling salesman problem.Eur. J. Oper. Res.201(2010) 82\u201388."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2012006\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T15:03:42Z","timestamp":1561734222000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2012006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":41,"journal-issue":{"issue":"1"},"alternative-id":["ro120006"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2012006","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}