Fast neighborhood search for the single machine total weighted tardiness problem

DOI10.1016/J.ORL.2005.01.010MaRDI QIDQ2583706zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Özlem Ergun, James B. Orlin

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

algorithmssingle machine schedulingneighborhood search

Mathematics Subject Classification ID

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

Recommendations

• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• Improved heuristics for the n-job single-machine weighted tardiness problem
• A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem

Cites work

• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• 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

Cited in

(13)

• Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
• MP or not MP: that is the question
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
• On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
• A destroy and repair algorithm for the bike sharing rebalancing problem
• Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups
• A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem
• A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• The Vehicle Routing Problem with Release and Due Dates

This page was built for publication: Fast neighborhood search for the single machine total weighted tardiness problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583706)