In this section

    An Efficient Tabu Search Algorithm For The Single-Machine Mean Tardiness Problem

    An Efficient Tabu Search Algorithm For The Single-Machine Mean Tardiness Problem. PRODUCTION PLANNING CONTROL, 8. pp. 694-700.

    [img]
    Preview
    		 PDF (An Efficient Tabu Search Algorithm For The Single-Machine Mean Tardiness Problem)
    an_efficient_tabu_search_algorithm_for_t_bendaya_isi_a1997ya03900010.pdf
    Download (28kB) | Preview

    Abstract

    In this paper, an efficient tabu search algorithm is prepared ibr solving the singlemachine mean tardiness problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighbourhoods of a given sequence and a combined scheme for intensification and diversification. The tabu search method is shown to produce results very close to the optimal solution using randomly generated problems with varying degrees of difficulty.

    Item Type: Article
    Subjects: Systems
    Department: College of Computing and Mathematics > lndustrial and Systems Engineering
    Depositing User: MR. ATIQ WALIULLAH SIDDIQUI
    Date Deposited: 14 Jun 2008 13:17
    Last Modified: 01 Nov 2019 13:44
    URI: http://eprints.kfupm.edu.sa/id/eprint/2447