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

DOI10.1016/J.EJOR.2003.08.061zbMATH Open1132.90321OpenAlexW2068736879MaRDI QIDQ707153FDOQ707153

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

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

zbMATH Keywords

SchedulingDynamic programmingLocal searchExponential neighborhoods

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A survey of very large-scale neighborhood search techniques
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Title not available (Why is that?)
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• Scheduling with time dependent processing times: Review and extensions
• A fully polynomial approximation scheme for the total tardiness problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• On the quality of local search for the quadratic assignment problem
• Title not available (Why is that?)
• Exponential neighbourhood local search for the traveling salesman problem

Cited In (5)

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