448 research outputs found
Optimization Algorithms in Project Scheduling
Scheduling, or planning in a general perspective, is the backbone of project management; thus, the successful implementation of project scheduling is a key factor to projects’ success. Due to its complexity and challenging nature, scheduling has become one of the most famous research topics within the operational research context, and it has been widely researched in practical applications within various industries, especially manufacturing, construction, and computer engineering. Accordingly, the literature is rich with many implementations of different optimization algorithms and their extensions within the project scheduling problem (PSP) analysis field. This study is intended to exhibit the general modelling of the PSP, and to survey the implementations of various optimization algorithms adopted for solving the different types of the PSP
Recommended from our members
Discrete flower pollination algorithm for resource constrained project scheduling problem
YesIn this paper, a new population-based and nature-inspired metaheuristic algorithm, Discrete Flower Pollination Algorithm (DFPA), is presented to solve the Resource Constrained Project Scheduling Problem (RCPSP). The DFPA is a modification of existing Flower Pollination Algorithm adapted for solving combinatorial optimization problems by changing some of the algorithm's core concepts, such as flower, global pollination, Lévy flight, local pollination. The proposed DFPA is then tested on sets of benchmark instances and its performance is compared against other existing metaheuristic algorithms. The numerical results have shown that the proposed algorithm is efficient and outperforms several other popular metaheuristic algorithms, both in terms of quality of the results and execution time. Being discrete, the proposed algorithm can be used to solve any other combinatorial optimization problems.Innovate UKAwarded 'Best paper of the Month
Reactive scheduling to treat disruptive events in the MRCPSP
Esta tesis se centra en diseñar y desarrollar una metodologÃa para abordar el MRCPSP con diversas funciones objetivo y diferentes tipos de interrupciones. En esta tesis se exploran el MRCPSP con dos funciones objetivo, a saber: (1) minimizar la duración del proyecto y (2) maximizar el valor presente neto del proyecto. Luego, se tiene en cuenta dos tipos diferentes de interrupciones, (a) interrupción de duración, e (b) interrupción de recurso renovable. Para resolver el MRCPSP, en esta tesis se proponen tres estrategias metaheurÃsticas: (1) algoritmo memético para minimizar la duración del proyecto, (2) algoritmo adaptativo de forrajeo bacteriano para maximizar el valor presente neto del proyecto y (3) algoritmo de optimización multiobjetivo de forrajeo bacteriano (MBFO) para resolver el MRCPSP con eventos de interrupción. Para juzgar el rendimiento del algoritmo memético y de forrajeo bacteriano propuestos, se ha llevado a cabo un extenso análisis basado en diseño factorial y diseño Taguchi para controlar y optimizar los parámetros del algoritmo. Además se han puesto a prueba resolviendo las instancias de los conjuntos más importantes en la literatura: PSPLIB (10,12,14,16,18,20 y 30 actividades) y MMLIB (50 y 100 actividades). También se ha demostrado la superioridad de los algoritmos metaheurÃsticos propuestos sobre otros enfoques heurÃsticos y metaheurÃsticos del estado del arte. A partir de los estudios experimentales se ha ajustado la MBFO, utilizando un caso de estudio.DoctoradoDoctor en IngenierÃa Industria
Meta-heuristic based Construction Supply Chain Modelling and Optimization
Driven by the severe competition within the construction industry, the necessity of improving and optimizing the performance of construction supply chain has been aroused. This thesis proposes three problems with regard to the construction supply chain optimization from three perspectives, namely, deterministic single objective optimization, stochastic optimization and multi-objective optimization respectively. Mathematical models for each problem are constructed accordingly and meta-heuristic algorithms are developed and applied for resolving these three problems
A survey of recent methods for solving project scheduling problems
This paper analyses the current state of research regarding solution methods dealing with resource-constrained project scheduling problems. The intention is to present a concentrated survey and brief scientific overview on models, their decision variables and constraints as well as current solution methods in the field of project scheduling.
The allocation of scarce resources among multiple projects with different, conflicting decision variables is a highly difficult problem in order to achieve an optimal schedule which meets all (usually different) of the projects’ objectives. Those projects, e.g. the assembly of complex machinery and goods, consume many renewable, e.g. workforce/staff, and non-renewable, e.g. project budget, resources. Each single process within these projects can often be performed in different ways – so called execution modes can help to make a schedule feasible. On the other hand the number of potential solutions increases dramatically through this fact. Additional constraints, e.g. min/max time lags, preemption or specific precedence relations of activities, lead to highly complex problems which are NP-hard in the strong sense
A survey of recent methods for solving project scheduling problems
This paper analyses the current state of research regarding solution methods dealing with resource-constrained project scheduling problems. The intention is to present a concentrated survey and brief scientific overview on models, their decision variables and constraints as well as current solution methods in the field of project scheduling.
The allocation of scarce resources among multiple projects with different, conflicting decision variables is a highly difficult problem in order to achieve an optimal schedule which meets all (usually different) of the projects’ objectives. Those projects, e.g. the assembly of complex machinery and goods, consume many renewable, e.g. workforce/staff, and non-renewable, e.g. project budget, resources. Each single process within these projects can often be performed in different ways – so called execution modes can help to make a schedule feasible. On the other hand the number of potential solutions increases dramatically through this fact. Additional constraints, e.g. min/max time lags, preemption or specific precedence relations of activities, lead to highly complex problems which are NP-hard in the strong sense
An integer linear programming model including time, cost, quality, and safety
Time, cost, quality and safety, are the four critical elements that contribute to project success. Traditionally, literature has focused on analysing only time and cost. Subsequently, other multi-objective optimization methods developed to optimize time, cost, quality or safety have been developed. New types of contracting methods designed by governments, included maximizing construction quality while minimizing its time and cost. Recently, due to the fact that the construction industry suffers from more accidents of greater severity than other industrial sectors, safety has become one of the four critical elements that contribute to project success. The project scheduling literature largely concentrates on the generation of a precedence and resource feasible schedule that optimizes the scheduling objective and that should serve as a baseline schedule for executing the project. However, these models do not allow to analyse alternative work plans that consider the trade-offs between time, cost, quality, and safety. In this paper, an integer linear programming problem is applied to a decision-CPM network in order to obtain an overall optimum including time, cost, quality and safety in a road building project. Using this type of model, the effects of alternative methods of performing the tasks can be considered and a greater degree of interaction between the planning and scheduling phases of a project is obtained
Simplifying Multiproject Scheduling Problem Based on Design Structure Matrix and Its Solution by an Improved aiNet Algorithm
Managing multiple project is a complex task involving the unrelenting pressures of time and cost. Many studies have proposed various tools and techniques for single-project scheduling; however, the literature further considering multimode or multiproject issues occurring in the real world is rather scarce. In this paper, design structure matrix (DSM) and an improved artificial immune network algorithm (aiNet) are developed to solve a multi-mode resource-constrained scheduling problem. Firstly, the DSM is used to simplify the mathematic model of multi-project scheduling problem. Subsequently, aiNet algorithm comprised of clonal selection, negative selection, and network suppression is adopted to realize the local searching and global searching, which will assure that it has a powerful searching ability and also avoids the possible combinatorial explosion. Finally, the approach is tested on a set of randomly cases generated from ProGen. The computational results validate the effectiveness of the proposed algorithm comparing with other famous metaheuristic algorithms such as genetic algorithm (GA), simulated annealing algorithm (SA), and ant colony optimization (ACO)
- …