We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-objective analysis, namely simultaneous optimization of the makespan and the reliability. We show that this problem can not be approximated by a single schedule. A similar problem has already been studied leading to a...

This paper integrates multi-project scheduling and linear scheduling concepts. Since the problem is combinatorial, a two-stage heuristic solution-finding procedure is used to model the problem with multiple resource constraints. Simulated annealing is utilized as a searching engine in the second stage to find the probable optimized solution. The first stage is slightly different from the other ...

Recently, multi-project management has become prevalent. However, the execution of multi-project is subject to considerable uncertainty (such as the addition of new projects or the removal of withdrawn projects) that may lead to schedule disruptions. This study adopts an event-driven approach whereby all projects are grouped as a dynamic network which will be modified and rescheduled in respons...