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

摘要

This paper deals with bicriteria in n-jobs, 3-machines flowshop scheduling problem in which the processing times are associated with probabilities including transportation time and job block criteria. The objective of the study is to obtain an optimal solution for minimizing the bicriteria taken as minimizing the total rental cost of the machines subject to obtains the minimum makespan. A heuristic approach method to find optimal or near optimal sequence has been discussed. A computer programme followed by a numerical illustration is give to clarify the algorithm.