| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437242 | Theoretical Computer Science | 2012 | 8 Pages |
Abstract
In this paper we address the 1/sij/∑wjTj problem, for which we improve the time complexities of searching the interchange, insertion and twist neighborhoods from to . 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 to .
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
