Using Sliding Frame Approach for Scheduling Large and Complex projects
Date
2009
Authors
Sadeh, A.
Cohen, Y
Zwikael, Ofer
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers (IEEE Inc)
Abstract
There is a steadily increase in the size and complexity of projects. As a result, traditional project scheduling techniques, such as non-polynomial (NP) algorithms can no longer provide an optimal solution to minimum project duration under predecessors and resource constraints.. This paper presents for the first time a general new approach that allows utilizing such algorithms in heuristic manner. This approach could be efficiently applied for solving most project scheduling problems. The main advantage of this approach is its ability to dissect the original problem to small controllable size sub problems for which exact techniques can be applied. Thus, it neutralizes the complexity of the applied algorithms (and their nonpolynomial growth). We discuss our experience applying this approach and give some insight as to the choice of parameters of the sliding frame.
Description
Keywords
Keywords: Choice of parameters; Complex projects; Controllable size; Makespan; New approaches; Optimal solutions; Project duration; Project scheduling; Project scheduling problem; Resource Constraint; Sliding Window; Sub-problems; Industrial engineering; Project ma Makespan; Project management; Project scheduling; Sliding frame; Sliding window
Citation
Collections
Source
IEEE International Conference on Industrial engineering and Engineering Management 2009 proceedings
Type
Conference paper
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description