An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

By Richard K. Congram, Chris N. Potts, Steef L. van de Velde. INFORMS journal on computing, 2002

326 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Hybrid metaheuristics in combinatorial optimization: A survey (2011, methodology): “In this paragraph, we will illustrate the principles of iterated dynasearch with respect to its application to the single-machine total weighted tardiness scheduling problem (SMTWTSP) [144].”
A review of population-based meta-heuristic algorithm (2013, background): “Also, some of them are non-nature-inspired algorithms like Iterated Local Search (ILS) [36] and Tabu Search (TS) [37].”
Ant Colony Optimization (2001, unknown): “ACS-SMTWTP-BSD is currently among the best available algorithms for the SMTWTP; however, the iterated Dynasearch approaches of Congram et al. (2002) and Grosso, Della Croce, & Tadei (2004) appear to be faster, reaching the same level of performance in a shorter computation time.”
Metaheuristics in Combinatorial Optimization (2005, background): “These include, for example, ejection chains, cyclic transfer, sequential fan and various forms of look ahead strategies (Ahuja et al., 2002; Congram, Potts, and van der Velde, 2002; Glover, 1996).”
Order batching to minimize total travel time in a parallel-aisle warehouse (2005, background): “, 1999) and the singlemachine weighted tardiness problem (Congram et al., 2002).”