Time-constrained project scheduling with adjacent resources

Research output: Book/ReportReportProfessional

117 Downloads (Pure)

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 languageUndefined
Place of Publicationonbekend
PublisherOperational Methods for Production & Logistics (OMPL)
Number of pages22
ISBN (Print)9789038614908
Publication statusPublished - 2008

Publication series

NameBETA Working Papers
PublisherBeta Research School for Operations Management and Logistics, University of Twente
No.WP 261

Keywords

  • IR-70222
  • METIS-251937

Cite this

Hurink, J. L., Kok, A. L., Paulus, J. J., & Schutten, J. M. J. (2008). Time-constrained project scheduling with adjacent resources. (BETA Working Papers; No. WP 261). onbekend: Operational Methods for Production & Logistics (OMPL).
Hurink, Johann L. ; Kok, A.L. ; Paulus, J.J. ; Schutten, Johannes M.J. / Time-constrained project scheduling with adjacent resources. onbekend : Operational Methods for Production & Logistics (OMPL), 2008. 22 p. (BETA Working Papers; WP 261).
@book{131c011b93024d05b807e22432e7571f,
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 = "IR-70222, METIS-251937",
author = "Hurink, {Johann L.} and A.L. Kok and J.J. Paulus and Schutten, {Johannes M.J.}",
note = "Revised version of BETA WP-181 -- ISBN 978-90-386-1490-8",
year = "2008",
language = "Undefined",
isbn = "9789038614908",
series = "BETA Working Papers",
publisher = "Operational Methods for Production & Logistics (OMPL)",
number = "WP 261",

}

Hurink, JL, Kok, AL, Paulus, JJ & Schutten, JMJ 2008, Time-constrained project scheduling with adjacent resources. BETA Working Papers, no. WP 261, Operational Methods for Production & Logistics (OMPL), onbekend.

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

onbekend : Operational Methods for Production & Logistics (OMPL), 2008. 22 p. (BETA Working Papers; No. WP 261).

Research output: Book/ReportReportProfessional

TY - BOOK

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.

N1 - Revised version of BETA WP-181 -- ISBN 978-90-386-1490-8

PY - 2008

Y1 - 2008

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 - IR-70222

KW - METIS-251937

M3 - Report

SN - 9789038614908

T3 - BETA Working Papers

BT - Time-constrained project scheduling with adjacent resources

PB - Operational Methods for Production & Logistics (OMPL)

CY - onbekend

ER -

Hurink JL, Kok AL, Paulus JJ, Schutten JMJ. Time-constrained project scheduling with adjacent resources. onbekend: Operational Methods for Production & Logistics (OMPL), 2008. 22 p. (BETA Working Papers; WP 261).