Sameer SharmaDeepak GuptaSeemaKewal Krishan Nailwal2026-02-142026-02-142017ISSN 0973-1768http://davjalandhar.ndl.gov.in/handle/123456789/206The majority of research on scheduling assumes setup times negligible or part of the processing time. In this paper, a bicriteria scheduling with a sequence dependent setup time (SDST) and job block criteria is considered. The objective function of the problem is minimization of the total completion time and the rental cost of machines taken on rent under a specified rental policy. The processing time of attributes on these machines are associated with probabilities. The scheduling problems considering either of these objectives are NP-hard, so exact optimization techniques are impractical. A heuristic algorithm to find optimal or near optimal sequence of jobs processing is The performance of the proposed algorithm is justified by bi objective in-out flow table of jobs.enArticle