Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.cor.2010.05.006 | Computers & OR |
Keywords | DocType | Volume |
scheduling problem,decomposition method,integer programming,project scheduling | Journal | 38 |
Issue | ISSN | Citations |
1 | Computers and Operations Research | 7 |
PageRank | References | Authors |
0.44 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| johann l hurink | 1 | 75 | 7.05 |
| A. L. Kok | 2 | 37 | 2.30 |
| jacob jan paulus | 3 | 23 | 1.75 |
| J. M. J. Schutten | 4 | 155 | 11.57 |