|
Abstract
|
Article Information:
Improved Tabu Search for Parallel Identical Machines with Availability Zones (Tz, Sz)
Rachid Zitouni and Omar Selt
Corresponding Author: Omar Selt
Submitted: April 08, 2014
Accepted: May 24, 2014
Published: July 15, 2014 |
Abstract:
|
In this study we propose a new polynomial metaheuristic elaboration (tabu search) for solving scheduling problems. This method allows us to solve the scheduling problem of n Tasks on m identical parallel machines with availability zones (Tz, Sz). Since this problem is NP-complet in the strong sense and finding an optimal solution appears unlikely, we suggested an heuristic based on choosing the most available machine. To improve the performance of this heuristic, we used diversification strategies with the aim of exploring unvisited regions of the solution space and two well-known neighborhoods (neighborhood by swapping and neighborhood by insertion). It must be noted that tasks movement can be within one machine or between different machines. Note that all data in this problem are integer and deterministic. The performance criterion to optimize in this problem which we denote P_m∕∕N - C//∑_(j=1)^n▒w_j C_j is the weighted sum of the end dates of tasks.
Key words: Metaheuristic, parallel identical machines, scheduling, tabu search, unavailability periods, ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
Rachid Zitouni and Omar Selt, . Improved Tabu Search for Parallel Identical Machines with Availability Zones (Tz, Sz). Research Journal of Applied Sciences, Engineering and Technology, (3): 423-428.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
