This title presents a large variety of models and algorithms dedicated to the resource-
constrained project scheduling problem (RCPSP), which aims at scheduling at minimal …

This paper addresses the problem of scheduling independent jobs with release dates on
identical parallel machines with a single server. The goal consists in minimizing the …

We address a generalization of the classical multiprocessor scheduling problem with non
simultaneous machine availability times, release dates, and delivery times. We develop new …

Several algorithms for finding a lower bound on the makespan for the Resource Constrained
Project Scheduling Problem (RCPSP) were proposed in the literature. However, fast …

We review the most recent lower bounds for the makespan minimization variant of the
Resource Constrained Project Scheduling Problem. Lower bounds are either based on …

The aim of this paper is to propose efficient algorithms for computing the energetic lower
bounds of the cumulative sheduling problem. So we have to schedule in a minimal …

The scheduling of parallel machines is a well-known problem in many companies.
Nevertheless, not always all the jobs can be manufactured in any machine and the eligibility …

This paper constitutes a step forward in resource-constrained scheduling theory. We
introduce an O (n× α (n)× log⁡ n) checker for energetic reasoning (ER), where α (n) is …

We address the makespan minimization for parallel identical machines subject to heads and
tails. This problem is NP-hard in the strong sense. We show that the worst-case performance …

We consider the problem of minimizing makespan on identical parallel machines subject to
release dates and delivery times. We present several new feasibility tests and adjustment …