@article {IOPORT.06049394,
    author       = {Liao, Ching-Jong and Tsou, Hsin-Hui and Huang, Kuo-Ling},
    title        = {Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups.},
    year         = {2012},
    journal      = {Theoretical Computer Science},
    volume       = {434},
    issn         = {0304-3975},
    pages        = {45-52},
    publisher    = {Elsevier Science Publishers, Amsterdam},
    doi          = {10.1016/j.tcs.2012.01.043},
    abstract     = {ummary: In this paper we address the $1/s_{ij}/\sum w_{j}T_{j}$ problem, for which we improve the time complexities of searching the interchange, insertion and twist neighborhoods from $O(n^3)$ to $O(n^2\log n)$. Further, we improve the time complexity of searching the insertion and twist neighborhoods in which a candidate job is selected from among $k$ jobs nearest to the selected job from $O(n^2 k)$ to $O(nk\log k + n^2)$.},
    identifier   = {06049394},
}