Efficient neighborhood search for the one-machine earliness–tardiness scheduling problem

An improved earliness–tardiness timing algorithm

“…Moreover, for efficiency reasons, neighborhood search or branchand-bound algorithms often rely on the job sequence instead of using the schedule. For instance, most neighborhoods used in the literature are based on the permutation of jobs in the sequence [1][2][3]. The timing procedure must be called for each iteration and, therefore, has to be done efficiently.…”

An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem

“…Davis and Kanet [7] presented and demonstrated an efficient timetabling procedure which can be embedded in an enumerative algorithm allowing the search to be conducted over the domain of job permutations for these problems. Hendel and Sourd [11] considered a new approach that efficiently searches in a large neighborhood and always returns a solution for which the timing is optimal in this area. Hoogeveen and Van De Velde [12] investigated single machine problem of scheduling n independent jobs to minimize the sum of α times total completion time and β times total earliness with β > α which can be rewritten as an earliness-tardiness problem.…”

Recent progress of local search in handling the time window constraints of the vehicle routing problem

“…In particular, efficient implementations for the standard neighborhoods are possible, as discussed inIbaraki et al (2005),Hendel and Sourd (2006),Ibaraki et al (2008),Kedad-Sidhoum and Sourd (2010), because each solution in a standard neighborhood can be obtained by reconnecting at most four paths. It is not difficult to see that the travel cost and the violation of the capacity constraints of a neighborhood solution (at least for the standard neighborhoods) can be computed in O(1) time.…”