227 research outputs found
Optimized Resource-Constrained Method for Project Schedule Compression
Construction projects are unique and can be executed in an accelerated manner to meet market conditions. Accordingly, contractors need to compress project durations to meet client changing needs and related contractual obligations and recover from delays experienced during project execution. This acceleration requires resource planning techniques such as resource leveling and allocation. Various optimization methods have been proposed for the resource-constrained schedule compression and resource allocation and leveling individually. However, in real-world construction projects, contractors need to consider these aspects concurrently.
For this purpose, this study proposes an integrated method that allows for joint consideration of the above two aspects. The method aims to optimize project duration and costs through the resources and cost of the execution modes assigned to project activities. It accounts for project cost and resource-leveling based on costs and resources imbedded in these modes of execution. The method's objective is to minimize the project duration and cost, including direct cost, indirect cost, and delay penalty, and strike a balance between the cost of acquiring and releasing resources on the one hand and the cost of activity splitting on the other hand.
The novelty of the proposed method lies in its capacity to consider resource planning and project scheduling under uncertainty simultaneously while accounting for activity splitting. The proposed method utilizes the fuzzy set theory (FSs) for modeling uncertainty associated with the duration and cost of project activities and genetic algorithm (GA) for scheduling optimization. The method has five main modules that support two different optimization methods: modeling uncertainty and defuzzification module; scheduling module; cost calculations module; sensitivity
IV
analysis module; and decision-support module. The two optimization methods use the genetic algorithm as an optimization engine to find a set of non-dominated solutions. One optimization method uses the elitist non-dominated sorting genetic algorithm (NSGA-II), while the other uses a dynamic weighted optimization genetic algorithm. The developed scheduling and optimization method is coded in python as a stand-alone automated computerized tool to facilitate the needed iterative rescheduling of project activities and project schedule optimization.
The developed method is applied to a numerical example to demonstrate its use and to illustrate its capabilities. Since the adopted numerical example is not a resource-constrained optimization example, the proposed optimization methods are validated through a multi-layered comparative analysis that involves performance evaluation, statistical comparisons, and performance stability evaluation. The performance evaluation results demonstrated the superiority of the NSGA-II against the dynamic weighted optimization genetic algorithm in finding better solutions. Moreover, statistical comparisons, which considered solutionsâ mean, and best values, revealed that both optimization methods could solve the multi-objective time-cost optimization problem. However, the solutionsâ range values indicated that the NSGA-II was better in exploring the search space before converging to a global optimum; NSGA-II had a trade-off between exploration (exploring the new search space) and exploitation (using already detected points to search the optimum). Finally, the coefficient of variation test revealed that the NSGA-II performance was more stable than that of the dynamic weighted optimization genetic algorithm.
It is expected that the developed method can assist contractors in preparation for efficient schedule compression, which optimizes schedule and ensures efficient utilization of their resources
Projects Never Fail: A Critical Review on Estimation of Project Scheduling and Project Costing
Uncertainty remains common in all projects. It is need to realize this uncertainty and have to minimize the effect of this uncertainty to achieve better project outcomes. To realize the project on truthful base it is required to develop project schedule and estimate project costing on reality bases. A lot of project scheduling and costing techniques and tools are used to measure the accuracy. The new systematic techniques increase project outcomes and also reduce the uncertainty from the projects. This study will leads to examine thoroughly project scheduling and project costing. Then this study will guide project managers how to develop a project schedule and what factors are effecting on the project scheduling and a sample project schedule will also provide for project managers and students of project management. After that the major sources of project costing and the method to calculate the project cost will also provide. And the sample project costing sheet is also develop in this study. Both project scheduling and project costing will develop the professionalism among project managers and students of project managers which they can never think before this study and also enhance project outcomes. Keywords: Project Scheduling, Project Costing, Uncertainty Handling and Project Succes
Algorithms for Scheduling Problems
This edited book presents new results in the area of algorithm development for different types of scheduling problems. In eleven chapters, algorithms for single machine problems, flow-shop and job-shop scheduling problems (including their hybrid (flexible) variants), the resource-constrained project scheduling problem, scheduling problems in complex manufacturing systems and supply chains, and workflow scheduling problems are given. The chapters address such subjects as insertion heuristics for energy-efficient scheduling, the re-scheduling of train traffic in real time, control algorithms for short-term scheduling in manufacturing systems, bi-objective optimization of tortilla production, scheduling problems with uncertain (interval) processing times, workflow scheduling for digital signal processor (DSP) clusters, and many more
Recommended from our members
Multi-mode resource-constrained project scheduling problem with resource vacations and task splitting
The research presented in this dissertation addresses the Multi-Mode Resource-Constrained Project Scheduling Problem (MMRCPSP) in the presence of resource unavailability. This research is motivated by the scheduling of engineering design tasks in automotive product development to minimize the project completion time, but addresses a general scheduling situation that is applicable in many contexts. The current body of MMRCPSP research typically assumes that, 1) individual resource units are available at all times when assigning tasks to resources and, 2) before assigning tasks to resources, there must be enough resource availability over time to complete the task without interruption. In many situations such as assigning engineering design tasks to designers, resources are not available over the entire project-planning horizon. In the case of engineering designers and other human resources, unavailability may be due to several reasons such as vacation, training, or being scheduled to do other tasks outside the project. In addition, when tasks are scheduled they are often split to accommodate unavailable resources and are not completed in one continuous time segment. The objectives of this research are to obtain insight into the types of project scheduling situations where task splitting may result in significant makespan improvements, and to develop a fast and effective scheduling heuristic for such situations. A designed computational experiment was used to gain insight into when task splitting may provide significant makespan improvements. Problem instances were randomly generated using a modification of a standard problem generator, and optimally solved with and without task splitting using a branch and bound algorithm. In total 3,880 problem instances were solved with and without task splitting. Statistical analysis of the experimental data reveals that high resource utilization is the most important factor affecting the improvements obtained by task splitting. The analysis also shows that splitting is more helpful when resource unavailability occurs in multiple periods of short duration versus fewer periods of long duration. Another conclusion from the analysis indicates that the project precedence structure and the number (not amount) of resources used by tasks do not significantly affect the improvements due to task splitting. Using the insights from the computational testing, a new heuristic is developed that can be applied to large problems. The heuristic is an implementation of a simple priority rule-based heuristic with a new parameter used to control the number of task splits. It is desirable to obtain the majority of task splitting benefits with the smallest number of split tasks. Computational experiments are conducted to evaluate its performance against known optimal solutions for small sized problems. A deterministic version of the heuristic found optimal solutions for 33% of the problems and a stochastic version found optimal solutions for over 70%. The average percent increase in makespan compared to optimal was 7.58% for the deterministic heuristic and less than 2% for the stochastic versions demonstrating acceptable performance
Optimising airline maintenance scheduling decisions
Airline maintenance scheduling (AMS) studies how plans or schedules are constructed to ensure that a fleet is efficiently maintained and that airline operational demands are met. Additionally, such schedules must take into consideration the different regulations airlines are subject to, while minimising maintenance costs. In this thesis, we study different formulations, solution methods, and modelling considerations, for the AMS and related problems to propose two main contributions. First, we present a new type of multi-objective mixed integer linear programming formulation which challenges traditional time discretisation. Employing the concept of time intervals, we efficiently model the airline maintenance scheduling problem with tail assignment considerations. With a focus on workshop resource allocation and individual aircraft flight operations, and the use of a custom iterative algorithm, we solve large and long-term real-world instances (16000 flights, 529 aircraft, 8 maintenance workshops) in reasonable computational time. Moreover, we provide evidence to suggest, that our framework provides near-optimal solutions, and that inter-airline cooperation is beneficial for workshops. Second, we propose a new hybrid solution procedure to solve the aircraft recovery problem. Here, we study how to re-schedule flights and re-assign aircraft to these, to resume airline operations after an unforeseen disruption. We do so while taking operational restrictions into account. Specifically, restrictions on aircraft, maintenance, crew duty, and passenger delay are accounted for. The flexibility of the approach allows for further operational restrictions to be easily introduced. The hybrid solution procedure involves the combination of column generation with learning-based hyperheuristics. The latter, adaptively selects exact or metaheuristic algorithms to generate columns. The five different algorithms implemented, two of which we developed, were collected and released as a Python package (Torres Sanchez, 2020). Findings suggest that the framework produces fast and insightful recovery solutions
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
International audienceThe Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization started off as a series of workshops organized bi-annually by either KĂśln University or Twente University. As its importance grew over time, it re-centered its geographical focus by including northern Italy (CTW04 in Menaggio, on the lake Como and CTW08 in Gargnano, on the Garda lake). This year, CTW (in its eighth edition) will be staged in France for the first time: more precisely in the heart of Paris, at the Conservatoire National dâArts et MĂŠtiers (CNAM), between 2nd and 4th June 2009, by a mixed organizing committee with members from LIX, Ecole Polytechnique and CEDRIC, CNAM
Modeling and Solving Resource Constrained Project Scheduling Problems with Remanufacturing Activities
Resource constrained project scheduling problem (RCPSP) is one of the most important problems in industrial engineering and production management. Owing to environmental concerns, companies are paying more attention to the remanufacturing of end-of-life products. In this thesis, a mathematical model is developed considering remanufacturing activities in resource constrained project scheduling problem. The mathematical model considers recycle rate in multiple operation modes and several components of cost, including bonus, penalty, and others. A set of project network instance are generated using RanGen1 for evaluation. To solve the model, a three-stage heuristic method is developed in CPLEX 12.8 environment. Result shows that proposed method can reach a close-to-optimal solution within acceptable time limit
- âŚ