OPTIMIZING THE PERMUTATION FLOWSHOP SCHEDULING PROBLEM USING THE SCATTER SEARCH METHOD

Clicks: 42
ID: 283499
2022
Free PDF
Article Quality & Performance Metrics
Overall Quality Improving Quality
0.0 /100
Combines engagement data with AI-assessed academic quality
AI Quality Assessment
Not analyzed
Abstract
Scheduling is the process of optimizing limited resources, depending on the objectives. Scheduling problems are one of the decision-making problems that play a critical role in production and service systems. Continuing production regularly and systematically is an important issue for production planners. Permutation flow shop scheduling, which is a sub-branch of production scheduling, is defined as “n” jobs being processed simultaneously on “m” machines. Permutation flow shop scheduling problems are in the complex and difficult problem class. Many metaheuristic methods have been proposed to solve such problems. In this study, the Scatter Search method, which is one of the population-based evolutionary methods of metaheuristic methods, was used to solve the permutation flow shop scheduling problem. The scatter search method was analysed with the algorithm prepared on JavaScript programming language. With the scatter search, the total completion time of the jobs was minimized and the effectiveness of the method was tested on the problem groups frequently used in the literature.
Reference Key
eren2022optimizing Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors EREN, Uğur Sinan; GÜLER, Ezgi; ŞAHİN, Yıldız
Journal Bartın University International Journal of Natural and Applied Sciences
Year 2022
DOI
10.55930/jonas.1121763
URL
https://doi.org/10.55930/jonas.1121763
Keywords
Problem scheduling scatter method optimizing search using permutation flowshop

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.