{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T03:36:51Z","timestamp":1773805011114,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,20]],"date-time":"2015-05-20T00:00:00Z","timestamp":1432080000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00291-015-0402-2","type":"journal-article","created":{"date-parts":[[2015,5,19]],"date-time":"2015-05-19T10:44:04Z","timestamp":1432032244000},"page":"305-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":54,"title":["A flow-based tabu search algorithm for the RCPSP with transfer times"],"prefix":"10.1007","volume":"38","author":[{"given":"Jens","family":"Poppenborg","sequence":"first","affiliation":[]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,20]]},"reference":[{"key":"402_CR1","first-page":"19","volume-title":"Resource-constrained project scheduling","author":"C Artigues","year":"2010","unstructured":"Artigues C (2010) The resource-constrained project scheduling problem. In: Artigues C, Demassey S, N\u00e9ron E (eds) Resource-constrained project scheduling. ISTE, London, pp 19\u201335"},{"issue":"2","key":"402_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0377-2217(02)00758-0","volume":"149","author":"C Artigues","year":"2003","unstructured":"Artigues C, Michelon P, Reusser S (2003) Insertion techniques for static and dynamic resource-constrained project scheduling. Eur J Oper Res 149(2):249\u2013267","journal-title":"Eur J Oper Res"},{"issue":"2","key":"402_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0377-2217(99)00496-8","volume":"127","author":"C Artigues","year":"2000","unstructured":"Artigues C, Roubellat F (2000) A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes. Eur J Oper Res 127(2):297\u2013316","journal-title":"Eur J Oper Res"},{"key":"402_CR4","volume-title":"Complex scheduling","author":"P Brucker","year":"2011","unstructured":"Brucker P, Knust S (2011) Complex scheduling. Springer, Berlin"},{"key":"402_CR5","volume-title":"Project scheduling: a research handbook","author":"EL Demeulemeester","year":"2002","unstructured":"Demeulemeester EL, Herroelen W (2002) Project scheduling: a research handbook. International Series in Operations Research & Management Science. Kluwer Academic Publishers, Boston"},{"issue":"6","key":"402_CR6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"issue":"3","key":"402_CR7","first-page":"195","volume":"22","author":"P Fortemps","year":"1997","unstructured":"Fortemps P, Hapke M (1997) On the disjunctive graph for project scheduling. Found Comput Decis Sci 22(3):195\u2013209","journal-title":"Found Comput Decis Sci"},{"key":"402_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0303-9_33","volume-title":"Tabu search","author":"F Glover","year":"1998","unstructured":"Glover F, Laguna M (1998) Tabu search. Kluwer Academic Publishers, Dordrecht"},{"issue":"1","key":"402_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann S, Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur J Oper Res 207(1):1\u201314","journal-title":"Eur J Oper Res"},{"issue":"2","key":"402_CR10","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S Hartmann","year":"2000","unstructured":"Hartmann S, Kolisch R (2000) Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur J Oper Res 127(2):394\u2013407","journal-title":"Eur J Oper Res"},{"issue":"5","key":"402_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0167-6377(01)00104-3","volume":"29","author":"J Hurink","year":"2001","unstructured":"Hurink J, Knust S (2001) List scheduling in a parallel machine environment with precedence constraints and setup times. Oper Res Lett 29(5):231\u2013239","journal-title":"Oper Res Lett"},{"issue":"2","key":"402_CR12","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur J Oper Res 90(2):320\u2013333","journal-title":"Eur J Oper Res"},{"issue":"1","key":"402_CR13","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. Eur J Oper Res 174(1):23\u201337","journal-title":"Eur J Oper Res"},{"issue":"1","key":"402_CR14","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch R, Sprecher A (1997) PSPLIB\u2014a project scheduling problem library. Eur J Oper Res 96(1):205\u2013216","journal-title":"Eur J Oper Res"},{"key":"402_CR15","volume-title":"Multi-project scheduling with resource transfers","author":"D Kr\u00fcger","year":"2009","unstructured":"Kr\u00fcger D (2009) Multi-project scheduling with resource transfers. Books on Demand GmbH, Norderstedt"},{"issue":"2","key":"402_CR16","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/j.ejor.2008.07.036","volume":"197","author":"D Kr\u00fcger","year":"2009","unstructured":"Kr\u00fcger D, Scholl A (2009) A heuristic solution framework for the resource constrained (multi-) project scheduling problem with sequence-dependent transfer times. Eur J Oper Res 197(2):492\u2013508","journal-title":"Eur J Oper Res"},{"issue":"2","key":"402_CR17","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00291-008-0144-5","volume":"32","author":"D Kr\u00fcger","year":"2010","unstructured":"Kr\u00fcger D, Scholl A (2010) Managing and modelling general resource transfers in (multi-) project scheduling. OR Spectr 32(2):369\u2013394","journal-title":"OR Spectr"},{"key":"402_CR18","first-page":"131","volume-title":"Perspectives in modern project scheduling","author":"M Mika","year":"2006","unstructured":"Mika M, Walig\u00f3ra G, W\u0229glarz J (2006) Modelling setup times in project scheduling. In: J\u00f3zefowska J, W\u0229glarz J (eds) Perspectives in modern project scheduling, vol 92. Springer, New York, pp 131\u2013163"},{"key":"402_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24800-2","volume-title":"Project scheduling with time windows and scarce resources: temporal and resource-constrained project scheduling with regular and nonregular objective functions","author":"K Neumann","year":"2003","unstructured":"Neumann K, Schwindt C, Zimmermann J (2003) Project scheduling with time windows and scarce resources: temporal and resource-constrained project scheduling with regular and nonregular objective functions. Springer, Berlin"},{"issue":"6","key":"402_CR20","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42(6):797\u2013813","journal-title":"Manag Sci"},{"key":"402_CR21","unstructured":"Poppenborg J (2014) Modeling and optimizing the evacuation of hospitals based on the RCPSP with resource transfers. PhD thesis, Clausthal University of Technology, Clausthal-Zellerfeld, Germany"},{"key":"402_CR22","unstructured":"Roy B, Sussmann B (1964) Les probl\u00e8mes d\u2019ordonnancement avec constraintes disjonctives. Technical report note D.S. no. 9 bis, SEMA, Paris, France"},{"issue":"4","key":"402_CR23","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s002910000042","volume":"22","author":"C Schwindt","year":"2000","unstructured":"Schwindt C, Trautmann N (2000) Batch scheduling in process industries: an application of resource-constrained project scheduling. OR Spectr 22(4):501\u2013524","journal-title":"OR Spectr"},{"issue":"6","key":"402_CR24","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1111\/1475-3995.00427","volume":"10","author":"C Schwindt","year":"2003","unstructured":"Schwindt C, Trautmann N (2003) Scheduling the production of rolling ingots: industrial context, model, and solution method. Int Trans Oper Res 10(6):547\u2013563","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"402_CR25","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0377-2217(93)E0294-8","volume":"80","author":"A Sprecher","year":"1995","unstructured":"Sprecher A, Kolisch R, Drexl A (1995) Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. Eur J Oper Res 80(1):94\u2013102","journal-title":"Eur J Oper Res"},{"issue":"1","key":"402_CR26","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"PJM Laarhoven van","year":"1992","unstructured":"van Laarhoven PJM, Aarts EHL, Lenstra JK (1992) Job shop scheduling by simulated annealing. Oper Res 40(1):113\u2013125","journal-title":"Oper Res"},{"issue":"4","key":"402_CR27","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1016\/j.cie.2007.11.008","volume":"5","author":"M Vanhoucke","year":"2008","unstructured":"Vanhoucke M (2008) Setup times and fast tracking in resource-constrained project scheduling. Comput Ind Eng 5(4):1062\u20131070","journal-title":"Comput Ind Eng"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-015-0402-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-015-0402-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-015-0402-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T11:00:06Z","timestamp":1559041206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-015-0402-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,20]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["402"],"URL":"https:\/\/doi.org\/10.1007\/s00291-015-0402-2","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,20]]}}}