In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck tabu search (SB-TS) algorithm by replacing the reoptimization step in the shifting bottleneck (SB) algorithm by a tabu search (TS). In terms of the shifting bottleneck heuristic, the proposed tabu search optimizes the total weighted tardi...

Using a simple multiprocessor scheduling problem as a vehicle, we explore the behavior of tabu search algorithms using different tabu, local search and list management strategies. We found that random blocking of the tail of the tabu list always improved performance; but that the use of frequency-based penalties to discourage frequently selected moves did not. Hash coding without conflict resol...

The two-machine group-scheduling problem for minimizing the total completion time with carryover sequence dependency is addressed in this paper. These problems are typically encountered in electronics manufacturing. A procedure called Minsetup is developed to determine the lower bound for the total completion time, and a search algorithm based on tabu search is proposed to solve the problem. Un...

a tandem agv configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. each loop has at least one additional p/d station, provided as an interface between adjacent loops. this study describes the development of three tabu search algorithms for the design of tandem agv systems. the first algorithm was developed based on the basic definiti...

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

In order to improve the efficiency of test data generation during the software test, many studies have been focusing on the automation of test data generation with metaheuristic techniques such as genetic algorithm and tabu search etc. This paper proposes a hybrid algorithm in combination with genetic algorithm with tabu search to generate the test data based on decision coverage criteria. The ...

in this paper a guided tabu search (gts) is utilized for optimal nodal ordering of finite element models (fems) leading to small profile for the stiffness matrices of the models. the search strategy is accelerated and a graph-theoretical approach is used as guidance. the method is evaluated by minimization of graph matrices pattern equivalent to stiffness matrices of finite element models. comp...

We presented a parallel tabu search (PTS) algorithm for the traveling salesman problem (TSP), which is NP-hard. To parallelize tabu search (TS) algorithm efficiently, the search space decomposition based on partition principle was used to balance the computing load, while exploitation in subspace had been boosted by an adaptive search strategy of intensification and diversification. Numerical r...

In recent years, there has been a great deal of interest in metaheuristics in the optimization community. Tabu Search (TS) represents a popular class of metaheuristics. However, compared with other metaheuristics like genetic algorithm and simulated annealing, contributions of TS that deals with continuous problems are still very limited. In this paper, we introduce a continuous TS called Direc...