Time-constrained project scheduling with adjacent resources

J.L. Hurink, A.L. Kok, J.J. Paulus, J.M.J. Schutten

Research output: Contribution to journalArticleAcademicpeer-review

18 Citations (Scopus)
9 Downloads (Pure)


We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with adjacent resources. For adjacent resources the resource units are ordered and the units assigned to a job have to be adjacent. On top of that, adjacent resources are not required by single jobs, but by job groups. As soon as a job of such a group starts, the adjacent resource units are occupied, and they are not released before all jobs of that group are completed. The developed decomposition method separates the adjacent resource assignment from the rest of the scheduling problem. Test results demonstrate the applicability of the decomposition method. The presented decomposition forms a first promising approach for the TCPSP with adjacent resources and may form a good basis to develop more elaborated methods.
Original languageEnglish
Pages (from-to)310-319
Number of pages10
JournalComputers & operations research
Issue number1
Publication statusPublished - Jan 2011


  • Project scheduling
  • Time-constrained project scheduling
  • Integer Programming
  • Adjacent resources
  • 2024 OA procedure


Dive into the research topics of 'Time-constrained project scheduling with adjacent resources'. Together they form a unique fingerprint.

Cite this