A genetic algorithm procedure for the time-constrained project scheduling problem
- Author
- Vincent Van Peteghem and Mario Vanhoucke (UGent)
- Organization
- Abstract
- In this paper, a genetic algorithm procedure for the Time-Constrained Project Scheduling Problem is proposed. In this problem, the cost of additional resources, which can be temporarily allocated in certain periods to meet a given deadline, should be minimized. The procedure makes use of shift vector representation and a local search procedure, which shifts cost causing activities. Computational experiments are applied on modified RCPSP benchmark instances and reveal promising results.
- Keywords
- project scheduling
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-3153350
- MLA
- Van Peteghem, Vincent, and Mario Vanhoucke. “A Genetic Algorithm Procedure for the Time-Constrained Project Scheduling Problem.” INFORMS Annual Meeting, Abstracts, 2011.
- APA
- Van Peteghem, V., & Vanhoucke, M. (2011). A genetic algorithm procedure for the time-constrained project scheduling problem. INFORMS Annual Meeting, Abstracts. Presented at the INFORMS Annual meeting 2011 : Transformation, Charlotte, NC, USA.
- Chicago author-date
- Van Peteghem, Vincent, and Mario Vanhoucke. 2011. “A Genetic Algorithm Procedure for the Time-Constrained Project Scheduling Problem.” In INFORMS Annual Meeting, Abstracts.
- Chicago author-date (all authors)
- Van Peteghem, Vincent, and Mario Vanhoucke. 2011. “A Genetic Algorithm Procedure for the Time-Constrained Project Scheduling Problem.” In INFORMS Annual Meeting, Abstracts.
- Vancouver
- 1.Van Peteghem V, Vanhoucke M. A genetic algorithm procedure for the time-constrained project scheduling problem. In: INFORMS Annual meeting, Abstracts. 2011.
- IEEE
- [1]V. Van Peteghem and M. Vanhoucke, “A genetic algorithm procedure for the time-constrained project scheduling problem,” in INFORMS Annual meeting, Abstracts, Charlotte, NC, USA, 2011.
@inproceedings{3153350, abstract = {{In this paper, a genetic algorithm procedure for the Time-Constrained Project Scheduling Problem is proposed. In this problem, the cost of additional resources, which can be temporarily allocated in certain periods to meet a given deadline, should be minimized. The procedure makes use of shift vector representation and a local search procedure, which shifts cost causing activities. Computational experiments are applied on modified RCPSP benchmark instances and reveal promising results.}}, author = {{Van Peteghem, Vincent and Vanhoucke, Mario}}, booktitle = {{INFORMS Annual meeting, Abstracts}}, keywords = {{project scheduling}}, language = {{eng}}, location = {{Charlotte, NC, USA}}, title = {{A genetic algorithm procedure for the time-constrained project scheduling problem}}, year = {{2011}}, }