A multi-start Dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem

Eric Angel (1) , Evripidis Bampis (1)

1 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes

We extend the dynasearch technique, recently proposed by Congram et al., in the context of time-dependent combinatorial optimization problems. As an application we consider a general time-dependent (idleness) version of the well known single-machine total weighted tardiness scheduling problem, in which the processing time of a job depends on its starting time of execution. We develop a multi-start local search algorithm and present experimental results on several types of instances showing the superiority of the dynasearch neighborhood over the traditional one.

Keywords: Total weighted tardiness; Scheduling; Combinatorial optimization; Combinatorial problem; Single machine; Time dependence; Processing time; Execution time; Local search; Search algorithm; Dynamic programming

Domains: Computer science; Operations Research [math.OC]; Data Structures and Algorithms [cs.DS]; Discrete Mathematics [cs.DM]; Computer Science and Game Theory [cs.GT]

Eric Angel, Evripidis Bampis. A multi-start Dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. European Journal of Operations Research, 2005, 162 (1), pp.281--289. ⟨hal-00341340⟩