Meta-Heuristic Algorithms for Two-Stage Assembly Flow Shop Scheduling Problem with Considering Setup Times of Machines
This paper deals with the problem of two-stage assembly flow shop scheduling with considering sequence-independent setup times .The objective is to minimize totalcompletion times of all orders. In this problem, there are several orders for one type of product. Each ordered product is formed of sever...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Allameh Tabataba'i University Press
2020-09-01
|
| Series: | Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī |
| Subjects: | |
| Online Access: | https://jims.atu.ac.ir/article_11744_d36baf6291c9fbceec5bd1f0a19ae30d.pdf |
| _version_ | 1797367658418536448 |
|---|---|
| author | Mehdi Yazdani |
| author_facet | Mehdi Yazdani |
| author_sort | Mehdi Yazdani |
| collection | DOAJ |
| description | This paper deals with the problem of two-stage assembly flow shop scheduling with considering sequence-independent setup times .The objective is to minimize totalcompletion times of all orders. In this problem, there are several orders for one type of product. Each ordered product is formed of several different parts. At first, the parts are manufactured in a flow shop stage with some different machines and then they are assembled into a final product on a single machine. This paper presents three meta-heuristic algorithms, namely Parallel Variable Neighborhood Search (PVN) Artificial Immune Algorithm (AIA) and Simulated Annealing (SA), for solving under studied problem. The Taguchi experimental design method as an optimization technique is employed to tune different parameters and operators of presented algorithms. Also, Numerical experiments are used to evaluate the performance of the proposed algorithms. The results show that the PVNS algorithm performs better than the other algorithms |
| first_indexed | 2024-03-08T17:20:27Z |
| format | Article |
| id | doaj.art-12a8d45397a3466c9781175dbd9b371a |
| institution | Directory Open Access Journal |
| issn | 2251-8029 2476-602X |
| language | fas |
| last_indexed | 2024-03-08T17:20:27Z |
| publishDate | 2020-09-01 |
| publisher | Allameh Tabataba'i University Press |
| record_format | Article |
| series | Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī |
| spelling | doaj.art-12a8d45397a3466c9781175dbd9b371a2024-01-03T04:45:47ZfasAllameh Tabataba'i University PressMuṭāli̒āt-i Mudīriyyat-i Ṣan̒atī2251-80292476-602X2020-09-01185830733510.22054/jims.2020.47551.239411744Meta-Heuristic Algorithms for Two-Stage Assembly Flow Shop Scheduling Problem with Considering Setup Times of MachinesMehdi Yazdani0Assistant Professor, Department of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Islamic Azad University, Qazvin BranchThis paper deals with the problem of two-stage assembly flow shop scheduling with considering sequence-independent setup times .The objective is to minimize totalcompletion times of all orders. In this problem, there are several orders for one type of product. Each ordered product is formed of several different parts. At first, the parts are manufactured in a flow shop stage with some different machines and then they are assembled into a final product on a single machine. This paper presents three meta-heuristic algorithms, namely Parallel Variable Neighborhood Search (PVN) Artificial Immune Algorithm (AIA) and Simulated Annealing (SA), for solving under studied problem. The Taguchi experimental design method as an optimization technique is employed to tune different parameters and operators of presented algorithms. Also, Numerical experiments are used to evaluate the performance of the proposed algorithms. The results show that the PVNS algorithm performs better than the other algorithmshttps://jims.atu.ac.ir/article_11744_d36baf6291c9fbceec5bd1f0a19ae30d.pdftwo-stage assembly flow shop problemschedulingsequence- independent setup timesmeta-heuristic algorithm |
| spellingShingle | Mehdi Yazdani Meta-Heuristic Algorithms for Two-Stage Assembly Flow Shop Scheduling Problem with Considering Setup Times of Machines Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī two-stage assembly flow shop problem scheduling sequence- independent setup times meta-heuristic algorithm |
| title | Meta-Heuristic Algorithms for Two-Stage Assembly Flow Shop Scheduling Problem with Considering Setup Times of Machines |
| title_full | Meta-Heuristic Algorithms for Two-Stage Assembly Flow Shop Scheduling Problem with Considering Setup Times of Machines |
| title_fullStr | Meta-Heuristic Algorithms for Two-Stage Assembly Flow Shop Scheduling Problem with Considering Setup Times of Machines |
| title_full_unstemmed | Meta-Heuristic Algorithms for Two-Stage Assembly Flow Shop Scheduling Problem with Considering Setup Times of Machines |
| title_short | Meta-Heuristic Algorithms for Two-Stage Assembly Flow Shop Scheduling Problem with Considering Setup Times of Machines |
| title_sort | meta heuristic algorithms for two stage assembly flow shop scheduling problem with considering setup times of machines |
| topic | two-stage assembly flow shop problem scheduling sequence- independent setup times meta-heuristic algorithm |
| url | https://jims.atu.ac.ir/article_11744_d36baf6291c9fbceec5bd1f0a19ae30d.pdf |
| work_keys_str_mv | AT mehdiyazdani metaheuristicalgorithmsfortwostageassemblyflowshopschedulingproblemwithconsideringsetuptimesofmachines |