Scheduling in a sequence dependent setup environment with genetic search
Computers and Operations Research - Special issue on genetic algorithms
New neighborhood search algorithms based on exponentially large neighborhoods
New neighborhood search algorithms based on exponentially large neighborhoods
Approximation algorithms for minimizing the total weighted tardiness on a single machine
Theoretical Computer Science
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Fast neighborhood search for the single machine total weighted tardiness problem
Operations Research Letters
| Hi-index | 5.23 |
In this paper we address the 1/s"i"j/@?w"jT"j problem, for which we improve the time complexities of searching the interchange, insertion and twist neighborhoods from O(n^3) to O(n^2logn). 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^2k) to O(nklogk+n^2).