The blocking flow shop scheduling problem: A comprehensive and conceptual review
This paper presents a literature review on the m-machine flow shop scheduling problem with
blocking conditions. In total, 139 papers are reviewed and classified, ranging from 1969 up …
blocking conditions. In total, 139 papers are reviewed and classified, ranging from 1969 up …
Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness
This paper proposes a self-adaptive discrete invasive weed optimization (SaDIWO) to solve
the blocking flow-shop scheduling problem (BFSP) with the objective of minimizing total …
the blocking flow-shop scheduling problem (BFSP) with the objective of minimizing total …
Chaotic Flower Pollination Algorithm for scheduling tardiness-constrained flow shop with simultaneously loaded stations
D Davendra, F Herrmann… - Neural Computing and …, 2022 - Springer
This paper introduces a novel chaotic flower pollination algorithm (CFPA) to solve a
tardiness-constrained flow-shop scheduling problem with simultaneously loaded stations …
tardiness-constrained flow-shop scheduling problem with simultaneously loaded stations …
Scheduling tardiness constrained flow shop with simultaneously loaded stations using genetic algorithm
D Davendra, F Hermann… - Proceedings of the 2020 …, 2020 - dl.acm.org
This paper describes an approach for solving a tardiness constrained flow shop with
simultaneously loaded stations using a Genetic Algorithm (GA). This industrial based …
simultaneously loaded stations using a Genetic Algorithm (GA). This industrial based …
Genetic algorithm with simulation for scheduling of a flow shop with simultaneously loaded stations
F Herrmann - Proceedings of the 28th EUROPEAN Conference on …, 2014 - opus4.kobv.de
In this study, a real world flow shop with a transportation restriction is regarded. This
restriction reduces the set of feasible schedules even more than the no-buffer restrictions …
restriction reduces the set of feasible schedules even more than the no-buffer restrictions …
Perturbation in Local Search for Scheduling
F Herrmann - Proceedings of the 29th EUROPEAN Conference on …, 2015 - opus4.kobv.de
Local search is an established meta heuristic for scheduling problems. To avoid of getting
stucked in a local optimum, the achieved solution is destroyed. Usually, this is done …
stucked in a local optimum, the achieved solution is destroyed. Usually, this is done …