in this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. in this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. in other words, there is a dictated ready date as well as a d...

Projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. An integer programming model is formulated for the project portfolio selection and scheduling.Two heuristic algorithms, genetic algorithm (GA) and simulated annealing (SA), are presented to solve the problem. Results of cal...

This is the second part of a paper considering the multi-mode resource-constrained project scheduling problem. The rst part presents an exact solution procedure for solving several variants of the multi-mode resource-constrained project scheduling problem including the commonly known makespan minimization problem. The basic scheme is enhanced by powerful search tree reduction schemes considerab...

Highway construction projects are one of the most important construction projects in the world. Therefore predicting the time of these kinds of projects is important. Basically highway projects are including few activities which are repeating along the horizontal direction. One of the best methods for scheduling these types of projects is linear scheduling method. The repetitive nature of the h...

Project scheduling with limited resources is a challenging management problem that is of immense importance to both practitioners and researchers. This problem is known to be NP-hard even under the simplifying assumptions of single renewable resource constraint, its constant availability over time and minimization of makespan as objective. This paper presents an improved Genetic Algorithm (GA) ...

The integration of machine learning methods into meta-heuristic search techniques is currently an important topic in the field of combinatorial optimisation. It is often referred to as intelligent optimisation [1]. Learning has the potential of helping the search process in several ways. Searching for instance, can become more generic when online learning and automation mechanisms tune the crit...

This paper addresses a general class of nonpreemptive resource-constrained project scheduling problems in which activity durations are discrete functions of committed renewable and nonrenewable resources. We provide a well known 0±1 problem formulation and stress the importance of themodel by giving applications within production and operationsmanagement. Furthermore, we prove that the feasibil...