• n x 2 Specially Structured Flow Shop Scheduling With Transportation Time to Minimize the Rental Cost of Machines

Abstract

The objective of this paper is to develop a heuristic algorithm to minimize the utilization time and hence the rental cost of machines in n–jobs, 2–machines specially structured flow shop scheduling under specified rental policy in which the processing times of the machines are associated with their respective probabilities including the significant transportation time of the jobs. The processing time of the jobs are not completely random, but bear a well defined relationship to one another. A computer programme followed by a numerical illustration is given to justify the algorithm.