Time-constrained project scheduling with adjacent resources

Research output: Book/ReportReportProfessional

175 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).