A constraint programming based branch-and-bound algorithm is embedded into a memetic algorithm to solve multiprocessor task scheduling problem in hybrid flow-shop environments. Both methods are able to solve the problem by themselves but the combination of the two allows to solve larger problem in a shorter amount of time. Computational experiments are conducted on a large set of instances and ...

In a shop floor of the industry, the routings which are based upon the jobs that need to be processed on different machines are one among the major activities and therefore the resource requirements are not based upon the quantity as in a flow shop but rather the routings for the products being produced. However, both job shop and flow shop production cope with a scheduling problem to find a fe...

This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present an adaptation of the Climbing Depth-bounded Discrepancy Search (CDDS) method based on Johnson’s rule and on ...

Despite the large amount of work performed on flow-shop scheduling most of the research has concentrated on the permutation problem in which passing is not allowed. In this work the general flow-shop problem, in which passing is allowed, is dealt with as it is considered to be a better representation of flowshop instances. The evolutionary techniques of scatter search (SS) and its generalised f...