A hybrid evolution strategies-simulated annealing algorithm for job shop scheduling problems
B Khurshid, S Maqsood - Engineering Applications of Artificial Intelligence, 2024 - Elsevier
Job shop scheduling problems (JSSPs) are intractable combinatorial optimization problems
and have been solved by numerous researchers over the last couple of decades, however …
and have been solved by numerous researchers over the last couple of decades, however …
[PDF][PDF] Q-Learning-Assisted Meta-Heuristics for Scheduling Distributed Hybrid Flow Shop Problems
Q Zhu, K Gao, W Huang, Z Ma… - Computers, Materials and …, 2024 - cdn.techscience.cn
The flow shop scheduling problem is important for the manufacturing industry. Effective flow
shop scheduling can bring great benefits to the industry. However, there are few types of …
shop scheduling can bring great benefits to the industry. However, there are few types of …
Hybrid meta-heuristic solving no-wait flow shop scheduling minimizing maximum tardiness
The non-waiting constraint is a crucial factor in industries with continuous production flows.
Recognizing the significance of this constraint in the manufacturing process, we propose …
Recognizing the significance of this constraint in the manufacturing process, we propose …
New efficient algorithms for the two-machine no-wait chain-reentrant shop problem
This paper tackles the two-machine chain-reentrant flow shop scheduling problem with the
no-wait constraint; we assume that each job passes from the first machine to the second and …
no-wait constraint; we assume that each job passes from the first machine to the second and …