Rule based heuristic approach for minimizing total flow time in permutation flow shop scheduling
| Autor: | Siva Sankar Raghavan, Balasundaram Rathinam, Baskar Neelakandan, Kannan Govindan |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: |
Mathematical optimization
Total flow Computer science General Engineering Scheduling (production processes) Decision tree Total flow time Rule-based system Flow shop scheduling Scheduling system Manufacturing systems Cost reduction Decision tree algorithm and heuristics decision tree algoritam i heuristika programiranje radova u protočnoj radionici ukupni protok vremena decision tree algorithm and heuristics flow shop scheduling total flow time |
| Zdroj: | Tehnički vjesnik Volume 22 Issue 1 Rathinam, B, Govindan, K, Neelakandan, B & Raghavan, S S 2015, ' Rule based heuristic approach for minimizing total flow time in permutation flow shop scheduling ', Tehnicki vjesnik, vol. 22, no. 1, pp. 25-32 . https://doi.org/10.17559/TV-20130704132725 |
| ISSN: | 1848-6339 1330-3651 |
| Popis: | 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. Production 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|