A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem

Aeon: Synthesizing Scheduling Algorithms from High-Level Models

“…For each algorithm, the mean relative error (MRE) is given. The MRE is equal to 100 * (UB − LB)/LB where UB is the value of the (average) makespan found by the algorithm and LB is the best lower bound known for the instance (taken from Zhang et al (2008Zhang et al ( , 2007; Van Hentenryck and Michel (2005); Laborie and Godard (2007)). To show another hybrid approach, we also generated a Large Neighborhood Search (LNS) for the OSP.…”

A tabu search/path relinking algorithm to solve the job shop scheduling problem

“…Our TS procedure uses the N7 neighbourhood proposed by Zhang et al (2007). It stops if the optimal solution is found or the best objective value has not been improved for a given number of TS iterations, called the tabu search cutoff.…”

“…Pardalos and Shylo (2006) propose algorithm GES, which is based on global equilibrium search techniques. Zhang et al (2007) extend the N6 neighbourhood proposed by Balas and Vazacopoulos (1998) to the N7 neighbourhood and Zhang et al (2008) combine TS with SA to create algorithm TS/SA, which outperforms almost all the algorithms. Nagata and Tojo (2009) present a local search framework termed guided ejection search, which always searches for an incomplete solution for JSP.…”

“…As one of the most popular local search algorithms, TS has been widely used by researchers to tackle JSP, e.g., Nowicki and Smutnicki (2005), Zhang et al (2007), Nasiri and Kianfar (2012a), Shen and Buscher (2012), and Gonçalves and Resende (2013), among others.…”

Redes neuronales y preprocesado de variables para modelos y sensores en bioingeniería

“…The first most successful usage was proposed by Glover [122,123,125] for combinatorial optimization. Later, TS was successfully used in scheduling [84,212,371], design [364,365], routing [42,303] and general optimization problems [7,124,147]. The TS has become a powerful method with different components tied together, that is able to obtain excellent results in different problem domains.…”