A deep reinforcement learning framework based on an attention mechanism and disjunctive graph embedding for the job-shop scheduling problem
R Chen, W Li, H Yang - IEEE Transactions on Industrial …, 2022 - ieeexplore.ieee.org
The job-shop scheduling problem (JSSP) is a classical NP-hard combinatorial optimization
problem, and the operating efficiency of manufacturing system is affected directly by the …
problem, and the operating efficiency of manufacturing system is affected directly by the …
An efficient job-shop scheduling algorithm based on particle swarm optimization
TL Lin, SJ Horng, TW Kao, YH Chen, RS Run… - Expert Systems with …, 2010 - Elsevier
The job-shop scheduling problem has attracted many researchers' attention in the past few
decades, and many algorithms based on heuristic algorithms, genetic algorithms, and …
decades, and many algorithms based on heuristic algorithms, genetic algorithms, and …
Reactive recovery of job shop schedules–a review
AS Raheja, V Subramaniam - The International Journal of Advanced …, 2002 - Springer
In the recent past, a great deal of time and effort has been devoted to the development of job
shop schedules. These schedules are able to cope with the dynamic and stochastic nature …
shop schedules. These schedules are able to cope with the dynamic and stochastic nature …
Flexible job shop scheduling with tabu search algorithms
This paper presents a tabu search algorithm that solves the flexible job shop scheduling
problem to minimize the makespan time. As a context for solving sequencing and …
problem to minimize the makespan time. As a context for solving sequencing and …
A modified genetic algorithm with local search strategies and multi-crossover operator for job shop scheduling problem
It is not uncommon for today's problems to fall within the scope of the well-known class of NP-
Hard problems. These problems generally do not have an analytical solution, and it is …
Hard problems. These problems generally do not have an analytical solution, and it is …
An effective PSO and AIS-based hybrid intelligent algorithm for job-shop scheduling
HW Ge, L Sun, YC Liang, F Qian - IEEE transactions on systems …, 2008 - ieeexplore.ieee.org
The optimization of job-shop scheduling is very important because of its theoretical and
practical significance. In this paper, a computationally effective algorithm of combining PSO …
practical significance. In this paper, a computationally effective algorithm of combining PSO …
[HTML][HTML] An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
The job shop scheduling problem is one of the most important and complicated problems in
machine scheduling. This problem is characterized as NP-hard. The high complexity of the …
machine scheduling. This problem is characterized as NP-hard. The high complexity of the …
Discrete artificial algae algorithm for solving job-shop scheduling problems
Abstract The Job-Shop Scheduling Problem (JSSP) is an NP-hard problem and can be
solved with both exact methods and heuristic algorithms. When the dimensionality is …
solved with both exact methods and heuristic algorithms. When the dimensionality is …
Agent-based fuzzy constraint-directed negotiation mechanism for distributed job shop scheduling
CY Hsu, BR Kao, KR Lai - Engineering Applications of Artificial …, 2016 - Elsevier
This paper presents an agent-based fuzzy constraint-directed negotiation (AFCN)
mechanism to solve distributed job shop scheduling problems (JSSPs). The scheduling …
mechanism to solve distributed job shop scheduling problems (JSSPs). The scheduling …
A modified genetic algorithm for job shop scheduling
L Wang, DZ Zheng - The International Journal of Advanced Manufacturing …, 2002 - Springer
As a class of typical production scheduling problems, job shop scheduling is one of the
strongly NP-complete combinatorial optimisation problems, for which an enhanced genetic …
strongly NP-complete combinatorial optimisation problems, for which an enhanced genetic …