Oct 2026· Production and operations management· 0 citations
TL;DR
This work proposes learning-then-searching, an efficient framework combining deep reinforcement learning with heuristic search to solve integrated process planning and scheduling problems, and develops a deep reinforcement learning method tailored to capture the complex relationships among operations, machines, and jobs.
Abstract
The integrated process planning and scheduling problem combines process route planning and shop scheduling to achieve high efficiency in manufacturing and maximize resource utilization, which is crucial for modern manufacturing systems. Traditional approaches, such as mixed-integer linear programming and heuristic algorithms, often struggle to balance solution quality and computational efficiency, particularly in large-scale scenarios. To address this, we propose learning-then-searching, an efficient framework combining deep reinforcement learning with heuristic search to solve integrated process planning and scheduling problems. We formulate the problem as a Markov decision process and develop a deep reinforcement learning method tailored to capture the complex relationships among operations, machines, and jobs. With the learned policy distributions, Monte Carlo tree search employs learned priors and problem-specific rollouts to further refine scheduling strategies, effectively balancing exploration and exploitation to achieve better solutions. Experimental results show that the proposed framework improves solution efficiency and quality over traditional methods across benchmark and large-scale instances, with pronounced advantages when route ambiguity is high. It also offers practitioners a flexible tradeoff between rapid policy-based decisions and further refinement through tree search when additional computation time is available.
The Flexible Job Shop Scheduling Problem (FJSP) is an NP-hard optimization challenge with significant industrial applications, especially for large-scale instances. Traditional approaches, such as Priority Dispatching Rules (PDRs), often struggle with time-intensive design processes and suboptimal performance as proble...
Jeongwon Park, Feng Ju· IISE Annual Conference &...· 0 citations
This work proposes a hybrid framework combining machine learning and traditional optimization techniques to solve the Traveling Salesman Problem efficiently, using an encoder-decoder neural network with local attention to predict near-optimal city sequences by training on smaller TSP instances.
L. N. Asha, Chase Rainwater· IISE Annual Conference &...· 0 citations
The findings demonstrate how mathematical optimization and advanced metaheuristics can be combined with problem-specific structural insights to improve solution quality and computational efficiency in production and operations research.
In this study, we investigate the potential of a Deep Reinforcement Learning (DRL) based Transformer neural network architecture to solve large-scale open shop scheduling problems. The open shop scheduling problem (OSSP) involves sequencing n jobs across m machines, where each machine handles only one job at a time, an...
The results show that the DACA-CPPO framework achieved 95% accuracy, reduced delivery costs, lowered delay rates, and improved route efficiency compared to baseline reinforcement learning strategies.
This systematic review analyses how Reinforcement Learning (RL) applied to the Dynamic Flexible Job Shop Scheduling Problem (DFJSSP) contributes to industrial production systems, considering problem formulations and extensions, algorithm families and scheduling strategies, and scalability. ScienceDirect, IEEE Xplore, T...
Ana Neto, N. Lopes, Cátia Alves et al.· Sustainability· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.