Title of article
Time-constrainedprojectschedulingwithadjacentresources
Author/Authors
J.L. Hurink ، نويسنده , , A.L.Kok، نويسنده , , J.J.Paulus c، نويسنده , , J.M.J.Schutten ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
10
From page
310
To page
319
Abstract
We developadecompositionmethodfortheTime-ConstrainedProjectSchedulingProblem(TCPSP)
with adjacentresources.Foradjacentresourcestheresourceunitsareorderedandtheunitsassignedto
a jobhavetobeadjacent.Ontopofthat,adjacentresourcesarenotrequiredbysinglejobs,butbyjob
groups. Assoonasajobofsuchagroupstarts,theadjacentresourceunitsareoccupied,andtheyare
not releasedbeforealljobsofthatgrouparecompleted.Thedevelopeddecompositionmethod
separatestheadjacentresourceassignmentfromtherestoftheschedulingproblem.Testresults
demonstratetheapplicabilityofthedecompositionmethod.Thepresenteddecompositionformsafirst
promisingapproachfortheTCPSPwithadjacentresourcesandmayformagoodbasistodevelopmore
elaboratedmethods.
Keywords
Time-constrained project scheduling , Adjacent resources , Project scheduling , Integer programming
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927857
Link To Document