Akademik Veri Yönetim Sistemi
Business and Management Studies: An International Journal, cilt.7, sa.3, ss.14-25, 2019 (Hakemli Dergi)
A variant of the hybrid flow shop (HFS) problem considering missing operations, transportation times and sequence-dependent setup times is investigated. Heuristic algorithms along with dispatching rulesand dispatching rules are used to solve the given problem. The objective function is minimization makespan. The computational experimets are conducted to test the performance of the heuristic algoirthms and dispatching rules. In order to depict the effect of the factors: number of jobs, number of machines, number of production stages, level of missing operations on the result, the additiol experimentes are carried out. The result of NEH heuristic with SPTF rule outperformed other heuristics for the proposed HFS problems.