A Genetic Algorithm for a Real-Life Scheduling Problem in the Valve Industry
Loading...
Date
2023
Authors
Gamze Esma Bektaş
Ege Cömert
Ezgi Sena Yılmaz
Melis Tan Tacoglu
Önder Bulut
Burçin Kasap
Pınar Aydın
Mustafa İnceoğlu
Eda Badak
Hasan Şenol
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Science and Business Media Deutschland GmbH
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
In this paper a real-life flexible job shop scheduling problem (FJSSP) for valve production having sequence-dependent setup times and machine unavailability constraints is studied. The aim is to minimize the weighted sum of earliness and tardiness of the scheduled jobs. Since this problem is known to be in the NP-Hard class we develop a Genetic Algorithm (GA) enriched with Iterated Local Search (ILS) to obtain near-optimal solutions for both the company’s problem and also for much larger instances in a reasonable run time. For the real-life implementation we develop a user-friendly Decision Support System (DSS) consisting of databases for the inputs a GA algorithm embedded as Python code and a Gantt Chart representation of solutions as the output. © 2023 Elsevier B.V. All rights reserved.
Description
Keywords
Decision Support System, Flexible Job Shop Problem, Genetic Algorithm, Iterative Local Search, Machine Unavailability, Sequence-dependent Setup Times, Weighted Earliness And Tardiness, Artificial Intelligence, Decision Support Systems, Iterative Methods, Job Shop Scheduling, Local Search (optimization), Earliness And Tardiness, Flexible Job-shop Problem, Flexible Job-shop Scheduling Problem, Iterative Local Searches, Machine Unavailability, Scheduling Problem, Sequence-dependent Setup Time, Unavailability Constraint, Weighted Earliness And Tardiness, Weighted Sum, Genetic Algorithms, Artificial intelligence, Decision support systems, Iterative methods, Job shop scheduling, Local search (optimization), Earliness and tardiness, Flexible job-shop problem, Flexible job-shop scheduling problem, Iterative local searches, Machine unavailability, Scheduling problem, Sequence-dependent setup time, Unavailability constraint, Weighted earliness and tardiness, Weighted Sum, Genetic algorithms, Genetic Algorithm, Decision Support System, Machine Unavailability, Flexible Job Shop Problem, Weighted Earliness and Tardiness, Iterative Local Search, Sequence-Dependent Setup Times
Fields of Science
Citation
WoS Q
Scopus Q
OpenCitations Citation Count
N/A
Source
22nd International Symposium for Production Research ISPR 2022
Volume
Issue
Start Page
697
End Page
710
Collections
PlumX Metrics
Citations
Scopus : 0
Captures
Mendeley Readers : 2
Google Scholar™
