Optimal Three Stage Flow Shop Scheduling in which Processing Time, Set Up Time, Each Associated With Probabilities Including Transportation Time and Jobs in a String of Disjoint Job-Blocks

Abstract

The paper deals with n jobs, 3 machines flow shop production scheduling in which processing times and set up times are associated with their respective probabilities involving transportation time and jobs are processed in two disjoint job blocks in a string. A heuristic method with an objective to minimize the total time elapsed time/idle time of the jobs/machines is discussed. A computer program followed by numerical illustration is given to clarify the algorithm.

Keywords: Disjoint job-block, Set up time, Processing time, Transportation time, Equivalent job