{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:24:57Z","timestamp":1759847097844},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,9,2]],"date-time":"2009-09-02T00:00:00Z","timestamp":1251849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10951-009-0125-9","type":"journal-article","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T11:48:09Z","timestamp":1251805689000},"page":"391-406","source":"Crossref","is-referenced-by-count":18,"title":["An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags"],"prefix":"10.1007","volume":"14","author":[{"given":"Francisco","family":"Ballest\u00edn","sequence":"first","affiliation":[]},{"given":"Agust\u00edn","family":"Barrios","sequence":"additional","affiliation":[]},{"given":"Vicente","family":"Valls","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,2]]},"reference":[{"key":"125_CR1","unstructured":"Ballest\u00edn, F. (2002). Nuevos m\u00e9todos de resoluci\u00f3n del problema de secuenciaci\u00f3n de proyectos con recursos limitados. Unpublished PhD Dissertation, Universidad de Valencia."},{"key":"125_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"Bartusch, M., M\u00f6hring, R. H., & Radermacher, F. J. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16, 201\u2013240. doi: 10.1007\/sBF02283745 .","journal-title":"Annals of Operations Research"},{"issue":"1","key":"125_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A. Cesta","year":"2002","unstructured":"Cesta, A., Oddi, A., & Smith, S. (2002). A constraint based method for project scheduling with time windows. Journal of Heuristics, 8(1), 109\u2013136. doi: 10.1023\/A:1013617802515 .","journal-title":"Journal of Heuristics"},{"key":"125_CR4","unstructured":"Cicirello, V. A. (2003). Boosting stochastic problem solvers through online self-analysis of performance. PhD thesis, The Robotics Institute, School of Computer Science, Carnegie Mellon University, Pittsburgh. Also available as a technical report CMU-RI-TR-03-27."},{"key":"125_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-30201-8_17","volume-title":"Modeling solution quality by extreme value","author":"V. A. Cicirello","year":"2004","unstructured":"Cicirello, V. A., & Smith, S. (2004). Heuristic selection for stochastic search optimization. In Lecture notes in computer science. Modeling solution quality by extreme value (Vol. 23, pp. 197\u2013211). Berlin: Springer."},{"key":"125_CR6","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/S0377-2217(97)00305-6","volume":"111","author":"B. Reyck De","year":"1998","unstructured":"De Reyck, B., & Herroelen, W. (1998). A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence constraints. European Operational Research, 111, 152\u2013174. doi: 10.1016\/S0377-2217(97)00305-6 .","journal-title":"European Operational Research"},{"key":"125_CR7","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1287\/mnsc.46.10.1365.12272","volume":"46","author":"U. Dorndorf","year":"2000","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (2000). A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints. Management Science, 46, 1365\u20131384. doi: 10.1287\/mnsc.46.10.1365.12272 .","journal-title":"Management Science"},{"key":"125_CR8","doi-asserted-by":"crossref","first-page":"1590","DOI":"10.1287\/mnsc.37.12.1590","volume":"37","author":"A. Drexl","year":"1991","unstructured":"Drexl, A. (1991). Scheduling of project networks by job assignment. Management Science, 37, 1590\u20131602. doi: 10.1287\/mnsc.37.12.1590 .","journal-title":"Management Science"},{"key":"125_CR9","unstructured":"Fest, A., M\u00f6hring, R. H., Stork, F., & Uetz, M. (1998). Resource-constrained project scheduling with time windows: a branching scheme based on dynamic release dates. Technical report 596, TU Berlin, Germany."},{"key":"125_CR10","unstructured":"Franck, B., & Neumann, K. (1998). Resource constrained project scheduling problems with time windows\u2014structural questions and priority-rule methods. Technical report WIOR 492, Universit\u00e4t Karlsruhe."},{"key":"125_CR11","first-page":"297","volume-title":"OR Specktrum","author":"B. Franck","year":"2001","unstructured":"Franck, B., Neumann, K., & Schwindt, Ch. (2001). Truncated branch and bound, schedule construction, and schedule improvement procedures for resource constrained project scheduling. In OR Specktrum (Vol. 23, pp. 297\u2013324). Berlin: Springer."},{"key":"125_CR12","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 Research Logistics, 45, 733\u2013750. doi: 10.1002\/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C .","journal-title":"Naval Research Logistics"},{"key":"125_CR13","first-page":"147","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 and computational analysis. In J. Weglarz (Ed.), Project scheduling, recent models, algorithms and applications (pp. 147\u2013178). Boston: Kluwer Academic."},{"key":"125_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. European Journal of Operational Research, 174, 23\u201337. doi: 10.1016\/j.ejor.2005.01.065 .","journal-title":"European Journal of Operational Research"},{"key":"125_CR15","unstructured":"Luo, S., Wang, C., & Wang, J. (2003). Ant colony optimization for resource-constrained project scheduling with generalized precedence relations. In Proceedings of the 15th IEEE international conference on tools with artificial intelligence (ICTAI\u201903)."},{"key":"125_CR16","volume-title":"Operations research verfahren, Band III","author":"K. Neumann","year":"1975","unstructured":"Neumann, K. (1975). Operations research verfahren, Band III. M\u00fcnchen: Carl Hanser."},{"key":"125_CR17","unstructured":"Neumann, K., & Schwindt, C. (1995). Projects with minimal and maximal time lags: construction of activity on-node networks and applications. Report WIOR-447, University of Karlsruhe."},{"key":"125_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22341-3","volume-title":"Project Scheduling with Time Windows and Scarce Resources","author":"K. Neumann","year":"2002","unstructured":"Neumann, K., Schwindt, Ch., & Zimmermann, J. (2002). Project Scheduling with Time Windows and Scarce Resources. Berlin: Springer."},{"key":"125_CR19","unstructured":"Smith, T. (2004). Windows-based project scheduling algorithms. PhD thesis, University of Oregon."},{"key":"125_CR20","unstructured":"Schwindt, C. (1996). Generation of resource constrained project scheduling problems with minimal and maximal time lags. Report WIOR 489, Institute for Economic Theory and Operations Research, University of Karlsruhe."},{"key":"125_CR21","unstructured":"Schwindt, C. (1998). A branch-and-bound algorithm for the resource-constrained project duration problem subject to temporal constraints. Technical report, WIOR-544, University Karlsruhe, Germany."},{"key":"125_CR22","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R. (1972). Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1, 146\u2013160. doi: 10.1137\/0201010 .","journal-title":"SIAM Journal of Computing"},{"key":"125_CR23","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., Ballest\u00edn, F., & Quintanilla, S. (2005). Justification and RCPSP: a technique that pays. European Journal of Operational Research, 165, 375\u2013386. doi: 10.1016\/j.ejor.2004.04.008 .","journal-title":"European Journal of Operational Research"},{"key":"125_CR24","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.ejor.2006.12.033","volume":"185","author":"V. Valls","year":"2008","unstructured":"Valls, V., Ballest\u00edn, F., & Quintanilla, S. (2008). A hybrid genetic algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 185, 495\u2013508. doi: 10.1016\/j.ejor.2006.12.033 .","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0125-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0125-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0125-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:43Z","timestamp":1559453983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0125-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,2]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["125"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0125-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,2]]}}}