The multi-mode resource-constrained project scheduling problem (MM RCPSP) is an NP-hard problem representing a generalization of the well-studied RCPSP. Depth-first tree search approach by Sprecher & Drexl (1998) is the best-known exact solution tree search procedure for this problem. In this paper we modify an existing breadth-first algorithm for multiple processors. It is a computer-cluster i...

In this paper we review different approaches for scheduling projects in multi-project environments. We show the evolution of the methodologies from the Resource Constrained Project Scheduling Problem to the Decentralized Resource Constrained Multi-Project Scheduling Problem. We argue that traditional methods used in project scheduling cannot cope with the complexity of current real portfolios p...

Makespan and cost minimization are two important factors in project investment. This paper considers a multi-mode resource-constrained project scheduling problem with the objective of minimizing costs, subject to a deadline constraint. A number of studies have focused on minimizing makespan or resource availability cost with a specified deadline. This problem assumes a fixed cost for the availa...

In this paper we propose a robust genetic algorithm for the multi-mode resourceconstrained project scheduling problem. We present a new representation for the solutions to this problem, which includes an additional bit indicating the scheduling scheme used to construct the schedule, forward or backward. Moreover, we have developed new genetic operators which operate over this representation, ex...

A modified particle swarm optimization (PSO) approach is presented for the multi-mode resource-constrained scheduling problem of automated guided vehicle (AGV) tasks. Various constraints in process AGV system are analysed, and types quantities AGVs as allocable resources considered. The multiple-AGV combined distribution mode its impact on tasks also Finally, a task model established which obje...

The paper describes an algorithm for the generation of a general class of precedenceand resource-constrained scheduling problems. Easy and hard instances for the singleand multi-mode resource-constrained project scheduling problem are benchmarked by using the state of the art (branch-and-bound-) procedures. The strong impact of the chosen parametric characterization of the problems is shown via...

In the construction industry, it is of great importance for project managers (PM) to consider resource allocation arrangement problem based on different perspectives. this situation, management resources in becomes a challenge. Generally speaking, there are many objectives that need be optimized conflict with each other, including time, cost, and energy consumption (EC). This paper proposed mul...

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

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