Distinct from ordinary project scheduling to minimize project completion time, this study conducts robust project scheduling with two resources constraints. In this study, actual start time of each operation is dynamic. The latest finish time minus actual finish time is the slack time available to each operation. The objective of this study is to determine all project operation times and slack ...

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...

Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...

odern project scheduling techniques have been around for almost 50 years. The original development work on the critical path method (CPM) and the performance evaluation and review technique (PERT) began in the mid 1950s [6]&[7]. Although the basic principles behind CPM and PERT have not changed, significant advances in project scheduling have taken place in the years since these techniques were...

Project scheduling problem is mainly to determine the schedule of allocating resources in order to balance the total cost and the completion time. This paper chiefly uses chance theory to introduce project scheduling problem with uncertain variables. First, two types of single-objective programming models with uncertain variables as uncertain chance-constrained model and uncertain maximization ...

the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...

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...