Comparison of two heuristic approaches for solving the production scheduling problem

Arunas Andziulis, Dale Dzemydiene, Raimundas Steponavičius, Sergej Jakovlev

    Research output: Contribution to journalArticle

    7 Citations (Scopus)


    Production scheduling problems attract a lot of attention among applied scientists and practitioners working in the field of combinatorial optimization and optimization software development since they are encountered in many different manufacturing processes and thus effective solutions to them offer great benefits. In this work, two commonly used heuristic methods for solving production scheduling problems, namely, the Nearest Neighbor (NN) and Ant Colony Optimization (ACO) have been tested on a specific real-life problem and the results discussed. The problem belongs to the class of Asymmetric Travelling Salesman Problems (ATSP), which is known as a hard type problem with no effective solutions for large scale problems available yet. The performances of the Nearest Neighbor algorithm and the Ant Colony Optimization technique were evaluated and compared using two criteria, namely: The minimum value of the objective function achieved and the CPU time it took to find it (including the statistical confidence limits). The conclusions drawn suggest that on one hand the ACO algorithm works better than NN if looking at the achieved minimum values of the objective function. On the other hand, the computational time of the ACO algorithm is slightly longer.

    Original languageEnglish
    Pages (from-to)118-122
    Number of pages5
    JournalInformation Technology and Control
    Issue number2
    Publication statusPublished - 2011



    • Ant colony optimization
    • Asymmetric travelling salesman problem
    • Nearest neighbor
    • Production scheduling
    • Theory of algorithms

    ASJC Scopus subject areas

    • Computer Science Applications
    • Electrical and Electronic Engineering
    • Control and Systems Engineering

    Cite this