Rule based heuristic approach for minimizing total flow time in permutation flow shop scheduling

Original scientific paperProduction scheduling plays a vital role in the planning and operation of a manufacturing system.Better scheduling system has a significant impact on cost reduction and minimum work-in-process inventory.This work considers the problem of scheduling n/m/F/ΣCi using Decision Tree (DT) algorithm.Since this problem is known to be strongly NP-hard, this work proposes heuristic based methodology to solve it.The advantages of DT's are that the dispatching rule is in the form of If-then else rules which are easily understandable by the shop floor people.The proposed approach is tested on benchmark problems available in the literature and compared.The proposed work is a complement to the traditional methods.Keywords: decision tree algorithm and heuristics; flow shop scheduling; total flow time Na pravilu zasnovan heuristički pristup smanjenju ukupnog protoka vremena kod programiranja radova u permutacijskoj protočnoj radionici Izvorni znanstveni članak Programiranje radova u proizvodnji je od bitne važnosti u planiranju i funkcioniranju proizvodnog sustava.Unaprijeđeni sustav programiranja značajno utječe na smanjenje troškova i minimalni broj radnih postupaka.U ovom se radu razmatra problem programiranja n/m/F/ΣCi primjenom Decision Tree (DT) algoritma.Budući da je ovaj problem poznat kao veoma NP-hard, u radu se za njegovo rješenje predlaže metodologija temeljena na heuristici.Prednosti DT-a su u tome što je pravilo otpreme u obliku If-then else pravila koja radnici u radionici lako razumiju.Predloženi je pristup testiran na repernim problemima dostupnim u literaturi i uspoređen.Predloženi rad je dodatak tradicionalnim metodama.