Time-constrained project scheduling with adjacent resources

Research output: Contribution to journalArticleAcademicpeer-review

15 Citations (Scopus)

Abstract

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
Volume38
Issue number1
DOIs
Publication statusPublished - Jan 2011

Fingerprint

Project Scheduling
Adjacent
Scheduling
Decomposition
Resources
Decomposition Method
Scheduling Problem
Unit
Project scheduling
Assignment
Decompose
Demonstrate

Keywords

  • Project scheduling
  • Time-constrained project scheduling
  • EWI-18323
  • IR-72685
  • Integer Programming
  • METIS-267623
  • Adjacent resources

Cite this

@article{312e013621b14247899713ef52c4c8d5,
title = "Time-constrained project scheduling with adjacent resources",
abstract = "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.",
keywords = "Project scheduling, Time-constrained project scheduling, EWI-18323, IR-72685, Integer Programming, METIS-267623, Adjacent resources",
author = "Hurink, {Johann L.} and A.L. Kok and J.J. Paulus and Schutten, {Johannes M.J.}",
year = "2011",
month = "1",
doi = "10.1016/j.cor.2010.05.006",
language = "English",
volume = "38",
pages = "310--319",
journal = "Computers & operations research",
issn = "0305-0548",
publisher = "Elsevier",
number = "1",

}

Time-constrained project scheduling with adjacent resources. / Hurink, Johann L.; Kok, A.L.; Paulus, J.J.; Schutten, Johannes M.J.

In: Computers & operations research, Vol. 38, No. 1, 01.2011, p. 310-319.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Time-constrained project scheduling with adjacent resources

AU - Hurink, Johann L.

AU - Kok, A.L.

AU - Paulus, J.J.

AU - Schutten, Johannes M.J.

PY - 2011/1

Y1 - 2011/1

N2 - 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.

AB - 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.

KW - Project scheduling

KW - Time-constrained project scheduling

KW - EWI-18323

KW - IR-72685

KW - Integer Programming

KW - METIS-267623

KW - Adjacent resources

U2 - 10.1016/j.cor.2010.05.006

DO - 10.1016/j.cor.2010.05.006

M3 - Article

VL - 38

SP - 310

EP - 319

JO - Computers & operations research

JF - Computers & operations research

SN - 0305-0548

IS - 1

ER -