A Q-learning-based variable greedy algorithm to minimize the sum of total earliness and tardiness in a no-wait flowshop scheduling problem
Fields of Study & Subjects
Scheduling and Optimization Algorithms
Resource-Constrained Project Scheduling
Assembly Line Balancing Optimization
Publication details
- Journal / source
- Computers & Operations Research
- Publisher
- Elsevier BV
- Volume
- 188
- Pages
- 107382–107382
- Publication date
- 6 January 2026
- Language
- EN