Solving n-Jobs, 3-Machines Constrained Flow Shop Scheduling Processing Time, Setup Time Each Associated with Probabilities Including Job-Block Criteria

Abstract

This paper is pertain to heuristic technique for n-jobs, 3-machines flowshop scheduling problem in which   processing times and setup times are associated with their respective probabilities involving transportation time, break down interval and job block criteria is taken in to account. Further jobs are attached with weights to indicate their relative importance. The proposed method is very easy to understand and also provide an important tool for decision makers. A numerical illustration followed by a computer programme is also given to clarify the algorithm.

Keywords: Flow shop scheduling, Processing time, Setup time, Transportation time, Break down, Weights of job, Job block.