The hybrid or flexible flowshop problem is a generalization of the flowshop in such a way
that every job can be processed by one among several machines on each machine stage. In …

In this paper, we propose 260 randomly generated scheduling problems whose size is
greater than that of the rare examples published. Such sizes correspond to real dimensions …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

In this paper the best heuristic methods known up to now are compared to solve the flow
shop sequencing problem and we improve the complexity of the best one. Next, this problem …

In this paper, we propose a branch and bound method for solving the job-shop problem. It is
based on one-machine scheduling problems and is made more efficient by several …

Constraint Programming is a problem-solving paradigm that establishes a clear distinction
between two pivotal aspects of a problem:(1) a precise definition of the constraints that …

The efficiency of recent enumerative methods for the job-shop problem crucially depends on
immediate selections of disjunctive constraints leading to adjustment of heads and tails. This …

In this paper, we present a polynomial algorithm for optimally adjusting heads and tails in
the job shop problem. This algorithm is based on Jackson's preemptive schedule for the one …

The aim of this paper is to present a new branch and bound method for solving the Multi-
Processor Flow-Shop. This method is based on the relaxation of the initial problem to m …

This paper presents a set of satisfiability tests and time‐bound adjustmentalgorithms that
can be applied to cumulative scheduling problems. An instance of thecumulative scheduling …