Deep Q-Networks for Minimizing Total Tardiness on a Single Machine

Deep Q-Networks for Minimizing Total Tardiness on a Single Machine

This paper considers the single-machine scheduling problem of total tardiness minimization. Due to its computational intractability, exact approaches such as dynamic programming algorithms and branch-and-bound algorithms struggle to produce optimal solutions for large-scale instances in a reasonable...

Full description

Saved in:
Bibliographic Details
Main Authors: Kuan Wei Huang, Bertrand M. T. Lin
Format: Article
Language:English
Published: MDPI AG 2024-12-01
Series:Mathematics
Subjects:
single-machine scheduling
total tardiness
machine learning
deep Q-networks
heuristic rules
short-term rewards
Online Access:https://www.mdpi.com/2227-7390/13/1/62
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items