期刊
OPERATIONS RESEARCH LETTERS
卷 32, 期 1, 页码 68-72出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0167-6377(03)00064-6
关键词
total weighted tardiness; dynasearch; generalized pairwise interchanges
Based on the work by Congram, Potts and Van de Velde, we develop for the single-machine total weighted tardiness scheduling problem an enhanced dynasearch neighborhood obtained by the generalized pairwise interchange (GPI) operators. Despite of the wider neighborhood considered, a fast search procedure using also elimination criteria is developed. The computational results significantly improve over those of Congram, Potts and Van de Velde. (C) 2003 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据