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

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

0.00 Avg rating0 Votes
Article ID: iaor200685
Country: Netherlands
Volume: 162
Issue: 1
Start Page Number: 281
End Page Number: 289
Publication Date: Apr 2005
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics, programming: dynamic
Abstract:

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 neighborhoood over the traditional one.

Reviews

Required fields are marked *. Your email address will not be published.