Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem

Maziar Yazdani, Aldeida Aleti, Seyed Mohammad Khalili, Fariborz Jolai

    Research output: Contribution to journalArticleResearchpeer-review

    34 Citations (Scopus)


    The sum of the maximum earliness and tardiness criteria is a new objective function for the job shop scheduling problem introduced in this work. A mixed integer linear programming (MIP) formulation of the job shop scheduling problem with the new objective function is developed. We design a set of experiments where we validate the MIP model on different problem sizes. This is one of the most difficult problems in combinatorial optimization, with even modest sized instances being computationally intractable. Getting inspiration from a number of advances in solving this notoriously difficult problem, we develop a new approximate optimization approach, which is based on the imperialist competitive algorithm hybridized with an efficient neighborhood search. The effectiveness of the proposed approach is demonstrated through an experimental evaluation.

    Original languageEnglish
    Pages (from-to)12-24
    Number of pages13
    JournalComputers and Industrial Engineering
    Publication statusPublished - 1 May 2017


    • Imperialist competitive algorithm
    • Job shop scheduling
    • Maximum earliness
    • Maximum tardiness
    • Neighborhood search

    Cite this