KFUPM ePrints

Tabu Search For A Class Of Single-Machine Scheduling Problems

Al-Turki, Umar and Fedjki, C.A. and Andijani, A. A. Tabu Search For A Class Of Single-Machine Scheduling Problems. COMPUTERS OPERATIONS RESEARCH, 28. pp. 1223-1230.

[img]
Preview
PDF
30Kb

Abstract

In this paper we develop a tabu search-based solution procedure designed specifically for a certain class of single-machine scheduling problems with a non-regular performance measure. The performance of the developed algorithm is tested for solving the variance minimization problem. Problems from the literature are used to test the performance of the algorithm. This algorithm can be used for solving other problems such as minimizing completion time deviation from a common due date.



Item Type:Article
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Systems Engineering Dept
Creators:Al-Turki, Umar and Fedjki, C.A. and Andijani, A. A.
Email:alturki@ccse.kfupm.edu.sa, chawki@kfupm.edu.sa, andijani@kfupm.edu.sa
ID Code:2566
Deposited By:SHAIKH ARIFUSALAM
Deposited On:14 Jun 2008 13:32
Last Modified:12 Apr 2011 13:12

Repository Staff Only: item control page