This work deals with the multi-mode resource-constrained project scheduling problem. In this problem, activities of the project may be executed in more than one operating mode and renewable resource constraints exist. Each activity operation mode has a different duration and requires different amount of renewable resources. The objective function considered is the minimisation of the project co...

This work describes a novel approach towards solving Multimode Resource Constrained Project Scheduling (MRCPS) Problems and an algorithm developed to implement this approach. The algorithm is intended to be used as an alternative to the various genetic algorithms currently being used to solve such problems. Using a deterministic approach that aims to select the optimum modes for execution as ef...

this paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. if the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrained. it is assumed that the resource amount required to accom-plish each activity is a discrete quantity and deterministic. the ...

The resource-constrained project scheduling problem is to find a schedule that minimizes the project duration subject to precedence relations and resource constraints. To further account for economic aspects of the project, one may add an objective of cash nature to the problem. In addition, dynamic nature and variations in real world are known to introduce uncertainties into data. Therefore, t...

The most recent left-to-right and right-to-left multibase exponentiation methods are compared for elliptic curve and modular residue groups to gauge the value and cost of switching from the normal left-toright mode to the more side channel resistant right-to-left direction in a resource constrained environment.

The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...

This paper presents a mixed-integer linear programming formulation for the multi-mode resource-constrained project scheduling problem with uncertain activity durations. We consider two-stage robust optimisation approach and find solutions that minimise worst-case makespan, whilst assuming durations lie in budgeted uncertainty set. Computational experiments show this easy-to-implement is many ti...

We consider the resource-constrained project scheduling problem. The purpose of this paper is to direct the focus to a branch-and-bound concept that can, by simple adaptations, operate on a wide range of problem settings. The general approach can, e.g., deal with multi-mode problems, resource availability varying with time, and a wide range of objectives. Even the simple assembly line balancing...

This abstract introduces a novel approach to intelligently select appropriate modes for each activity in the multi mode resource constrained project scheduling problem. The mode of an activity determines its duration and the resources that it requires. In order to obtain a good (or optimal) makespan, finding an appropriate mode for each activity is most important. The approach integrates differ...