A flow-based tabu search algorithm for the RCPSP with transfer times
Jens Poppenborg () and
Sigrid Knust ()
Additional contact information
Jens Poppenborg: Clausthal University of Technology
Sigrid Knust: University of Osnabrück
OR Spectrum: Quantitative Approaches in Management, 2016, vol. 38, issue 2, No 3, 305-334
Abstract:
Abstract In this paper, we propose a tabu search algorithm for the resource-constrained project scheduling problem with transfer times. Solutions are represented by resource flows extending the disjunctive graph model for shop scheduling problems. Neighborhoods are defined by parallel and serial modifications rerouting or reversing flow on certain arcs. This approach is evaluated from a theoretical and experimental point of view. Besides studying the connectivity of different neighborhoods, computational results are presented for benchmark instances with and without transfer times.
Keywords: RCPSP; Transfer times; Tabu search; Resource flow (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)
Downloads: (external link)
http://link.springer.com/10.1007/s00291-015-0402-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:orspec:v:38:y:2016:i:2:d:10.1007_s00291-015-0402-2
Ordering information: This journal article can be ordered from
http://www.springer. ... research/journal/291
DOI: 10.1007/s00291-015-0402-2
Access Statistics for this article
OR Spectrum: Quantitative Approaches in Management is currently edited by Rainer Kolisch
More articles in OR Spectrum: Quantitative Approaches in Management from Springer, Gesellschaft für Operations Research e.V.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().