Bicriteria in Constrained n x 3 Flow Shop to Minimize the Rental Cost, Setup Time, Processing Time Each Associated with Probabilities Including Transportation Time and Job Block Criteria

摘要

This paper is an attempt to obtain an optimal solution for minimizing the bicriteria taken as minimizing the total rental cost of the machines subject to obtain the minimum makespan for constrained n jobs 3 machines flowshop scheduling problem in which the processing times, independent set up times each associated with probabilities including transportation time and job block concept. The two criteria of minimizing the maximum utilization of the machines or rental cost of machines and minimizing the maximum makespan are one of the combinations of our objective function reflecting the performance measure. The proposed method is very simple and easy to understand. A computer programme followed by a numerical illustration is given to clarify the algorithm.