Review on flexible job shop scheduling

J **e, L Gao, K Peng, X Li, H Li - IET collaborative intelligent …, 2019 - Wiley Online Library
Flexible job shop scheduling problem (FJSP) is an NP‐hard combinatorial optimisation
problem, which has significant applications in the real world. Due to its complexity and …

A multi-objective scheduling method for distributed and flexible job shop based on hybrid genetic algorithm and tabu search considering operation outsourcing and …

W Xu, Y Hu, W Luo, L Wang, R Wu - Computers & Industrial Engineering, 2021 - Elsevier
The general distributed flexible job shop scheduling problem (DFJSP) involves three sub-
problems:(1) operation-sequencing,(2) job-to-cell assignment, and (3) operation-to-machine …

An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption

RH Caldeira, A Gnanavelbabu… - Computers & Industrial …, 2020 - Elsevier
This work addresses the flexible job shop scheduling problem considering new job arrivals
which is a common occurrence in real-world manufacturing enterprises. With growing …

[HTML][HTML] A literature review on latest developments of Harmony Search and its applications to intelligent manufacturing

J Yi, C Lu, G Li - Mathematical Biosciences and Engineering, 2019 - aimspress.com
The harmony search (HS) algorithm is one of the most popular meta-heuristic algorithms.
The basic idea of HS was inspired by the music improvisation process in which the …

Multi-objective green scheduling of integrated flexible job shop and automated guided vehicles

G Xu, Q Bao, H Zhang - Engineering Applications of Artificial Intelligence, 2023 - Elsevier
The traditional flexible job shop scheduling problem (FJSP) ignores transportation issues or
merely introduces a time lag for transportation tasks while assuming an infinite number of …

Solving the flexible job shop scheduling problem using an improved Jaya algorithm

RH Caldeira, A Gnanavelbabu - Computers & Industrial Engineering, 2019 - Elsevier
The classical job shop scheduling problem (JSSP) has been a subject of extensive research
for the past many years. Due to its high computational complexity, it is considered to be NP …

A shuffled cellular evolutionary grey wolf optimizer for flexible job shop scheduling problem with tree-structure job precedence constraints

Z Zhu, X Zhou, D Cao, M Li - Applied Soft Computing, 2022 - Elsevier
Along with the growing demands for customized products and small batch production, the
flexible job shop manufacturing environment becomes increasingly popular. Efficient flexible …

A new approach to solve the flexible job shop problem based on a hybrid particle swarm optimization and Random-Restart Hill Climbing

ERR Kato, GD de Aguiar Aranha, RH Tsunaki - Computers & Industrial …, 2018 - Elsevier
Industries are looking for ways to expand their competitive advantages, a way is optimizing
their production, and in this context, they found solutions in activities of production …

Flexible job-shop scheduling problem with job precedence constraints and interval grey processing time

Z Zhu, X Zhou - Computers & Industrial Engineering, 2020 - Elsevier
In the practical production scheduling of complex products, the processing time always fails
to be accurately estimated as a deterministic value due to the fluctuating manufacturing …

Tasks assigning and sequencing of multiple AGVs based on an improved harmony search algorithm

G Li, X Li, L Gao, B Zeng - Journal of Ambient Intelligence and Humanized …, 2019 - Springer
The efficiency of automatic guided vehicle (AGV) scheduling is important to improve the
productivity of manufacturing enterprises. In this paper, the production materials and cutting …