OPTIMIZING THE PERMUTATION FLOWSHOP SCHEDULING PROBLEM USING THE SCATTER SEARCH METHOD
Current Language EN
English English Türkçe Türkçe Español Español Português Português Pусский Pусский Filipino Filipino Tiếng Việt Tiếng Việt हिन्दी हिन्दी العربية العربية বাংলা বাংলা Deutsch Deutsch 中文 中文

OPTIMIZING THE PERMUTATION FLOWSHOP SCHEDULING PROBLEM USING THE SCATTER SEARCH METHOD

EREN, Uğur Sinan; GÜLER, Ezgi; ŞAHİN, Yıldız
Bartın University International Journal of Natural and Applied Sciences 2022
26
eren2022optimizing

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.

Keywords

Problem scheduling scatter method optimizing search using permutation flowshop

Access

DOI:
10.55930/jonas.1121763
URL:
https://doi.org/10.55930/jonas.1121763

Citation

ID: 283499
Ref Key: eren2022optimizing
Use this key to autocite in SciMatic or Thesis Manager

References

References

No Bibliography

Blockchain Verification

Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
283499
Unique Identifier:
10.55930/jonas.1121763
Network:
Scimatic Chain (ID: 481)
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
5/5
Creates 1,000,000 NFT tokens for this article
Token Features:
  • ERC-1155 Standard NFT
  • 1 Million Supply per Article
  • Transferable via MetaMask
  • Permanent Blockchain Record
Blockchain QR Code
Scan with Saymatik Web3.0 Wallet
Gas fees required in SCI Coins
Buy SCI

Saymatik Web3.0 Wallet

Google Play
App Store