Skoči na glavni sadržaj

Izvorni znanstveni članak

https://doi.org/10.17559/TV-20130704132725

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

Balasundaram Rathinam orcid id orcid.org/0000-0002-3826-7507 ; Department of Mechanical Engineering, ShriAngalamman College of Engineering and Technology, Siruganoor, Tiruchirappalli, Tamilnadu, Pin – 621 105, India
Kannan Govindan ; Department of Business and Economics, University of Southern Denmark, 5230 Odense, Denmark
Baskar Neelakandan ; Department of Mechanical Engineering, M. A. M. College of Engineering, Siruganoor, Tiruchirappalli, Tamilnadu, India
Siva Sankar Raghavan ; Caterpillar Inc., Engineering Design Center, Chennai, Tamilnadu, India


Puni tekst: hrvatski pdf 1.088 Kb

str. 25-32

preuzimanja: 1.379

citiraj

Puni tekst: engleski pdf 1.088 Kb

str. 25-32

preuzimanja: 626

citiraj


Sažetak

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.

Ključne riječi

decision tree algorithm and heuristics; flow shop scheduling; total flow time

Hrčak ID:

135060

URI

https://hrcak.srce.hr/135060

Datum izdavanja:

23.2.2015.

Podaci na drugim jezicima: hrvatski

Posjeta: 3.307 *