Time-constrained project scheduling with adjacent resources

Authors:
J. L. Hurink;A. L. Kok;J. J. Paulus;J. M. J. Schutten
Affiliations:
Department of Applied Mathematics, Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands;ORTEC, Algorithmic R&D, P.O. Box 490, 2800 AL Gouda, The Netherlands;CQM bv, P.O. Box 414, 5600 EK Eindhoven, The Netherlands;Department of Operational Methods for Production and Logistics, School of Management and Governance, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Venue:
Computers and Operations Research
Year:
2011

Citing 6
Cited 1

Characterization and generation of a general class of resource-constrained project scheduling problems

Management Science
Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks

IEEE Transactions on Computers
On the Complexity of Adjacent Resource Scheduling

Journal of Scheduling
Higher-Dimensional Packing with Order Constraints

SIAM Journal on Discrete Mathematics
Time-constrained project scheduling

Journal of Scheduling
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis

Operations Research Letters

Exact and approximate methods for parallel multiple-area spatial scheduling with release times

OR Spectrum

Quantified Score

Hi-index	0.01

Visualization

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.