基于Q学习的可变贪婪算法最小化无等待流水车间调度问题中的总提前和延迟之和

A Q-learning-based variable greedy algorithm to minimize the sum of total earliness and tardiness in a no-wait flowshop scheduling problem

Computers and Operations Research · 2026

被引 1 · 同刊同年前 5%