Skip to Content

27 Results Found

  • Article
  • Open Access
7 Citations
4,521 Views
18 Pages

12 June 2020

One of the possible approaches to solving difficult optimization problems is applying population-based metaheuristics. Among such metaheuristics, there is a special class where searching for the best solution is based on the collective behavior of de...

(This article belongs to the Special Issue Swarm Intelligence Applications and Algorithms)
  • Review
  • Open Access
21 Citations
10,823 Views
25 Pages

This article aims to review the industrial applications of AI-based intelligent system algorithms in the manufacturing sector to find the latest methods used for sustainability and optimisation. In contrast to previous review articles that broadly su...

  • Article
  • Open Access
13 Citations
5,465 Views
34 Pages

Chaotic Multi-Objective Simulated Annealing and Threshold Accepting for Job Shop Scheduling Problem

  • Juan Frausto-Solis,
  • Leonor Hernández-Ramírez,
  • Guadalupe Castilla-Valdez,
  • Juan J. González-Barbosa and
  • Juan P. Sánchez-Hernández

The Job Shop Scheduling Problem (JSSP) has enormous industrial applicability. This problem refers to a set of jobs that should be processed in a specific order using a set of machines. For the single-objective optimization JSSP problem, Simulated Ann...

(This article belongs to the Special Issue Numerical and Evolutionary Optimization 2020)
  • Article
  • Open Access
5 Citations
3,614 Views
19 Pages

30 January 2025

Variable machine efficiency (VME) and maintenance activities (MA) are critical factors often unexplored in job scheduling problems. This paper introduces a new problem termed the job-shop scheduling problem with variable machine efficiency and mainte...

  • Review
  • Open Access
48 Citations
12,868 Views
19 Pages

A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0

  • Raja Awais Liaqait,
  • Shermeen Hamid,
  • Salman Sagheer Warsi and
  • Azfar Khalid

9 July 2021

Scheduling plays a pivotal role in the competitiveness of a job shop facility. The traditional job shop scheduling problem (JSSP) is centralized or semi-distributed. With the advent of Industry 4.0, there has been a paradigm shift in the manufacturin...

(This article belongs to the Special Issue Building Sustainable Industry 4.0: Efficiency, Effectiveness, Evaluation, Development Frameworks)
  • Article
  • Open Access
14 Citations
3,332 Views
20 Pages

Equilibrium Optimizer and Slime Mould Algorithm with Variable Neighborhood Search for Job Shop Scheduling Problem

  • Yuanfei Wei,
  • Zalinda Othman,
  • Kauthar Mohd Daud,
  • Shihong Yin and ,
  • Qifang Luo and
  • Yongquan Zhou
  • + 1 author+ 0 author

1 November 2022

Job Shop Scheduling Problem (JSSP) is a well-known NP-hard combinatorial optimization problem. In recent years, many scholars have proposed various metaheuristic algorithms to solve JSSP, playing an important role in solving small-scale JSSP. However...

(This article belongs to the Special Issue Theoretical and Computational Research in Various Scheduling Models, 2nd Edition)
  • Article
  • Open Access
40 Citations
5,499 Views
17 Pages

13 August 2020

Job shop scheduling problem (JSSP) has high theoretical and practical significance in academia and manufacturing respectively. Therefore, scholars in many different fields have been attracted to study this problem, and many meta-heuristic algorithms...

(This article belongs to the Special Issue Evolutionary Computation and Mathematical Programming 2020)
  • Article
  • Open Access
3 Citations
5,133 Views
17 Pages

Applying Decision Transformers to Enhance Neural Local Search on the Job Shop Scheduling Problem

  • Constantin Waubert de Puiseau,
  • Fabian Wolz,
  • Merlin Montag,
  • Jannik Peters and ,
  • Hasan Tercan and
  • Tobias Meisen
  • + 1 author+ 0 author

1 March 2025

Background: The job shop scheduling problem (JSSP) and its solution algorithms have been of enduring interest in both academia and industry for decades. In recent years, machine learning (ML) has been playing an increasingly important role in advanci...

(This article belongs to the Section AI Systems: Theory and Applications)
  • Article
  • Open Access
7 Citations
2,649 Views
26 Pages

Modified Coral Reef Optimization Methods for Job Shop Scheduling Problems

  • Chin-Shiuh Shieh,
  • Thanh-Tuan Nguyen,
  • Wan-Wei Lin,
  • Dinh-Cuong Nguyen and
  • Mong-Fong Horng

30 September 2022

The job shop scheduling problem (JSSP) is a fundamental operational research topic with numerous applications in the real world. Since the JSSP is an NP-hard (nondeterministic polynomial time) problem, approximation approaches are frequently used to...

(This article belongs to the Section Computing and Artificial Intelligence)
  • Article
  • Open Access
4 Citations
3,185 Views
18 Pages

Real-Time Selection System of Dispatching Rules for the Job Shop Scheduling Problem

  • Anran Zhao,
  • Peng Liu,
  • Yunfeng Li,
  • Zheyu Xie and ,
  • Longhao Hu and
  • Haoyuan Li
  • + 1 author+ 0 author

22 September 2023

Personalized market demands make the job shop scheduling problem (JSSP) increasingly complex, and the need for scheduling methods that can solve scheduling strategies quickly and easily has become very urgent. In this study, we utilized the variety a...

(This article belongs to the Section Industrial Systems)
  • Article
  • Open Access
7 Citations
4,172 Views
40 Pages

Cooperative Threads with Effective-Address in Simulated Annealing Algorithm to Job Shop Scheduling Problems

  • Marco Antonio Cruz-Chávez,
  • Jesús del C. Peralta-Abarca and
  • Martín H. Cruz-Rosales

15 August 2019

This paper presents a parallel algorithm applied to the job shop scheduling problem (JSSP). The algorithm generates a set of threads, which work in parallel. Each generated thread, executes a procedure of simulated annealing which obtains one solutio...

  • Article
  • Open Access
11 Citations
6,281 Views
13 Pages

The scheduling of production resources (such as associating jobs to machines) plays a vital role for the manufacturing industry not only for saving energy, but also for increasing the overall efficiency. Among the different job scheduling problems, t...

(This article belongs to the Topic Artificial Intelligence and Computational Methods: Modeling, Simulations and Optimization of Complex Systems)
  • Article
  • Open Access
4 Citations
3,205 Views
20 Pages

A Robust Heuristics for the Online Job Shop Scheduling Problem

  • Hugo Zupan,
  • Niko Herakovič and
  • Janez Žerovnik

12 December 2024

The job shop scheduling problem (JSSP) is a popular NP-hard problem in combinatorial optimization, due to its theoretical appeal and its importance in applications. In practical applications, the online version is much closer to the needs of smart ma...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
18 Citations
3,817 Views
18 Pages

25 January 2021

In real industrial engineering, job shop scheduling problem (JSSP) is considered to be one of the most difficult and tricky non-deterministic polynomial-time (NP)-hard problems. This study proposes a new hybrid heuristic algorithm for solving JSSP in...

(This article belongs to the Special Issue Modeling, Simulation and Design of Membrane Computing System)
  • Article
  • Open Access
15 Citations
6,932 Views
25 Pages

Large Language Model-Assisted Deep Reinforcement Learning from Human Feedback for Job Shop Scheduling

  • Yuhang Zeng,
  • Ping Lou,
  • Jianmin Hu,
  • Chuannian Fan and ,
  • Quan Liu and
  • Jiwei Hu
  • + 1 author+ 0 author

27 April 2025

The job shop scheduling problem (JSSP) is a classical NP-hard combinatorial optimization challenge that plays a crucial role in manufacturing systems. Deep reinforcement learning has shown great potential in solving this problem. However, it still ha...

(This article belongs to the Section Advanced Manufacturing)
  • Article
  • Open Access
56 Citations
7,606 Views
32 Pages

22 September 2020

It is not uncommon for today’s problems to fall within the scope of the well-known class of NP-Hard problems. These problems generally do not have an analytical solution, and it is necessary to use meta-heuristics to solve them. The Job Shop Sc...

(This article belongs to the Special Issue Artificial Intelligence for Smart Manufacturing: Methods and Applications)
  • Article
  • Open Access
3 Citations
4,016 Views
32 Pages

23 September 2021

In order to attain high manufacturing productivity, industry 4.0 merges all the available system and environment data that can empower the enabled-intelligent techniques. The use of data provokes the manufacturing self-awareness, reconfiguring the tr...

(This article belongs to the Topic Modern Technologies and Manufacturing Systems)
  • Article
  • Open Access
16 Citations
3,265 Views
26 Pages

17 June 2022

Job Shop Scheduling is currently one of the most addressed planning and scheduling optimization problems in the field. Due to its complexity, as it belongs to the NP-Hard class of problems, meta-heuristics are one of the most commonly used approaches...

(This article belongs to the Special Issue Metaheuristic Algorithms–an Effective Way to Optimize the Behaviour of the Dynamical System)
  • Article
  • Open Access
2 Citations
2,101 Views
26 Pages

17 June 2026

The job shop scheduling problem (JSSP) is a paradigmatic and strongly NP-hard combinatorial optimisation problem that underpins production planning in modern manufacturing systems, and constraint programming (CP) has become one of the leading methodo...

(This article belongs to the Special Issue Mathematical Methods and Operation Research in Planning, Scheduling and Supply Chain Operations Management)
  • Article
  • Open Access
1 Citations
1,686 Views
18 Pages

5 June 2026

Developing high-quality and reliable solver code for the job shop scheduling problem (JSSP) remains a challenging and expertise-intensive task because generated code must stay executable, produce feasible schedules, and achieve strong scheduling resu...

(This article belongs to the Special Issue Data-Driven Optimization and Decision-Making for Sustainable Manufacturing and Production Scheduling)
  • Article
  • Open Access
10 Citations
2,421 Views
25 Pages

4 October 2021

This paper investigates the Job Shop Scheduling Problem (JSSP) with FDM (Fused Deposition Modeling) machine unavailability constraints due to Predictive Maintenance (PdM) tasks, under the objective of minimizing the makespan, total tardiness and mach...

(This article belongs to the Section Manufacturing Processes and Systems)
  • Article
  • Open Access
120 Views
23 Pages

3 November 2026

The JSSP is recognized as one of the most difficult combinatorial optimization problems and is classified as NP-hard. In this study, three metaheuristics are presented and evaluated. The first, EGD–ILS, is a new hybrid metaheuristic. Its first...

(This article belongs to the Special Issue Advanced Optimization Methods and Applications, 3rd Edition)
  • Article
  • Open Access
19 Citations
6,067 Views
24 Pages

16 July 2022

Job shop scheduling problem (JSSP) is essential in the production, which can significantly improve production efficiency. Dynamic events such as machine breakdown and job rework frequently occur in smart manufacturing, making the dynamic job shop sch...

(This article belongs to the Section Machines Testing and Maintenance)
  • Article
  • Open Access
8 Citations
5,321 Views
27 Pages

Three Hybrid Scatter Search Algorithms for Multi-Objective Job Shop Scheduling Problem

  • Leo Hernández-Ramírez,
  • Juan Frausto-Solís,
  • Guadalupe Castilla-Valdez,
  • Javier González-Barbosa and
  • Juan-Paulo Sánchez Hernández

31 January 2022

The Job Shop Scheduling Problem (JSSP) consists of finding the best scheduling for a set of jobs that should be processed in a specific order using a set of machines. This problem belongs to the NP-hard class problems and has enormous industrial appl...

(This article belongs to the Special Issue Softcomputing: Theories and Applications II)
  • Systematic Review
  • Open Access
20 Citations
9,481 Views
44 Pages

Task Scheduling with Mobile Robots—A Systematic Literature Review

  • Catarina Rema,
  • Pedro Costa,
  • Manuel Silva and
  • Eduardo J. Solteiro Pires

The advent of Industry 4.0, driven by automation and real-time data analysis, offers significant opportunities to revolutionize manufacturing, with mobile robots playing a central role in boosting productivity. In smart job shops, scheduling tasks in...

(This article belongs to the Section Industrial Robots and Automation)
  • Article
  • Open Access
21 Citations
5,757 Views
20 Pages

6 January 2023

Artificial intelligence is considered to be a significant technology for driving the future evolution of smart manufacturing environments. At the same time, automated guided vehicles (AGVs) play an essential role in manufacturing systems due to their...

(This article belongs to the Special Issue Artificial Intelligence and Data Engineering in Engineering Applications)
  • Article
  • Open Access
3 Citations
1,819 Views
22 Pages

26 December 2025

Population initialization significantly influences metaheuristic algorithm performance, yet random initialization dominates despite problem-specific needs. This study investigates initialization strategies for the Job Shop Scheduling Problem (JSSP),...