Fast neighborhood search for the single machine total weighted tardiness problem

DOI10.1016/j.orl.2005.01.010zbMath1080.90045WikidataQ59592452 ScholiaQ59592452MaRDI QIDQ2583706

James B. Orlin, Özlem Ergun

Publication date: 18 January 2006

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.01.010

zbMATH Keywords

algorithms; single machine scheduling; neighborhood search

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

The Vehicle Routing Problem with Release and Due Dates, MP or not MP: that is the question, An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times, A destroy and repair algorithm for the bike sharing rebalancing problem, Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups, Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, Fast neighborhood search for the single machine earliness-tardiness scheduling problem

Cites Work

• 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
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Unnamed Item
• Unnamed Item