Permutation flow shop scheduling problem (PFSSP), a NP-hard combinatorial optimization problem, has strong engineering background of finding the optimal processing sequence and time of jobs on machines under the constraints of resources. Recently, several approaches based on Particle Swarm Optimization (PSO) have been developed to solve the PFSSP, and the experimental results show that they are...

Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...

One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...