A flow-based tabu search algorithm for the RCPSP with transfer times

Autor(en): Poppenborg, Jens
Knust, Sigrid 
Stichwörter: CONSTRAINTS; HEURISTICS; Operations Research & Management Science; RCPSP; RESOURCE; Resource flow; SCHEDULING PROBLEM; Tabu search; Transfer times
Erscheinungsdatum: 2016
Herausgeber: SPRINGER
Journal: OR SPECTRUM
Volumen: 38
Ausgabe: 2, SI
Startseite: 305
Seitenende: 334
Zusammenfassung: 
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.
ISSN: 01716468
DOI: 10.1007/s00291-015-0402-2

Show full item record

Page view(s)

1
Last Week
0
Last month
1
checked on Feb 23, 2024

Google ScholarTM

Check

Altmetric