A New Hybrid Scatter Search Method for Solving the Flexible Job Shop Scheduling Problems.

Autor: Külahlı, Safa, Engin, Orhan, Koç, İsmail
Předmět:
Zdroj: Celal Bayar University Journal of Science; 2021, Vol. 17 Issue 4, p347-359, 13p
Abstrakt: Flexible job shop scheduling (FJSS) is derived by inheriting the features of the job-shop scheduling problem. It 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 method is proposed to solve the FJSS problem. The objective function of the proposed hybrid scatter search method is minimizing the maximum completion time (Cmax) for FJSS problems. The proposed hybrid scatter search method is integrating a local and global search for generating an initial population. The performance of the proposed new hybrid scatter search 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 hybrid scatter search to solve the FJSS problems. The proposed new hybrid scatter search method is tested on a set of the well-known benchmark flexible job shop scheduling instances from the literature. The computational results indicated that the proposed new hybrid scatter search is an effective method for solving the FJSS problems. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index