{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T08:53:35Z","timestamp":1778662415531,"version":"3.51.4"},"reference-count":38,"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)00765-8","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"325-343","source":"Crossref","is-referenced-by-count":11,"title":["Order-based neighborhoods for project scheduling with nonregular objective functions"],"prefix":"10.1016","volume":"149","author":[{"given":"K.","family":"Neumann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Schwindt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00765-8_BIB1","series-title":"Local Search in Combinatorial Optimization","author":"Aarts","year":"1997"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB2","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB3","series-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","first-page":"1","article-title":"Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem","author":"Baar","year":"1998"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB4","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0377-2217(94)90380-8","article-title":"Optimal resource leveling using non-serial dynamic programming","volume":"78","author":"Bandelloni","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","article-title":"Scheduling project networks with resource constraints and time windows","volume":"16","author":"Bartusch","year":"1988","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB6","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, University of Li\u00e8ge"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB7","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)00765-8_BIB8","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 the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB9","doi-asserted-by":"crossref","first-page":"1590","DOI":"10.1287\/mnsc.41.10.1590","article-title":"Minimizing resource availability costs in time-limited project networks","volume":"41","author":"Demeulemeester","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0305-0548(97)00043-9","article-title":"An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations","volume":"25","author":"De Reyck","year":"1998","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB11","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1061\/(ASCE)0733-9364(1989)115:2(302)","article-title":"Resource leveling in construction by optimization","volume":"115","author":"Easa","year":"1989","journal-title":"Journal of Construction Engineering and Management"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/PL00013356","article-title":"Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling","volume":"23","author":"Franck","year":"2001","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0377-2217(96)00112-9","article-title":"Project network models with discounted cash flows: a guided tour through recent developments","volume":"100","author":"Herroelen","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB14","series-title":"Project Scheduling: Recent Models, Algorithms and Applications","first-page":"1","article-title":"A classification scheme for project scheduling","author":"Herroelen","year":"1999"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB15","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/0305-0548(94)90014-0","article-title":"A tabu search procedure for the resource-constrained project scheduling problem with discounted cash flows","volume":"21","author":"Icmeli","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB16","doi-asserted-by":"crossref","first-page":"1395","DOI":"10.1287\/mnsc.42.10.1395","article-title":"A branch and bound procedure for the resource-constrained project scheduling problem with discounted cash flows","volume":"42","author":"Icmeli","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB17","series-title":"Project Scheduling: Recent Models, Algorithms and Applications","first-page":"147","article-title":"Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis","author":"Kolisch","year":"1999"},{"key":"10.1016\/S0377-2217(02)00765-8_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)00765-8_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)00765-8_BIB20","series-title":"Projektplanung bei beschr\u00e4nkten Ressourcen: Effiziente L\u00f6sungsverfahren zur Kapitalwertmaximierung","author":"Mayer","year":"1998"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB21","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)00765-8_BIB22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01545589","article-title":"Activity-on-node networks with minimal and maximal time-lags and their application to make-to-order production","volume":"19","author":"Neumann","year":"1997","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB23","series-title":"Project Scheduling: Recent Models, Algorithms and Applications","first-page":"261","article-title":"Heuristic methods for resource-constrained project scheduling with regular and nonregular objective functions and schedule-dependent time windows","author":"Neumann","year":"1999"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB24","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/S0377-2217(98)00272-0","article-title":"Resource levelling for projects with schedule-dependent time windows","volume":"117","author":"Neumann","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB25","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/S0377-2217(99)00498-1","article-title":"Procedures for resource levelling and net present value problems in project scheduling with general temporal and resource constraints","volume":"127","author":"Neumann","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB26","unstructured":"Neumann, K., Zimmermann, J., 2003. Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints. Central European Journal of Operations Research, to appear"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB27","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s001860000092","article-title":"Active and stable project scheduling","volume":"52","author":"Neumann","year":"2000","journal-title":"Mathematical Methods of Operations Research"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB28","doi-asserted-by":"crossref","unstructured":"Neumann, K., Schwindt, C., Zimmermann, J., 2002. Project Scheduling with Time Windows and Scarce Resources. Lecture Notes in Economics and Mathematical Systems, vol. 508. Springer, Berlin","DOI":"10.1007\/978-3-662-22341-3"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB29","unstructured":"N\u00fcbel, H., 1999. A branch-and-bound procedure for the resource investment problem subject to temporal constraints. Technical Report WIOR\u2013574, University of Karl-sruhe"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB30","unstructured":"Pinson, E., Prins, C., Rullier, F., 1994. Using tabu search for solving the resource-constrained project scheduling problem. In: Proceedings of the Fourth International Workshop on Project Management and Scheduling, Leuven, pp. 102\u2013106"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB31","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1287\/mnsc.16.5.357","article-title":"Cash flows in networks","volume":"16","author":"Russell","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB32","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1002\/1520-6750(199308)40:5<665::AID-NAV3220400509>3.0.CO;2-J","article-title":"Local search techniques for the generalized resource constrained project scheduling problem","volume":"40","author":"Sampson","year":"1993","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB33","series-title":"Operations Research Proceedings 1999","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/978-3-642-58300-1_62","article-title":"Minimizing earliness\u2013tardiness costs of resource-constrained projects","author":"Schwindt","year":"2000"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB34","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s001860100129","article-title":"A steepest ascent approach to maximizing the net present value of projects","volume":"53","author":"Schwindt","year":"2001","journal-title":"Mathematical Methods of Operations Research"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB35","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0377-2217(94)00039-F","article-title":"A comparison of stochastic scheduling rules for maximizing project net present value","volume":"85","author":"Yang","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB36","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1002\/(SICI)1520-6750(199912)46:8<912::AID-NAV3>3.0.CO;2-C","article-title":"A metaheuristic scheduling procedure for resource-constrained projects with cash flows","volume":"46","author":"Zhu","year":"1999","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB37","series-title":"Operations Research Proceedings 1999","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/978-3-642-58300-1_65","article-title":"Project scheduling with discounted cash flows and general temporal constraints","author":"Zimmermann","year":"2000"},{"key":"10.1016\/S0377-2217(02)00765-8_BIB38","series-title":"Ablauforientiertes Projektmanagement: Modelle, Verfahren und Anwendungen","author":"Zimmermann","year":"2001"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007658?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007658?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:30:15Z","timestamp":1553913015000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0377221702007658"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00765-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}