Algorithms for scheduling projects with generalized precedence relations

The problem of scheduling projects under various types of resource constraints constitutes an important and challenging problem which has received increasing attention during the past several years. The bulk of the models and procedures designed for coping with these problem types aim at scheduling...

全面介紹

Saved in:
書目詳細資料
Main Authors: DE REYCK, Bert, DEMEULEMEESTER, Erik, HERROELEN, Willy
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 1999
主題:
在線閱讀:https://ink.library.smu.edu.sg/lkcsb_research/6770
https://ink.library.smu.edu.sg/context/lkcsb_research/article/7771/viewcontent/algorithms.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English
id sg-smu-ink.lkcsb_research-7771
record_format dspace
spelling sg-smu-ink.lkcsb_research-77712021-08-31T15:31:20Z Algorithms for scheduling projects with generalized precedence relations DE REYCK, Bert DEMEULEMEESTER, Erik HERROELEN, Willy The problem of scheduling projects under various types of resource constraints constitutes an important and challenging problem which has received increasing attention during the past several years. The bulk of the models and procedures designed for coping with these problem types aim at scheduling project activities to minimize the project duration subject to constant availability constraints on the required set of resources and precedence constraints that indicate that activities can only be started when all of their predecessors have already been finished. However, real-life project scheduling applications often involve more complicated types of precedence relations such as arbitrary minimal and maximal time lags between the starting and completion times of the activities, and require more sophisticated regular and nonregular objective functions. Over the past few years, considerable progress has been made in the use of exact solution procedures for this problem type and its variants. We will review the fundamental logic and report new computational experience with solution procedures for optimally solving resource-constrained project scheduling problems in which such generalized precedence relations and objective functions can be explicitly considered. 1999-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/lkcsb_research/6770 info:doi/10.1007/978-1-4615-5533-9_4 https://ink.library.smu.edu.sg/context/lkcsb_research/article/7771/viewcontent/algorithms.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Search Tree Project Schedule Precedence Relation Resource Type Project Schedule Problem Business Administration, Management, and Operations Management Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Search Tree
Project Schedule
Precedence Relation
Resource Type
Project Schedule Problem
Business Administration, Management, and Operations
Management Information Systems
spellingShingle Search Tree
Project Schedule
Precedence Relation
Resource Type
Project Schedule Problem
Business Administration, Management, and Operations
Management Information Systems
DE REYCK, Bert
DEMEULEMEESTER, Erik
HERROELEN, Willy
Algorithms for scheduling projects with generalized precedence relations
description The problem of scheduling projects under various types of resource constraints constitutes an important and challenging problem which has received increasing attention during the past several years. The bulk of the models and procedures designed for coping with these problem types aim at scheduling project activities to minimize the project duration subject to constant availability constraints on the required set of resources and precedence constraints that indicate that activities can only be started when all of their predecessors have already been finished. However, real-life project scheduling applications often involve more complicated types of precedence relations such as arbitrary minimal and maximal time lags between the starting and completion times of the activities, and require more sophisticated regular and nonregular objective functions. Over the past few years, considerable progress has been made in the use of exact solution procedures for this problem type and its variants. We will review the fundamental logic and report new computational experience with solution procedures for optimally solving resource-constrained project scheduling problems in which such generalized precedence relations and objective functions can be explicitly considered.
format text
author DE REYCK, Bert
DEMEULEMEESTER, Erik
HERROELEN, Willy
author_facet DE REYCK, Bert
DEMEULEMEESTER, Erik
HERROELEN, Willy
author_sort DE REYCK, Bert
title Algorithms for scheduling projects with generalized precedence relations
title_short Algorithms for scheduling projects with generalized precedence relations
title_full Algorithms for scheduling projects with generalized precedence relations
title_fullStr Algorithms for scheduling projects with generalized precedence relations
title_full_unstemmed Algorithms for scheduling projects with generalized precedence relations
title_sort algorithms for scheduling projects with generalized precedence relations
publisher Institutional Knowledge at Singapore Management University
publishDate 1999
url https://ink.library.smu.edu.sg/lkcsb_research/6770
https://ink.library.smu.edu.sg/context/lkcsb_research/article/7771/viewcontent/algorithms.pdf
_version_ 1770575791900327936