Please use this identifier to cite or link to this item:
|A fuzzy logic based methodology for multi-objective hybrid flow shop scheduling with multi-processor tasks problems and solving with an efficient genetic algorithm 
|efficient genetic algorithm; fuzzy due date; fuzzy processing time; Hybrid flow shop scheduling; multi-processor tasks problems; simulated annealing
Computer circuits; Fuzzy logic; Genetic algorithms; Machine shop practice; Multiprocessing systems; Efficient genetic algorithms; Fuzzy due-date; Fuzzy processing time; Fuzzy-Logic; Hybrid flow shop scheduling; Logic-based methodology; Multi objective; Multi-processor task problem; Multiprocessor tasks; Scheduling problem; Simulated annealing
|IOS Press BV
|In the conventional scheduling problem, the parameters such as the processing time for each job and due dates are usually assumed to be known exactly, but in many real-world applications, these parameters may very dynamically due to human factors or operating faults. During the last decade, several works on scheduling problems have used a fuzzy approach including either uncertain or imprecise data. A fuzzy logic based tool for multi-objective Hybrid Flow-shop Scheduling with Multi-processor Tasks (HFSMT) problem is presented in this paper. In this study, HFSMT problems with a fuzzy processing time and a fuzzy due date are formulated, taking Oǧuz and Ercan's benchmark problems in the literature into account. Fuzzy HFSMT problems are formulated by three-objectives: the first is to maximize the minimum agreement index and the second is to maximize the average agreement index, and the third is to minimize the maximum fuzzy completion time. An efficient genetic algorithm(GA) is proposed to solve the formulated fuzzy HFSMT problems. The feasibility and effectiveness of the proposed method are demonstrated by comparing it with the simulated annealing (SA) algorithm in the literature. © 2022 - IOS Press. All rights reserved.
|Appears in Collections:
|Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections
Show full item record
checked on Mar 4, 2024
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.