A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers
Abstract This paper deals with a reentrant hybrid flow shop problem with sequence-dependent setup time and limited buffers where there are multiple unrelated parallel machines at each stage. A mathematical model with the minimization of total weighted completion time is constructed for this problem....
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2023-08-01
|
| Series: | Complex & Intelligent Systems |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s40747-023-01147-8 |
| _version_ | 1797272229158846464 |
|---|---|
| author | Qianqian Zheng Yu Zhang Hongwei Tian Lijun He |
| author_facet | Qianqian Zheng Yu Zhang Hongwei Tian Lijun He |
| author_sort | Qianqian Zheng |
| collection | DOAJ |
| description | Abstract This paper deals with a reentrant hybrid flow shop problem with sequence-dependent setup time and limited buffers where there are multiple unrelated parallel machines at each stage. A mathematical model with the minimization of total weighted completion time is constructed for this problem. Considering the complexity of the problem at hand, an effective cooperative adaptive genetic algorithm (CAGA) is proposed. In the algorithm, a dual chain coding scheme and a staged-hierarchical decoding approach are, respectively, designed to encode and decode each solution. Six dispatch heuristics and a dynamic adjustment method are introduced to define initial population. To balance the exploration and exploitation abilities, three effective operations are implemented: (1) two new crossover and mutation operators with collaborative mechanism are imposed on genetic algorithm; (2) an adaptive adjustment strategy is introduced to re-optimize better solutions after mutation operations, where ant colony search algorithm and modified greedy heuristic are intelligently switched; (3) a reset strategy with dynamic variable step strategy is embedded to re-generate some non-improved solutions. A Taguchi method of design of experiment is adopted to calibrate the parameter values in the presented algorithm. Comparison experiments are executed on test instances with different scale problems. Computational results show that the proposed CAGA is more effective and efficient than several well-known algorithms in solving the studied problem. |
| first_indexed | 2024-03-07T14:25:19Z |
| format | Article |
| id | doaj.art-889c21a242724d1f90c8607abf9be8b0 |
| institution | Directory Open Access Journal |
| issn | 2199-4536 2198-6053 |
| language | English |
| last_indexed | 2024-03-07T14:25:19Z |
| publishDate | 2023-08-01 |
| publisher | Springer |
| record_format | Article |
| series | Complex & Intelligent Systems |
| spelling | doaj.art-889c21a242724d1f90c8607abf9be8b02024-03-06T08:07:21ZengSpringerComplex & Intelligent Systems2199-45362198-60532023-08-0110178180910.1007/s40747-023-01147-8A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffersQianqian Zheng0Yu Zhang1Hongwei Tian2Lijun He3School of Transportation and Logistics Engineering, Wuhan University of TechnologySchool of Transportation and Logistics Engineering, Wuhan University of TechnologySchool of Transportation and Logistics Engineering, Wuhan University of TechnologySchool of Transportation and Logistics Engineering, Wuhan University of TechnologyAbstract This paper deals with a reentrant hybrid flow shop problem with sequence-dependent setup time and limited buffers where there are multiple unrelated parallel machines at each stage. A mathematical model with the minimization of total weighted completion time is constructed for this problem. Considering the complexity of the problem at hand, an effective cooperative adaptive genetic algorithm (CAGA) is proposed. In the algorithm, a dual chain coding scheme and a staged-hierarchical decoding approach are, respectively, designed to encode and decode each solution. Six dispatch heuristics and a dynamic adjustment method are introduced to define initial population. To balance the exploration and exploitation abilities, three effective operations are implemented: (1) two new crossover and mutation operators with collaborative mechanism are imposed on genetic algorithm; (2) an adaptive adjustment strategy is introduced to re-optimize better solutions after mutation operations, where ant colony search algorithm and modified greedy heuristic are intelligently switched; (3) a reset strategy with dynamic variable step strategy is embedded to re-generate some non-improved solutions. A Taguchi method of design of experiment is adopted to calibrate the parameter values in the presented algorithm. Comparison experiments are executed on test instances with different scale problems. Computational results show that the proposed CAGA is more effective and efficient than several well-known algorithms in solving the studied problem.https://doi.org/10.1007/s40747-023-01147-8Reentrant hybrid flow shopSequence-dependent setup timeLimited buffersUnrelated parallel machinesTotal weighted completion timeCooperative adaptive genetic algorithm |
| spellingShingle | Qianqian Zheng Yu Zhang Hongwei Tian Lijun He A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers Complex & Intelligent Systems Reentrant hybrid flow shop Sequence-dependent setup time Limited buffers Unrelated parallel machines Total weighted completion time Cooperative adaptive genetic algorithm |
| title | A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers |
| title_full | A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers |
| title_fullStr | A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers |
| title_full_unstemmed | A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers |
| title_short | A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers |
| title_sort | cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence dependent setup time and limited buffers |
| topic | Reentrant hybrid flow shop Sequence-dependent setup time Limited buffers Unrelated parallel machines Total weighted completion time Cooperative adaptive genetic algorithm |
| url | https://doi.org/10.1007/s40747-023-01147-8 |
| work_keys_str_mv | AT qianqianzheng acooperativeadaptivegeneticalgorithmforreentranthybridflowshopschedulingwithsequencedependentsetuptimeandlimitedbuffers AT yuzhang acooperativeadaptivegeneticalgorithmforreentranthybridflowshopschedulingwithsequencedependentsetuptimeandlimitedbuffers AT hongweitian acooperativeadaptivegeneticalgorithmforreentranthybridflowshopschedulingwithsequencedependentsetuptimeandlimitedbuffers AT lijunhe acooperativeadaptivegeneticalgorithmforreentranthybridflowshopschedulingwithsequencedependentsetuptimeandlimitedbuffers AT qianqianzheng cooperativeadaptivegeneticalgorithmforreentranthybridflowshopschedulingwithsequencedependentsetuptimeandlimitedbuffers AT yuzhang cooperativeadaptivegeneticalgorithmforreentranthybridflowshopschedulingwithsequencedependentsetuptimeandlimitedbuffers AT hongweitian cooperativeadaptivegeneticalgorithmforreentranthybridflowshopschedulingwithsequencedependentsetuptimeandlimitedbuffers AT lijunhe cooperativeadaptivegeneticalgorithmforreentranthybridflowshopschedulingwithsequencedependentsetuptimeandlimitedbuffers |