Multistage Bicriteria Scheduling Problems: Minimizing Rental Cost with Minimum Makespan.

This paper is an attempt to study a bicriteria in n jobs m machines flow shop scheduling problems under a specified rental policy in which processing times are associated with probabilities. We consider bi-criteria scheduling problems involving minimization of rental cost of the machines with minimum makespan. A heuristic approach to find the best possible sequence by optimizing both the criteria's simultaneously is discussed. The effectiveness of the heuristic approach is justified by mathematical proofs and bi-criteria In- Out flow table of the jobs. A computer programme followed by a numerical illustration is given to substantiate the algorithm. [ABSTRACT FROM AUTHOR]