Time-constrained project scheduling with adjacent resources

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

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2011, Vol.38 (1), p.310-319
Main Authors: Hurink, J.L., Kok, A.L., Paulus, J.J., Schutten, J.M.J.
Format: Article
Language:English
Subjects:
Adjacent resources
Applied sciences
Decomposition
Exact sciences and technology
Integer programming
Job shops
Mathematical programming
Operational research and scientific management
Operational research. Management science
Operations research
Project management
Project scheduling
Resource allocation
Rest
Scheduling
Scheduling, sequencing
Studies
Time-constrained project scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2010.05.006