We present a scheduling problem of the flow-shop type. We introduce a transportation system: robot or conveyor. This transportation system is also involved in machine loading and unloading. The studied workshop consists of two machines and a conveyor that must process a set of tasks. Tasks having just been executed wait for the conveyor to be transported. The objective is to determine a feasibl...

Production planning and scheduling play significant roles in manufacturing system operations and different techniques have been used to enhance their performance. Lot streaming has been studied for decades and is shown to accelerate production flow. This research deals with lot streaming in hybrid flow shops. Multiple products are processed in a multi-stage hybrid flow shop with non-identical m...

Simulated annealing (SA) heuristics have been successfully applied on a variety of complex optimization problems. This paper presents a new hybrid SA approach for the permutation ¯ow-shop scheduling (FSS) problem. FSS is known to be NP-hard, and thus the right way to proceed is through the use of heuristics techniques. The proposed approach combines the characteristics of a canonical SA procedu...

Minimum makespan scheduling of Flow Shops with Multiple Processors (FSMPs), also known as the Hybrid Flow Shop (HFS), is classified as NP complete. Thus, the FSMP largely depends on strong heuristics to develop solutions to makespan scheduling instances. An FSMP consists of m stages wherein each stage has one or more processors through which n jobs are scheduled. This paper presents a heuristic...

This paper presents a new approach of differential evolution to scheduling optimization problem. The developed approach is viewed as an enhanced varient of differential evolution, incorporation new child correction schemas and coversion schemas from differential to discrete domain. The heuristic is extensively evaluated with the scheduling problem of flow shop and compared with published result...

This article presents an intelligent heuristic search algorithm (IHSA*) for solving flow-shop problems with two or three machines and an arbitrary number of jobs. Following its initial development the algorithm has been modified in two different ways in order to reduce backtracking and to improve its performance. The first modification concerns the choice of the best heuristic function to use, ...

In flow shop scheduling there are m machines and n jobs, such that every job has to be processed on the machines in the fixed order 1, . . . , m. In the permutation flow shop problem, it is also required that each machine processes the set of all jobs in the same order. Formally, given n jobs along with their processing times on each machine, the goal is to compute a single permutation of the j...

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...