Flow Shop Scheduling in Which Processing Time Connected with Probabilities and Job Delay Due to Maintenance for M * N Machine

摘要

The objective of the paper is to obtain optimal or close to optimal makespan for m * n sequential problem, wherein processing time connected with their weighted probabilities. In this paper, we analyse the processing time interval of the job may or may not have the maintenance activity and breakdown. We construct a job sequence by heuristic method and optimal makespan and also obtained mean flow time. The method is illustrated by using some numerical examples.