Tabu Search and an Exact Algorithm for the Solutions of Resource-constrained Project Scheduling Problems
When the project is scheduled with a given set of resources, it is difficult to find the optimal solution. Resourceconstrained scheduling problems (RCPSP) are generally NP-hard. In this paper, a high level heuristic procedure “Tabu Search Algorithm (TSA)†is proposed to provide good solutions to...
Main Author: | Omer Atli |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer
2011-04-01
|
Series: | International Journal of Computational Intelligence Systems |
Subjects: | |
Online Access: | https://www.atlantis-press.com/article/2148.pdf |
Similar Items
-
SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS
by: Wamiliana Wamiliana
Published: (2004-01-01) -
Finding solution by Tabu search
by: Ratanamanee, W., et al.
Published: (2003-11-01) -
MINIMASI WAKTU PENGERJAAN PRODUK MELANIE SLEIGH CHANGING TABLE MELALUI PENDEKATAN SIMULASI DAN TABU SEARCH
by: Natalia Sofyan, et al.
Published: (2006-01-01) -
A study on the performance of differential search algorithm for single mode resource constrained project scheduling problem
by: Nazanin Rahmani, et al.
Published: (2015-09-01) -
A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem
by: Nayeli Jazmin Escamilla Serna, et al.
Published: (2021-05-01)