Admissions Open
Admissions Open
The role of production scheduling is indispensible in the environment of manufacturing and service industries. Continuous machine operation or No-idle time on machines refers to the environment of production scheduling in which the machines once started work continuously to process all the jobs from first to last. The classical problem in flow shop scheduling is the minimization of makespan under different environments. The problem of makespan minimization in flow shop scheduling under continuous machine operation or no-idle situation is NP-hard. The heuristic proposed in this paper works on the principle of basic insertion to solve the flow shop problem for processing n-jobs on m-machines with continuous machine operation. The proposed constructive heuristic is compared with important heuristics solving no-idle problem that exists in flow shop literature. The computational result on Taillard‟s benchmark problems shows the superiority of the heuristic proposed over other heuristics.