scholarly journals Sequence Dependent Scheduling Optimization on Plastic Injection Line with Tabu Search Method

2021 ◽  
Vol 9 (2) ◽  
pp. 378-387
Author(s):  
Muhammed MOHAMEDSALİH ◽  
Fuat ŞİMŞİR
Keyword(s):  
Tabu Search ◽  
Search Method ◽  
Scheduling Optimization ◽  
Sequence Dependent ◽  
Injection Line ◽  
Tabu Search Method ◽  
Plastic Injection

scholarly journals Course scheduling optimization using genetic algorithm and tabu search

2021 ◽  
Vol 9 (3) ◽  
pp. 157-166
Author(s):  
Arif Amrulloh ◽  
Enny Itje Sela
Keyword(s):  
Higher Education ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Tabu Search ◽  
Search Method ◽  
Scheduling Optimization ◽  
Taboo Search ◽  
Course Scheduling ◽  
Study Programs ◽  
Tabu Search Method

Scheduling courses in higher education often face problems, such as the clashes of teachers' schedules, rooms, and students' schedules. This study proposes course scheduling optimization using genetic algorithms and taboo search. The genetic algorithm produces the best generation of chromosomes composed of lecturer, day, and hour genes. The Tabu search method is used for the lecture rooms division. Scheduling is carried out for the Informatics faculty with four study programs, 65 lecturers, 93 courses, 265 lecturer assignments, and 65 classes. The process of generating 265 schedules took 561 seconds without any scheduling clashes. The genetic algorithms and taboo searches can process quite many course schedules faster than the manual method.

Multiobjective Tabu Search method used in chemistry

2006 ◽  
Vol 106 (6) ◽  
pp. 1406-1412 ◽  
Author(s):  
T. Rusu ◽  
V. Bulacovschi
Keyword(s):  
Tabu Search ◽  
Search Method ◽  
Tabu Search Method

On a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine Cutting Problems

2012 ◽  
Vol 4 (2) ◽  
pp. 26-40 ◽  
Author(s):  
Hamza Gharsellaoui ◽  
Hamadi Hasni
Keyword(s):  
Tabu Search ◽  
Hybrid Approach ◽  
Search Method ◽  
Two Dimensional ◽  
Whole Number ◽  
Infinite Height ◽  
Tabu Search Method ◽  
Problem Instances ◽  
Cutting Problems ◽  
Guillotine Cutting

The paper deals with the purpose of one hybrid approach for solving the constrained two-dimensional cutting (2DC) problem. The authors study this hybrid approach that combines the genetic algorithm and the Tabu search method. For this problem, they assume a packing of a whole number of rectangular pieces to cut, and that all cuts are of guillotine type in one sheet of a fixed width and an infinite height. Finally, they undertake an extensive experimental study with a large number of problem instances extracted from the literature by the Hopper’s benchmarks in order to support and to prove their approach and to evaluate the performance.

Sign in / Sign up

Export Citation Format

Share Document