## 6 Computational Results
### TSP Implementation in GAMS
(2022)_ [PERSON]; [PERSON]; [PERSON] Automatic Generation of Iterated Greedy Algorithms for the Non-Permutation Flow Shop Scheduling Problem with Total Completion Time Minimization. _Comput. Ind. Eng._**2022**, _163_, 107843. [CrossRef]
* _[PERSON] (2022)_ [PERSON]; [PERSON] [PERSON] An Iterated Greedy Algorithm for Distributed Blocking Flow Shop with Setup Times and Maintenance Operations to Minimize Makespan. _Comput. Ind. Eng._**2022**, _171_, 108366. [CrossRef]
* _[PERSON] et al. (2019)_ [PERSON]; [PERSON]; [PERSON] Multi-Objective Iterated Local Search Algorithm for Comprehensive Energy-Aware Hybrid Flow Shop Scheduling. _J. Clean. Prod._**2019**, _224_, 421-434. [CrossRef]
* _[PERSON] et al. (2022)_ [PERSON]; [PERSON]; [PERSON] Multi-Local Search-Based General Variable Neighborhood Search for Distributed Flow Shop Scheduling in Heterogeneous Multi-Factories. _Appl. Soft Comput._**2022**, _125_, 109138. [CrossRef]
* _[PERSON] et al. (2022)_ [PERSON]; [PERSON] Hybrid Metaheuristics for the Integrated and Detailed Scheduling of Production and Delivery Operations in No-Wait Flow Shop Systems. _Comput. Ind. Eng._**2022**, _170_, 108255. [CrossRef]
* _[PERSON] et al. (2022)_ [PERSON]; [PERSON]; [PERSON] A Hybrid Genetic Algorithm and Tabu Search for Minimizing Makespan in Flow Shop Scheduling Problem. _J. King Saud Unit. Comput. Inf. Sci._**2022**, _in press. [CrossRef]
* _[PERSON] et al. (2022)_ [PERSON]; [PERSON]; [PERSON] Permutation Flow Shop Scheduling with Multiple Lines and Demand Plans Using Reinforcement Learning. _Eur. J. Oper. Res._**2022**, _299_, 75-86. [CrossRef]
* _[PERSON] et al. (2020)_ [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation. _Appl. Sci._**2020**, _10_, 1174. [CrossRef]* (54) [PERSON]; [PERSON] A New Hybrid Ant Colony Optimization Algorithm for Solving the No-Wait Flow Shop Scheduling Problems. _Appl. Soft Comput._**2018**, _72_, 166-176. [CrossRef]
* (55) [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON] The Impact of Local Search Strategies on Chaotic Hybrid Firefly Particle Swarm Optimization Algorithm in Flow-Shop Scheduling. _J. King Saud Univ. Comput. Inf. Sci._ 2022, _in press._ [CrossRef]
* (56) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Migrating Birds Optimization with a Diversified Mechanism for Blocking Flow Shops to Minimize Idle and Blocking Time. _Appl. Soft Comput._**2022**, _114_, 107834. [CrossRef]
* (57) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] A Discrete Whale Swarm Algorithm for Hybrid Flow-Shop Scheduling Problem with Limited Buffers. _Robot. Comput.-Integer. Manuf._**2021**, _68_, 102081. [CrossRef]
* (58) [PERSON]; [PERSON]; [PERSON] Exact Solution of the Two-Machine Flow Shop Problem with Three Operations. _Comput. Oper. Res._**2022**, _138_, 105595. [CrossRef]
* (59) [PERSON]; [PERSON]; [PERSON] Exact Method to Optimize the Total Electricity Cost in Two-Machine Permutation Flow Shop Scheduling Problem under Time-of-Use Tariff. _Comput. Oper. Res._**2022**, _144_, 10578. [CrossRef]
* (60) [PERSON]; [PERSON]; [PERSON] A Linear Programming Approach for Hybrid Flexible Flow Shop with Sequence-Dependent Setup Times to Minimise Total Tardiness. _IFAC PapersOnLine_**2021**, _54-1_, 1162-1167. [CrossRef]
* (61) [PERSON]; [PERSON] Branch-and-Bound Algorithms for Minimizing Total Eearliness and Tardiness in a Two-Machine Permutation Flow Shop with Unforced Idle Allowed. _Comput. Oper. Res._**2019**, _109_, 1-11. [CrossRef]
* (62) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] A Two-Way Parallel Slime Mold Algorithm by Flow and Distance for the Travelling Salesman Problem. _Appl. Sci._**2020**, _10_, 6180. [CrossRef]
* (63) [PERSON]; [PERSON]; [PERSON] _The Vehicle Routing Problem: Latest Advances and New Challenges_; Springer: Berlin/Heidelberg, Germany, 2008. * (64) [PERSON]; [PERSON] _The Vehicle Routing Problem_; Society for Industrial and Applied Mathematics: Philadelphia, PA, USA, 2002.