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

DC FieldValueLanguage
dc.contributor.authorPoppenborg, Jens
dc.contributor.authorKnust, Sigrid
dc.date.accessioned2021-12-23T16:08:59Z-
dc.date.available2021-12-23T16:08:59Z-
dc.date.issued2016
dc.identifier.issn01716468
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/8559-
dc.description.abstractIn 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.
dc.language.isoen
dc.publisherSPRINGER
dc.relation.ispartofOR SPECTRUM
dc.subjectCONSTRAINTS
dc.subjectHEURISTICS
dc.subjectOperations Research & Management Science
dc.subjectRCPSP
dc.subjectRESOURCE
dc.subjectResource flow
dc.subjectSCHEDULING PROBLEM
dc.subjectTabu search
dc.subjectTransfer times
dc.titleA flow-based tabu search algorithm for the RCPSP with transfer times
dc.typejournal article
dc.identifier.doi10.1007/s00291-015-0402-2
dc.identifier.isiISI:000372434700003
dc.description.volume38
dc.description.issue2, SI
dc.description.startpage305
dc.description.endpage334
dc.identifier.eissn14366304
dc.publisher.place233 SPRING ST, NEW YORK, NY 10013 USA
dcterms.isPartOf.abbreviationOR Spectrum
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidKnSi808-
Show simple item record

Page view(s)

1
Last Week
0
Last month
0
checked on Apr 17, 2024

Google ScholarTM

Check

Altmetric