A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem

DOI10.1016/J.EJOR.2003.08.061MaRDI QIDQ707153zbMATHOpenAlexFDO

Authors Eric Angel, Evripidis Bampis

Publication date 9 February 2005

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

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

zbMATH Keywords

SchedulingDynamic programmingLocal searchExponential neighborhoods

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• Fast neighborhood search for the single machine total weighted tardiness problem
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
• A tabu search algorithm for the single machine total weighted tardiness problem

Cites work

• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• scientific article; zbMATH DE number 1082109 (Why is no real title available?)
• scientific article; zbMATH DE number 2064409 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• A fully polynomial approximation scheme for the total tardiness problem
• A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
• A survey of very large-scale neighborhood search techniques
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• Creating very large scale neighborhoods out of smaller ones by compounding moves
• Exponential neighbourhood local search for the traveling salesman problem
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• On the classification of NP-complete problems in terms of their correlation coefficient
• On the quality of local search for the quadratic assignment problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling with time dependent processing times: Review and extensions

Cited in

(5)

• Split-merge: using exponential neighborhood search for scheduling a batching machine
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• Fast neighborhood search for the single machine total weighted tardiness problem
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem

This page was built for publication: A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem

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