A tabu search algorithm for the single machine total weighted tardiness problem

DOI10.1016/j.ejor.2005.10.030zbMath1102.90018OpenAlexW2063949971MaRDI QIDQ853020

Furkan Kıraç, Müjde Kurtulan, Ümit Bilge

Publication date: 15 November 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.030

zbMATH Keywords

tabu searchsingle machine schedulingtotal weighted tardiness minimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Just-in-time scheduling for a distributed concrete precast flow shop system ⋮ On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem ⋮ A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM ⋮ A population-based variable neighborhood search for the single machine total weighted tardiness problem ⋮ Memory and Learning in Metaheuristics

Uses Software

• OR-Library
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A controlled search simulated annealing method for the single machine weighted tardiness problem
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• A heuristic for the single machine tardiness problem
• A tabu search algorithm for parallel machine total tardiness problem
• On the single machine total tardiness problem
• Single machine scheduling to minimize total weighted tardiness
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• On general routing problems
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• The Total Tardiness Problem: Review and Extensions

This page was built for publication: A tabu search algorithm for the single machine total weighted tardiness problem