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

DOI10.1016/j.ejor.2003.08.061zbMath1132.90321OpenAlexW2068736879MaRDI QIDQ707153

Evripidis Bampis, Eric Angel

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

Dynamic programmingSchedulingLocal searchExponential neighborhoods

Mathematics Subject Classification ID

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

Related Items

Split-merge: using exponential neighborhood search for scheduling a batching machine

Cites Work

• A survey of very large-scale neighborhood search techniques
• Exponential neighbourhood local search for the traveling salesman problem
• On the quality of local search for the quadratic assignment problem
• A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
• A fully polynomial approximation scheme for the total tardiness problem
• On the classification of NP-complete problems in terms of their correlation coefficient
• Creating very large scale neighborhoods out of smaller ones by compounding moves
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• Scheduling with time dependent processing times: Review and extensions
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item