Modeling and Solving the Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times by Firefly Algorithm (Case Study: Automotive Industry)

Progress in today’s modern industry requires a lot of knowledge, one of which is scheduling. Flow-shop scheduling is one of the most widely used optimization problems. In this research, considering the importance of simultaneously order in different stages of production in the automotive industry, a...

Full description

Saved in:
Bibliographic Details
Main Authors: Mustafa Mohammadi, Seyed Ahmad Shayannia, Mohamadreza Lotfi, Javad Rezaeian Zaidi
Format: Article
Language:English
Published: Wiley 2022-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2022/8962052
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850236651065835520
author Mustafa Mohammadi
Seyed Ahmad Shayannia
Mohamadreza Lotfi
Javad Rezaeian Zaidi
author_facet Mustafa Mohammadi
Seyed Ahmad Shayannia
Mohamadreza Lotfi
Javad Rezaeian Zaidi
author_sort Mustafa Mohammadi
collection DOAJ
description Progress in today’s modern industry requires a lot of knowledge, one of which is scheduling. Flow-shop scheduling is one of the most widely used optimization problems. In this research, considering the importance of simultaneously order in different stages of production in the automotive industry, and also in order to make the problem more practical, we have investigated the problem of scheduling the flow-shop, taking into account the lead time and the costs of each order. Due to the fact that in most research studies, the lead time and costs of an order have been ignored because they made it difficult to find the initial solution to the problem. In this research, using the firefly meta-heuristic method, a suitable solution is provided to overcome this problem. Therefore, considered objective function is to minimize the total completion time. Absolute relative error (ARE) has been used to validate the model in a deterministic and meta-heuristic mode. According to the ARE result, the difference in the results between the two algorithms is negligible. Then, the sequence results are determined according to the desired algorithm for 5 tasks considered for automobile parts. The results show that the completion time of job 1 is 1397.85; job 2 is 771.44; job 3 is 608.65; job 4 is 1163.87; and job 5 is 479.45.
format Article
id doaj-art-11eabe951c2f4e7caac4c91b7bfa3c3b
institution OA Journals
issn 1607-887X
language English
publishDate 2022-01-01
publisher Wiley
record_format Article
series Discrete Dynamics in Nature and Society
spelling doaj-art-11eabe951c2f4e7caac4c91b7bfa3c3b2025-08-20T02:01:55ZengWileyDiscrete Dynamics in Nature and Society1607-887X2022-01-01202210.1155/2022/8962052Modeling and Solving the Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times by Firefly Algorithm (Case Study: Automotive Industry)Mustafa Mohammadi0Seyed Ahmad Shayannia1Mohamadreza Lotfi2Javad Rezaeian Zaidi3Department of Industrial ManagementDepartment of Industrial ManagementDepartment of Industrial EngineeringDepartment of Industrial EngineeringProgress in today’s modern industry requires a lot of knowledge, one of which is scheduling. Flow-shop scheduling is one of the most widely used optimization problems. In this research, considering the importance of simultaneously order in different stages of production in the automotive industry, and also in order to make the problem more practical, we have investigated the problem of scheduling the flow-shop, taking into account the lead time and the costs of each order. Due to the fact that in most research studies, the lead time and costs of an order have been ignored because they made it difficult to find the initial solution to the problem. In this research, using the firefly meta-heuristic method, a suitable solution is provided to overcome this problem. Therefore, considered objective function is to minimize the total completion time. Absolute relative error (ARE) has been used to validate the model in a deterministic and meta-heuristic mode. According to the ARE result, the difference in the results between the two algorithms is negligible. Then, the sequence results are determined according to the desired algorithm for 5 tasks considered for automobile parts. The results show that the completion time of job 1 is 1397.85; job 2 is 771.44; job 3 is 608.65; job 4 is 1163.87; and job 5 is 479.45.http://dx.doi.org/10.1155/2022/8962052
spellingShingle Mustafa Mohammadi
Seyed Ahmad Shayannia
Mohamadreza Lotfi
Javad Rezaeian Zaidi
Modeling and Solving the Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times by Firefly Algorithm (Case Study: Automotive Industry)
Discrete Dynamics in Nature and Society
title Modeling and Solving the Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times by Firefly Algorithm (Case Study: Automotive Industry)
title_full Modeling and Solving the Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times by Firefly Algorithm (Case Study: Automotive Industry)
title_fullStr Modeling and Solving the Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times by Firefly Algorithm (Case Study: Automotive Industry)
title_full_unstemmed Modeling and Solving the Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times by Firefly Algorithm (Case Study: Automotive Industry)
title_short Modeling and Solving the Flow-Shop Scheduling Problem with Sequence-Dependent Setup Times by Firefly Algorithm (Case Study: Automotive Industry)
title_sort modeling and solving the flow shop scheduling problem with sequence dependent setup times by firefly algorithm case study automotive industry
url http://dx.doi.org/10.1155/2022/8962052
work_keys_str_mv AT mustafamohammadi modelingandsolvingtheflowshopschedulingproblemwithsequencedependentsetuptimesbyfireflyalgorithmcasestudyautomotiveindustry
AT seyedahmadshayannia modelingandsolvingtheflowshopschedulingproblemwithsequencedependentsetuptimesbyfireflyalgorithmcasestudyautomotiveindustry
AT mohamadrezalotfi modelingandsolvingtheflowshopschedulingproblemwithsequencedependentsetuptimesbyfireflyalgorithmcasestudyautomotiveindustry
AT javadrezaeianzaidi modelingandsolvingtheflowshopschedulingproblemwithsequencedependentsetuptimesbyfireflyalgorithmcasestudyautomotiveindustry