Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem

DOI10.1057/PALGRAVE.JORS.2600400MaRDI QIDQ4347409zbMATHOpenAlexFDO

Authors Randolph M. Russell, J. Edward Holsenback

Publication date 10 March 1998

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600400

zbMATH Keywords

heuristicsingle machinetotal tardinesssequencingnet benefit of relocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
• Evaluation of leading heuristics for the single machine tardiness problem
• A heuristic for the single machine tardiness problem

Cited in

(7)

• Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
• Evaluation of leading heuristics for the single machine tardiness problem
• Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates
• A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
• The single-machine total tardiness scheduling problem: review and extensions
• Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
• Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem

This page was built for publication: Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem

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