An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes

2017 ◽  
Vol 77 ◽  
pp. 154-176 ◽  
Author(s):  
Omid Shahvari ◽  
Rasaratnam Logendran
Keyword(s):  
Tabu Search ◽  
Lower Bounds ◽  
Parallel Machines ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Unrelated Parallel Machines ◽  
Scheduling Problems ◽  
Batch Sizes

scholarly journals Tabu Search Algorithm Based on Lower Bound and Exact Algorithm Solutions for Minimizing the Makespan in Non-Identical Parallel Machines Scheduling

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Mohammed A. Noman ◽  
Moath Alatefi ◽  
Abdulrahman M. Al-Ahmari ◽  
Tamer Ali
Keyword(s):  
Lower Bound ◽  
Tabu Search ◽  
Parallel Machines ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Exact Algorithm ◽  
Tabu Search Algorithm ◽  
Scheduling Problems ◽  
Parallel Machines Scheduling ◽  
Hard Problems

Recently, several heuristics have been interested in scheduling problems, especially those that are difficult to solve via traditional methods, and these are called NP-hard problems. As a result, many methods have been proposed to solve the difficult scheduling problems; among those, effective methods are the tabu search algorithm (TS), which is characterized by its high ability to adapt to problems of the large size scale and ease of implementation and gives solution closest to the optimum, but even though those difficult problems are common in many industries, there are only a few numbers of previous studies interested in the scheduling of jobs on unrelated parallel machines. In this paper, a developed TS algorithm based on lower bound (LB) and exact algorithm (EA) solutions is proposed with the objective of minimizing the total completion time (makespan) of jobs on nonidentical parallel machines. The given solution via EA was suggested to enhance and assess the solution obtained from TS. Moreover, the LB algorithm was developed to evaluate the quality of the solution that is supposed to be obtained by the developed TS algorithm and, in addition, to reduce the period for searching for the optimal solution. Two numerical examples from previous studies from the literature have been solved using the developed TS algorithm. Findings show that the developed TS algorithm proved its superiority and speed in giving it the best solution compared to those solutions previously obtained from the literature.

A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD

2009 ◽  
Vol 26 (06) ◽  
pp. 817-829 ◽  
Author(s):  
XIAOFENG HU ◽  
JINGSONG BAO ◽  
YE JIN
Keyword(s):  
Tabu Search ◽  
Parallel Machines ◽  
Search Algorithm ◽  
Real Data ◽  
Total Tardiness ◽  
Tabu Search Algorithm ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Pipe Processing ◽  
Flowshop Scheduling Problem

This paper focuses on scheduling problem of a pipe-processing flowshop in a shipyard. The flowshop composes of five stages, including cutting, bending, welding preprocessing, argon-welding and CO 2-welding, and each stage consists of identical parallel machines. Since thousands of pipes are mounted on the hull block before erection, the pipe-processing scheduling is a critical task for shipbuilding to meet the due date of the block erection. A tabu search algorithm is developed for the scheduling problem with the objective of minimizing total tardiness. Computational experiments are performed on the collected real data. Results show that the proposed algorithm is efficient for this problem.

scholarly journals Applying Tabu Search to Determine New Ramsey Graphs

10.37236/1230 ◽  
1996 ◽  
Vol 3 (1) ◽  
Author(s):  
Konrad Piwakowski
Keyword(s):  
Tabu Search ◽  
Lower Bounds ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Ramsey Numbers ◽  
Ramsey Graphs

In this note an adaptation of heuristic tabu search algorithm for finding Ramsey graphs is presented. As a result, seven new lower bounds for classical Ramsey numbers are established: $R(3,13)\geq 59$, $R(4,10)\geq 80$, $R(4,11)\geq 96$, $R(4,12)\geq 106$, $R(4,13)\geq 118$, $R(4,14)\geq 129$, and $R(5,8)\geq 95$.

Sign in / Sign up

Export Citation Format

Share Document