Please use this identifier to cite or link to this item:
Title: A New Hybrid Scatter Search Algorithm for Solving the Flexible Job Shop Scheduling Problems
Authors: Külahlı, Safa
Engin, Orhan
Koç, İsmail
Issue Date: 2021
Abstract: Flexible job shop scheduling (FJSS) is derived by inheriting the features of the job-shop scheduling problem. FJSS has an extra routing sub-problem of the job-shop scheduling. FJSS is well known as an NP-hard problem in the literature. A new hybrid scatter search (HSS) method is proposed to solve the FJSS problem. The proposed HSS method is integrating a local and global search for generating an initial population. The performance of the proposed new HSS method is dependent on the selected parameters. These parameters are the size of the initial population and reference set; the number of subsets, reference set updating and population sub updating; reproduction, crossover, and mutation operators, and their ratio. A full factorial experimental design is made to determine the best values of control parameters and operators for the proposed new HSS to solve the FJSS problems. The proposed new HSS method is tested on a set of the well-known benchmark FJSS instances from the literature. The computational results indicated that the proposed new HSS is an effective method for solving the FJSS problems.
ISSN: 1305-130X
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
TR Dizin İndeksli Yayınlar Koleksiyonu / TR Dizin Indexed Publications Collections

Files in This Item:
File SizeFormat 
f2326b51-ac34-4ca8-854b-7a15bda5d46c.pdf692.44 kBAdobe PDFView/Open
Show full item record

CORE Recommender

Page view(s)

checked on Mar 20, 2023


checked on Mar 20, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.