Опубликована: Авг. 9, 2024
Язык: Английский
Опубликована: Авг. 9, 2024
Язык: Английский
Computers & Operations Research, Год журнала: 2024, Номер unknown, С. 106919 - 106919
Опубликована: Ноя. 1, 2024
Язык: Английский
Процитировано
9Applied Soft Computing, Год журнала: 2024, Номер 159, С. 111593 - 111593
Опубликована: Апрель 16, 2024
Язык: Английский
Процитировано
8Expert Systems with Applications, Год журнала: 2024, Номер 259, С. 125288 - 125288
Опубликована: Сен. 12, 2024
Язык: Английский
Процитировано
4Annals of Operations Research, Год журнала: 2025, Номер unknown
Опубликована: Март 13, 2025
Язык: Английский
Процитировано
0Information Sciences, Год журнала: 2025, Номер unknown, С. 122169 - 122169
Опубликована: Апрель 1, 2025
Язык: Английский
Процитировано
0Operations Research Perspectives, Год журнала: 2025, Номер unknown, С. 100340 - 100340
Опубликована: Апрель 1, 2025
Язык: Английский
Процитировано
0IET Collaborative Intelligent Manufacturing, Год журнала: 2024, Номер 6(1)
Опубликована: Март 1, 2024
Abstract A distributed heterogeneous permutation flowshop scheduling problem with sequence‐dependent setup times (DHPFSP‐SDST) is addressed, which well reflects real‐world scenarios in factories. The objective to minimise the maximum completion time (makespan) by assigning jobs factories, and sequencing them within each factory. First, a mathematical model describe DHPFSP‐SDST established. Second, four meta‐heuristics, including genetic algorithms, differential evolution, artificial bee colony, iterated greedy (IG) algorithms are improved optimally solve concerned compared other existing optimisers literature. Nawaz‐Enscore‐Ham (NEH) heuristic employed for generating an initial solution. Then, five local search operators designed based on characteristics enhance algorithms' performance. To choose appropriately during iterations, Q‐learning‐based strategy adopted. Finally, extensive numerical experiments conducted 72 instances using 5 optimisers. obtained optimisation results comparisons prove that IG algorithm along Q‐learning selection shows better performance respect its peers. proposed exhibits higher efficiency problems.
Язык: Английский
Процитировано
3Swarm and Evolutionary Computation, Год журнала: 2024, Номер 90, С. 101668 - 101668
Опубликована: Июль 29, 2024
Язык: Английский
Процитировано
3Engineering Optimization, Год журнала: 2024, Номер unknown, С. 1 - 27
Опубликована: Апрель 23, 2024
This paper investigates a distributed assembly permutation flow-shop scheduling problem with transportation and sequence-dependent set-up times (DAPFSP-TSDST). A hybrid genetic programming (HGP) algorithm is proposed to optimize the makespan of stage, which inherits merits (GP) neighbourhood search operators. In HGP, problem-specific initialization heuristic developed make populations more diverse. Multiple operators are employed as leaf nodes, vital for success GP. product shift strategy strengthen its exploitability. addition, simulated annealing criterion adopted HGP explore thoroughly. Finally, statistical computational experiments carried out on benchmark instances. The results exhaustively identify notable competitiveness in coping DAPFSP-TSDST.
Язык: Английский
Процитировано
2Applied Soft Computing, Год журнала: 2024, Номер 166, С. 112124 - 112124
Опубликована: Авг. 14, 2024
Язык: Английский
Процитировано
1