The resource constrained project scheduling problem is one of the most important issues that project managers have to deal with during the project implementation, as constrainedresource availabilities very often lead...
详细信息
ISBN:
(纸本)9781424481262
The resource constrained project scheduling problem is one of the most important issues that project managers have to deal with during the project implementation, as constrainedresource availabilities very often lead to delays in project completion and budget overruns. For solving this NP-hard optimization problem, we propose a genetic based hyperheuristic, i.e. an algorithm controlling a set of low-level heuristics which work in the solution domain. Chromosomes impose the sequence that the algorithm applies the low level heuristics. Implemented within a commercial project management software system, the hyperheuristic operates on the priority values that the software uses for scheduling activities. We perform a series of computational experiments with random generated projects. The results show that the algorithm is very promising for finding good solutions in reasonable time.
In this paper, we consider the resource constrained project scheduling problem (RCPSP). New feasibility tests for the energetic reasoning are introduced based on new integer programming (IP) formulations. Experimental...
详细信息
resource and project optimization scheduling has become the key of the success of researching project in the enterprises. In order to solve the mass resource constrained project scheduling problem, in this paper, an i...
详细信息
ISBN:
(纸本)9780769537290
resource and project optimization scheduling has become the key of the success of researching project in the enterprises. In order to solve the mass resource constrained project scheduling problem, in this paper, an improved particle swarm algorithm (PSO) called particle swarm algorithm with crossover (CPSO) was presented. This improved algorithm is based on PSO and genetic algorithm (GA). Through comparing with SPSO and GA on RCPSP, it is indicated that CPSO not only avoids premature convergence to a high degree, but also keeps a faster convergence rate than SPSO and GA.
The optimal scheduling of resource and program has became the key to the success of enterprise development projects. The conventional resource constrained project scheduling problem seeks a solution which satisfies th...
详细信息
ISBN:
(纸本)9780769536996
The optimal scheduling of resource and program has became the key to the success of enterprise development projects. The conventional resource constrained project scheduling problem seeks a solution which satisfies the time and resource constraints on purpose of a minimal construction period. With the development of the society, the realistic problems trend to be more and more complicated, and the RCPSP model is thereupon complex. This paper proposes a new projectscheduling model with success rate and it is suitable for large-scale projectschedulingproblems, then, an improved particle swarm optimization called CPSO based on PSO and GA is used to solve the problems. The application of solving examples with CPSO demonstrates that this algorithm is effective.
The optimal scheduling of resource and program has became the key to the success of enterprise development *** conventional resource constrained project scheduling problem seeks a solution which satisfies the time and...
详细信息
The optimal scheduling of resource and program has became the key to the success of enterprise development *** conventional resource constrained project scheduling problem seeks a solution which satisfies the time and resource constraints on purpose of a minimal construction *** the development of the society,the realistic problems trend to be more and more complicated,and the RCPSP model is thereupon *** paper proposes a new projectscheduling model with success rate and it is suitable for large-scale projectschedulingproblems,then,an improved particle swarm optimization called CPSO based on PSO and GA is used to solve the *** application of solving examples with CPSO demonstrates that this algorithm is effective.
Several efficient lower bounds and time-bound adjustment methods for the resource constrained project scheduling problem (RCPSP) have recently been proposed. Some of them are based on redundant resources. In this pape...
详细信息
Several efficient lower bounds and time-bound adjustment methods for the resource constrained project scheduling problem (RCPSP) have recently been proposed. Some of them are based on redundant resources. In this paper we define redundant functions which are very useful for computing redundant resources. We also describe an algorithm for computing all maximal redundant functions. Once all these redundant functions have been determined, we have to identify those that are useful for bounding. Surprisingly, their number is reasonable even for large resource capacities, so a representative subset of them can be tabulated to be used efficiently. Computational results on classical RCPSP instances confirm their usefulness. (c) 2005 Elsevier B.V. All rights reserved.
Critical chain method (CCM) is a new project method which combines project network technologies and management arts. Although there are lots of researches on it, the existing critical chain method has some drawbacks l...
详细信息
ISBN:
(纸本)9783037852378
Critical chain method (CCM) is a new project method which combines project network technologies and management arts. Although there are lots of researches on it, the existing critical chain method has some drawbacks limiting its decision level in practical application. To improve the decision level and application range of critical chain method, the critical chain method with multi-mode is studied. The project network technology is the foundation of projectschedulingproblem. All the existing project management tools can only support single mode project network, that is, all the project activities have only one executive mode. We study the multi-mode project network as the foundation of multi-mode CC. Furthermore, by relating multi-mode project network to critical chain method, the critical chain method with multi-mode is presented, and the implementation procedure is proposed. In the implementation of multi-mode CCM, the activity priority rules and mode priority rules are investigated.
Existing research has focused on solving problems in the area of project management using variety of approaches including search based software engineering approach. The main aim of this research is to evaluate the pe...
详细信息
Existing research has focused on solving problems in the area of project management using variety of approaches including search based software engineering approach. The main aim of this research is to evaluate the performance of metaheuristics search techniques such as genetic algorithm, simulated annealing and tabu search in resource allocation problem with project management discipline. This will enable the paper to introduce an alternative approach to solve this resource constrained project scheduling problem (RCPSP). The nature of this research is both constructive and experimental therefore software development research methodology will be utilised as a guideline. This study reports a comprehensive set of experiments which evaluate the performance of metaheuristics search techniques. Initial set of experiments were performed over various numerical test function to verify the implementation of search techniques. The next stage of experiments had focused on the scalability of these search techniques. Based on the first two experiments, search techniques were evaluated against a discrete problem to further explore the scalability. Finally, a multi objective test case problem was evaluated which focused around RCPSP. For each of these experiments the parameters were fine-tuned during the design phase of the experiments. Based on the experiments, it was apparent that the metaheuristics search techniques can be used to solve problems in resource allocation within project management discipline. Finally, a comparison analysis strongly suggests that overall simulated annealing had performed better than genetic algorithm and tabu search.
We deal here with a schedulingproblem GPPCSP (Generalized Parallelism and Preemption constrainedschedulingproblem) which is an extension of both the well-known resourceconstrainedschedulingproblem and the Schedu...
详细信息
We deal here with a schedulingproblem GPPCSP (Generalized Parallelism and Preemption constrainedschedulingproblem) which is an extension of both the well-known resourceconstrainedschedulingproblem and the schedulingproblem with Disjunctive Constraints. We first propose a reformulation of GPPCSP: according to it, solving GPPCSP means finding a vertex of the Feasible Vertex Subset of an Antichain Polyhedron. Next, we state several theoretical results related to this reformulation process and to structural properties of this specific Feasible Vertex Subset (connectivity,...). We end by focusing on the preemptive case of GPPCSP and by identifying specific instances of GPPCSP which are such that any vertex of the related Antichain Polyhedron may be projected on its related Feasible Vertex Subset without any deterioration of the makespan. For such an instance, the GPPCSP problem may be solved in a simple way through linear programming.
A genetic algorithm (GA) was proposed to solve the resource constrained project scheduling problem(RCPSP), in which resources are renewable and there is a single mode to perform each activity. This work employed genet...
详细信息
ISBN:
(纸本)9780769534985
A genetic algorithm (GA) was proposed to solve the resource constrained project scheduling problem(RCPSP), in which resources are renewable and there is a single mode to perform each activity. This work employed genetic algorithms to schedule project activities to minimize make-span subject to precedence constraints and resources availability. In the genetic algorithm, a new permutation of priority-based encoding scheme was designed in the algorithm, and it inherits all the merits of both the permutation-based encoding scheme and the priority-based encoding scheme. The serial generation scheme was used in decoding scheme to generate project plan. A full factorial computational experiment was set up using the well-known standard instances in PSPLIB, and the algorithm given in this paper was compared with the existing intelligent optimization algorithms, the results reveal that the algorithm is effective for the RCPSP.
暂无评论