Heuristics for N Job M Machine Flowshop Batch Processing With Breakdown Times

P V Senthiil; V S Mirudhuneka

Abstract: Flow shop scheduling is a typical combinatorial optimization problem, where each job has to go through the processing in each and every machine on the shop floor. Here considered the basic form of flow shop scheduling i.e. Two machine Flow Shop batch processing with type two transportation i.e. transportation of jobs from machine shop to dispatch unit. For this problem we investigate the optimal property and propose an algorithm which includes Johnson?s algorithm. After the sequences of jobs are formed we implement breakdown time at two intervals and form another solution. This problem is extended to Njob Mmachine problem to find optimal solution. The performance measure taken here is makes pan and mean weighted flow time of jobs. This type of problem comes under NP hard category.

Keywords: Flowshop scheduling, Breakdown times, NP hard