In this section

    Tabu Search For A Class Of Single-Machine Scheduling Problems

    Tabu Search For A Class Of Single-Machine Scheduling Problems. COMPUTERS OPERATIONS RESEARCH, 28. pp. 1223-1230.

    [img]
    Preview
    		 PDF
    tabu_search_for_a_class_of_single_machin_al_turki_isi_000170418600005.pdf
    Download (31kB) | Preview

    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
    Department: College of Computing and Mathematics > lndustrial and Systems Engineering
    Depositing User: SHAIKH ARIFUSALAM
    Date Deposited: 14 Jun 2008 10:32
    Last Modified: 01 Nov 2019 13:44
    URI: http://eprints.kfupm.edu.sa/id/eprint/2566