In the last decade, theory of constraint application in project management lead to make a new approach for project scheduling and control as a critical chain. In this paper, a multi-objective optimization model for multi-project scheduling on critical chain is investigated. The objectives include time, cost and quality. In order to solve the problem, a Simulated Annealing algorithm is developed...

A recurring problem in project management involves the allocation of scarce resources to the individual jobs comprising the project. In many situations such as audit-staff scheduling, timetabling, and course scheduling, the resources correspond to individuals (skilled labour). This naturally leads to an assignment-type project scheduling problem, i.e. a project has to be performed by assigning ...

A recurring problem in project management involves the allocation of scarce resources to the individual jobs comprising the project. In many situations such as audit-staff scheduling, timetabling, and course scheduling, the resources correspond to individuals (skilled labour). This naturally leads to an assignment-type project scheduling problem, i.e. a project has to be performed by assigning ...

In project scheduling, many problems can arise when resource fluctuations are beyond acceptable limits. To overcome this, mathematical techniques have been developed for leveling resources. However, these produce a hard and inflexible approach in scheduling projects. The authors propose a simple resource leveling approach that can be used in scheduling projects with multi-mode execution activit...

The scheduling problem under study may be viewed as an extension of the standard Multi-mode ResourceConstrained Project Scheduling Problem (MRCPSP) including Multi-Skilled Labor and will be called as MRCPSP-MS. This problem requires an integration of resource limitation, labor skills, and multiple possible execution modes for each task, and the objective is to minimize the overall project durat...

in this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (mrcpsp) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. we present a depth-first branch and bound algorithm for the resource constrained project schedulin...

resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. in this study, budget, investment costs and earnings are considered to be stochastic. the objectives are maximizing net present values of selected projects and minimizing v...

In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...

in this paper, a new genetic algorithm (ga) is presented for solving the multi-mode resource-constrained project scheduling problem (mrcpsp) with minimization of project makespan as the objective subject to resource and precedence constraints. a random key and the related mode list (ml) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (mssg...

Large-scale projects often have several activities which are performed by subcontractors with limited multi-resources. Project scheduling with limited resources is one of the most famous problems in the research operations and optimization cases. The resource-constraint project scheduling problem (RCPSP) is a NP-hard problem in which the activities of a project must be scheduled to reduce the p...