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 …

Flexible job shop scheduling problem (FJSP) which is an extension of the classical job shop
scheduling problem is a very important problem in the modern manufacturing system. It …

Flexible job-shop scheduling problem (FJSP) is very important in many research fields such
as production management and combinatorial optimization. The FJSP problems cover two …

Context: Recent developments in modern IT systems including internet of things, edge/fog
computing, or cyber–physical systems support intelligent and seamless interaction between …

This paper presents a novel discrete artificial bee colony (DABC) algorithm for solving the
multi-objective flexible job shop scheduling problem with maintenance activities …

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 …

Technological developments along with the emergence of Industry 4.0 allow for new
approaches to solve industrial problems, such as the Job-shop Scheduling Problem (JSP) …

With the development of Internet of manufacturing things, decentralized scheduling in
flexible job shop is arousing great attention. To deal with the challenges confronted by …

A novel hybrid tabu search algorithm with a fast public critical block neighborhood structure
(TSPCB) is proposed in this paper to solve the flexible job shop scheduling problem with the …

In this paper, we propose a hybrid shuffled frog-leaping algorithm (HSFLA) for solving the
multi-objective flexible job shop scheduling problem. Three minimization objectives–the …