Solving job shop scheduling problems via deep reinforcement learning
Deep reinforcement learning (DRL), as a promising technique, is a new approach to solve
the job shop scheduling problem (JSSP). Although DRL method is effective for solving …
the job shop scheduling problem (JSSP). Although DRL method is effective for solving …
Survey on Lagrangian relaxation for MILP: importance, challenges, historical review, recent advancements, and opportunities
MA Bragin - Annals of Operations Research, 2024 - Springer
Operations in areas of importance to society are frequently modeled as mixed-integer linear
programming (MILP) problems. While MILP problems suffer from combinatorial complexity …
programming (MILP) problems. While MILP problems suffer from combinatorial complexity …
Integrating machine learning and mathematical optimization for job shop scheduling
Job-shop scheduling is an important but difficult combinatorial optimization problem for low-
volume and high-variety manufacturing, with solutions required to be obtained quickly at the …
volume and high-variety manufacturing, with solutions required to be obtained quickly at the …
Human–machine collaborative decision-making method based on confidence for smart workshop dynamic scheduling
D Wang, F Qiao, L Guan, J Liu… - IEEE Robotics and …, 2022 - ieeexplore.ieee.org
Dynamic scheduling is one of the most important problems in the field of production
scheduling. Existing ways to solve the problem are mainly based on experienced workers or …
scheduling. Existing ways to solve the problem are mainly based on experienced workers or …
Research on sustainable collaborative scheduling problem of multi-stage mixed flow shop for crankshaft components
L Nie, Q Zhang, M Feng, J Qin - Scientific Reports, 2024 - nature.com
The crankshaft manufacturing process primarily comprises machining, single jacket, and
double jacket stages. These stages collectively produce substantial carbon emissions …
double jacket stages. These stages collectively produce substantial carbon emissions …
Near-optimal scheduling for IC packaging operations considering processing-time variations and factory practices
Due to the short life cycles of electronic products, trial run lots of new products are crucial in
IC packaging for production verification and engineering adjustments. The processing time …
IC packaging for production verification and engineering adjustments. The processing time …
Cooperative task scheduling and planning considering resource conflicts and precedence constraints
D Li, H Su, X Xu, Q Wang, J Qin, W Zou - International Journal of Precision …, 2023 - Springer
The robot-task-sequencing planning problem is investigated in this paper, where multi-robot
tasks with resource conflicts and precedence constraints are involved making the problem …
tasks with resource conflicts and precedence constraints are involved making the problem …
Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming
Abstract Mixed-Integer Linear Programming (MILP) plays an important role across a range of
scientific disciplines and within areas of strategic importance to society. The MILP problems …
scientific disciplines and within areas of strategic importance to society. The MILP problems …
[PDF][PDF] Toward agile and robust supply chains: A lesson from stochastic job-shop scheduling
Motivated by the presence of uncertainties as well as combinatorial complexity within the
links of supply chains, this paper addresses the outstanding and timely challenge illustrated …
links of supply chains, this paper addresses the outstanding and timely challenge illustrated …
Dynamic Job Shop Scheduling via Deep Reinforcement Learning
Recently, deep reinforcement learning (DRL) is shown to be promising in learning
dispatching rules end-to-end for complex scheduling problems. However, most research is …
dispatching rules end-to-end for complex scheduling problems. However, most research is …