Heuristic approaches to discrete‐continuous project scheduling problems to minimize the makespan

Heuristic approaches to discrete‐continuous project scheduling problems to minimize the makespan

0.00 Avg rating0 Votes
Article ID: iaor20113690
Volume: 48
Issue: 2
Start Page Number: 399
End Page Number: 421
Publication Date: Mar 2011
Journal: Computational Optimization and Applications
Authors:
Keywords: project management, heuristics
Abstract:

In this paper some discrete‐continuous project scheduling problems to minimize the makespan are considered. These problems are characterized by the fact that activities of a project simultaneously require for their execution discrete and continuous resources. A class of these problems is considered where the number of discrete resources is arbitrary, and one continuous, renewable, limited resource occurs. A methodology for solving the defined problems is presented. The continuous resource allocation problem is analyzed. An exact, as well as a heuristic approach to the problem is discussed. The idea of the continuous resource discretization is described, and a special case of the problem with identical processing rate functions is analyzed. Some computational experiments for evaluating the efficiency of the proposed heuristic approaches are presented. Conclusions and directions for future research are given.

Reviews

Required fields are marked *. Your email address will not be published.