Bicriteria in n x 3 Flow Shop Scheduling under Specified Rental Policy, Processing Time Associated with Probabilities Including Transportation Time, Weightage and Job Block Criteria

Abstract

This paper is an attempt to find a heuristic algorithm for bicriteria in n-jobs, 3-machines flowshop scheduling problem in which the processing times are associated with probabilities including transportation time and job block concept.  Further jobs are attached with weights to indicate their relative importance. The objective of the study is to obtain an optimal solution for minimising the bicriteria taken as minimising the total rental cost of the machines subject to obtains the minimum makespan. The two criteria of minimising the maximum utilisation of the machines or rental cost of machines and minimising the maximum makespan are one of the combinations of our objective function reflecting the performance measure. A computer programme followed by a numerical illustration is give to clarify the algorithm.