Abstract: The additional relationships i.e., start-to-start, finish-to-finish, and start-to-finish, between activity in Precedence Diagram Method (PDM) provides a more flexible schedule than traditional Critical Path Method (CPM). But, changing the duration of critical activities in the PDM network will have an anomalous effect on the critical path and the project completion date. In this study, we classified the critical activities in two groups i.e., 1. activity on single critical path and 2. activity on multi-critical paths, and six classes i.e., normal, reverse, neutral, perverse, decrease-reverse and increase-normal, based on their effects on project duration in PDM. Furthermore, we determined the maximum float of time by which the duration each type of critical activities can be changed without effecting the project duration. This study would help the project manager to clearly understand the behavior of each critical activity on critical path, and he/she would be able to change the project duration by shortening or lengthening activities based on project budget and project deadline.
Abstract: Assembling large-scale products, such as airplanes, locomotives, or wind turbines, involves frequent process interruptions induced by e.g. delayed material deliveries or missing availability of resources. This leads to a negative impact on the logistical performance of a producer of xxl-products. In industrial practice, in case of interruptions, the identification, evaluation and eventually the selection of an alternative order of assembly activities (‘assembly alternative’) leads to an enormous challenge, especially if an optimized logistical decision should be reached. Therefore, in this paper, an innovative, optimization model for the identification of assembly alternatives that addresses the given problem is presented. It describes make-to-order, large-scale product assembly processes as a resource constrained project scheduling (RCPS) problem which follows given restrictions in practice. For the evaluation of the assembly alternative, a cost-based definition of the logistical objectives (delivery reliability, inventory, make-span and workload) is presented.
Abstract: Concurrent planning of the resource constraint project scheduling and material ordering problems have received significant attention within the last decades. Hence, the issue has been investigated here with the aim to minimize total project costs. Furthermore, the presented model considers different discount options in order to approach the real world conditions. The incorporated alternatives consist of all-unit and incremental discount strategies. On the other hand, a modified version of the genetic algorithm is applied in order to solve the model for larger sizes, in particular. Finally, the applicability and efficiency of the given model is tested by different numerical instances.
Abstract: Building Information Modeling (BIM) is a holistic documentation process for operational visualization, design coordination, estimation and project scheduling. BIM software defines objects parametrically and it is a tool for virtual reality. Primary advantage of implementing BIM is the visual coordination of the building structure and systems such as Mechanical, Electrical and Plumbing (MEP) and it also identifies the possible conflicts between the building systems. This paper is an attempt to develop a risk based BIM model which would highlight the primary advantages of application of BIM pertaining to urban infrastructure transportation project. It has been observed that about 40% of the Architecture, Engineering and Construction (AEC) companies use BIM but primarily for their outsourced projects. Also, 65% of the respondents agree that BIM would be used quiet strongly for future construction projects in India. The 3D models developed with Revit 2015 software would reduce co-ordination problems amongst the architects, structural engineers, contractors and building service providers (MEP). Integration of risk management along with BIM would provide enhanced co-ordination, collaboration and high probability of successful completion of the complex infrastructure transportation project within stipulated time and cost frame.
Abstract: Concurrent planning of project scheduling and
material ordering has been increasingly addressed within last decades
as an approach to improve the project execution costs. Therefore, we
have taken the problem into consideration in this paper, aiming to
maximize schedules quality robustness, in addition to minimize the
relevant costs. In this regard, a bi-objective mathematical model is
developed to formulate the problem. Moreover, it is possible to
utilize the all-unit discount for materials purchasing. The problem is
then solved by the E-constraint method, and the Pareto front is
obtained for a variety of robustness values. The applicability and
efficiency of the proposed model is tested by different numerical
instances, finally.
Abstract: Concurrent planning of project scheduling and
material ordering can provide more flexibility to the project
scheduling problem, as the project execution costs can be enhanced.
Hence, the issue has been taken into account in this paper. To do so, a
mixed-integer mathematical model is developed which considers the
aforementioned flexibility, in addition to the materials quantity
discount and space availability restrictions. Moreover, the activities
duration has been treated as decision variables. Finally, the efficiency
of the proposed model is tested by different instances. Additionally,
the influence of the aforementioned parameters is investigated on the
model performance.
Abstract: Time and cost are the main goals of the construction
project management. The first schedule developed may not be a
suitable schedule for beginning or completing the project to achieve
the target completion time at a minimum total cost. In general, there
are trade-offs between time and cost (TCT) to complete the activities
of a project. This research presents genetic algorithms (GAs) multiobjective
model for project scheduling considering different
scenarios such as least cost, least time, and target time.
Abstract: This research proposes a preemptive fuzzy goal programming model for multi-objective multi-mode resource constrained project scheduling problem. The objectives of the problem are minimization of the total time and the total cost of the project. Objective in a multi-mode resource-constrained project scheduling problem is often a minimization of makespan. However, both time and cost should be considered at the same time with different level of important priorities. Moreover, all elements of cost functions in a project are not included in the conventional cost objective function. Incomplete total project cost causes an error in finding the project scheduling time. In this research, preemptive fuzzy goal programming is presented to solve the multi-objective multi-mode resource constrained project scheduling problem. It can find the compromise solution of the problem. Moreover, it is also flexible in adjusting to find a variety of alternative solutions.
Abstract: In this paper the multi-mode resource-constrained project scheduling problem with discounted cash flows is considered. Minimizing the makespan and maximization the net present value (NPV) are the two common objectives that have been investigated in the literature. We apply one evolutionary algorithm named multiobjective particle swarm optimization (MOPSO) to find Pareto front solutions. We used standard sets of instances from the project scheduling problem library (PSPLIB). The results are computationally compared respect to different metrics taken from the literature on evolutionary multi-objective optimization.
Abstract: Project managers are the ultimate responsible for the
overall characteristics of a project, i.e. they should deliver the project
on time with minimum cost and with maximum quality. It is vital for
any manager to decide a trade-off between these conflicting
objectives and they will be benefited of any scientific decision
support tool. Our work will try to determine optimal solutions (rather
than a single optimal solution) from which the project manager will
select his desirable choice to run the project. In this paper, the
problem in project scheduling notated as
(1,T|cpm,disc,mu|curve:quality,time,cost) will be studied. The
problem is multi-objective and the purpose is finding the Pareto
optimal front of time, cost and quality of a project
(curve:quality,time,cost), whose activities belong to a start to finish
activity relationship network (cpm) and they can be done in different
possible modes (mu) which are non-continuous or discrete (disc), and
each mode has a different cost, time and quality . The project is
constrained to a non-renewable resource i.e. money (1,T). Because
the problem is NP-Hard, to solve the problem, a meta-heuristic is
developed based on a version of genetic algorithm specially adapted
to solve multi-objective problems namely FastPGA. A sample project
with 30 activities is generated and then solved by the proposed
method.
Abstract: Traditionally, project scheduling and material planning have been treated independently. In this research, a mixed integer programming model is presented to integrate project scheduling and materials ordering problems. The goal is to minimize the total material holding and ordering costs. In addition, an efficient metaheuristic algorithm is proposed to solve the model. The proposed algorithm is computationally tested, the results are analyzed, and conclusions are given.
Abstract: Resource-constrained project scheduling is an NPhard
optimisation problem. There are many different heuristic
strategies how to shift activities in time when resource requirements
exceed their available amounts. These strategies are frequently based
on priorities of activities. In this paper, we assume that a suitable
heuristic has been chosen to decide which activities should be
performed immediately and which should be postponed and
investigate the resource-constrained project scheduling problem
(RCPSP) from the implementation point of view. We propose an
efficient routine that, instead of shifting the activities, extends their
duration. It makes it possible to break down their duration into active
and sleeping subintervals. Then we can apply the classical Critical
Path Method that needs only polynomial running time. This
algorithm can simply be adapted for multiproject scheduling with
limited resources.
Abstract: Project managers are the ultimate responsible for the
overall characteristics of a project, i.e. they should deliver the project
on time with minimum cost and with maximum quality. It is vital for
any manager to decide a trade-off between these conflicting
objectives and they will be benefited of any scientific decision
support tool. Our work will try to determine optimal solutions (rather
than a single optimal solution) from which the project manager will
select his desirable choice to run the project. In this paper, the
problem in project scheduling notated as
(1,T|cpm,disc,mu|curve:quality,time,cost) will be studied. The
problem is multi-objective and the purpose is finding the Pareto
optimal front of time, cost and quality of a project
(curve:quality,time,cost), whose activities belong to a start to finish
activity relationship network (cpm) and they can be done in different
possible modes (mu) which are non-continuous or discrete (disc), and
each mode has a different cost, time and quality . The project is
constrained to a non-renewable resource i.e. money (1,T). Because
the problem is NP-Hard, to solve the problem, a meta-heuristic is
developed based on a version of genetic algorithm specially adapted
to solve multi-objective problems namely FastPGA. A sample project
with 30 activities is generated and then solved by the proposed
method.
Abstract: Renewable and non-renewable resource constraints have been vast studied in theoretical fields of project scheduling problems. However, although cumulative resources are widespread in practical cases, the literature on project scheduling problems subject to these resources is scant. So in order to study this type of resources more, in this paper we use the framework of a resource constrained project scheduling problem (RCPSP) with finish-start precedence relations between activities and subject to the cumulative resources in addition to the renewable resources. We develop a branch and bound algorithm for this problem customizing precedence tree algorithm of RCPSP. We perform extensive experimental analysis on the algorithm to check its effectiveness and performance for solving different instances of the problem in question.
Abstract: In this paper, supply policy and procurement of
shared resources in some kinds of concurrent construction projects
are investigated. This could be oriented to the problems of holding
construction companies who involve in different projects
concurrently and they have to supply limited resources to several
projects as well as prevent delays to any project. Limits on
transportation vehicles and storage facilities for potential
construction materials and also the available resources (such as cash
or manpower) are some of the examples which affect considerably on
management of all projects over all. The research includes
investigation of some real multi-storey buildings during their
execution periods and surveying the history of the activities. It is
shown that the common resource demand variation curve of the
projects may be expanded or displaced to achieve an optimum
distribution scheme. Of course, it may cause some delay to some
projects, but it has minimum influence on whole execution period of
all projects and its influence on procurement cost of the projects is
considerable. These observations on investigation of some
multistorey building which are built in Iran will be presented in this
paper.
Abstract: As one result of the project “Reactive Construction
Project Scheduling using Real Time Construction Logistic Data and
Simulation”, a procedure for using data about uncertain resource
availability assumptions in reactive scheduling processes has been
developed. Prediction data about resource availability is generated in
a formalized way using real-time monitoring data e.g. from auto-ID
systems on the construction site and in the supply chains. The paper
focusses on the formalization of the procedure for monitoring
construction logistic processes, for the detection of disturbance and
for generating of new and uncertain scheduling assumptions for the
reactive resource constrained simulation procedure that is and will be
further described in other papers.
Abstract: The Resource-Constrained Project Scheduling
Problem (RCPSP) is concerned with single-item or small batch
production where limited resources have to be allocated to dependent
activities over time. Over the past few decades, a lot of work has
been made with the use of optimal solution procedures for this basic
problem type and its extensions. Brucker and Knust[1] discuss, how
timetabling problems can be modeled as a RCPSP. Authors discuss
high school timetabling and university course timetabling problem as
an example. We have formulated two mathematical formulations of
course timetabling problem in a new way which are the prototype of
single-mode RCPSP. Our focus is to show, how course timetabling
problem can be transformed into RCPSP. We solve this
transformation model with genetic algorithm.