{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:09Z","timestamp":1759847349583},"reference-count":29,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1051\/ro:2008010","type":"journal-article","created":{"date-parts":[[2008,5,16]],"date-time":"2008-05-16T10:07:45Z","timestamp":1210932465000},"page":"215-228","source":"Crossref","is-referenced-by-count":6,"title":["New representation to reduce the search space for the resource-constrained project scheduling problem"],"prefix":"10.1051","volume":"42","author":[{"given":"Khaled","family":"Moumene","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques A.","family":"Ferland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"R1","unstructured":"J. Alcaraz and C. Maroto, A Robust Genetic Algorithm for Resource Allocation in Project Scheduling,Ann. Oper. Res.102(2001) 83\u2013109."},{"key":"R2","unstructured":"T. Baar, P. Brucker and S. Knust,Tabu-search algorithms for the resource-constrained project scheduling problem, Metaheuristics : Advances and Trends in Local Search Paradigms for Optimisation, Kluwer (1997) 1\u201318."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"J. Blazewicz, J.K. Lenstra, A.H.G. and Rinnooy Kan, Scheduling projects to resource constraints : Classification and complexity,Disc. Appl. Math.5(1983) 11\u201324.","DOI":"10.1016\/0166-218X(83)90012-4"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"F.F. Boctor, Some effcient multi-heuristic procedures for resource-constrained project scheduling,Eur. J. Oper. Res.49(1990) 3\u201313.","DOI":"10.1016\/0377-2217(90)90116-S"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"F.F. Boctor, Resource-constrained project scheduling by simulated annealing,Int. J. Prod. Res.34(1996) 2335\u20132351.","DOI":"10.1080\/00207549608905028"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"M. Bouleimen, H. Lecocq, A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple version,Eur. J. Oper. Res.149(2003) 268\u2013281.","DOI":"10.1016\/S0377-2217(02)00761-0"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"P. Brucker, A. Drexl, R. Mohring, K. Neumann, Resource-constrained project scheduling : Notation, classification, models and methods,Eur. J. Oper. Res.112(1999) 3\u201341.","DOI":"10.1016\/S0377-2217(98)00204-5"},{"key":"R8","unstructured":"J.-H. Cho, Y.-D. Kim, A simulated annealing algorithm for resource-constrained project scheduling problems,J. Oper. Res. Soc.48(1997) 735\u2013744."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"E.W. Davis, G.E. Heidorn, An algorithm for optimal project scheduling under multiple resource constraints,Manage. Sci.27(1971) B803\u2013B816.","DOI":"10.1287\/mnsc.17.12.B803"},{"key":"R10","unstructured":"E.W. Davis, J.H. Patterson, A comparison of heuristic and optimal solutions in resource-constrained project scheduling,Manage. Sci.21(1975) 944\u2013955."},{"key":"R11","unstructured":"E. Demeulemeester, W. Harroelen, New benchmarking results for the resource constrained project scheduling problem,Manage. Sci.43(1995) 1485\u20131492."},{"key":"R12","unstructured":"E. Demeulemeester, W. Herroelen, A branch-and-bound procedure for multiple resource-constrained project scheduling problem,Manage. Sci.38(1992) 1803\u20131818."},{"key":"R13","unstructured":"S. Hartmann, A competitive genetic algorithm for resource-constrained project scheduling,Nav. Res. Logist.456(1998) 733\u2013750."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"W. Herroelen, B. Reyck, E. Demeulemeester, Resource-constrained project scheduling : A survey of recent developments,Computers and Operations Research4(1998) 279\u2013302.","DOI":"10.1016\/S0305-0548(97)00055-5"},{"key":"R15","unstructured":"R. Klein, Bidirectional planning : improving priority rule-based heuristics for scheduling resource-constrained projects,Eur. J. Oper. Res.127(2000) 619\u2013638."},{"key":"R16","unstructured":"U. Kohlmorgen, H. Schmeck, K. Haase, Experiences with fine-grained parallel genetic algorithms,Ann. Oper. Res.90(1999) 203\u2013219."},{"key":"R17","unstructured":"R. Kolisch, A. Drexel, Adaptative search for solving hard project scheduling problem,Nav. Res. Logist.43(1996) 23\u201340."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"R. Kolisch, Serial and Parallel resource-constrained project scheduling methods revisited: Theory and computation,Eur. J. Oper. Res.90(1996) 320\u2013333.","DOI":"10.1016\/0377-2217(95)00357-6"},{"key":"R19","unstructured":"R. Kolisch, Efficient priority rules for the resource-constrained project scheduling problem,J. Oper. Manage.14(1996) 179\u2013192."},{"key":"R20","unstructured":"R. Kolisch, A. Drexl, Adaptative search for solving hard project scheduling problems,Nav. Res. Logist.43(1996) 23\u201340."},{"key":"R21","doi-asserted-by":"crossref","unstructured":"R. Kolisch, S. Hartmann, Heuristic algorithms for solving resource-constrained project scheduling problem : Classification and computation analysis, in :Project Scheduling : Recent Models, Algorithms and Applications, edited by J. Weglarz, Kluwer Academic Publisher, Boston 1999, 147\u2013178.","DOI":"10.1007\/978-1-4615-5533-9_7"},{"key":"R22","unstructured":"Kolisch R., Sprecher A., Drexel A., Characterization and generation of general class of resource-constrained project scheduling problems,Manage. Sci.41(1995) 1693\u20131703."},{"key":"R23","unstructured":"A. Mingozi, V. Maniezzo, S. Ricciardelli, L. Bianco, An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation,Manage. Sci.44(1998) 714\u2013729."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"J.H. Patterson, R. Sowinski, F.B. Talbot, J. Weglarz, An algorithm for a general class of precedence and resource constrained scheduling problems, in :Advances in project scheduling, edited by R. Sowinski, J. Weglarz, Elsevier, Amsterdam 1989, 3\u201328.","DOI":"10.1016\/B978-0-444-87358-3.50005-5"},{"key":"R25","unstructured":"E. Pinson, C. Prins, F. Rullier, Using tabu search for solving the resource-constrained project scheduling problem, in:Proceedings of the 4th International Workshop on Project Management and Scheduling, Leuven, Belgium 1994, 102\u2013106."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"A. Sprecher, R. Kolisch, A. Drexel, Semi-Active, active and non-delay schedules for resource-constrained project scheduling problem,Eur. J. Oper. Res.80(1995) 94\u2013102.","DOI":"10.1016\/0377-2217(93)E0294-8"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"J.P. Stinson, E.W. Davis, B.M. Khumawala, Multiple resource-constrained scheduling using branch-and-bound,AIIE Transactions10(1978) 252\u2013259.","DOI":"10.1080\/05695557808975212"},{"key":"R28","unstructured":"B. Talbot, J.H. Patterson, An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problem,Manage. Sci.24(1978) 1163\u20131174."},{"key":"R29","unstructured":"A. Thesen, Heuristic scheduling of activities under resource and precedence restrictions,Manage. Sci.23(1976) 412\u2013422."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008010\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T08:28:42Z","timestamp":1557563322000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":29,"journal-issue":{"issue":"2"},"alternative-id":["ro0783"],"URL":"https:\/\/doi.org\/10.1051\/ro:2008010","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}