On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification

DOI10.1016/j.ejor.2010.06.031zbMath1206.90042OpenAlexW2107195613MaRDI QIDQ613434

Martin Josef Geiger

Publication date: 20 December 2010

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

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

zbMATH Keywords

schedulingmetaheuristicsneighborhood operators

Mathematics Subject Classification ID

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

Related Items (6)

Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem ⋮ Order matters -- a variable neighborhood search for the swap-body vehicle routing problem ⋮ A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tabu search algorithm for the single machine total weighted tardiness problem
• A population-based variable neighborhood search for the single machine total weighted tardiness problem
• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Landscapes, operators and heuristic search
• Generalized pairwise interchanges and machine scheduling
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• Minimizing total tardiness on a single machine using ant colony optimization

This page was built for publication: On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification