{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:41:29Z","timestamp":1771026089167,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0377-2217(02)00768-3","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"282-301","source":"Crossref","is-referenced-by-count":84,"title":["Resource-constrained project scheduling: A critical activity reordering heuristic"],"prefix":"10.1016","volume":"149","author":[{"given":"Vicente","family":"Valls","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sacramento","family":"Quintanilla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Ballest\u0131\u0301n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00768-3_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling subject to resource constraints: Classification and complexity","volume":"5","author":"Blazewicz","year":"1983","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"10.1016\/S0377-2217(02)00768-3_BIB2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","article-title":"Genetic algorithms and random keys for sequencing and optimization","volume":"6","author":"Bean","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB3","unstructured":"Bouleimen, K., Lecocq, H., 1998. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem, Technical Report, Service de Robotique et Automatisation, Universit\u00e9 de Li\u00e8ge"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","article-title":"Resource-constrained project scheduling: Notation, classification, models, and methods","volume":"112","author":"Brucker","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB5","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","article-title":"A branch & bound algorithm for the resource-constrained project scheduling problem","volume":"107","author":"Brucker","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB6","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1057\/palgrave.jors.2600416","article-title":"A simulated annealing algorithm for resource constrained project scheduling problems","volume":"48","author":"Cho","year":"1997","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB7","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","article-title":"A branch-and-bound procedure for the multiple resource-constrained project scheduling problem","volume":"38","author":"Demeulemeester","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB8","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB9","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C","article-title":"A competitive genetic algorithm for resource-constrained project scheduling","volume":"45","author":"Hartmann","year":"1998","journal-title":"Naval Research Logistics"},{"issue":"2","key":"10.1016\/S0377-2217(02)00768-3_BIB10","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","article-title":"Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem","volume":"127","author":"Hartmann","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0377-2217(02)00768-3_BIB11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0305-0548(97)00055-5","article-title":"Resource-constrained project scheduling: A survey of recent developments","volume":"25","author":"Herroelen","year":"1998","journal-title":"Computers and Operations Research"},{"issue":"11","key":"10.1016\/S0377-2217(02)00768-3_BIB12","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1108\/01443579310046454","article-title":"Project scheduling problems: A survey","volume":"13","author":"Icmeli","year":"1993","journal-title":"International Journal of Operations & Production Management"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB13","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","article-title":"Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling","volume":"112","author":"Klein","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB14","series-title":"Project Scheduling. Recent Models, Algorithms and Applications","first-page":"147","article-title":"Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis","author":"Kolisch","year":"1999"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB15","unstructured":"Kolisch, R., Padman, R., 1997. An integrated survey of project scheduling, Technical report 463, Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","article-title":"PSPLIB\u2013\u2013A project scheduling library","volume":"96","author":"Kolish","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"10.1016\/S0377-2217(02)00768-3_BIB17","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","article-title":"Characterization and generation of a general class of resource-constrained project scheduling problems","volume":"41","author":"Kolish","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB18","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1057\/jors.1996.79","article-title":"Search heuristics for resource constrained project scheduling","volume":"47","author":"Lee","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01719262","article-title":"Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling","volume":"17","author":"Leon","year":"1995","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB20","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/0377-2217(92)90320-9","article-title":"An iterative scheduling technique for resource-constrained project scheduling","volume":"56","author":"Li","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB21","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","article-title":"An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation","volume":"44","author":"Mingozzi","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/A:1018982423325","article-title":"Problem space search algorithms for resource-constrained project scheduling","volume":"70","author":"Naphade","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB23","unstructured":"Nonobe, K., Ibaraki, T., 1999. Formulation and Tabu search algorithm for the resource constrained project scheduling problem (RCPSP), Technical report 99010"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB24","first-page":"574","article-title":"A survey on the resource-constrained project scheduling problem","volume":"27","author":"\u00d6zdamar","year":"1995","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB25","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0272-6963(95)00015-1","article-title":"An iterative local constraint based analysis for solving the resource constrained project scheduling problem","volume":"14","author":"\u00d6zdamar","year":"1996","journal-title":"Journal of Operations Management"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB26","unstructured":"Sprecher, A., 1996. Solving the RCPSP efficiently at modest memory requirements, Technical report 425, Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB27","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0377-2217(93)E0294-8","article-title":"Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem","volume":"80","author":"Sprecher","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB28","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New search paces for sequencing problems with application to job shop scheduling","volume":"38","author":"Storer","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00768-3_BIB29","series-title":"Project Scheduling. Recent Models, Algorithms and Applications","first-page":"333","article-title":"Project Scheduling with Stochastic Activity Interruptions","author":"Valls","year":"1999"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007683?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007683?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T03:58:53Z","timestamp":1553918333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0377221702007683"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00768-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}