Constrained Flow Shop Scheduling with n-Jobs, 3-Machines, Processing Time Associated with Probability involving Transportation Time, Breakdown Interval and Weightage of Jobs

Abstract

This paper is an attempt to find simple heuristic algorithm for n jobs, 3 machines flow shop scheduling problem in which processing times are associated with probabilities involving transportation time and break down interval. Further jobs are attached with weights to indicate their relative importance. A simple heuristic approach to find optimal or near optimal sequence minimizing the total elapsed time whenever mean weighted production flow time is taken into consideration. The proposed method is very easy to understand and, also provide an important tool for the decision makers. A computer programme followed by a numerical illustration is also given to clarify the algorithm.

Keywords: Flow shop scheduling, Processing time, Transportation time, Breakdown interval, Weights of job, Optimal sequence