A survey of scheduling problems with no-wait in process
A Allahverdi - European Journal of Operational Research, 2016 - Elsevier
Scheduling involving no-wait in process plays an important role in industries such as plastic,
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries …
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries …
A systematic review on harmony search algorithm: theory, literature, and applications
Harmony search algorithm is the recently developed metaheuristic in the last decade. It
mimics the behavior of a musician producing a perfect harmony. It has been used to solve …
mimics the behavior of a musician producing a perfect harmony. It has been used to solve …
An improved artificial bee colony algorithm with Q-learning for solving permutation flow-shop scheduling problems
H Li, K Gao, PY Duan, JQ Li… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
A permutation flow-shop scheduling problem (PFSP) has been studied for a long time due to
its significance in real-life applications. This work proposes an improved artificial bee colony …
its significance in real-life applications. This work proposes an improved artificial bee colony …
Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
This paper proposes a Pareto-based grouping discrete harmony search algorithm (PGDHS)
to solve the multi-objective flexible job shop scheduling problem (FJSP). Two objectives …
to solve the multi-objective flexible job shop scheduling problem (FJSP). Two objectives …
Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives
Flexible job-shop scheduling problem (FJSP) is a practically useful extension of the classical
job shop scheduling problem. This paper proposes an effective discrete harmony search …
job shop scheduling problem. This paper proposes an effective discrete harmony search …
A discrete water wave optimization algorithm for no-wait flow shop scheduling problem
F Zhao, H Liu, Y Zhang, W Ma, C Zhang - Expert Systems with Applications, 2018 - Elsevier
In this paper, a discrete Water Wave Optimization algorithm (DWWO) is proposed to solve
the no-wait flowshop scheduling problem (NWFSP) with respect to the makespan criterion …
the no-wait flowshop scheduling problem (NWFSP) with respect to the makespan criterion …
Comprehensive review of the development of the harmony search algorithm and its applications
This paper presents a comprehensive overview of the development of the harmony search
(HS) algorithm and its applications. HS is a well-known human-based meta-heuristic …
(HS) algorithm and its applications. HS is a well-known human-based meta-heuristic …
A simplified binary harmony search algorithm for large scale 0–1 knapsack problems
As an important subset of combinatorial optimization, 0–1 knapsack problems, especially the
high-dimensional ones, are often difficult to solve. This study aims to provide a new …
high-dimensional ones, are often difficult to solve. This study aims to provide a new …
A two-stage cooperative evolutionary algorithm for energy-efficient distributed group blocking flow shop with setup carryover in precast systems
W Niu, J Li - Knowledge-Based Systems, 2022 - Elsevier
As the main link of the rapidly developing prefabricated construction industry, the production
of precast components (PCs) has become a research hotspot. Therefore, the distributed …
of precast components (PCs) has become a research hotspot. Therefore, the distributed …
Island neighboring heuristics harmony search algorithm for flow shop scheduling with blocking
This paper proposes an island neighboring heuristics harmony search algorithm (INHS) to
tackle the blocking flow-shop scheduling problem. The island model is used to diversify the …
tackle the blocking flow-shop scheduling problem. The island model is used to diversify the …