We consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. In this problem, a project consists of a set of sequential phases such that ...

The resource-constrained project scheduling problem is a notoriously difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms to find ...

This paper considers a project scheduling problem with the objective of minimizing resource availability costs required to execute the activities in a project by a given project deadline. The project contains activities ...

In this paper, we develop a metaheuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type ...

A fundamental challenge associated with research or new product development projects is identifying that innovative activity that will deliver success. In such projects, it is typically the case that innovative breakthroughs ...

In this paper, we consider a scheduling problem in a new product development

project. Each research and development project consists of a set of activities in

which each activity may be executed by several ...

This paper deals with project scheduling problem with resource leveling objective function where precedence relations among activities are prescribed. We develop a dedicated path-relinking metaheuristic algorithm to tackle ...

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