Non- Avaliability Of The Machines In Two- Stage Flow -Shop Scheduling ,Processing Time Associated With Probabilities Including Transportation Time And Job Block Criteria To Minimize The Hiring Cost

Abstract

This paper deals with a herustic algorithm to minimize the rental cost of the machines  for 2- stage flow shop scheduling problem under specified rental policy in which processing times are associated with their respective probabilities with break down interval and transportation time. Further ,the equivalent job block criteria is being considered. The objective of the paper is to find an algorithm to minimize the rental cost of the machines under specified rental policy with break down interval, transportation time  and job block criteria. The purposed algorithm is easy to understand and provide an important tool for the decision makers.