ENGINEERING ACCESS, VOL. 11, NO.

1, JANUARY-JUNE 2025 65

A Review of Metaheuristic Algorithms for Job Shop

Scheduling
Dharmik Chiragkumar Hajariwala1, Srishti Sudhir Patil2 and Sudhir Madhav Patil3,*
1
SYMTech-Project Management, Department of Manufacturing Engineering and Industrial Management,
COEP Technological University (COEP Tech), Chhatrapati Shivajinagar, Pune: 411005, Maharashtra State, India
2
SYBTech-CSE, Department of Computer Engineering and Technology,
Dr. Vishwanath Karad MIT World Peace University (MIT-WPU), Kothrud, Pune: 411038, Maharashtra State, India
3
Department of Manufacturing Engineering and Industrial Management,
COEP Technological University (COEP Tech), Chhatrapati Shivajinagar, Pune: 411005, Maharashtra State, India

*Corresponding Email : [email protected]

Received May 9, 2024, Revised June 11, 2024, Accepted June 17, 2024, Published December 17, 2024

Abstract. Job shop scheduling (JSS) is a critical made, there remain numerous opportunities for innovation
problem in the field of operations research and and improvement in developing more robust, efficient, and
manufacturing, where the goal is to optimize the adaptive metaheuristic algorithms. Future research
scheduling of jobs on machines to enhance productivity should focus on hybrid approaches, real-time scheduling,
and efficiency. Combinatorial optimization problems like and integrating machine learning techniques to further
JSS present significant challenges due to their diverse enhance the performance and applicability of these
applications and practical importance. In order to meet algorithms in complex, real-world JSS problems. This
this challenge, metaheuristic algorithms have become comprehensive review not only serves as a valuable
extremely effective tools. They provide effective solutions resource for researchers and practitioners but also sets
that strike a balance between computational cost and the stage for future innovations in the optimization of
solution quality. Given the Nondeterministic Polynomial complex scheduling problems.
time (NP)-hard nature of the problem, exact methods are
Keywords:
often impractical for large instances, making
metaheuristic approaches highly valuable due to their Job shop scheduling, metaheuristic algorithms, multi-
ability to find near-optimal solutions within reasonable objective, scheduling, scheduling problem
computational times. The primary purpose of this review
manuscript is to comprehensively analyze and synthesize
the current state of research on metaheuristic algorithms 1. Introduction
applied to JSS. This review categorizes and summarizes Effective scheduling is essential to many industrial and
contemporary metaheuristic methods such as harmony manufacturing processes; it affects things like output
search, and ant colony optimization, alongside traditional volume, how resources are used, and total operating
techniques like genetic algorithms, simulated annealing, expenses. Because of its complexity and the numerous
tabu search, and particle swarm optimization. The constraints involved, job shop scheduling (JSS) stands out
fundamental concepts, key components, and typical among the many scheduling issues as a particularly
applications of metaheuristic algorithms are explored. The difficult task. A set of jobs must be completed in a job
paper evaluates robustness, scalability, and adaptability shop setting in a certain order on a set of machines while
of different methods to different problem instances and abiding by a number of restrictions, include processing
constraints, and performance metrics, highlighting their times, resource availability, and precedence relationships
strengths and weaknesses. Additionally, this paper reviews [1]. Traditionally, precise optimization techniques like
recent advancements in hybrid and multi-objective mathematical programming have been used to solve job
metaheuristic methods aimed at balancing scheduling shop scheduling problem (JSSP). However, for large
constraints and improving solution quality and problem sizes encountered in real-world scenarios, exact
convergence speed. By offering a critical evaluation of the methods are frequently computationally impractical due to
literature, this manuscript aims to identify trends, gaps, the combinatorial nature of these problems [2].
and future research directions in the application of Metaheuristic algorithms have become a potential and
metaheuristic algorithms to JSS. The discussion includes useful tool for solving intricate optimization problems,
an exploration of emerging techniques and their potential such as JSS, in recent years [3]. When it comes to
impact on the field, as well as the practical implications optimization, metaheuristics provide a versatile and
for industrial applications. The conclusion of the review adaptive method that can quickly and effectively search
highlights that while significant advancements have been
66 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

through large solution spaces and identify excellent reasonable amount of computational time. Moreover, this
solutions [4]. paper explores a range of metaheuristic algorithms, how
they are used in JSS, and their comparative performance
The goal of this review is to give a thorough overview
analysis.
of metaheuristic algorithms used to solve scheduling
issues in job shops. This paper examines the foundations
of JSS, present several metaheuristic algorithms frequently B. Importance of Efficient Scheduling in
employed in this setting, and investigate their uses, Industrial and Manufacturing Processes
difficulties, and potential applications.
Effective scheduling is critical to industrial and
manufacturing processes because it affects many aspects
A. Brief Overview of Job Shop Scheduling of the business, such as overall competitiveness,
Problem productivity, and resource utilization. Manufacturers face
constant pressure to streamline their production
The JSSP is a well-known optimization problem that
procedures and meet customer deadlines for high-quality
arises in manufacturing settings where a range of jobs,
products in today's hectic and fiercely competitive
each with a unique processing requirement and sequence
business world. By ensuring that resources are used
of operations must be processed on a set of machines.
effectively and production targets are met efficiently,
Essentially, the objective is to efficiently assign resources
efficient scheduling is essential to achieving these goals
and ascertain the best order in which to complete tasks in
[11]. Figure 1 shows the various key aspects of efficient
order to minimizing makespan (the total amount of time
scheduling.
needed to finish all jobs) or other performance metrics
while respecting different constraints. The origins of job Key Aspects of Efficient Scheduling
shop production scheduling can be traced back to the early
days of industrialization when manufacturing processes • Resource utilization: Using machinery, labor, and
began to diversify, necessitating more sophisticated materials to their fullest potential is made possible by
scheduling techniques to manage the increased complexity effective scheduling [12]. Throughput and
[5]. Over the years, JSS has evolved into a prominent area productivity can be increased in manufacturing by
of research within the fields of operations research, avoiding bottlenecks and minimizing idle time [13].
industrial engineering, and computer science, owing to its • Lead time minimization: It is critical to reduce lead
significance in optimizing resource utilization, reducing times in order to better respond to market shifts and
production lead times, and improving overall efficiency satisfy customer demands. By cutting down on
[6]. Traditional methods of JSS, such as manual waiting times between operations, efficient
scheduling or simple rule-based approaches, often proved scheduling speeds up production and makes it
inadequate in handling the complexities inherent in possible to fulfill orders more quickly [14].
modern manufacturing environments. This led to the
development of algorithmic approaches aimed at • Production cost optimization: By lowering overtime
automating and optimizing the scheduling process, thereby costs, cutting setup times, and maximizing inventory
enabling manufacturers to achieve higher levels of levels, efficient scheduling techniques assist in
productivity and competitiveness [7]. JSS is more lowering production costs. Manufacturing
complicated than simpler scheduling problems where each organizations can reduce costs and increase
job travels a predetermined path through the production profitability by optimizing their production processes
system. In this case, each job might need to be processed [15].
on several machines in a particular order, and factors like • Increased flexibility: Manufacturers need to be able
processing times, machine availability, and precedence to react fast to shifts in market conditions, resource
relationships must be taken into account [8]. The availability, and demand in the fast-paced business
combinatorial explosion of possible schedules as the world of today. Greater flexibility is made possible
number of jobs and machines increases is the fundamental by efficient scheduling, which makes it possible to
complexity of the JSSP [9]. Consequently, for real-world quickly modify production schedules in response to
scenarios with large problem sizes, finding an optimal shifting requirements [16].
solution through exhaustive search methods becomes
unmanageable. For manufacturing operations to increase • Competitive advantage and customer satisfaction:
productivity, cut lead times, and maximize resource Efficient scheduling gives manufacturers a big
utilization, the JSSP must be solved effectively [10]. competitive edge because it allows them to deliver
Therefore, in order to effectively address this difficult products faster, cheaper, and of better quality than
problem, researchers and practitioners have turned to their rivals [17]. Manufacturers can become
optimization techniques like metaheuristic algorithms. preferred suppliers in the market, increase customer
satisfaction, and forge closer bonds with customers
This paper examines how metaheuristic algorithms by streamlining their production processes and
present a viable method for dealing with the difficulties strengthening their scheduling skills. In the end,
involved in JSS and producing excellent results in a effective scheduling promotes operational excellence
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 67

and adds value for customers, which leads to long- sections of this review, the paper explores the ways in
term business success and sustainable growth [18]. which advanced scheduling techniques, more especially
metaheuristic algorithms, facilitate efficient scheduling
Thus, efficient scheduling is essential to optimizing
and continuous improvement in manufacturing and
industrial and manufacturing processes, reducing costs,
industrial processes.
increasing output, and maintaining competitiveness in
today's fast-paced business environment. In the following

Resource
utilization

Competitive Lead time

advantage and 2 minimization
5
customer
satisfaction

Key aspect
of efficient
scheduling

4 3

Increased Production cost

feasibility optimization

Fig. 1 Key aspects of efficient scheduling

• Iterative Improvement: Through a series of

C. Introduction to Metaheuristic Algorithms as continuous steps, metaheuristic algorithms
a Solution Approach improve candidate solutions iteratively, gradually
In the quest of solving complicated optimization bringing the solution closer to optimality [20].
issues, large-scale examples with extensive solution • Exploration and Exploitation: Metaheuristics strike
spaces and multiple constraints frequently present a balance between exploitation (exploiting
challenges for conventional exact methods. In promising areas to refine the search towards
particular, metaheuristic algorithms provide a strong optimal solutions) and exploration (diversifying
substitute for optimization when dealing with issues the search to explore different regions of the
involving non-linear relationships and high solution space) [21].
computational complexity [19].
• Stochastic Components: Many metaheuristic
Definition of Metaheuristic Algorithm: algorithms include unpredictable elements such as
Metaheuristic algorithms are iterative approaches to randomness, probabilistic making decisions, or
solving problems that search for better solutions by simulated annealing (SA) in order to introduce
exploring and navigating solution spaces using ideas randomness into the search process and escape
drawn from mathematics, social behavior, or natural local optimal conditions [4, 19].
phenomena. Metaheuristics are ideally suited to tackle
real-world optimization problems because they put an • Adaptability: By changing parameters, operators,
emphasis on obtaining good solutions in a reasonable or search strategies, metaheuristic algorithms can
amount of time, as opposed to exact methods that ensure be made more specialized for particular problem
optimality but may have scalability issues [20]. domains. This adaptability is a common feature [4,
20].
Key Characteristics of Metaheuristic Algorithms:
68 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

Categories of Metaheuristic Algorithms: • Genetic Algorithms (GA)

Metaheuristic algorithms come in a multitude of forms, • Simulated Annealing (SA)
each with unique search mechanisms, optimization • Tabu Search (TS)
strategies, and underlying principles. Figure 2 presents • Particle Swarm Optimization (PSO)
timeline of various meta-heuristic algorithm for JSS. • Harmony Search (HS)
Typical metaheuristic categories include the following • Ant Colony Optimization (ACO)
[20]:
• Artificial Bee Colony (ABC)

GA SA TS PGA AIA ACO

1985 1990 1991 1997 1999 2000

[22] [23] [24] [25] [26] [27]

ABC,
BFO RGA MBHS,
IABC, PSO IMBHS
PABC

2006, 2010,
2016 2005 2002 2002 2001, 2013
[31], [32], [30] [26] [29] [28]
[33]

CRO, PCRO GWO,

IWO DE, CS, DCS BA, PBA
IDE DGWO

2009 2011, 2013 2012, 2014 2012, 2015 2013, 2016 2014, 2016
[26] [34], [35] [36],[37] [38],[39] [40], [41] [42], [43]

Fig. 2 Timeline of Meta-heuristic algorithm for job shop scheduling

context of JSS [46-48]. The upcoming sections of this
Applications of Metaheuristic Algorithms:
review examine the use of metaheuristic algorithms as a
Applications for metaheuristic algorithms are widely
solution approach for JSSP, emphasizing their efficacy,
used in many different fields, such as engineering,
applications, and potential to improve industrial and
finance, healthcare, and telecommunications, etc.
manufacturing process efficiency.
Figure 3 portrays the various applications of
metaheuristic algorithms. When it comes to solving This paper examines the application of
real-world problems where precise methods might not metaheuristic algorithms as a solution approach for JSS
be feasible or practical, they are an invaluable tool due issues in the ensuing sections of this review. By delving
to their efficiency, versatility, and capacity to handle into the underlying principles, mechanisms, and
complex optimization problems [4, 44, 45]. applications of metaheuristic algorithms in this context,
Metaheuristic algorithms present a viable method for this paper aim to provide insights into their
maximizing production schedules, minimizing effectiveness and potential for optimizing scheduling
makespan, and enhancing resource efficiency in the processes in industrial and manufacturing environments.
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 69

Engineering [45]

Finance [49]

Machine Learning [50]

Management [51]

Healthcare [52]

Telecommunication [53]

Environment [54]

Fig. 3 Application of Meta-heuristic Algorithm

the desired result. This is crucial for efficiency,
D. Objectives of using Metaheuristic saving time and computational resources [46].
Algorithm • Accuracy (ACC): This refers to the degree to
which a result or measurement aligns with the true
• Minimize Maximum Completion Time (MMCT):
or accepted value. High accuracy translate into less
Completion time refers to the arrangement of tasks
error and more precision in the result. For results
in a way that maximizes the early completion of
that are valid and dependable in domains like
the longest task. The goal of this strategy is to
science, engineering, and data analysis, accuracy is
shorten the total amount of time needed to finish
essential [58, 59].
all tasks. To guarantee effectiveness and cut down
on delays, it is frequently used in scheduling. • Minimization of Tardiness (MTD): Tardiness
Concentrating on the most extended task aids in refers to the delay in completing jobs beyond their
workload distribution and boosts output [55]. due dates or deadlines. This objective's algorithms
prioritize minimizing tardiness by making sure that
• Minimizing Makespan (MMK): The total amount
tasks are finished on time or ahead of schedule. In
of time needed to finish every task in a production
order to maximize customer satisfaction, reduce
schedule is referred to as makespan. This
late delivery penalties, and maintain a competitive
objective's algorithms focus on minimizing the
advantage in the market, these algorithms optimize
makespan by streamlining the machine's sequence
production schedules to meet predetermined
of operations to shorten the total production time.
deadlines [60, 61].
These algorithms give top priority to finishing
every task as soon as possible, which reduces • Improve Scheduling Efficiency (ISE): Efficient
production time and boosts throughput overall scheduling ensures that tasks are completed in a
[56]. timely and organized manner, reducing downtime
and bottlenecks. This objective is essential in
• Robustness (RBS): This is a system's capacity to
industries like manufacturing, project
withstand unforeseen alterations or disruptions
management, and logistics. Increasing scheduling
without malfunctioning. It guarantees
efficiency results in higher productivity and lower
dependability and stability in a range of
operating costs. It results in improved performance
circumstances. In engineering and design, a robust
overall and more efficient workflows [62, 63].
system is able to continue operating in the face of
uncertainty. For the creation of reliable and long- • Sequence Dependent Adjust Time (SDAT): This
lasting processes and products, this attribute is refers to the variation in the time required to
crucial [57]. switch from one task to another based on the order
in which tasks are performed. This adjustment
• Convergence Speed (CVS): This refers to how
time depends on the specific sequence of
quickly a process or algorithm reaches its outcome
operations. In scheduling and manufacturing,
or solution. In optimization and iterative methods,
accounting for sequence-dependent adjust time is
faster convergence means fewer steps to achieve
crucial for accurate planning and minimizing
70 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

delays. It ensures that transitions between tasks are overall production efficiency, as it directly affects
efficient, reducing overall completion time and downtime, throughput, and resource utilization
improving productivity [64, 65]. [74, 75].
• Machine Release Date (MRD): This refers to the • Minimize Flow Time (MFT): Flow time is the
specific time when a machine becomes available amount of time needed for a job to proceed from
for use in a production process. This date is crucial the start of production to the end. In order to
for planning and scheduling tasks, ensuring that minimize the flow time for each job, algorithms
operations begin as soon as the machine is ready. that aim to minimize flow time focus on
Knowing the release date helps in coordinating optimizing the job sequences and resource
activities and avoiding delays. It ensures that allocations. These algorithms seek to minimize
resources are utilized efficiently and production flow time in order to increase customer
timelines are met [66, 67]. responsiveness, decrease work-in-progress
inventory, and increase production efficiency [76,
• Production Efficiency (PEF): This refers to the 77].
ability to maximize output while minimizing input,
such as time, materials, and labour. A high level of • Minimize Relative Error (MRE): This objective
production efficiency involves quick and minimal aims to reduce discrepancies between planned and
waste product creation. Reaching this goal is actual job completion times, enhancing scheduling
essential to cutting expenses and raising profits. accuracy [78].
Efficient production processes guarantee improved
resource utilization and increased productivity • Improve Solution Quality (ISQ): This objective
[68]. focuses on enhancing overall scheduling outcomes
by optimizing job sequencing and resource
• Work Sequence (WSQ): This describes the precise allocation for better performance. This makes the
sequence in which actions or tasks are carried out. schedule better to achieve higher efficiency and
Sequencing correctly is essential for productivity performance [78, 79].
and a seamless workflow. It guarantees that every
task is finished on schedule, reducing delays and • Minimize Earliness Penalties (MEP): Goal is to
avoiding conflicts. An ideal sequence of operations decrease costs associated with completing jobs
improves output and efficient use of resources in earlier than required, thus reducing financial
both manufacturing and project management [69]. penalties [80, 81].

• Minimization of Production Time (MPT): This • Time Lag Requirement (TLR): This objective
aims to reduce the overall duration required to focuses on meeting specific time constraints
manufacture goods or complete tasks. This between consecutive job operations to ensure
objective focuses on optimizing processes, smooth workflow and timely completion. It
eliminating bottlenecks, and streamlining ensures the correct time intervals between tasks to
operations. By minimizing production time, meet production needs [82, 83].
businesses can increase output, meet deadlines, • Minimize Energy Consumption (MEC): This aims
and respond swiftly to customer demands [70, 71]. to optimize scheduling to reduce energy usage,
• Cost Saving (CSV): This involves identifying and contributing to environmental sustainability and
implementing measures to reduce expenses cost savings. This decreases the energy used in
without compromising quality or efficiency. The production to save money and resources [84, 85].
goal of this objective is to reduce unnecessary • Minimize Transportation Time (MTT): This
expenditures in order to strengthen an objective focuses on minimizing the time required
organization's financial position. Achieving cost for transporting materials or products between
savings involves a variety of tactics, including different stages or workstations, improving
improving resource usage, negotiating better prices efficiency and reducing delays. It cuts down the
with suppliers, and putting cost-effective time needed to move materials between
technologies into use [72, 73]. workstations [86, 87].
• Minimize Set-up Time (MST): Set-up time is a
crucial element in manufacturing and production 2. Overview of Job Shop Scheduling
processes, representing the duration required
preparing equipment, machinery, or systems for JSS is an essential issue in operations management and
the execution of a specific task or production run. manufacturing, which involves a requirement to allocate
It encompasses activities such as equipment resources efficiently to complete a set of jobs on a set of
adjustment, tooling, calibration, and material machines, subject to various constraints [6]. This
preparation before actual production can section will explore the essential ideas and concepts of
commence. Set-up time plays a significant role in JSS, including its definition, key characteristics, and
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 71

categorization. JSS includes the coordination and result in notable cost savings and productivity gains as
sequencing of operations or tasks across different they minimize idle time, minimize setup costs, and
machinery to meet production objectives while maximize machine utilization [1, 5, 6].
satisfying various constraints. JSS differs from simpler
scheduling problems in that it involves figuring out the B. Description of the Job Shop Constraints
best order of operations for every job on every machine,
taking into account variables like processing times, In this subsection, this paper discusses the
machine availability, and precedence relationships [2, constraints usually encountered in JSS, including
82]. machine availability, processing times, precedence
relationships between tasks, and resource constraints. It
is essential to understand the constraints, when creating
A. Definition of Job Shop Scheduling
scheduling problems and optimization algorithms.
This section delves into the definition and key
Constraints in JSS:
characteristics of the JSS. At its core, the JSSP revolves
around the efficient allocation of resources to complete • Machine Availability: Due to factors like
a set of jobs on a set of machines within a specified resource limitations, setup times, and
period. maintenance, each machine has a limited
JSS is a typical optimization scenario came across amount of availability. Jobs cannot be
in manufacturing and operations management, where a processed on machines that are already busy
number of jobs must be processed through a series of with other tasks [91].
operations on a number of machines. Every job consists • Processing Times: Every operation has a
of a number of tasks or operations that, under a number processing time that corresponds to how long it
of restrictions, must be completed on a particular takes to finish the task on a specific machine.
machine in the correct sequence [5, 88, 89]. Processing times can differ based on a number
Key Characteristics of JSS [90]: of variables, including material properties, job
complexity, and machine capabilities [92].
• Machine Dependency: Each task within a job
involves a series of operations that must be • Precedence Relationships: There are
carried out on specific machines. On the other precedence relationships among certain
hand, machines might differ in their capacities, operations, which determine that they must be
which could limit their availability and use. carried out in a particular order. For instance,
the outcome of machining operations on the
• Precedence Constraints: Before they can begin, same or separate machines may be necessary
some operations might need to wait for others for the assembly process to proceed [93].
to finish. In order to ensure that the schedule is
correct, these precedence constraints must be • Resource constraints: JSS may be impacted by
met. limitations on labor, materials, and tools.
Limited resources may have an influence on
• Complexity: The JSSP involves a large number scheduling choices and reduce the
of potential schedules, making it fundamentally effectiveness of production as an entire process
combinatorial in nature. The complexity of the [94].
problems grows exponentially with the no. of
jobs and machines, making it difficult to find • Job priorities: Different jobs may have varying
optimal solutions using conventional priorities depending on things like deadlines,
optimization techniques. client demands, and output targets. Setting the
right priorities for your work is crucial to
• Objective Function: The main aim of JSS meeting deadlines and maximizing output [95].
revolves around minimizing the makespan,
which refers to the total duration required to • Optimization objectives: The goal of JSS is to
complete all tasks. Other goals could be maximize machine utilization, minimize idle
maximizing machine utilization, reducing time, minimize makespan (total completion
tardiness, or distributing the workload evenly time), and reduce job tardiness (lateness).
among the machines. Alternatives may need to be made during the
scheduling process because these goals may
conflict with one another [96].
Importance of JSS: In manufacturing Understanding the job shop constraints is essential
environments, maximizing resource utilization, cutting for formulating scheduling problems, designing
production lead times, and enhancing overall effective algorithms, and making informed scheduling
operational efficiency all depend on effective JSS. The decisions. By considering these factors, researchers and
implementation of efficient scheduling strategies can practitioners can develop strategies to improve
72 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

production efficiency, meet customer demands, and difficult when considering processing times
optimize resource utilization in job shop environments. that indicate random fluctuations or follow
probabilistic distributions [99].
C. Classification of Job Shop Scheduling • Job Shop with Setup Times: Setup times are a
Problems factor in some scheduling problems in job
By categorizing JSSP, scholars and professionals shops because they are necessary when
are able to understand the details and complexity of switching between various tasks or operations.
various problem scenarios. It makes it easier to choose Setup times add extra costs and delays to
the best approaches for solving problems and to create production, which can have a negative impact
specialized scheduling plans that are suited to the on efficiency [100].
demands and features of particular problems [5]. Scheduling Environment:
The application of various metaheuristic • Static Job Shop: In a static job shop,
algorithms to various JSSP, which aim to maximize scheduling choices are predetermined based on
production schedules, reduce makespan, and enhance the known constraints and characteristics of the
resource utilization in industrial and manufacturing job. Scheduling algorithms are able to optimize
settings are discussed in the following sections of this schedules in person without requiring real-time
review. The number of machines, the nature of the jobs adjustments, and the scheduling environment is
and operations, and the scheduling environment are still comparatively stable [101].
some of the factors that can be used to categorize JSS
issues. Selecting suitable solution approaches and • Dynamic Job Shop: Scheduling decisions in a
creating efficient scheduling strategies require an dynamic job shop are made either dynamically
understanding of these classifications. or in real-time in response to shifts in job
priorities, the availability of resources, or
Classification of JSSPs: outside variables. Adaptive algorithms that can
Number of Machines: quickly adjust to changing conditions and
minimize production schedule disruptions are
• Single-Machine Job Shop: There is just one necessary for dynamic JSS [102].
machine available for processing tasks in a
single-machine job shop. Every job requires Researchers and practitioners can effectively
scheduling of several operations on this one optimize scheduling processes and customize solution
machine. In comparison to other approaches to specific problem instances by having a
configurations, this scenario is very simple thorough understanding of the classifications of JSSPs.
[81]. The application of various metaheuristic algorithms to
various JSSP, which aim to maximize production
• Parallel Machine Job Shop: A parallel machine schedules, reduce makespan, and enhance resource
job shop has several identical machines that utilization in industrial and manufacturing settings are
can process orders at the same time. More discussed in the following sections of this review.
scheduling flexibility is possible with this
configuration, which may also result in better
throughput and resource use [97], [98]. 3. Overview of Metaheuristic Algorithms
• Hybrid Job Shop: A hybrid job shop In this section, the paper provides an overview of
incorporates aspects of parallel and single metaheuristic algorithms, exploring their principles,
machine configurations. It could be made up of characteristics, and applications in solving optimization
a combination of parallel and single machines, problems. Metaheuristic algorithms provide flexible and
each with different processing capabilities and adaptive methods for optimization. They can quickly
constraints [98]. and effectively search through large solution spaces to
find outstanding solutions. Developing an understanding
Characteristics of Jobs and Operations: of the foundations of metaheuristic algorithms is
• Deterministic Job Shop: The processing times necessary to fully utilize their potential in solving
for operations in a deterministic job shop are complicated optimization problems, such as JSSPs.
fixed and unchanging. Because job completion
times and resource requirements can be A. Commonly Used Metaheuristic Algorithms
accurately predicted, this helps to partially
This subsection provides an overview of common
simplify the scheduling problem [99].
metaheuristic algorithms used in JSS. Metaheuristic
• Stochastic Job Shop: Processing times for algorithms are powerful optimization techniques that
operations are uncertain in a stochastic job offer flexible and robust approaches for finding near-
shop. Scheduling decisions become more optimal solutions to complex scheduling problems. By
exploring these common metaheuristic algorithms, this
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 73

paper aims to elucidate their principles, operational optimization of problems with continuous
characteristics, and advantages in addressing various variables [29, 103].
scheduling challenges in different environments.
• Bacterial Foraging Optimization (BFO):
• Genetic Algorithm (GA): Utilizes evolutionary Simulates bacterial foraging behaviors.
processes to iteratively evolve solutions Solutions (bacterial colonies) are iteratively
(schedules). Representing potential schedules improved through chemotaxis, reproduction,
as chromosomes, genetic operators like and elimination-dispersal, effectively finding
selection, crossover, and mutation are applied optimal solutions for various problems [26,
to breed better solutions across generations 109].
[22, 103].
• Particle Swarm Optimization (PSO): Inspired
• Simulated Annealing (SA): Mimics the by social behaviors of animals, particles
physical annealing process, starting with an represent potential solutions. They move
initial solution and exploring neighboring through the solution space based on their own
solutions probabilistically. By gradually experiences and those of the swarm, iteratively
decreasing the temperature parameter, it allows improving their positions to find near-optimal
for escaping local optima and converging schedules [30, 44, 110].
towards near-optimal solutions [23, 104].
• Artificial Bee Colony (ABC): Models the
• Tabu Search (TS): Employs a local search foraging behavior of honeybees. Employed,
mechanism with a tabu list to avoid revisiting onlooker, and scout bees explore the solution
previously explored solutions. Aspiration space, sharing information and introducing
criteria allow overcoming some restrictions, diversity to iteratively improve solutions and
enabling efficient traversal of the search space converge towards optimal schedules [31, 111].
and finding superior schedules [24, 105, 106].
• Improved Artificial Bee Colony (IABC)
• Parallel Genetic Algorithm (PGA): Utilizes Algorithm: The IABC algorithm improves the
parallel computing to speed up GA processes ABC algorithm. It ensures thorough search
by running multiple instances concurrently, space coverage by using a four-layer
exploring different solution areas chromosome encoding structure to represent
simultaneously [25, 103]. solutions in an adaptable and natural way.
Performance is further optimized by adding a
• Artificial Immune Algorithm (AIA): Mimics random selection method for onlooker bees and
immune system processes to optimize a neighborhood search mechanism for
problems, using antibodies to represent employed bees [32, 112].
solutions and leveraging immune memory and
clonal selection for adaptation [26]. • Parallel Artificial Bee Colony (PABC)
Algorithm: This algorithm enhances the
• Ant Colony Optimization (ACO): Based on the traditional ABC by mimicking the foraging
foraging behavior of ants, where pheromone behavior of bees in a parallelized manner. The
trails guide the search for solutions. Ants colony is divided into several sub colonies, and
probabilistically select jobs and machines, with in order to increase efficiency, parallel
pheromone updates leading to the construction operations are carried out within each sub
of high-quality schedules over time [27, 107]. colony with dynamic migration [33, 113, 114].
• Music-Based Harmony Search (MBHS): • Invasive Weed Optimization (IWO): Inspired
Inspired by creating harmonious music. by the invasive behavior of weeds. Candidate
Solutions are represented as melodies, updated solutions (weed areas) evolve by growth,
using principles of harmony and music theory reproduction, and competition, efficiently
to explore and find near-optimal solutions [28, exploring the solution space [26, 115].
108].
• Differential Evolution (DE) Algorithm: It
• Improved Music Based Harmony Search improves solutions by combining and mutating
(IMBHS): Enhances traditional Harmony existing ones. This helps to reduce the total
Search with advanced harmony memory and time needed to complete all jobs. It also
improvisation techniques, improving enhances the use of resources efficiently [34,
convergence speed and solution quality for 116].
various optimization problems [28].
• Improved Differential Evolution (IDE)
• Real Coded Genetic Algorithm (RGA): Uses Algorithm: This algorithm improves traditional
real-number vectors instead of binary strings to DE with four mutation strategies and an
represent solutions, allowing effective exponential crossover method, developing new
74 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

candidate solutions repeatedly. By choosing improves convergence towards the ideal job
the best solution from each iteration based on scheduling by merging and exchanging
fitness, it seeks to maximize the objectives in solutions between subpopulations [41, 122].
JSSP [35, 117].
• Grey Wolf Optimization (GWO): Inspired by
• Cuckoo Search (CS) Algorithm: This the hunting behavior of grey wolves, where
algorithm optimizes JSS by mimicking cuckoo positions of solutions are updated based on
breeding strategies. It replaces poor solutions alpha, beta, and delta wolves. The algorithm
with better ones discovered through random balances exploration and exploitation to find
search and Lévy flights. This method optimal solutions [42, 123].
minimizes the total job completion time and
improves scheduling efficiency [36, 118]. • Discrete Grey Wolf Optimization (DGWO): A
variation of GWO for discrete problems.
• Discrete Cuckoo Search (DCS) Algorithm: Wolves reposition themselves similarly,
This algorithm uses random generation to evaluating solutions and converging towards
create an initial population. It then transforms optimal results [43, 124].
continuous solutions into discrete permutations
and evaluates the fitness of each population. • Modified Genetic Algorithm (MoGA): A
The algorithm accepts new solutions based on customized version of the classic genetic
an exponentially decreasing probability and algorithm designed to address specific
improves the population based on random optimization problems, evolving solutions
moves (swap, insert, and inverse) [37, 119]. iteratively through processes like crossover,
mutation, and selection [125].
• Bat Algorithm (BA): The Bat Algorithm is
used for JSS by simulating bat echolocation to • Improved Genetic Algorithm (IGA): Enhances
explore solutions. It adjusts job sequences the traditional genetic algorithm with
based on loudness and pulse rates, finding sophisticated strategies like elitism and
optimal schedules. This reduces completion adaptive parameter tuning to improve
time and improves scheduling efficiency [38, exploration and exploitation, leading to faster
120]. convergence towards optimal or nearly optimal
solutions [103, 126].
• Parallel Bat Algorithm (PBA): This algorithm
enhances the traditional BA by uses a random- • Modified Ant Colony Optimization Algorithm
key encoding scheme for mapping continuous (MACO): Customizes the standard ACO
positions to discrete job sequences. It uses algorithm with improved pheromone updating
parallel processing, executing several rules, sophisticated heuristic data, or specific
procedures at once, and combining the exploration tactics to quickly approach optimal
outcomes on a regular basis to improve the or nearly optimal solutions [127].
quality of the solution. Neighborhood operators • Enhanced Particle Swarm Optimization
that enhance local search efficiency and (EPSO): Improves the traditional PSO
preserve population diversity include algorithm with mechanisms like adaptive
swapping, insertion, and inversion [39, 121]. inertia weights and local search strategies to
• Coral Reef Optimization (CRO): Mimics the explore solution spaces and approach optimal
cooperative behaviors of coral reef organisms. or nearly optimal solutions more effectively
Candidate solutions interact through feeding, [128].
communication, and reproduction, effectively Table 1 presents the summary of various
solving a range of optimization problems [40, metaheuristic algorithms based on main concept,
122]. advantages, disadvantages and specific performance
characteristics of specified research work from the
• Parallel Coral Reef Optimization (PCRO): This
literature.
algorithm establishes multiple sub-populations
(coral reefs) and employs local search and
crossover operators in parallel to enhance
solution diversity and quality. Periodically, it
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 75

Table 1 Summary of Metaheuristic Algorithms

Study/Reference Metaheuristic Main Concept Advantages Disadvantages Note on Performance
Algorithm
[22], [103] Genetic Algorithm Evolutionary algorithm Good global search Can be slow, may Often used for its
using selection, capabilities, converge robustness and ability to
crossover, and mutation adaptable prematurely escape local optima
[23], [104] Simulated Annealing Probabilistic technique Simple, avoids local Slow convergence, Effective for problems
inspired by annealing in minima effectively parameter tuning is with a complex landscape
metallurgy critical
[24], [105], [106] Tabu Search Uses memory structures Avoids local Computationally Performs well with
to avoid cycles and minima, flexible intensive, parameter complex constraints
enhance search memory structures tuning required
[25], [103] Parallel Genetic Parallel execution of Faster execution, Complexity in Suitable for large-scale
Algorithm Genetic Algorithms maintains diversity implementation, problems
requires parallel
computing resources
[26] Artificial Immune Inspired by the human Good global search, Can be Effective in dynamic
Algorithm immune system's adaptable to changes computationally environments
adaptive learning expensive, complex
[27], [107] Ant colony Mimics behavior of ants Good for Slow convergence, Effective for routing and
optimization finding paths to food combinatorial requires many network problems
sources problems, positive iterations
feedback loop
[28], [108] Music Based Inspired by musical Simple, few Can get stuck in Easy to implement, often
Harmony Search improvisation parameters to tune local optima, used for optimization
performance problems with continuous
depends on harmony variables
memory
[28] Improved Music Enhanced version of Improved More complex, Better convergence and
Based Harmony Harmony Search with performance over requires fine-tuning solution quality compared
Search better exploration and basic Harmony to basic version
exploitation Search
[29], [103] Real Coded Genetic Genetic Algorithm using Handles continuous Similar issues as GA Suitable for continuous
Algorithm real numbers instead of optimization well (slow convergence, optimization problems
binary premature
convergence)
[26], [109] Bacterial Foraging Inspired by the foraging Good global search Computationally Effective for dynamic and
Optimization behavior of bacteria ability, adaptable intensive, slow noisy environments
convergence
[30], [44], [110] Particle Swarm Models social behavior Simple, few May get trapped in Popular for its simplicity
Optimization of birds flocking or fish parameters, fast local optima, and efficiency
schooling convergence sensitive to
parameter settings
[31], [111] Artificial Bee Colony Mimics the foraging Simple, flexible, Can converge Effective for a wide range
behavior of honey bees good global search prematurely, of optimization problems
ability requires balancing
exploration and
exploitation
[32], [112] Improved Artificial Enhanced version with Better performance Increased Improved results in terms
Bee Colony mechanisms to improve compared to basic complexity of convergence speed and
Algorithm convergence and ABC solution quality
solution quality
[33], [113], [114] Parallel Artificial Bee Parallel implementation Faster, maintains Complexity in Suitable for large-scale and
Colony Algorithm of ABC for faster diversity, scalable implementation, complex problems
execution parallel computing
resources required
[26], [115] Invasive Weed Inspired by the Good for multi- Can be Effective for dynamic and
Optimization colonizing behavior of modal optimization computationally multi-modal environments
weeds expensive,
parameter sensitivity
[34], [116] Differential Uses differential Robust, simple, May converge Popular for continuous and
Evolution Algorithm mutation and crossover good for continuous slowly, sensitive to real-valued optimization
for optimization optimization parameter settings problems
[35], [117] Improved Enhanced version with Better performance Increased Improved convergence
Differential better exploration and over basic DE complexity, requires speed and solution quality
Evolution Algorithm exploitation strategies fine-tuning compared to basic DE
[36], [118] Cuckoo Search Based on brood Simple, efficient for Can converge Effective for various
Algorithm parasitism of some global optimization prematurely, optimization problems,
cuckoo species parameter sensitivity often outperforms some
traditional algorithms
76 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

Study/Reference Metaheuristic Main Concept Advantages Disadvantages Note on Performance

Algorithm
[37], [119] Discrete Cuckoo Adapted for discrete Effective for Can be complex to Suitable for scheduling and
Search Algorithm optimization problems discrete problems implement combinatorial optimization
problems
[38], [120] Bat Algorithm Inspired by the Good balance of May require fine- Effective for continuous
echolocation behavior of exploration and tuning, can converge optimization problems
bats exploitation prematurely
[39], [121] Parallel Bat Parallel implementation Faster, maintains Complexity in Suitable for large-scale
Algorithm of Bat Algorithm for diversity implementation, problems
faster execution requires parallel
computing resources
[40] Coral Reef Algorithm Models coral reef Good balance of Relatively new, less Promising results, effective
formation and exploration and studied, parameter for various optimization
reproduction exploitation sensitivity problems
[41], [122] Parallel Coral Reef Parallel implementation Faster, scalable, Complexity in Suitable for large-scale and
Algorithm for faster and scalable maintains diversity implementation, complex problems
optimization requires parallel
computing resources
[42], [123] Grey Wolf Optimizer Inspired by the social Simple, effective for May converge Effective for multi-modal
hierarchy and hunting various types of prematurely, optimization problems
mechanism of grey optimization sensitive to
wolves problems parameter settings
[43], [124] Discrete Grey Wolf Adapted for discrete Effective for Can be complex to Suitable for scheduling and
Optimizer optimization problems discrete problems implement combinatorial optimization
problems
[125] Modified Genetic Genetic Algorithm with Improved Increased Improved convergence
Algorithm modifications to performance over complexity, still speed and solution quality
improve performance basic GA may converge compared to basic GA
prematurely
[126], [103] Improved Genetic Enhanced version with Better performance Increased Better results in terms of
Algorithm better exploration and compared to basic complexity convergence speed and
exploitation strategies GA solution quality
[127] Modified Ant Colony Enhanced version of Improved More complex, Better convergence speed
Optimization ACO with better performance over computationally and solution quality
Algorithm exploration and basic ACO expensive compared to basic ACO
exploitation strategies
[128] Enhanced Particle Enhanced version with Better performance Increased Improved convergence
Swarm Optimization better mechanisms to over basic PSO complexity, speed and solution quality
avoid local optima and parameter sensitivity compared to basic PSO
improve convergence

parameters, operators, and search strategies,

Understanding the working principle of these
they can be made to fit particular JSS
commonly used metaheuristic algorithms in JSS is
scenarios, providing effective and customized
crucial for selecting appropriate solution approaches and
solutions.
designing effective scheduling strategies tailored to
specific problem instances. The subsequent section • Efficient Exploration of Solution Spaces:
(performance evaluation) of this review delves into each Scheduling issues in job shops usually involve
metaheuristic algorithms in more detail, analyzing their large solution spaces with multiple possible
effectiveness, performance, and practical implications in schedules. Metaheuristic algorithms to
industrial and manufacturing settings. effectively explore these solution spaces,
finding promising areas and avoiding local
B. Advantages of Using Metaheuristics for JSS optima, use iterative search strategies [9].
This subsection discusses the advantages of • Effective Handling of Complex Constraints:
employing metaheuristic algorithms as solution Complex constraints like machine
approaches for JSSP. Metaheuristic algorithms offer dependencies, precedence relationships, and
several benefits over traditional exact optimization setup times are frequently present in JSSP [93].
methods when it comes to addressing the complexities In order to find workable and superior
of JSS, including their ability to efficiently explore large solutions, metaheuristic algorithms can
solution spaces, find high-quality solutions, and adapt to efficiently navigate these constraints by taking
changing conditions. into account several objectives and constraints
at once [20].
• Flexibility and Adaptability: Metaheuristic
algorithms are inherently flexible and • Scalability to Large Problem Instances: Large-
adaptable, able to handling various problem scale JSSPs, which may be computationally
instances and constraints [4]. By modifying the demanding for precise optimization techniques,
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 77

are ideally suited for metaheuristic algorithms (HAIA), and IMBHS, show enhanced performance,
[91]. They provide scalable solutions that do providing effective solutions for single-objective JSSP.
not significantly impair performance even as Hu et al. [133] This study proposes a differential
problem sizes increase [129]. evolutionary algorithm with uncertainty handling
techniques (DEA_UHT) for stochastic reentrant JSSP
• Robustness to Uncertainty and Variability: (SRJSSP). DEA_UHT, utilizing hypothesis tests and
Environments used for JSS are frequently optimal budget allocation, outperforms conventional
unpredictable and variable due to things like methods, balancing computational efficiency and
unforeseen events, machine breaks down, or solution quality amidst uncertainties.
changes in processing times [56].
Metaheuristic algorithms demonstrate Heuristic algorithm and real world-constraints:
resilience against these kinds of uncertainties
Huynh-Tuong et al. [134] This study addresses a
by dynamically adjusting to shifts in the
teamwork scheduling problem with job-person
scheduling context while preserving consistent
constraints, using a Mixed integer linear programming
performance [19].
(MILP) model, heuristics, and metaheuristic
Understanding the advantages of using (Assignment algorithm based on FCFS (ASGN),
metaheuristic algorithms for JSS is crucial for selecting Assignment algorithm based on SPT (ASPT),
appropriate solution approaches and designing effective Assignment algorithm based on LPT (ALPT)), and SA
scheduling strategies. This explores specific to minimize makespan. The SA metaheuristic achieves
metaheuristic algorithms and their advantages in the best solution quality but with longer computation
addressing JSSP, analyzing their effectiveness, time, while the other heuristics offer faster runtimes
performance, and practical implications in industrial and with lower solution quality. Future research may
manufacturing settings. explore evolutionary algorithms for larger instances and
additional constraints. Liu et al. [135] The study focuses
on coordinated scheduling in shared manufacturing
4. Performance Evaluation environments using a non-cooperative game model. The
This section conducts a comprehensive performance Nash equilibrium genetic algorithm (NE-GA) is
evaluation and comparison of the various metaheuristic proposed to minimize completion time and makespan
algorithms discussed in the preceding sections. By while ensuring fair payoff distribution among
systematically assessing the effectiveness, efficiency, customers. The NE-GA outperforms heuristic
and robustness of these optimization methods across algorithms (FCFS, SPT, LPT) and other metaheuristic
different problem instances and evaluation metrics, this optimization techniques (SA, PSO). Future work may
aims to provide insights into their relative performance consider transportation capacity limits and theoretical
and practical implications for JSS applications. convergence analysis. Campo et al. [136] This research
addresses the flexible JSSP with real-world constraints
Evolutionary Algorithm for JSS Optimization: using a GA integrated with fuzzy logic to minimize
Yongsuo et al. [130] This study addresses dynamic tardiness/earliness penalties. Tested on a fabric finishing
JSS with extended constraints, using a GA to minimize production system, the proposed method outperforms
the maximum completion time. The GA outperforms traditional heuristics by over 30%, providing efficient
heuristic algorithms (weighted shortest processing time and effective solutions. Future research may compare
(WSPT), earliest due date (EDD), first come first serve with other metaheuristics and explore additional
(FCFS), longest processing time (LPT), critical ratio constraints.
(CR)) in achieving better results across various Novel algorithmic framework and optimization:
scenarios. Siregar et al. [131] In an aluminum industry
case, the GA significantly reduced the makespan from Zhang et al. [137] This study addresses the flexible
55,970 to 46,637 hours compared to the FCFS method, JSSP with Lot Streaming (LSFJSP) using a DGWO.
improving efficiency by 20.13% and demonstrating the The DGWO algorithm shows strong robustness and
GA's effectiveness in production scheduling. Wang et superior convergence speed compared to GA and PSO,
al. [132] This research introduces the search economics demonstrating competitive performance in
for job-shop scheduling problem (SEJSP) algorithm for computational experiments. Kumar et al. [138] The
flexible JSS, which outperforms other algorithms like study compares Shifting Bottleneck (SB), GA, and PSO
CRO and GA in minimizing makespan. SEJSP's for solving JSSP. GA performs best for smaller
efficient exploration and parameter settings lead to problems, SB is faster but less reliable, and PSO
superior or competitive performance on benchmark struggles with larger problems due to random
instances. Mishra et al. [26] Evaluating various initialization. Future research may explore dynamic
evolutionary algorithms (PSO, AIA, IWO, BFO, JSSP scenarios. Wang et al. [139] Introduces an ABC
MBHS) on 250 benchmark instances, study finds that algorithm for the Flexible JSSP, focusing on
selective initial populations yield better results. Hybrid minimizing maximum completion time. The ABC
methods, particularly Hybrid PSO (HPSO), Hybrid AIA algorithm demonstrates effective global exploration and
78 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

local exploitation, showing efficiency in simulations Defersha et al. [147] This study explores the
compared to existing methods. Zarrouk et al. [140] Flexible JSSP, allowing operations to be assigned to
Presents a two-level PSO algorithm for the flexible job- multiple machines, considering SDST, machine release
shop scheduling problem (FJSP), where the upper level dates, and time lags. A PGA is proposed to solve this
assigns operations to machines and the lower level model efficiently. Numerical examples show that PGA
manages sequencing. The algorithm improves efficiency significantly enhances computational performance,
by reducing evaluated solutions and demonstrates particularly for medium to large problem instances,
significant performance improvements in convergence where traditional sequential GA struggles. Future work
and central processing unit (CPU) time. Hajibabaei et al. will extend this approach to handle multiple objectives
[141] Investigates the Flexible JSSP with unrelated and additional constraints. Abdullah et al. [148] Focuses
parallel machines and sequence-dependent setup times on the NP-hard JSSP and introduces a PGA with
(SDST). In study TS algorithm outperforms GA, adaptive genetic operators and a migration operation to
particularly in instances with varying job numbers and improve results and reduce computation time. Extensive
processing times, confirmed by statistical validation. experiments reveal that adaptive operators and
Dabah et al. [142] Focuses on the Blocking JSSP with parallelism significantly enhance scheduling quality and
zero buffer capacity. The study proposes a parallelized efficiency. The PGA effectively minimizes job
TS algorithm, demonstrating significant improvements completion times by scheduling tasks across multiple
in solution quality and exploration efficiency over machines and jobs, demonstrating notable
sequential approaches, highlighting the benefits of improvements in both scheduling quality and
parallelism. computational efficiency.
Comparative study and Algorithm performance: Meta-heuristic algorithm for scheduling problem
and optimization:
Alharkan et al. [143] This study introduces TS and
GPSO for scheduling jobs on two identical parallel Liu, Z. et al. [149] This study focuses on the
machines with a single server to minimize makespan, an Flexible JSSP and proposes an enhanced GA with a
NP-hard problem. TS and Greedy PSO (GPSO) are three-layer coding mechanism to optimize batching
compared to SA, GA, and Local search (I-L) strategies and subsequent scheduling. Experimental
algorithms, showing strong performance, especially for results show significant improvements in flexible JSSP
medium and large instances, with TS performing best optimization compared to traditional algorithms,
overall except in cases with 8 and 200 jobs. Yu et al. highlighting the algorithm's effectiveness in stabilizing
[144] Provides a comprehensive overview of JSSP and production in batch job shops. Future research may
solutions, emphasizing the importance of efficient involve exploring more advanced optimization
scheduling in manufacturing. It discusses three main algorithms and addressing uncertainties in dynamic
approaches GA, TS, and SA highlighting their production environments. Kumar, P. et al. [150] This
principles, advancements, and applications. The study study presents a MoGA approach for solving the JSSP
underscores the need for integrating diverse algorithms to optimize makespan in manufacturing systems. The
and methodologies to enhance scheduling efficiency and algorithm effectively reduces makespan for specific
precision. Hasani et. al [145] examines scheduling n problems sourced from literature, highlighting the
jobs on two parallel machines with a single server to significance of considering short processing time and
minimize the makespan, proposing two heuristic transportation time in JSS optimization. Future research
algorithms: one to minimize machine idle time and aims to consider additional factors like maintenance
another to minimize gaps between job loadings. time and setup time in machine scheduling. Habbadi, S.
Experiments reveal that for small to medium instances et al. [151] Discusses the application of GA in solving
(up to 400 jobs), SA and GA methods outperform the the JSSP, focusing on manual implementation to
heuristics. However, for larger instances (500 jobs and understand the procedure and decision-making involved
above), the proposed I-L Algorithm proves superior, in finding optimal solutions. The study emphasizes the
remaining efficient even for very large instances up to importance of population initialization and coding in
10,000 jobs. Hasani et al. [146] Focuses on minimizing GA processes, shedding light on practical applications
makespan by scheduling jobs on two parallel machines of mathematics and programming for complex
with a single server, using SA and GA. These methods scheduling problems. Abdullah, N. et al. [152]
are tested on instances with up to 1000 jobs, showing Introduces a modified PSO algorithm to efficiently
that SA and GA outperform previous algorithms, solve the JSSP. By overcoming idle particle positions,
particularly for instances up to 250 jobs. SA tends to the enhanced PSO algorithm demonstrates improved
perform better for larger instances, although GA performance in finding optimal schedules across
occasionally reaches the lower bound more frequently different problem instances, effectively tackling the
for very large instances. Future research will explore complexities of the JSSP. Ali, B. et al. [153] Focuses on
hybrid algorithms and different objective functions. the Dynamic JSSP and proposes a GA approach to
minimize makespan while considering setup times and
Parallel Genetic Algorithm (PGA) for JSS
precedence constraints. The experiments demonstrate
optimization:
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 79

the superior performance of the GA-based approach in the SM, and a SA based simulation-optimization
dynamic scheduling scenarios, highlighting the approach is proposed to find optimal schedules in the
competitiveness and effectiveness of GA in minimizing dynamic system. Results indicate that SA closely
makespan. Shen, Z. et al. [154] Addresses the JSSP in a approximates the performance of the shortest SPT rule
brewery production setting, implementing GA, SA, and with reasonable computational burden, outperforming
ACO algorithms for optimization. Results show other scheduling rules. The study suggests possible
significant improvements in production time for all extensions, including generalizing the SM to handle
three algorithms compared to the unoptimized case, other types of disturbances and incorporating different
with GA performing the best, highlighting the heuristics for larger-scale applications. Zhang et al.
effectiveness of metaheuristic methods in optimizing [159] Proposes a multi-population genetic algorithm for
complex production processes. Janes, G. et al. [155] the multi-objective scheduling of flexible JSP, aiming to
Utilizes a GA to efficiently find schedules for various reduce the longest makespan of workpieces, the load on
real-world scenarios of the JSSP, demonstrating each machine, and the total machine load
satisfactory results and potential cost savings by using simultaneously. By considering factors such as shortest
fewer machines. The study emphasizes the algorithm's processing time and balanced machine utilization, the
readiness for industrial application and provides insights method efficiently allocates machines and simplifies the
for system performance evaluation. Salido et al. [156] scheduling process. The algorithm demonstrates
Addresses the JSSP with Machine Speed Scaling superior performance compared to conventional
(JSMS), proposing a GA to efficiently solve this NP- algorithms in terms of population quality, initial
hard problem by optimizing both makespan and energy solution quality, and convergence rate, offering an
consumption objectives. The GA presents a promising effective solution to the multi-objective scheduling
approach for addressing large-scale scheduling challenges in flexible job-shop environments.
problems with energy-aware optimization requirements.
Dynamic scheduling and rescheduling strategy:
Chaouch et al. [127] Explores bio-inspired algorithms,
including Ant System (AS), Ant Colony System (ACS), Zhang et al. [160] introduce the Improved
and MACO, to tackle the Distributed JSSP. MACO Heuristic Kalman Algorithm (IHKA) for Dynamic
emerges as superior, consistently outperforming AS and JSSP, utilizing a cellular neighbor network to efficiently
ACS across different instances, demonstrating find optimal schedules. Compared to other methods like
promising results in addressing the challenging HKA and Genetic Algorithm-Mixed (GAM), IHKA
Distributed JSSP. Teekeng et al. [128] Introduces demonstrates superior performance, quickly generating
EPSO, a novel algorithm based on PSO, designed to practical solutions for real-world factories. Singh et al.
solve the Flexible JSSP. EPSO demonstrates superior [161] tackle the Flexible JSSP using Quantum-Behaved
performance compared to existing optimization Particle Swarm Optimization (QPSO), which integrates
methods, consistently achieving solutions equal to or GA mutation and chaotic numbers for enhanced global
better than lower bounds of benchmarks, paving the search capabilities, showing promising results in
way for future research in complex flexible JSSP minimizing makespan across various datasets. Wang et
scenarios. al. [162] address Dynamic JSSP in manufacturing,
developing a mixed-integer programming model and
Multi-objective optimization and advanced
enhanced PSO with modified decoding schemes and
algorithmic technique:
population initialization strategies to efficiently handle
Zhang et al. [157] Introduces an IGA for the rescheduling tasks, demonstrating superior performance
Flexible JSSP, aiming to minimize makespan, total compared to existing methods across diverse instances.
setup time, and total transportation time while
Integration of Meta-heuristic and machine learning
considering constraints such as processing time, setup
for scheduling problem:
time, and transportation time. Experimental studies
validate the effectiveness of the proposed approach Lin et. al [163] The Learning-based Cuckoo
across various datasets, demonstrating superior Search (LCS) algorithm, integrated with machine
performance compared to existing algorithms in terms learning techniques like auto encoders and factorization
of finding non-dominated solutions and optimizing machines (FM), efficiently tackles the flexible JSSP. By
objective values. The IGA consistently produces high- compressing solution spaces and dynamically adjusting
quality solutions across different problem sizes and parameters through reinforcement learning (RL), LCS
complexities, confirming its efficacy in addressing FJSP achieves faster convergence and higher-quality
with multiple time constraints. Future research may solutions compared to conventional methods.
explore the relationship between initial and final Computational experiments demonstrate LCS's
solutions and enhance genetic operators using individual superiority over heuristic rules, metaheuristics, and even
fitness information. Sel et al. [158] Addresses the IBM CPLEX Interactive Optimizer, particularly in
Dynamic JSSP by introducing a Simulation Model (SM) large-scale scenarios. This amalgamation of machine
that incorporates machine failures and changing due learning and metaheuristics positions LCS as a potent
dates. Three scheduling rules (SRs) are integrated into tool for resolving complex Flexible JSSPs, with future
80 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

improvements focusing on enhancing optimization comprehensive experimental evaluation, the hybrid

through advanced machine learning methods. Zebari et. approach demonstrates superior performance in
al [164] In addressing the Multi-Objective Flexible exploring the solution space, balancing exploitation and
JSSP, this research proposes a hybrid approach exploration, and generating diverse, high-quality
integrating the Hybrid BA and SA. Given the solutions across various scenarios.
complexities involved in optimizing conflicting
Table 2 presents the summary of comparative
objectives like makespan reduction and production cost
analysis of various metaheuristic algorithms based
minimization, conventional approaches often struggle.
category of algorithm, objective(s), and problem
The Hybrid BA and SA approach outperforms
addressed. It also highlights the key findings of each
individual algorithms and other state-of-the-art
study reviewed.
techniques by leveraging the exploration capabilities of
BA and the exploitation strategies of SA. Through
Table 2 Summary of the Comparative analysis of metaheuristic algorithm
Types Study Objective(s) Problem Addressed Methodology Key findings
Evolutionary [130] MMCT Dynamic JSSP with extended GA compared with GA outperforms
Algorithm for JSS process constraints. WSPT, EDD, FCFS, heuristic algorithms in
optimization LPT, and CR minimizing maximum
algorithms. completion time.
[131] MMK Scheduling in the aluminum GA, and FCFS GA reduces makespan
industry by 20.13% and shows
better efficiency
[132] MMK FJSSP SEJSP Algorithm, SEJSP achieves
CRO, and GA. competitive or superior
performance
[26] MMK JSSP PSO, AIA, IWO, Hybrid methods show
BFO, MBHS improved performance
[133] ISE, ISQ SRJSSP DEA with uncertainty DEA_UHT is robust
handling techniques and effective,
(hypothesis test outperforming
technique (HTT) and conventional methods
optimal computing
budget allocation
technique (OCBAT))
Heuristic algorithm [134] MMK Teamwork scheduling with MILP model, SA achieves best
and real world- job-person constraints heuristics (ASGN, solution quality;
constraints ASPT, ALPT, SA) ASGN, ASPT, ALPT
offer faster runtime
[135] MMCT, MMK Coordinated scheduling of Nash equilibrium NE-GA minimizes
parallel machine production genetic algorithm makespan effectively
and transportation (NE-GA)
[136] MTD, MEP FJSSP with SDST, due GA with fuzzy logic Reduces
windows, uncertainties tardiness/earliness
penalties by over 30%
Novel algorithmic [137] RBS, CVS LSFJSP DGWO algorithm DGWO shows strong
framework and robustness, superior
optimization convergence speed and
accuracy
[138] RBS, CVS, ACC JSSP SB, GA, and PSO GA performs best for
smaller problems, SB
is faster but less
reliable
[139] MMCT Flexible Job-Shop ABC algorithm ABC algorithm shows
Scheduling Problem (FJSP) efficiency and
effectiveness
[140] WSQ FJSP with two-level PSO Two-level PSO Significant
algorithm improvements in
convergence and CPU
time
[141] MST FJJSP with unrelated parallel MILP, TS algorithm TS outperforms GA,
machines and SDST applicable in diverse
industries
[142] ISQ, IST Blocking JSSP (BJSS) with Parallelized TS Parallel TS methods
zero buffer capacity algorithm enhance solution
quality
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 81

Types Study Objective(s) Problem Addressed Methodology Key findings

Comparative study [143] MMK Scheduling on two identical TS, GPSO TS and GPSO perform
and Algorithm parallel machines with a well for medium- and
performance single server large-scale instances
[144] ISE JSSP GA, TS, SA advancements and
practical applications
of each method
[145] MMK Scheduling on two parallel Heuristic algorithms Proposed heuristic
machines with a single minimizing makespan algorithms (Min-idle,
server. with two parallel Min-load gap) perform
machines and a single well for larger
server. instances (500 jobs and
above), outperforming
other methods.
[146] MMK Scheduling on two parallel SA and GA Composite
machines with a single server neighborhood
approach outperforms
previous algorithms
Parallel Genetic [147] SDAT, TLR, MRD Flexible JSSP with multiple PGA PGA improves
Algorithm (PGA) for constraints computational
JSS optimization performance,
especially for medium-
sized problems
[148] MPT JSSP, NP-hard nature PGA with adaptive Adaptive operators and
operators and parallelism improve
migration results and reduce
computation time
Meta-heuristic [149] ISE FJSSP Enhanced GA with Significant
algorithm for three-layer coding improvements in
scheduling problem and operation computational
and optimization overlapping strategy efficiency and solution
quality
[150] MMK JSSP Modified GA Reductions in
makespan for specific
problems

[151] MMK JSSP optimization using GA Manually Emphasizes

implemented GA importance of
population
initialization and
coding
[152] ISE JSSP with PSO algorithm Modified PSO Outperforms standard
PSO in finding optimal
schedules
[153] MMK DJSSP with setup times and GA Approach GA shows superior
precedence constraints performance in
minimizing makespan
[154] PEF JSSP in brewery production GA, SA, and ACO GA saves 35% in
production time; SA
and ACO also improve
production time
[155] CSV, MMK JSSP with modified GA GA Achieves reduced
operations makespan in short time
for real-world
scenarios.
[156] MMK, MEC JSSP with Machine Speed GA GA optimizes
Scaling (JSMS) makespan and energy
consumption compare
to the IBM ILOG
CPLEX CP Optimizer.
[127] ACC Distributed JSSP (DJSP) Ant System (AS), Ant MACO minimizes
Colony System makespan effectively
(ACS), MACO
[128] ISQ Flexible JSSP Enhanced PSO EPSO outperforms
(EPSO), AIA AIA and Demir's
model
82 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

Types Study Objective(s) Problem Addressed Methodology Key findings

Multi-objective [157] MMK, MST, MTT FJSP with constraints Improved Genetic Experimental studies
optimization and Algorithm (IGA) validate the
advanced algorithmic effectiveness of the
technique proposed approach
across various datasets,
demonstrating superior
performance compared
to existing algorithms.
[158] ISE Dynamic JSSP (DJSP) Simulation model SPT yields the best
with SA, EDD, SPT, performance; SA
FCFS closely approximates
SPT with reasonable
computational burden,
outperforming EDD
and FIFO.
[159] MMK, MFT Multi-objective FJSP Multi-population Efficiently allocates
Genetic Algorithm machines, reduces total
machine load
Dynamic scheduling [160] ISE Dynamic JSSP (DJSSP) Improved Heuristic IHKA outperforms
and rescheduling Kalman Algorithm HKA and GAM, and
strategy (IHKA) utilizing a Quickly generates
cellular neighbor practical solutions for
network real-world factories
[161] MMK Flexible Job-Shop Quantum-Behaved QPSO shows
Scheduling Problem (FJJSP) Particle Swarm promising results in
Optimization (QPSO) minimizing makespan
integrating genetic across various datasets
algorithm mutation
and chaotic numbers
[162] WSQ DJSSP Mixed-integer Enhanced PSO shows
programming model superior performance
with enhanced in handling
Particle Swarm rescheduling tasks
Optimization (PSO) compared to existing
methods
Integration of Meta- [163] CVS, ISQ FJSSP Learning-based LCS achieves better
heuristic and machine Cuckoo Search (LCS) solutions in less CPU
learning for integrating machine- time than CPLEX,
scheduling problem learning techniques heuristic rules, and
metaheuristics.
[164] MMK, CSV Multi-Objective Flexible Hybrid Bat Algorithm Hybrid BA and SA
Job-Shop Scheduling (BA) and SA improve convergence
Problem (MOFJSSP) rates and solution
quality. Better balance
between exploitation
and exploration
compared to other
techniques.

innovation in the domain of JSS, guiding future research

This rigorous comparative analysis provides
efforts and industry practices.
valuable insights into the performance and applicability
of metaheuristic algorithms for JSS. This analysis
contribute to the understanding of algorithm behavior A. Challenges in Applying Metaheuristic
and guide practitioners and researchers in choosing Algorithms to Job Shop Scheduling
appropriate optimization methods for their scheduling
This sub section provide an overview of common
tasks.
metaheuristic algorithms used in JSS. Metaheuristic
algorithms are powerful optimization techniques that
5. Challenges and Future Directions offer flexible and robust approach to find optimal
solutions to complex scheduling problems. By exploring
This section discusses challenges faced by current these common metaheuristic algorithms, this paper aims
metaheuristic algorithms and emerging trends in the to elucidate their principles, operational characteristics,
field of JSS optimization. Identify the key challenges and advantages in addressing various scheduling
and potential avenues for future research and challenges in different environments. Despite their
development, this aims to stimulate further effectiveness, applying metaheuristic algorithms to JSS
advancements in algorithm design, problem modeling, encounters several challenges. Understanding and
and practical implementation. This section provide addressing these challenges is crucial for further
insights into the unresolved issues and opportunities for
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 83

improving the performance and applicability of influence the effectiveness of scheduling

optimization techniques in manufacturing environments. solutions.
Problem Complexity: • Impact: Integrating domain knowledge into
metaheuristic algorithms poses challenges in
• Description: JSSPs pose inherent complexity
terms of knowledge representation,
owing to the combinatorial nature of
incorporation methods, and balancing the use
optimization tasks, the existence of multiple
of explicit knowledge with algorithmic
conflicting objectives, and the presence of
exploration and exploitation.
diverse constraints.
Multi-Objective Optimization:
• Impact: The complexity of JSS poses
challenges for metaheuristic algorithms, • Description: JSS frequently entails managing
requiring them to efficiently explore the vast multiple conflicting objectives, including
solution space and balance competing minimization makespan, reducing tardiness,
objectives while respecting constraints. and optimizing resource utilization.
High-Dimensional Search Space: • Impact: Metaheuristic algorithms must
effectively handle multi-objective
• Description: JSSPs typically entail navigating a
optimization, balancing trade-offs between
high-dimensional search space, characterized
competing objectives and generating Pareto-
by a multitude of decision variables
optimal solutions that represent meaningful
representing machine assignments, operation
compromises.
sequences, and job schedules.
These challenges requires interdisciplinary
• Impact: Navigating high-dimensional search research efforts combining expertise in optimization,
spaces presents challenges for metaheuristic operations research, computer science, and
algorithms in terms of exploration, manufacturing engineering. By overcome to these
exploitation, and convergence speed, as well as challenges, researchers and practitioners can further
memory and computational resource advance the capabilities and practical applicability of
requirements. metaheuristic algorithms for JSS, leading to more
Dynamic and Uncertain Environments: efficient and agile manufacturing systems.
• Description: Manufacturing environments are
dynamic and subject to uncertainties such as
B. Potential Research Directions and Areas
machine breakdowns, unexpected job arrivals, for Improvement
and changes in demand or resource Identify the potential research directions and areas
availability. for improvement is essential for advancing the field of
• Impact: Metaheuristic algorithms must adapt to JSS optimization using metaheuristic algorithms. By
dynamic and uncertain environments, requiring focus on the key challenges and emerging trends,
robustness, flexibility, and adaptability to researchers can address current limitations and drive
handle changing conditions and maintain high- innovation in algorithm design, problem modeling, and
quality solutions. practical implementation.

Scalability and Efficiency: Development of Hybrid and Advanced

Techniques:
• Description: As manufacturing systems grow
in complexity and scale, the scalability and • Explore novel combinations of metaheuristic
efficiency of metaheuristic algorithms become algorithms, machine learning techniques, and
increasingly important. optimization paradigms to develop hybrid and
advanced approaches for JSS. Investigate the
• Impact: Ensuring the scalability and efficiency integration of reinforcement learning, deep
of algorithms is essential for handling large- learning, and other AI-based methods with
scale scheduling instances with many jobs, metaheuristic algorithms to enhance solution
machines, and production constraints, as well quality, scalability, and adaptability.
as meeting real-time or near-real-time
scheduling requirements. Multi-Objective and Robust Optimization:

Incorporation of Domain Knowledge: • Develop metaheuristic algorithms capable of

efficiently solving multi-objective JSSPs,
• Description: Domain-specific knowledge, such balancing conflicting objectives and generating
as production rules, machine capabilities, and Pareto-optimal solutions. Explore robust
scheduling preferences, can significantly optimization techniques that can handle
84 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

uncertainties and dynamic changes in makespan, reducing tardiness, and maximizing

manufacturing environments, ensuring the resource utilization) should be clearly defined.
resilience and reliability of scheduling
Define Constraints: Determine every relevant
solutions.
limitations, such as processing times, resource
Scalability and Efficiency Improvements: constraints, precedence relationships, and
machine availability.
• Develop scalable metaheuristic algorithms
capable of efficiently handling large-scale JSS Formulate the Problem: Create a computational
instances with thousands of jobs, machines, or mathematical model of the JSS issue,
and production constraints. Investigate parallel making sure that it accurately represent the
and distributed optimization techniques, actual situation.
metaheuristic ensembles, and adaptive search
• Selection of Metaheuristic Algorithm:
strategies for improving algorithm efficiency
and reducing computational overhead. Algorithm Choice: Based on the characteristics
of the problem and the goals of the research,
Dynamic and Real-Time Scheduling:
select an appropriate metaheuristic algorithm.
• Address the challenges of dynamic and real- Popular options include TS, PSO, ACO, GA,
time JSS by developing metaheuristic and SA.
algorithms that can adaptively respond to
Hybrid Approaches: To improve performance,
changing production conditions and resource
think about combining the chosen
constraints. Explore online optimization
metaheuristic with additional optimization
techniques, predictive modeling approaches,
strategies (such as machine learning, exact
and reactive scheduling strategies for
methods, or local search).
optimizing scheduling decisions in real-time
manufacturing environments. • Algorithm Design and Implementation:
Explainable AI and Decision Support Systems: Parameter Tuning: Determine the metaheuristic
algorithm's important parameters (population
• Develop metaheuristic algorithms with
size, mutation rate, cooling schedule, etc.) and
enhanced interpretability and explainability,
optimize those using parameter-tuning
enabling stakeholders to understand and trust
strategies (grid search, response surface
scheduling solutions generated by optimization
methodology, etc.).
techniques. Investigate visualization tools,
decision support systems, and interactive Algorithm Customization: Modify the
interfaces for facilitating human-computer algorithm to include constraints and knowledge
collaboration in the JSS process. unique to the problem. This could entail
creating neighborhood structures, encoding
These research directions and areas for
schemes, or specialized operators.
improvement helps the researchers can advance the
state-of-the-art in metaheuristic optimization for JSS, Adaptive Mechanisms: In order to balance
leading to more efficient, agile, and resilient exploration and exploitation, implement
manufacturing systems. These efforts contribute to the adaptive mechanisms that dynamically adjust
development of innovative solutions that address the algorithm parameters based on the search
evolving challenges and requirements of modern progress.
manufacturing environments.
• Computational Experiments:
C. Application Guidelines for Using Benchmarking: To assess the algorithm's
Metaheuristic Algorithms in Future Work performance in comparison to current methods,
test it on common benchmark instances of
For future research and practice, these following JSSPs.
guideline offers a thorough method for applying
metaheuristic algorithms to JSSPs in an efficient Scalability Testing: Assess the algorithm’s
manner. To handle the complexity and limitations of job scalability by applying it to problems of
shop environments, researchers and practitioners can varying sizes and complexities to ensure it can
design, implement, and assess metaheuristic algorithms handle large-scale instances.
by following these steps. • Real-World Application:
• Problem Definition and Modelling: Data Collection: Gather real-world information
Identify Objectives: The scheduling from workshop settings, such as schedule
problem's objectives (such as minimizing restrictions, machine specifications, and job
specifications.
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 85

Customization for Real-World Use: Modify the • Advantages: Enables decision-makers to

algorithm to accommodate particular real- explore trade-offs between competing
world limitations and specifications, such as objectives and make informed decisions based
material handling considerations, operator on the Pareto front, leading to more flexible
availability, and machine maintenance and adaptable scheduling solutions.
schedules.
Explainable AI and Transparent Optimization:
Simulation and Validation: Prior to
implementing the algorithm in real-world • Description: Emphasis on explainable AI
settings, validate its performance in a techniques and transparent optimization
controlled environment using simulation methods that provide insights into the decision-
models. making process and rationale behind
scheduling solutions generated by
Researchers and practitioners effectively use the metaheuristic algorithms.
metaheuristic algorithms to address the challenges of
JSS, improve production efficiency, and stimulate • Advantages: Enhances trust, understanding,
innovation in manufacturing processes by adhering to and acceptance of scheduling solutions among
this application guideline. stakeholders, enabling effective
communication, collaboration, and decision-
making in manufacturing environments.
D. Trends in Metaheuristic-Based Approaches
for Job Shop Scheduling Real-Time and Adaptive Scheduling Strategies:

This sub-section explores emerging trends and • Description: Creating real-time and adaptive
advancements in metaheuristic-based approaches for scheduling strategies involves creating
JSS optimization. These trends reflect recent approaches that dynamically adapt scheduling
developments and innovations that have the potential to decisions to accommodate evolving production
shape the future of scheduling techniques in conditions, resource availability, and
manufacturing and production environments. fluctuations in demand.
Hybridization with Machine Learning Techniques: • Advantages: Enables agile, responsive, and
adaptive scheduling in dynamic manufacturing
• Description: Integration of metaheuristic environments, improving production
algorithms with machine learning techniques efficiency, flexibility, and resilience.
such as reinforcement learning, neural
networks, and deep learning. Embracing these emerging trends and
advancements, researchers and practitioners leverage
• Advantages: Enhances the learning and the full potential of metaheuristic-based approaches for
adaptation capabilities of metaheuristic addressing the evolving challenges and requirements of
algorithms, enabling them to leverage JSS in modern manufacturing environments. These
historical data, learn from experience, and trends represent exciting opportunities for innovation
improve solution quality over time. and improvement in scheduling techniques, paving the
Metaheuristic-Driven Optimization Platforms: way for more efficient, flexible, and intelligent
manufacturing systems.
• Description: Development of optimization
platforms and frameworks that provide a
unified environment for implementing, testing, 6. Conclusion
and deploying metaheuristic-based scheduling
This review paper provides valuable insights into the
solutions.
application of metaheuristic algorithms for addressing
• Advantages: Facilitates rapid prototyping, the complex problem of JSS. Through a comprehensive
experimentation, and deployment of analysis of various metaheuristic approaches such as
metaheuristic algorithms for JSS tasks, GA, SA, PSO, ACO, and others, the paper highlights
fostering collaboration and knowledge sharing their working principle, strength and suitability for
among researchers and practitioners. different JSS scenarios. The analysis pertaining to
efficiency, adaptability, computational complexity and
Multi-Objective and Pareto-Based Optimization: robustness of various metaheuristic algorithms like GA,
• Description: Focus on multi-objective PSO, ACO, and SA in JSS is discussed in performance
optimization techniques that generate Pareto- evaluation. GA, PSO, ACO, and SA each have unique
optimal solutions, balancing conflicting strengths. GA and ACO are known for their high
objectives such as makespan minimization, solution quality and adaptability. PSO converges
tardiness reduction, and resource utilization quickly but is sensitive to parameter settings. SA is
optimization. effective in avoiding local optima but can be
86 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

computationally intensive. Together, these algorithms [3] T. Dokeroglu, T. Kucukyilmaz, and E.-G. Talbi, “Hyper-
heuristics: a survey and taxonomy,” Computers & Industrial
are versatile for various JSS challenges. In JSS, GA
Engineering, vol. 187, p. 109815, Jan. 2024, doi:
have moderate computational complexity and are 10.1016/j.cie.2023.109815.
suitable for large problems. PSO has relatively low [4] V. Tomar, M. Bansal, and P. Singh, “Metaheuristic algorithms
computational overhead. ACO is computationally for optimization: a brief review,” Multidisciplinary digital
publishing institute, Mar. 2024, p. 238. doi:
intensive due to pheromone updates. SA is
10.3390/engproc2023059238.
straightforward but can be computationally demanding. [5] G. Da Col and E. C. Teppan, “Industrial-size job shop
Key findings suggest that no single metaheuristic scheduling with constraint programming,” Operations Research
consistently outperforms others across all problem Perspectives, vol. 9, p. 100249, 2022, doi:
10.1016/j.orp.2022.1002490.
instances. Instead, the performance of each algorithm is
[6] R. A. Liaqait, S. Hamid, S. S. Warsi, and A. Khalid, “A critical
heavily dependent on problem-specific characteristics analysis of job shop scheduling in context of industry 4.0,”
and parameter tuning. Emerging trends in this field Sustainability, vol. 13, no. 14, p. 7684, Jul. 2021, doi:
include the integration of advanced techniques like 10.3390/su13147684.
[7] J. Zhang, G. Ding, Y. Zou, S. Qin, and J. Fu, “Review of job
machine learning and real time strategies, as well as the
shop scheduling research and its new perspectives under
exploration of hybrid metaheuristic approaches for Industry 4.0,” Journal of Intelligent Manufacturing, vol. 30, no.
improved performance. Potential research directions 4, pp. 1809–1830, Apr. 2019, doi: 10.1007/s10845-017-1350-2.
encompass the development of novel metaheuristic [8] X. Wu, X. Yan, D. Guan, and M. Wei, “A deep reinforcement
learning model for dynamic job-shop scheduling problem with
algorithms inspired by hybrid and advanced techniques,
uncertain processing time,” Engineering Applications of
as well as the investigation of multi-objective JSSPs to Artificial Intelligence, vol. 131, p. 107790, May 2024, doi:
balance conflicting objectives. Challenges in this 10.1016/j.engappai.2023.107790.
domain revolve around the scalability, uncertain [9] D. Vivekanandan, S. Wirth, P. Karlbauer, and N. Klarmann, “A
reinforcement learning approach for scheduling problems with
environment, and problem complexity of metaheuristic
improved generalization through order swapping,” Journal of
algorithms. Additionally, the lack of standardized computer science and artificial intelligence, Mar 2023, doi:
benchmark datasets and performance evaluation metrics 10.48550/ARXIV.2302.13941.
poses a challenge to algorithm comparison and [10] G. Infantes, S. Roussel, P. Pereira, A. Jacquet, and E. Benazera,
“Learning to Solve Job Shop Scheduling under Uncertainty,”
validation. Addressing these challenges will require
Journal of computer science and artificial intelligence, Mar
interdisciplinary collaboration and innovative 2024, doi: 10.48550/ARXIV.2404.01308.
methodologies to advance the efficiency and [11] Z. Zhou, L. Xu, X. Ling, and B. Zhang, “Digital-twin-based job
effectiveness of JSS optimization techniques. Thus, this shop multi-objective scheduling model and strategy,”
International Journal of Computer Integrated Manufacturing,
review underscores the importance of continued
vol. 37, no. 1–2, pp. 87–107, Feb. 2024, doi:
research and development in metaheuristic algorithms to 10.1080/0951192X.2023.2204475.
enhance scheduling practices and optimize [12] P. Penchev, P. Vitliemov, and I. Georgiev, “Optimization model
manufacturing operations. for production scheduling taking into account preventive
maintenance in an uncertainty-based production system,”
Heliyon, vol. 9, no. 7, pp. e17485, Jul. 2023, doi:
10.1016/j.heliyon.2023.e17485.
Conflicts of Interest [13] M. M. Teshome, T. Y. Meles, and C.-L. Yang, “Productivity
improvement through assembly line balancing by using
The authors have no conflicts of interest to declare. simulation modeling in case of Abay garment industry Gondar,”
Heliyon, vol. 10, no. 1, pp. e23585, Jan. 2024, doi:
10.1016/j.heliyon.2023.e23585.
Authors’ Contribution Statement [14] S. Khorasani, E. Körpeoğlu, and V. V. Krishnan, “Dynamic
Development Contests,” Operations Research, vol. 72, no. 1, pp.
DCH: Conceptualization, data acquisition, data 43–59, Jan. 2024, doi: 10.1287/opre.2021.0420.
collection, data curation, data analysis, writing original [15] M. Aghelinejad, Y. Ouazene, and A. Yalaoui, “Production
draft, and interpretation of results. SSP: Data analysis, scheduling optimisation with machine state and time-dependent
energy costs,” International Journal of Production Research, vol.
design, data representation, interpretation of results, 56, no. 16, pp. 5558–5575, Aug. 2018, doi:
writing original draft, and reading proof. SMP: 10.1080/00207543.2017.1414969.
Conceptualization, study conception, writing original [16] Y. M. Omar, M. Minoufekr, and P. Plapper, ‘Business analytics
draft, interpretation of results, supervision, review, in manufacturing: current trends, challenges and pathway to
market leadership’, Operations Research Perspectives, vol. 6, pp.
reading proof, and the revision of the whole article. 100127, Oct. 2019, doi: 10.1016/j.orp.2019.100127.
[17] Z.-Y. Wang and C. Lu, “An integrated job shop scheduling and
assembly sequence planning approach for discrete
References manufacturing,” Journal of Manufacturing Systems, vol. 61, pp.
27–44, Oct. 2021, doi: 10.1016/j.jmsy.2021.08.003.
[1] M. Geurtsen, J. B. H. C. Didden, J. Adan, Z. Atan, and I. Adan, [18] P. J. Lederer and L. Li, “Pricing, production, scheduling, and
“Production, maintenance and resource scheduling: a review,” delivery-time competition,” Operations Research, vol. 45, no. 3,
European Journal of Operational Research, vol. 305, no. 2, pp. pp. 407–420, 1997, Accessed: May 06, 2024. [Online].
501–529, Mar. 2023, doi: 10.1016/j.ejor.2022.03.045. Available: https://www.jstor.org/stable/172018.
[2] L. Xue, S. Zhao, A. Mahmoudi, and M. R. Feylizadeh, “Flexible [19] A. M. Nassef, M. A. Abdelkareem, H. M. Maghrabie, and A.
job-shop scheduling problem with parallel batch machines based Baroutaji, “Review of metaheuristic optimization algorithms for
on an enhanced multi-population genetic algorithm,” Complex power systems problems,” Sustainability, vol. 15, no. 12, pp.
& Intelligent Systems, vol. 10, no. 3, pp. 4083–4101, Jun. 2024, 9434, Jun. 2023, doi: 10.3390/su15129434.
doi: 10.1007/s40747-024-01374-7.
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 87

[20] K. Rajwar, K. Deep, and S. Das, “An exhaustive review of the [35] L. Tang, Y. Zhao, and J. Liu, “An improved differential
metaheuristic algorithms for search and optimization: taxonomy, evolution algorithm for practical dynamic scheduling in
applications, and open challenges,” Complex & Intelligent steelmaking-continuous casting production,” IEEE transactions
Systems, vol. 56, no. 11, pp. 13187–13257, Nov. 2023, doi: on evolutionary computation, vol. 18, no. 2, pp. 209–225, Apr.
10.1007/s10462-023-10470-y. 2014, doi: 10.1109/TEVC.2013.2250977.
[21] R. P. Badoni et al., “An exploration and exploitation-based [36] S. Hanoun, S. Nahavandi, D. Creighton, and H. Kull, “Solving a
metaheuristic approach for university course timetabling multiobjective job shop scheduling problem using Pareto
problems,” Axioms, vol. 12, no. 8, pp. 720, Jul. 2023, doi: Archived Cuckoo Search,” In Proceedings of 2012 IEEE 17th
10.3390/axioms12080720. International Conference on Emerging Technologies & Factory
[22] L. Davis, “Job shop scheduling with genetic algorithm,” In Automation, Kracow, Poland, IEEE, Sep. 2012, pp. 1–8. doi:
Proceedings of the First International Conference on Genetic https://doi.org/10.1109/ETFA.2012.6489617.
Algorithms and their Applications, J. J. Grefenstette, Ed., New [37] A. Ouaarab, B. Ahiod, X.-S. Yang, and M. Abbad, “Discrete
York, Psychology Press, 1985, pp. 136-140. doi: cuckoo search algorithm for job shop scheduling problem,” in
10.4324/9781315799674. 2014 IEEE International Symposium on Intelligent Control, Juan
[23] R. W. Eglese, “Simulated annealing: a tool for operational Les Pins, France, Oct. 2014, pp. 1872–1876. doi:
research,” European Journal of Operational Research, vol. 46, 10.1109/ISIC.2014.6967636.
no. 3, pp. 271–281, Jun. 1990, doi: 10.1016/0377- [38] M. K. Marichelvam and T. Prabaharan, “A bat algorithm for
2217(90)90001-R. realistic hybrid flowshop scheduling problems to minimize
[24] M. Widmer, “Job Shop Scheduling with Tooling Constraints: a makespan and mean flow time,” ICTACT Journal of Soft
Tabu Search Approach,” Journal of the Operational Research Computing, vol. 03, no. 01, pp. 428–433, Oct. 2012, doi:
Society, vol. 42, no. 1, pp. 75–82, Jan. 1991, doi: 10.21917/ijsc.2012.0066.
10.1057/jors.1991.9. [39] T.-K. Dao, T.-S. Pan, T.-T. Nguyen, and J.-S. Pan, “Parallel bat
[25] S.-C. Lin, E. D. Goodman, and W. F. Punch, “Investigating algorithm for optimizing makespan in job shop scheduling
parallel genetic algorithms on job shop scheduling problems,” in problems,” Journal of Intelligent Manufacturing, vol. 29, no. 2,
Evolutionary Programming VI, vol. 1213, P. J. Angeline, R. G. pp. 451–462, Feb. 2018, doi: 10.1007/s10845-015-1121-x.
Reynolds, J. R. McDonnell, and R. Eberhart, Eds., Berlin, [40] Salcedo-Sanz, S., Del Ser, J., Landa-Torres, I., Gil-López, S., &
Heidelberg: Springer Berlin Heidelberg, 1997, pp. 383–393. doi: Portilla-Figueras, A., “The coral reefs optimization algorithm: an
10.1007/BFb0014827. efficient meta-heuristic for solving hard optimization problems,”
[26] S. K. Mishra and C. S. P. Rao, “Performance comparison of In Proceedings of the 15th international conference on applied
some evolutionary algorithms on job shop scheduling stochastic models and data analysis, pp. 751-758, Jun. 2013.
problems,” IOP Conference Series: Materials Science and [41] Chun-Wei Tsai, Heng-Ci Chang, Kai-Cheng Hu, and Ming-
Engineering, vol. 149, pp. 012041, Sep. 2016, doi: Chao Chiang, “Parallel coral reef algorithm for solving JSP on
10.1088/1757-899X/149/1/012041. Spark,” in 2016 IEEE International Conference on Systems,
[27] M. den Besten, T. Stützle, and M. Dorigo, “Ant Colony Man, and Cybernetics, Budapest, Hungary, Oct. 2016, pp.
Optimization for the Total Weighted Tardiness Problem,” in 001872–001877. doi: 10.1109/SMC.2016.7844511.
Parallel Problem Solving from Nature PPSN VI, M. Schoenauer, [42] S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey Wolf
K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Optimizer,” Advances in Engineering Software, vol. 69, pp. 46–
Schwefel, Eds., Berlin, Heidelberg: Springer, 2000, pp. 611– 61, Mar. 2014, doi: 10.1016/j.advengsoft.2013.12.007.
620. doi: 10.1007/3-540-45356-3_60. [43] C. Lu, S. Xiao, X. Li, and L. Gao, “An effective multi-objective
[28] H. Madivada and R. C.S.P, “Improved Music Based Harmony discrete grey wolf optimizer for a real-world scheduling problem
Search (IMBHS) for Solving Job Shop Scheduling Problems in welding production,” Advances in Engineering Software, vol.
(JSSPS),” International journal of Programming Languages and 99, pp. 161–176, Sep. 2016, doi:
applications, vol. 3, no. 3, pp. 1–15, Jul. 2013, doi: 10.1016/j.advengsoft.2016.06.004.
10.5121/ijpla.2013.3301. [44] A. G. Gad, “Particle swarm optimization algorithm and its
[29] S. Matsui, I. Watanabe, and K. Tokoro, “Real-Coded Parameter- applications: a systematic review,” Archives of Computational
Free Genetic Algorithm for Job-Shop Scheduling Problems,” in Methods in Engineering, vol. 29, no. 5, pp. 2531–2561, Aug.
Parallel Problem Solving from Nature — PPSN VII, vol. 2439, 2022, doi: 10.1007/s11831-021-09694-4.
J. J. M. Guervós, P. Adamidis, H.-G. Beyer, H.-P. Schwefel, and [45] J.-S. Pan, P. Hu, V. Snášel, and S.-C. Chu, “A survey on binary
J.-L. Fernández-Villacañas, Eds., Berlin, Heidelberg: Springer metaheuristic algorithms and their engineering applications,”
Berlin Heidelberg, 2002, pp. 800–810. doi: 10.1007/3-540- Journal of Intelligent Manufacturing, vol. 56, no. 7, pp. 6101–
45712-7_77. 6167, Jul. 2023, doi: 10.1007/s10462-022-10328-9.
[30] H. W. Ge, Y. C. Liang, Y. Zhou, and X. C. Guo, “A particle [46] H. Zhang, B. Buchmeister, X. Li, and R. Ojstersek, ‘An Efficient
swarm optimization-based algorithm for job-shop scheduling Metaheuristic Algorithm for Job Shop Scheduling in a Dynamic
problems,” international journal of computational methods, vol. Environment’, Mathematics, vol. 11, no. 10, pp. 2336, May
02, no. 03, pp. 419–430, Sep. 2005, doi: 2023, doi: 10.3390/math11102336.
10.1142/S0219876205000569. [47] Z. Liang, P. Zhong, M. Liu, C. Zhang, and Z. Zhang, ‘A
[31] Chong, C. S., Low, M. Y. H., Sivakumar, A. I., & Gay, K. L. “A computational efficient optimization of flow shop scheduling
bee colony optimization algorithm to job shop scheduling,” In problems’, Scientific reports, vol. 12, no. 1, p. 845, Jan. 2022,
IEEE Proceedings of the 2006 winter simulation conference, pp. doi: 10.1038/s41598-022-04887-8.
1954-1961, Dec. 2006, doi: [48] B. Jeong, J.-H. Han, and J.-Y. Lee, ‘Metaheuristics for a flow
https://doi.org/10.1109/WSC.2006.322980. shop scheduling problem with urgent jobs and limited waiting
[32] B. Z. Yao, C. Y. Yang, J. J. Hu, G. D. Yin, and B. Yu, “An times’, Algorithms, vol. 14, no. 11, pp. 323, Nov. 2021, doi:
improved artificial bee colony algorithm for job shop problem,” 10.3390/a14110323.
Applied mechanics and materials, vol. 26–28, pp. 657–660, Jun. [49] Khaje Zadeh, S., Shahverdiani, S., Daneshvar, A., & Madanchi
2010, doi: 10.4028/www.scientific.net/AMM.26-28.657. Zaj, M., “Predicting the optimal stock portfolio approach of
[33] L. Asadzadeh, “A parallel artificial bee colony algorithm for the meta-heuristic algorithm and Markov decision process,” Journal
job shop scheduling problem with a dynamic migration of decisions and operations research, vol. 5, no. 4, pp. 426-445,
strategy,” Computers & Industrial Engineering, vol. 102, pp. 2021, doi: https://doi.org/10.22105/dmor.2020.239616.1183.
359–367, Dec. 2016, doi: 10.1016/j.cie.2016.06.025. [50] T. Q. Ngo, L. Q. Nguyen, and V. Q. Tran, “Novel hybrid
[34] W. Wisittipanich and V. Kachitvichyanukul, “Differential machine learning models including support vector machine with
evolution algorithm for job shop scheduling problem,” Industrial meta-heuristic algorithms in predicting unconfined compressive
Engineering and Management Systems, vol. 10, no. 3, pp. 203– strength of organic soils stabilised with cement and lime,”
208, Sep. 2011, doi: 10.7232/iems.2011.10.3.203. International Journal of Pavement Engineering, vol. 24, no. 2,
pp. 2136374, Jan. 2023, doi: 10.1080/10298436.2022.2136374.
88 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

[51] S. Chen and H. Xu, “Meta-heuristic algorithm-based human [67] S. Dauzère-Pérès, J. Ding, L. Shen, and K. Tamssaouet, “The
resource information management system design and flexible job shop scheduling problem: a review”, European
development for industrial revolution 5.0,” Soft Computing, vol. Journal of Operational Research, vol. 314, no. 2, pp. 409–432,
27, no. 7, pp. 4093–4105, Apr. 2023, doi: 10.1007/s00500-021- Apr. 2024, doi: 10.1016/j.ejor.2023.05.017.
06650-z. [68] Z. Li and Y. Chen, “Minimizing the makespan and carbon
[52] N. Manavizadeh, H. Farrokhi-Asl, and P. Beiraghdar, “Using a emissions in the green flexible job shop scheduling problem with
metaheuristic algorithm for solving a home health care routing learning effects”, Scientific Reports, vol. 13, no. 1, pp. 6369,
and scheduling problem,” Journal of project management, pp. Apr. 2023, doi: 10.1038/s41598-023-33615-z.
27–40, 2020, doi: 10.5267/j.jpm.2019.8.001. [69] J. C. Serrano-Ruiz, J. Mula, and R. Poler, “Job shop smart
[53] P. Sharma and U. Modani, “Trusted cluster-based manufacturing scheduling by deep reinforcement learning”,
communication for wireless sensor network using meta-heuristic Journal of Industrial Information Integration, vol. 38, pp.
algorithms,” Journal of tech science press, vol. 45, no. 2, pp. 100582, Mar. 2024, doi: 10.1016/j.jii.2024.100582.
1935–1951, 2022, doi: 10.32604/csse.2023.031509. [70] L. Wang, Y. Zhao, and X. Yin, “Precast production scheduling
[54] H. Khajavi and A. Rastgoo, “Predicting the carbon dioxide in off-site construction: mainstream contents and optimization
emission caused by road transport using a Random Forest (RF) perspective”, Journal of Cleaner Production, vol. 405, pp.
model combined by Meta-Heuristic Algorithms,” Sustainable 137054, Jun. 2023, doi: 10.1016/j.jclepro.2023.137054.
Cities and Society, vol. 93, pp. 104503, Jun. 2023, doi: [71] S. Kawaguchi and Y. Fukuyama, “Improved parallel reactive
10.1016/j.scs.2023.104503. hybrid particle swarm optimization using improved
[55] W. Li, H. Dai, and D. Zhang, “The relationship between neighborhood schedule generation method for the integrated
maximum completion time and total completion time in framework of optimal production scheduling and operational
flowshop production”, Procedia Manufacturing, vol. 1, pp. 146– planning of an energy plant in a factory”, Electronics &
156, 2015, doi: 10.1016/j.promfg.2015.09.077. Communication in Japan, vol. 103, no. 7, pp. 37–48, Jul. 2020,
[56] K. Li, Q. Deng, L. Zhang, Q. Fan, G. Gong, and S. Ding, “An doi: 10.1002/ecj.12237.
effective MCTS-based algorithm for minimizing makespan in [72] C. Jun Tan, S. Hanoun, and C. Peng Lim, “A multi-objective
dynamic flexible job shop scheduling problem”, Computers & evolutionary algorithm-based decision support system: A case
Industrial Engineering, vol. 155, pp. 107211, May 2021, doi: study on job-shop scheduling in manufacturing”, in 2015 Annual
10.1016/j.cie.2021.107211. IEEE Systems Conference Proceedings, Vancouver, Canada,
[57] M. H. Ali, A. Saif, and A. Ghasemi, “Robust job shop Apr. 2015, pp. 170–174. doi: 10.1109/SYSCON.2015.7116747.
scheduling with condition-based maintenance and random [73] C. J. Tan et al., “Application of an evolutionary algorithm-based
breakdowns”, International federation of automatic contrl- ensemble model to job-shop scheduling”, J Intell Manuf, vol. 30,
PapersOnLine, vol. 55, no. 10, pp. 1225–1230, 2022, doi: no. 2, pp. 879–890, Feb. 2019, doi: 10.1007/s10845-016-1291-1.
10.1016/j.ifacol.2022.09.557. [74] D. Lee, D. Lee, and K. Kim, “Self-growth learning-based
[58] C. Cebi, E. Atac, and O. K. Sahingoz, “Job shop scheduling machine scheduler to minimize setup time and tardiness in
problem and solution algorithms: a review”, in 2020 11th OLED display semiconductor manufacturing”, Applied Soft
International Conference on Computing, Communication and Computing, vol. 145, pp. 110600, Sep. 2023, doi:
Networking Technologies, Kharagpur, India, Jul. 2020, pp. 1–7. 10.1016/j.asoc.2023.110600.
doi: 10.1109/ICCCNT49239.2020.9225581. [75] A. Allahverdi, C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov,
[59] K. Zhou, C. Tan, Y. Zhao, J. Yu, Z. Zhang, and Y. Wu, “A survey of scheduling problems with setup times or costs”,
“Research on solving flexible job shop scheduling problem European Journal of Operational Research, vol. 187, no. 3, pp.
based on improved gwo algorithm ss-gwo”, Neural Process Lett, 985–1032, Jun. 2008, doi: 10.1016/j.ejor.2006.06.060.
vol. 56, no. 1, p. 26, Feb. 2024, doi: 10.1007/s11063-024-11488- [76] I. A. Chaudhry and P. R. Drake, “Minimizing flow-time
1. variance in a single-machine system using genetic algorithms”,
[60] M. Yazdani, A. Aleti, S. M. Khalili, and F. Jolai, “Optimizing International Journal of advanced manufacturing technology,
the sum of maximum earliness and tardiness of the job shop vol. 39, no. 3–4, pp. 355–366, Oct. 2008, doi: 10.1007/s00170-
scheduling proble”’, Computers & Industrial Engineering, vol. 007-1221-7.
107, pp. 12–24, May 2017, doi: 10.1016/j.cie.2017.02.019. [77] K. Gowrishankar, C. Rajendran, and G. Srinivasan, “Flow shop
[61] N. Tyagi, R. P. Tripathi, and A. B. Chandramouli, “Single scheduling algorithms for minimizing the completion time
machine scheduling model with total tardiness problem”, Indian variance and the sum of squares of completion time deviations
Journal of science and technology, vol. 9, no. 37, Oct. 2016, doi: from a common due date”, European Journal of Operational
10.17485/ijst/2016/v9i37/97527. Research, vol. 132, no. 3, pp. 643–665, Aug. 2001, doi:
[62] L. Song, Y. Li, and J. Xu, “Dynamic job-shop scheduling based 10.1016/S0377-2217(00)00170-3.
on transformer and deep reinforcement learning”, Processes, vol. [78] A. Syarif, A. Pamungkas, R. Kumar, and Mitsuo Gen,
11, no. 12, pp. 3434, Dec. 2023, doi: 10.3390/pr11123434. “Performance Evaluation of Various Heuristic Algorithms to
[63] A. Delgoshaei, M. K. A. B. M. Ariffin, and Z. B. Leman, “An Solve Job Shop Scheduling Problem (JSSP)”, International
effective 4–phased framework for scheduling job-shop Journal of Intelligent Engineering & Systems, vol. 14, no. 2, pp.
manufacturing systems using weighted nsga-ii’, Mathematics, 334–343, Apr. 2021, doi: 10.22266/ijies2021.0430.30.
vol. 10, no. 23, Pp. 4607, Dec. 2022, doi: [79] A. Delgoshaei et al., “A supervised method for scheduling multi-
10.3390/math10234607. objective job shop systems in the presence of market
[64] F. Abderrabi et al., “Flexible job shop scheduling problem with uncertainties”, Operation Research, vol. 55, pp. S1165–S1193,
sequence dependent setup time and job splitting: hospital 2021, doi: 10.1051/ro/2020082.
catering case study”, Applied Sciences, vol. 11, no. 4, pp. 1504, [80] G. Wan and B. P.-C. Yen, “Single machine scheduling to
Feb. 2021, doi: 10.3390/app11041504. minimize total weighted earliness subject to minimal number of
[65] A. Azzouz, A. Chaabani, M. Ennigrou, and L. B. Said, tardy jobs”, European Journal of Operational Research, vol. 195,
“Handling sequence-dependent setup time flexible job shop no. 1, pp. 89–97, May 2009, doi: 10.1016/j.ejor.2008.01.029.
problem with learning and deterioration considerations using [81] V. Poongothai, P. Godhandaraman, and A. A. Jenifer, “Single
evolutionary bi-level optimization”, Applied Artificial machine scheduling problem for minimizing total tardiness of a
Intelligence, vol. 34, no. 6, pp. 433–455, May 2020, doi: weighted jobs in a batch delivery system, stochastic rework and
10.1080/08839514.2020.1723871. reprocessing times”, The 11th national conference on
[66] F. M. Defersha and D. Rooyani, “An efficient two-stage genetic mathematical techniques and applications, Chennai, India, Jan.
algorithm for a flexible job-shop scheduling problem with 2019, p. 020132. doi: 10.1063/1.5112317.
sequence dependent attached/detached setup, machine release [82] V. Boyer, J. Vallikavungal, X. Cantú Rodríguez, and M. A.
date and lag-time”, Computers & Industrial Engineering, vol. Salazar-Aguilar, “The generalized flexible job shop scheduling
147, pp. 106605, Sep. 2020, doi: 10.1016/j.cie.2020.106605. problem”, Computers & Industrial Engineering, vol. 160, pp.
107542, Oct. 2021, doi: 10.1016/j.cie.2021.107542.
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 89

[83] X. Zhang and S. Van De Velde, “On-line two-machine job shop [99] R. L. C. Souza, A. Ghasemi, A. Saif, and A. Gharaei, “Robust
scheduling with time lags”, Information Processing Letters, vol. job-shop scheduling under deterministic and stochastic
110, no. 12–13, pp. 510–513, Jun. 2010, doi: unavailability constraints due to preventive and corrective
10.1016/j.ipl.2010.04.002. maintenance,” Computers & Industrial Engineering, vol. 168,
[84] Y. He, F. Liu, H. Cao, and C. Li, “A bi-objective model for job- pp. 108130, Jun. 2022, doi: 10.1016/j.cie.2022.108130.
shop scheduling problem to minimize both energy consumption [100] P. Sharma and A. Jain, “A review on job shop scheduling with
and makespan”, Journal of Central South University of setup times,” Proceedings of the institution of mechanical
Technology, vol. 12, no. 2, pp. 167–171, Oct. 2005, doi: engineers, part b: journal of engineering manufacture, vol. 230,
10.1007/s11771-005-0033-x. no. 3, pp. 517–533, Mar. 2016, doi:
[85] Z. Wei, W. Liao, and L. Zhang, “Hybrid energy-efficient 10.1177/0954405414560617.
scheduling measures for flexible job-shop problem with variable [101] M. Vázquez and D. Whitley, “A comparison of genetic
machining speeds”, Expert Systems with Applications, vol. 197, algorithms for the static job shop scheduling problem”, in
pp. 116785, Jul. 2022, doi: 10.1016/j.eswa.2022.116785. Parallel Problem Solving from Nature PPSN VI, vol. 1917, M.
Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J.
[86] C. Peng, Z. Li, H. Zhong, X. Li, A. Lin, and Y. Liao, “Research Merelo, and H.-P. Schwefel, Eds., Berlin, Heidelberg: Springer
on Multi-Objective Scheduling Algorithm of Job Shop Berlin Heidelberg, 2000, pp. 303–312. doi: 10.1007/3-540-
Considering Limited Storage and Transportation Capacity”, 45356-3_30.
IEEE IEEE internet of things journal, vol. 11, pp. 94252–94280, [102] Mohan, K. Lanka, and A. N. Rao, “A Review of Dynamic Job
2023, doi: 10.1109/ACCESS.2023.3285710. Shop Scheduling Techniques,” Procedia Manufacturing, vol. 30,
[87] H. Hu, J. He, X. He, W. Yang, J. Nie, and B. Ran, “Emergency pp. 34–39, 2019, doi: 10.1016/j.promfg.2019.02.006.
material scheduling optimization model and algorithms: A [103] S. Katoch, S. S. Chauhan, and V. Kumar, “A review on genetic
review”, Journal of Traffic and Transportation Engineering, vol. algorithm: past, present, and future,” Multimedia Tools &
6, no. 5, pp. 441–454, Oct. 2019, doi: Application, vol. 80, no. 5, pp. 8091–8126, Feb. 2021, doi:
10.1016/j.jtte.2019.07.001. 10.1007/s11042-020-10139-6.
[88] P. Schworm, X. Wu, M. Glatt, and J. C. Aurich, “Solving [104] D. Delahaye, S. Chaimatanan, and M. Mongeau, “Simulated
flexible job shop scheduling problems in manufacturing with Annealing: From Basics to Applications,” in Handbook of
Quantum Annealing”, Production engineering , vol. 17, no. 1, Metaheuristics, vol. 272, pp. 1-35 M. Gendreau and J.-Y. Potvin,
pp. 105–115, Feb. 2023, doi: 10.1007/s11740-022-01145-8. Eds., Cham: Springer International Publishing, 2019, doi:
[89] A. S. Jain and S. Meeran, “Deterministic job-shop scheduling: 10.1007/978-3-319-91086-4_1.
Past, present and future”, European Journal of Operational [105] Z. Lu, A. Martínez-Gavara, J.-K. Hao, and X. Lai, “Solution-
Research, vol. 113, no. 2, pp. 390–434, Mar. 1999, doi: based tabu search for the capacitated dispersion problem,”
10.1016/S0377-2217(98)00113-1. Expert Systems with Applications, vol. 223, p. 119-156, Aug.
[90] M. M. Ahmadian, M. Khatami, A. Salehipour, and T. C. E. 2023, doi: 10.1016/j.eswa.2023.119856.
Cheng, “Four decades of research on the open-shop scheduling [106] R. Martí, A. Martínez-Gavara, and F. Glover, “Tabu Search,” in
problem to minimize the makespan,” European Journal of Discrete Diversity and Dispersion Maximization: A Tutorial on
Operational Research, vol. 295, no. 2, pp. 399–426, Dec. 2021, Metaheuristic Optimization, R. Martí and A. Martínez-Gavara,
doi: 10.1016/j.ejor.2021.03.026. Eds., Cham: Springer International Publishing, 2023, pp. 137–
[91] K. Tamssaouet, S. Dauzère-Pérès, and C. Yugma, 149. doi: 10.1007/978-3-031-38310-6_7.
“Metaheuristics for the job-shop scheduling problem with [107] A. Soofastaei, “Introductory Chapter: Ant Colony
machine availability constraints”, Computers & Industrial Optimization,” in the Application of Ant Colony Optimization,
Engineering, vol. 125, pp. 1–8, Nov. 2018, doi: A. Soofastaei, Ed., IntechOpen, 2022. doi:
10.1016/j.cie.2018.08.008. 10.5772/intechopen.103801.
[92] A. Agnetis, J.-C. Billaut, S. Gawiejnowicz, D. Pacciarelli, and [108] J. Yi, C. Lu, G. Li, J. Yi, C. Lu, and G. Li, ‘A literature review
A. Soukhal, “Scheduling problems with variable job processing on latest developments of Harmony Search and its applications
times”, in Multiagent Scheduling, Springer, Berlin Heidelberg, to intelligent manufacturing’, Multimedia tools & application,
2014, pp. 217–260. doi: 10.1007/978-3-642-41880-8_6. vol. 16, no. 4, pp. 2086–2117, 2019, doi: 10.3934/mbe.2019102.
[93] Z. Zhu and X. Zhou, “Flexible job-shop scheduling problem [109] C. Guo, H. Tang, B. Niu, and C. Boon Patrick Lee, ‘A survey of
with job precedence constraints and interval grey processing bacterial foraging optimization’, Neurocomputing, vol. 452, pp.
time,” Computers & Industrial Engineering, vol. 149, pp. 728–746, Sep. 2021, doi: 10.1016/j.neucom.2020.06.142.
106781, Nov. 2020, doi: 10.1016/j.cie.2020.106781. [110] C. Wang, S. Zhang, T. Ma, Y. Xiao, M. Z. Chen, and L. Wang,
[94] S. Zhang, H. Du, S. Borucki, S. Jin, T. Hou, and Z. Li, “Dual “Swarm intelligence: a survey of model classification and
Resource Constrained Flexible Job Shop Scheduling Based on applications,” Chinese Journal of Aeronautics, pp.
Improved Quantum Genetic Algorithm,” Machines, vol. 9, no. 6, S1000936124000931, Mar. 2024, doi:
pp. 108, May 2021, doi: 10.3390/machines9060108. 10.1016/j.cja.2024.03.019.
[95] G. Mauroy, Y. Wardi, and J. M. Proth, “Perturbation analysis of [111] A. Kumar, D. Kumar, and S. K. Jarial, “A review on artificial
job shop scheduling with multiple job priorities,” in Proceedings bee colony algorithms and their applications to data clustering,”
of the 1998 IEEE International Conference on Control Cybernetics and Information Technologies, vol. 17, no. 3, pp. 3–
Applications, Trieste, Italy, 1998, pp. 930–931. doi: 28, Sep. 2017, doi: 10.1515/cait-2017-0027.
10.1109/CCA.1998.721594. [112] X. Li, J. Lu, C. Yang, and J. Wang, “Research of flexible
[96] P. Schworm, X. Wu, M. Klar, M. Glatt, and J. C. Aurich, assembly job-shop batch–scheduling problem based on
“Multi-objective quantum annealing approach for solving improved artificial bee colony,” Frontiers in bioengineering &
flexible job shop scheduling in manufacturing”, Journal of biotechnology, vol. 10, pp. 909548, Aug. 2022, doi:
Manufacturing Systems, vol. 72, pp. 142–153, Feb. 2024, doi: 10.3389/fbioe.2022.909548.
10.1016/j.jmsy.2023.11.015. [113] A. Priya, S. Mandal, and Yogesh, “Parallel artificial bee colony
[97] Ding Zhu, Wu Ping, Zhang Libo, Wang Feng, and Zhang algorithm for solving advance industrial productivity problems,”
Xuefeng, “A multi-agent ant colony optimization algorithm for in Advances in Library and Information Science, B. Holland and
earliness/tardiness scheduling with different due window on K. Sinha, Eds., IGI Global, 2024, pp. 21–41. doi: 10.4018/979-
non-uniform parallel machines,” in International Technology 8-3693-0807-3.ch002.
and Innovation Conference 2006, Hangzhou, China: IEEE, pp. [114] L. Asadzadeh, “A parallel artificial bee colony algorithm for the
67–71, 2006, doi: 10.1049/cp:20060730. job shop scheduling problem with a dynamic migration
[98] F. Dugardin, H. Chehade, L. Amodeo, F. Yalaoui, and C. Prins, strategy”, Computers & Industrial Engineering, vol. 102, pp.
“Hybrid job shop and parallel machine scheduling problems: 359–367, Dec. 2016, doi: 10.1016/j.cie.2016.06.025.
minimization of total tardiness criterion,” in Multiprocessor [115] S. K. Mishra, P. S. C. Bose, and C. S. P. Rao, “An invasive
Scheduling, Theory and Applications, E. Levner, Ed., I-Tech weed optimization approach for job shop scheduling problems,”
Education and Publishing, 2007. doi: 10.5772/5227.
90 ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025

International journal of advanced manufacturing & technology, Journal of Physics.: Conference Series, vol. 1607, no. 1, p.
vol. 91, no. 9–12, pp. 4233–4241, Aug. 2017, doi: 012050, Aug. 2020, doi: 10.1088/1742-6596/1607/1/012050.
10.1007/s00170-017-0091-x. [131] Siregar, I. Rizkya, R. M. Sari, and K. Syahputri, “Minimization
[116] P. Shilpa and G. Balaraju, “Job shop scheduling using of makespan using fcfs method and genetic algorithm method
differential evolution algorithm”, International journal of comparison in aluminum industry,” in 2019 3rd International
mechanical and production engineering research and Conference on Electrical, Telecommunication and Computer
development, vol. 8, no. 3, pp. 327–338, 2018, doi: Engineering (ELTICOM), Medan, Indonesia: IEEE, pp. 9–12,
10.24247/ijmperdjun201837. sept. 2019, doi: 10.1109/ELTICOM47379.2019.8943914.
[117] P. Sriboonchandr, N. Kriengkorakot, and P. Kriengkorakot, [132] S.-J. Wang, C.-W. Tsai, and M.-C. Chiang, “A high performance
“Improved differential evolution algorithm for flexible job shop search algorithm for job-shop scheduling problem,” Procedia
scheduling problems”, Mathematical computation application, Computer Science, vol. 141, pp. 119–126, 2018, doi:
vol. 24, no. 3, p. 80, Sep. 2019, doi: 10.3390/mca24030080. 10.1016/j.procs.2018.10.157.
[118] S. Singh and K. P. Singh, “Cuckoo search optimization for job [133] R. Hu, X. Wu, B. Qian, J. Mao, and H. Jin, “Differential
shop scheduling problem,” in Proceedings of Fourth evolution algorithm combined with uncertainty handling
International Conference on Soft Computing for Problem techniques for stochastic reentrant job shop scheduling
Solving, vol. 335, K. N. Das, K. Deep, M. Pant, J. C. Bansal, problem,” Complexity, vol. 2022, pp. 1–11, Jan. 2022, doi:
and A. Nagar, Eds., New Delhi: Springer India, 2015, pp. 99– 10.1155/2022/9924163.
111. doi: 10.1007/978-81-322-2217-0_9. [134] T. H. Son, H. X. Long, N. Huynh-Tuong, and T. Van Lang, “An
[119] A. Ouaarab, B. Ahiod, and X.-S. Yang, “Discrete cuckoo search approach for the teamwork scheduling problem with job-person
applied to job shop scheduling problem,” in Recent Advances in constraint,” in 2022 9th NAFOSTED Conference on Information
Swarm Intelligence and Evolutionary Computation, vol. 585, X.- and Computer Science, Ho Chi Minh City, Vietnam, pp. 64–68,
S. Yang, Ed., Cham: Springer International Publishing, 2015, pp. Oct. 2022 doi: 10.1109/NICS56915.2022.10013369.
121–137. doi: 10.1007/978-3-319-13826-8_7. [135] P. Liu, K. Xu, H. Gong, “Non-cooperative game of coordinated
[120] S. Batubara, D. K. Sari, and D. A. Wicaksono, "Design of job scheduling of parallel machine production and Transportation in
scheduling using bat algorithm to minimize makespan in hybrid shared manufacturing,” Computers, materials & continua, Vol.
flowshop," In Proceedings of the International Conference on 76, no.1, pp. 239-258, 2023, doi: 10.32604/cmc.2023.038232.
Industrial Engineering and Operations Management Dubai, [136] A. Campo, J. A. Cano, R. Gómez-Montoya, E. Rodríguez-
UAE, March 10-12, 2020, pp. 2606-2617. Available at Velásquez, and P. Cortés, “Flexible job shop scheduling problem
https://www.ieomsociety.org/ieom2020/papers/618.pdf. with fuzzy times and due-windows: minimizing weighted
[121] T.-K. Dao, T.-S. Pan, T.-T. Nguyen, and J.-S. Pan, “Parallel bat tardiness and earliness using genetic algorithms,” Algorithms,
algorithm for optimizing makespan in job shop scheduling vol. 15, no. 10, pp. 334, Sep. 2022, doi: 10.3390/a15100334.
problems,” Journal of intelligent manufacturing, vol. 29, no. 2, [137] H. Zhang, B. Buchmeister, X. Li, and R. Ojstersek, “Advanced
pp. 451–462, Feb. 2018, doi: 10.1007/s10845-015-1121-x. metaheuristic method for decision-making in a dynamic job shop
[122] Chun-Wei Tsai, Heng-Ci Chang, Kai-Cheng Hu, and Ming- scheduling environment,” Mathematics, vol. 9, no. 8, pp. 909,
Chao Chiang, “Parallel coral reef algorithm for solving JSP on Apr. 2021, doi: 10.3390/math9080909.
Spark,” in 2016 IEEE International Conference on Systems, [138] N. Kumar and A. Mishra, “Comparative study of different
Man, and Cybernetics, Budapest, Hungary, Oct. 2016, pp. heuristics algorithms in solving classical job shop scheduling
001872–001877. doi: 10.1109/SMC.2016.7844511. problem,” Materials Today: Proceedings, vol. 22, pp. 1796–
[123] T. Jiang and C. Zhang, “Application of grey wolf optimization 1802, 2020, doi: 10.1016/j.matpr.2020.03.013.
for solving combinatorial problems: job shop and flexible job [139] L. Wang, G. Zhou, Y. Xu, S. Wang, and M. Liu, “An effective
shop scheduling cases”, IEEE Access, vol. 6, pp. 26231–26240, artificial bee colony algorithm for the flexible job-shop
2018, doi: 10.1109/ACCESS.2018.2833552. scheduling problem,” International journal of advanced
[124] C. Zhang, K. Wang, Q. Ma, X. Li, and L. Gao, “A discrete grey manufacturing & technology, vol. 60, no. 1–4, pp. 303–315,
wolf optimizer for solving flexible job shop scheduling problem Apr. 2012, doi: 10.1007/s00170-011-3610-1.
with lot-streaming,” in 2021 IEEE 24th International Conference [140] R. Zarrouk, I. E. Bennour, and A. Jemai, “A two-level particle
on Computer Supported Cooperative Work in Design swarm optimization algorithm for the flexible job shop
(CSCWD), Dalian, China: IEEE, May 2021, pp. 969–974. doi: scheduling problem,” Swarm Intelligence, vol. 13, no. 2, pp.
10.1109/CSCWD49262.2021.9437886. 145–168, Jun. 2019, doi: 10.1007/s11721-019-00167-w.
[125] M. S. Viana, O. Morandin Junior, and R. C. Contreras, “A [141] Hajibabaei and J. Behnamian, “Flexible job-shop scheduling
modified genetic algorithm with local search strategies and problem with unrelated parallel machines and resources-
multi-crossover operator for job shop scheduling problem,” dependent processing times: a tabu search algorithm,”
Sensors, vol. 20, no. 18, p. 5440, Sep. 2020, doi: International Journal of Management Science and Engineering
10.3390/s20185440. Management, vol. 16, no. 4, pp. 242–253, Oct. 2021, doi:
[126] Y. Song, F. Wang, and X. Chen, “An improved genetic 10.1080/17509653.2021.1941368.
algorithm for numerical function optimization,” Applied [142] A. Dabah, A. Bendjoudi, A. AitZai, and N. N. Taboudjemat,
Intelligence, vol. 49, no. 5, pp. 1880–1902, May 2019, doi: “Efficient parallel tabu search for the blocking job shop
10.1007/s10489-018-1370-4. scheduling problem,” Soft Computing, vol. 23, no. 24, pp.
[127] I. Chaouch, O. B. Driss, and K. Ghedira, “A modified ant colony 13283–13295, Dec. 2019, doi: 10.1007/s00500-019-03871-1.
optimization algorithm for the distributed job shop scheduling [143] Alharkan, M. Saleh, M. A. Ghaleb, H. Kaid, A. Farhan, and A.
problem,” Procedia Computer Science, vol. 112, pp. 296–305, Almarfadi, “Tabu search and particle swarm optimization
2017, doi: 10.1016/j.procs.2017.08.267. algorithms for two identical parallel machines scheduling
[128] W. Teekeng, A. Thammano, P. Unkaw, and J. Kiatwuthiamorn, problem with a single server,” Journal of King Saud University -
“A new algorithm for flexible job-shop scheduling problem Engineering Sciences, vol. 32, no. 5, pp. 330–338, Jul. 2020,
based on particle swarm optimization,” Artificial Life & doi: 10.1016/j.jksues.2019.03.006.
Robotics, vol. 21, no. 1, pp. 18–23, Mar. 2016, doi: [144] Y. Yu, “A research review on job shop scheduling problem,”
10.1007/s10015-015-0259-0. E3S Web Conf., vol. 253, p. 02024, 2021, doi:
[129] B. Denkena, F. Schinkel, J. Pirnay, and S. Wilmsmeier, 10.1051/e3sconf/202125302024.
“Quantum algorithms for process parallel flexible job shop [145] Hasani, S. A. Kravchenko, and F. Werner, “Minimizing the
scheduling,” CIRP Journal of Manufacturing Science and makespan for the two-machine scheduling problem with a single
Technology, vol. 33, pp. 100–114, May 2021, doi: server: Two algorithms for very large instances,” Engineering
10.1016/j.cirpj.2021.03.006. Optimization, vol. 48, no. 1, pp. 173–183, Jan. 2016, doi:
[130] Z. Yongsuo, Z. Caimeng, H. Yinsheng, Q. Pengrui, and S. 10.1080/0305215X.2015.1005083.
Wangjiao, “Research on JOB SHOP Scheduling Problem,” [146] Hasani, S. A. Kravchenko, and F. Werner, “Simulated annealing
and genetic algorithms for the two-machine scheduling problem
ENGINEERING ACCESS, VOL. 11, NO. 1, JANUARY-JUNE 2025 91

with a single server,” International Journal of Production [162] Z. Wang, J. Zhang, and S. Yang, “An improved particle swarm
Research, vol. 52, no. 13, pp. 3778–3792, Jul. 2014, doi: optimization algorithm for dynamic job shop scheduling
10.1080/00207543.2013.874607. problems with random job arrivals,” Swarm and Evolutionary
[147] F. M. Defersha and M. Chen, “A parallel genetic algorithm for a Computation, vol. 51, pp. 100594, Dec. 2019, doi:
flexible job-shop scheduling problem with sequence dependent 10.1016/j.swevo.2019.100594.
setups,” International journal of advanced manufacturing & [163] C. Lin, Z. Cao, and M. Zhou, “Learning-based cuckoo search
technology, vol. 49, no. 1–4, pp. 263–279, Jul. 2010, doi: algorithm to schedule a flexible job shop with sequencing
10.1007/s00170-009-2388-x. flexibility,” IEEE Transactions on Cybernetics, vol. 53, no. 10,
[148] W. N. Abdullah and S. A. Alagha, “A parallel adaptive genetic pp. 6663–6675, Oct. 2023, doi: 10.1109/TCYB.2022.3210228.
algorithm for job shop scheduling problem,” Journal of physics: [164] A. Y. Zebari, S. M. Almufti, and C. M. Abdulrahman, “Bat
Conference Series, vol. 1879, no. 2, p. 022078, May 2021, doi: algorithm (BA): review, applications and modifications,”
10.1088/1742-6596/1879/2/022078. International Journal of Scientific World, vol. 8, no. 1, pp. 1–7,
[149] Z. Liu et al., “An improved genetic algorithm with an Jan. 2020, doi: 10.14419/ijsw.v8i1.30120.
overlapping strategy for solving a combination of order batching
and flexible job shop scheduling problem,” Engineering
Applications of Artificial Intelligence, vol. 127, p. 107321, Jan.
2024, doi: 10.1016/j.engappai.2023.107321.
[150] Kumar, P., Ghangas, G., Sharma, A., & Dhull, S., “Minimising
the makespan of job shop scheduling problem by using genetic
algorithm (GA),” International journal of production
engineering, vol. 6, pp. 27-39, 2020.
[151] S. Habbadi, B. Herrou, and S. Sekkat, “Job shop scheduling
problem using genetic algorithms,” in Proceedings of the
International Conference on Industrial Engineering and
Operations Management, Rome, Europe: IEOM Society
International, Jul. 2022, pp. 3050–3062. doi:
10.46254/EU05.20220592.
[152] Abdullah, W. N., “Solving job-shop scheduling problem using a
developed particle swarm optimization algorithm,” International
Journal of Science and Research, vol. 7 no.1, pp. 1845-1848,
2018. doi: 10.21275/ART20179752.
[153] Ben Ali, A. J. Telmoudi, and S. Gattoufi, “Stochastic cases of
the dynamic job shop problem based on the genetic algorithm to
minimize,” in 2017 4th International Conference on Control,
Decision and Information Technologies, Barcelona, pp. 0760–
0765, Apr. 2017, doi: 10.1109/CoDIT.2017.8102686.
[154] Z. Shen and L. Smalov, “Comparative performance of genetic
algorithm, simulated annealing and ant colony optimisation in
solving the job-shop scheduling problem,” in 2018 26th
International Conference on Systems Engineering, Sydney,
Australia, pp. 1–5, Dec. 2018, doi:
10.1109/ICSENG.2018.8638185.
[155] Janes, G., Perinic, M., & Jurkovic, Z., “Applying improved
genetic algorithm for solving job shop scheduling problems,”
Technical gazatte, vol. 24, no. 4, pp. 1243-1247, Aug. 2017, doi:
10.17559/TV-20150527133957.
[156] A. Salido, J. Escamilla, A. Giret, and F. Barber, “A genetic
algorithm for energy-efficiency in job-shop scheduling,”
International journal of advanced manufacturing & technology,
vol. 85, no. 5–8, pp. 1303–1314, Jul. 2016, doi: 10.1007/s00170-
015-7987-0.
[157] Zhang, Y. Hu, J. Sun, and W. Zhang, “An improved genetic
algorithm for the flexible job shop scheduling problem with
multiple time constraints,” Swarm and Evolutionary
Computation, vol. 54, pp. 100664, May 2020, doi:
10.1016/j.swevo.2020.100664.
[158] Ç. Sel and A. Hamzadayı, “A simulated annealing approach
based simulation-optimisation to the dynamic job-shop
scheduling problem,” Pamukkale journal of engineering &
science, vol. 24, no. 4, pp. 665–674, 2018, doi:
10.5505/pajes.2017.47108.
[159] W. Zhang, J. B. Wen, Y. C. Zhu, and Y. Hu, “Multi-objective
scheduling simulation of flexible job-shop based on multi-
population genetic algorithm,” International journal of
simulation model, vol. 16, no. 2, pp. 313–321, Jun. 2017, doi:
10.2507/IJSIMM16(2)CO6.
[160] Zhang, B. Buchmeister, X. Li, and R. Ojstersek, “Advanced
metaheuristic method for decision-making in a dynamic job shop
scheduling environment,” Mathematics, vol. 9, no. 8, pp. 909,
Apr. 2021, doi: 10.3390/math9080909.
[161] R. Singh and S. S. Mahapatra, “A quantum behaved particle
swarm optimization for flexible job shop scheduling,”
Computers & Industrial Engineering, vol. 93, pp. 36–44, Mar.
2016, doi: 10.1016/j.cie.2015.12.004.