A research survey: review of flexible job shop scheduling techniques
IA Chaudhry, AA Khan - International Transactions in …, 2016 - Wiley Online Library
In the last 25 years, extensive research has been carried out addressing the flexible job
shop scheduling (JSS) problem. A variety of techniques ranging from exact methods to …
shop scheduling (JSS) problem. A variety of techniques ranging from exact methods to …
A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem
R Chen, B Yang, S Li, S Wang - Computers & industrial engineering, 2020 - Elsevier
As an important branch of production scheduling, flexible job-shop scheduling problem
(FJSP) is difficult to solve and is proven to be NP-hard. Many intelligent algorithms have …
(FJSP) is difficult to solve and is proven to be NP-hard. Many intelligent algorithms have …
Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem
H Ding, X Gu - Computers & Operations Research, 2020 - Elsevier
The flexible job shop scheduling problem (FJSP) is a typical scheduling problem in practical
production and has been proven to be a NP-hard problem. The study of FJSP is important to …
production and has been proven to be a NP-hard problem. The study of FJSP is important to …
An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems
This paper proposes an effective hybrid tabu search algorithm (HTSA) to solve the flexible
job-shop scheduling problem. Three minimization objectives–the maximum completion time …
job-shop scheduling problem. Three minimization objectives–the maximum completion time …
Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems
This paper presents a hybrid Pareto-based discrete artificial bee colony algorithm for solving
the multi-objective flexible job shop scheduling problem. In the hybrid algorithm, each …
the multi-objective flexible job shop scheduling problem. In the hybrid algorithm, each …
Hybrid of human learning optimization algorithm and particle swarm optimization algorithm with scheduling strategies for the flexible job-shop scheduling problem
H Ding, X Gu - Neurocomputing, 2020 - Elsevier
The flexible job-shop scheduling problem (FJSP) is a well-known combinational
optimization problem. Studying FJSP is essential for promoting production efficiency and …
optimization problem. Studying FJSP is essential for promoting production efficiency and …
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 …
Novel approach to energy-efficient flexible job-shop scheduling problems
In this work, we develop a novel mathematical formulation for the energy-efficient flexible job-
shop scheduling problem using the improved unit-specific event-based time representation …
shop scheduling problem using the improved unit-specific event-based time representation …
Two-stage teaching-learning-based optimization method for flexible job-shop scheduling under machine breakdown
R Buddala, SS Mahapatra - The international journal of advanced …, 2019 - Springer
In the real-world situations, uncertain events commonly occur and cause disruption of
normal scheduled activities. Consideration of uncertain events during the scheduling …
normal scheduled activities. Consideration of uncertain events during the scheduling …
QoS-based dynamic web service composition with ant colony optimization
Service-oriented architecture (SOA) provides a scalable and flexible framework for service
composition. Service composition algorithms play an important role in selecting services …
composition. Service composition algorithms play an important role in selecting services …