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...
