IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v16y2026ics2214716026000047.html

Evolutionary trajectories of Tabu Search in scheduling: A main path analysis–based retrospective over four decades

Author

Listed:
  • Ying, Kuo-Ching
  • Pourhejazy, Pourya
  • Chen, Ming-Yen

Abstract

Tabu Search (TS), an optimization algorithm recognized for its effectiveness in local search, is widely used to solve planning and scheduling problems. This article traces the development trajectories of the TS algorithm in scheduling by performing a Main Path Analysis (MPA) of publications over the past four decades. By synthesizing these trajectories with an in-depth discussion of core theoretical properties, this review provides both a coherent historical perspective and practically actionable technical guidance for practitioners. We further investigate the principal applications of TS across different scheduling problems using Cluster Analysis (CA) and provide an agenda for future research. The review reveals that TS has undergone the most development in addressing single-machine, parallel-machine, and flow-shop scheduling problems. This study also sheds light on the selection of TS’s algorithmic components for different classes of scheduling problems.

Suggested Citation

  • Ying, Kuo-Ching & Pourhejazy, Pourya & Chen, Ming-Yen, 2026. "Evolutionary trajectories of Tabu Search in scheduling: A main path analysis–based retrospective over four decades," Operations Research Perspectives, Elsevier, vol. 16(C).
    • Handle: RePEc:eee:oprepe:v:16:y:2026:i:c:s2214716026000047
    DOI: 10.1016/j.orp.2026.100380
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716026000047
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.orp.2026.100380?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:oprepe:v:16:y:2026:i:c:s2214716026000047. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/operations-research-perspectives .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.