This paper is survey of hybrid flow shop scheduling problems. An HFS scheduling problem is a classical flow-shop in which parallel machines are available to perform the same operation. Most real world scheduling problems are NP-hard in nature. The hybrid flow shop scheduling problems have received considerable research attention. The several optimization and heuristic solution procedures are av...

We propose a constructive heuristic for the well known NP-hard problem of no-wait flow shop scheduling. It is based on the assumption that the priority of a job in the sequence is given by the sum of its processing times on the bottleneck machine(s) for selecting the initial sequence of jobs. The computational experimentations show that there is a significant improvement in solution quality ove...

A no-wait robotic cell is an automated ow shop in which a robot is used to move the parts from a machine to the next. Parts are not allowed to wait. We analyze the complexity of the part sequencing problem in a robotic cell with three machines, for di erent periodical patterns of robot moves, when the objective is productivity maximization. c © 2000 Elsevier Science B.V. All rights reserved.

Genetic algorithms are a very popular heuristic which have been successfully applied to many optimization problems within the last 30 years. In this chapter, we give a survey on some genetic algorithms for shop scheduling problems. In a shop scheduling problem, a set of jobs has to be processed on a set of machines such that a specific optimization criterion is satisfied. According to the restr...

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule isNP -hard in the s...