Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Scheduling Algorithms
Integrated Production Control Systems: Management, Analysis, Design
Integrated Production Control Systems: Management, Analysis, Design
A survey of approaches to the job shop scheduling problem
SSST '96 Proceedings of the 28th Southeastern Symposium on System Theory (SSST '96)
An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling
Journal of Scheduling
On decomposition of the total tardiness problem
Operations Research Letters
New dominance rules and exploration strategies for the 1|ri|ΣUi scheduling problem
Computational Optimization and Applications
A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
INFORMS Journal on Computing
A branch-and-bound algorithm for assembly line worker assignment and balancing problems
Computers and Operations Research
| Hi-index | 0.00 |
This paper presents a modified Branch and Bound (B&B) algorithm called, the Branch, Bound, and Remember (BB&R) algorithm, which uses the Distributed Best First Search (DBFS) exploration strategy for solving the 1|r i |Σemt i scheduling problem, a single machine scheduling problem where the objective is to find a schedule with the minimum total tardiness. Memory-based dominance strategies are incorporated into the BB&R algorithm. In addition, a modified memory-based dynamic programming algorithm is also introduced to efficiently compute lower bounds for the 1|r i |Σt i scheduling problem. Computational results are reported, which shows that the BB&R algorithm with the DBFS exploration strategy outperforms the best known algorithms reported in the literature.