Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times
Distributed flowshop group scheduling problem (DFGSP) is commonly seen in modern
industry. However, research works on DFGSP with total flow time criterion are rarely …
industry. However, research works on DFGSP with total flow time criterion are rarely …
An effective two-stage iterated greedy algorithm for distributed flowshop group scheduling problem with setup time
The distributed flow shop group scheduling problem (DFGSP) has wide industrial
applications. Due to the strong coupling of DFGSP, three issues should be solved, such as …
applications. Due to the strong coupling of DFGSP, three issues should be solved, such as …
An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem
This paper aims to minimize the total tardiness for a distributed flowshop group scheduling
problem with sequence-dependent setup time, which is an extension of the traditional …
problem with sequence-dependent setup time, which is an extension of the traditional …
Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling …
Y Wang, Y Han, Y Wang, MF Tasgetiren, J Li… - European Journal of …, 2023 - Elsevier
In the flowshop scheduling literature, the insertion-based neighborhood search method is
often considered to obtain high-quality solutions. It will lead to expending extensive …
often considered to obtain high-quality solutions. It will lead to expending extensive …
Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem
This study addresses a reconfigurable distributed flowshop group scheduling problem
(RDFGSP), the characteristics of which lie in the reconfigurability of the flowlines, and the …
(RDFGSP), the characteristics of which lie in the reconfigurability of the flowlines, and the …
A cooperative population-based iterated greedy algorithm for distributed permutation flowshop group scheduling problem
This paper studies the distributed permutation flowshop group scheduling problem
(DPFGSP) with the consideration of minimizing total flowtime (TF), which has important …
(DPFGSP) with the consideration of minimizing total flowtime (TF), which has important …
[HTML][HTML] A discrete differential evolution algorithm for flow shop group scheduling problem with sequence-dependent setup and transportation times
S Yuan, T Li, B Wang - Journal of Intelligent Manufacturing, 2021 - Springer
This study investigates a flow shop group scheduling problem where both sequence-
dependent setup time between groups and round-trip transportation time between machines …
dependent setup time between groups and round-trip transportation time between machines …
An effective cooperative co-evolutionary algorithm for distributed flowshop group scheduling problems
This article addresses a novel scheduling problem, a distributed flowshop group scheduling
problem, which has important applications in modern manufacturing systems. The problem …
problem, which has important applications in modern manufacturing systems. The problem …
Reconfigurable distributed flowshop group scheduling with a nested variable neighborhood descent algorithm
Inspired by a real-world cellular manufacturing system for processing printed circuit boards
(PCBs), this study addresses a reconfigurable distributed flowshop scheduling problem …
(PCBs), this study addresses a reconfigurable distributed flowshop scheduling problem …
The distributed flowshop scheduling problem with delivery dates and cumulative payoffs
In the classic distributed permutation flowshop scheduling problem (DPFSP), there are more
studies on the minimization of makespan, total flow time, total tardiness, etc. This paper …
studies on the minimization of makespan, total flow time, total tardiness, etc. This paper …
相关搜索
- greedy algorithm historical information
- flowshop group scheduling problem
- setup times historical information
- greedy algorithm setup time
- flowshop group constructive heuristics
- flowshop group automatic design
- greedy algorithm total tardiness
- constructive heuristics scheduling problem
- automatic design scheduling problem
- evolution algorithm transportation times