A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
In recent years, a large number of heuristics have been proposed for the minimization of the
total or mean flowtime/completion time of the well-known permutation flowshop scheduling …
total or mean flowtime/completion time of the well-known permutation flowshop scheduling …
A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0
Smart factories Industry 4.0 on the basis of collaborative cyber-physical systems represents
a future form of industrial networks. Supply chains in such networks have dynamic structures …
a future form of industrial networks. Supply chains in such networks have dynamic structures …
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 …
The distributed assembly permutation flowshop scheduling problem
Nowadays, improving the management of complex supply chains is a key to become
competitive in the twenty-first century global market. Supply chains are composed of multi …
competitive in the twenty-first century global market. Supply chains are composed of multi …
Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms
The distributed production lines widely exist in modern supply chains and manufacturing
systems. This paper aims to address the distributed no-wait flow shop scheduling problem …
systems. This paper aims to address the distributed no-wait flow shop scheduling problem …
Effective heuristics for the blocking flowshop scheduling problem with makespan minimization
The blocking flowshop scheduling problem with makespan criterion has important
applications in a variety of industrial systems. Heuristics that explore specific characteristics …
applications in a variety of industrial systems. Heuristics that explore specific characteristics …
A decomposition-based multi-objective evolutionary algorithm for hybrid flowshop rescheduling problem with consistent sublots
Lot streaming is the most widely used technique to facilitate the overlap of successive
operations. Considering the consistent sublots and machine breakdown, this study …
operations. Considering the consistent sublots and machine breakdown, this study …
Effective constructive heuristic and iterated greedy algorithm for distributed mixed blocking permutation flow-shop scheduling problem
Distributed permutation flow-shop scheduling problem (DPFSP) has achieved much
attention in recent years, which always assumes that there are infinite buffers between any …
attention in recent years, which always assumes that there are infinite buffers between any …
Local search methods for the flowshop scheduling problem with flowtime minimization
Flowshop scheduling is a very active research area. This problem still attracts a
considerable amount of interest despite the sheer amount of available results. Total flowtime …
considerable amount of interest despite the sheer amount of available results. Total flowtime …
Applications of Lagrangian relaxation-based algorithms to industrial scheduling problems, especially in production workshop scenarios: A review
L Sun, R Yang, J Feng, G Guo - Journal of Process Control, 2024 - Elsevier
Industrial scheduling problems (ISPs), especially industrial production workshop scheduling
problems (IPWSPs) in various sectors like manufacturing, and power require allocating …
problems (IPWSPs) in various sectors like manufacturing, and power require allocating …