.png){kind=icon}
.png){kind=icon}
Return
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2003.08.061.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
scheduling
dynamic programming
local search
exponential neighborhoods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available