Finding realistic schedules for flexible job shop problems has attracted many researchers
recently due to its nondeterministic polynomial time (NP) hardness. In this paper, we present …

We present an exact branch-and-bound algorithm for the two-stage hybrid flow shop
problem with multiple identical machines in each stage. The objective is to schedule a set of …

We address the problem of minimizing makespan on identical parallel machines. We
propose new lower bounding strategies and heuristics for this fundamental scheduling …

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 …

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 …

We propose an exact branch-and-bound algorithm for the problem of maximizing the
minimum machine completion time on identical parallel machines. The proposed algorithm …

This paper investigates how to adapt some discrepancy-based search methods to solve
Hybrid Flow Shop (HFS) problems in which each stage consists of several identical …

In this paper, we investigate fast lower bounds for the deterministic one-dimensional bin
packing problem. We present two variants of a general lifting procedure which aims at …