Specially Structured n-Job 2-machine Flow Shop Scheduling Model With Break

This Paper deals with a specially structured n-jobs 2- machine flow shop scheduling problem under specified rental policy in which processing times are associated with their respective probabilities including interval and weightage of job. Further jobs are attached with weights to indicate their relative importance. The objective is to find an algorithm to minimize the rental cost of the machine under Specified rental policy. The method is illustrated with the help of numerical example.