An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
This paper considers a distributed permutation flowshop scheduling problem with sequence-
dependent setup times (DPFSP-SDST) to minimize the maximum completion time among …
dependent setup times (DPFSP-SDST) to minimize the maximum completion time among …
Solving Permutation Flow Shop Scheduling Problem with Sequence‐Independent Setup Time
In this paper, we study the resolution of a permutation flow shop problem with sequence‐
independent setup time. The objective is to minimize the maximum of job completion time …
independent setup time. The objective is to minimize the maximum of job completion time …
Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times
The distributed permutation flowshop scheduling problem (DPFSP) has attracted a lot of
attention in recent years, as current production systems frequently operate multiple factories …
attention in recent years, as current production systems frequently operate multiple factories …
Artificial bee colony algorithm for solving multi-objective distributed fuzzy permutation flow shop problem
The distributed permutation flow shop scheduling (DPFSS) is a permutation flow shop
scheduling problem including the multi-factory environment. The processing times of the …
scheduling problem including the multi-factory environment. The processing times of the …
Minimizing the late work of the flow shop scheduling problem with a deep reinforcement learning based approach
Z Dong, T Ren, J Weng, F Qi, X Wang - Applied Sciences, 2022 - mdpi.com
In the field of industrial manufacturing, assembly line production is the most common
production process that can be modeled as a permutation flow shop scheduling problem …
production process that can be modeled as a permutation flow shop scheduling problem …
Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
Permutation flowshop scheduling problem (PFSP) is a classical NP-Hard combinatorial
optimisation problem. Existing PFSP variants capture different realistic scenarios, but …
optimisation problem. Existing PFSP variants capture different realistic scenarios, but …
New benchmark algorithm for minimizing total completion time in blocking flowshops with sequence-dependent setup times
CY Cheng, P Pourhejazy, KC Ying, SY Huang - Applied Soft Computing, 2021 - Elsevier
Just-in-time production in large enterprises along with the factory's limited space highlights
the need for scheduling tools that consider blocking conditions. This study contributes to the …
the need for scheduling tools that consider blocking conditions. This study contributes to the …
Production planning and scheduling problem of continuous parallel lines with demand uncertainty and different production capacities
KC Bhosale, PJ Pawar - Journal of Computational Design and …, 2020 - academic.oup.com
Production planning and scheduling problems are highly interdependent as scheduling
provides optimum allocation of resources and planning is an optimum utilization of these …
provides optimum allocation of resources and planning is an optimum utilization of these …
Distributed fuzzy permutation flow shop scheduling problem: a bee colony algorithm
The distributed permutation flow shop scheduling problem is a subclass of the permutation
flow shop scheduling problem. Distributed scheduling adopts multi-factory with permutation …
flow shop scheduling problem. Distributed scheduling adopts multi-factory with permutation …
Heuristics for the mixed no-idle flowshop with sequence-dependent setup times
In this paper, the mixed no-idle flowshop scheduling problem with sequence-dependent
setup times and makespan minimisation criterion is studied. The mixed no-idle flowshop …
setup times and makespan minimisation criterion is studied. The mixed no-idle flowshop …