This paper presents an experimental investigation of the Sounds of Silence (SoS) harmony search metaheuristic for the multi-mode resource-constrained project scheduling problem (MRCPSP) using a pre-optimized starting repertoire. The presented algorithm is based on the time oriented version of the SoS harmony search metaheuristic developed by Csébfalvi et al. [1] for the single-mode resource-con...

In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...

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

a r t i c l e i n f o Keywords: Multi-mode scheduling Ant colony optimization Renewable and nonrenewable resource constraints Construction projects An ant colony optimization (ACO)-based methodology for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) considering both renewable and nonrenewable resources is presented. With regard to the MRCPSP solution consisting ...

Globalisation in large engineering, procurement and construction companies has lead in many cases to the establishment of a number of global centres for activities such as process design, detail design, procurement and fabrication. A company with a number of such resources then faces the problem of maintaining a high percentage utilisation in each of these resource locations, multiple projects ...

In this paper, we study a resource-constrained project scheduling problem in which a set of project activities have due dates. If the finish time of each one of these activities is not equal to its due date, an earliness or a tardiness cost exists for each tardy or early period. The objective is to minimize the sum of discounted weighted earliness-tardiness penalty costs of these activities. Sc...

When heavy rain strikes Taiwan, it always results in cracks road pavement, and damages arising from potholes. Tremendously compromising safety, users may have fatal accidents caused by untimely repair actions. The maintenance department needs to take the responsibilities for sections form of inspections faces decision about how properly allocate available resources pavement immediately. perform...

A new destructive lower bound for the resource-constrained project scheduling problem is presented. Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacity of each resource type is limited. Furthermore, nish-start precedence relations between the activities ...

Justification is a simple technique which was presented for improving the quality of schedules generated with algorithms for solving RCPSPs. Few researches implemented justification with meta-heuristics and proved that algorithms optimization results using justification outperforms the performance of the same algorithms without justification. In this paper, Stacking Justification is presented f...