Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
From MaRDI portal
Publication:6167662
DOI10.1016/j.ejor.2022.11.034MaRDI QIDQ6167662
Antonín Novák, Zdeněk Hanzálek, Michal Bouška, Přemysl Šucha
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid algorithm for the single-machine total tardiness problem
- Hybridizing the cross-entropy method: An application to the max-cut problem
- The single-machine total tardiness scheduling problem: review and extensions
- A simulated annealing approach for the one-machine mean tardiness scheduling problem
- A heuristic for the single machine tardiness problem
- Decomposition of the single machine total tardiness problem
- Solution of the single machine total tardiness problem
- Learning heuristics for the TSP by policy gradient
- Accelerating the branch-and-price algorithm using machine learning
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- Reinforcement learning for combinatorial optimization: a survey
- A new decomposition approach for the single machine total tardiness scheduling problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Job-shop scheduling using neural networks
- Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
- Algorithmic paradoxes of the single-machine total tardiness problem
This page was built for publication: Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness