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

DOI10.1057/PALGRAVE.JORS.2600400zbMATH Open0882.90075OpenAlexW2076149487MaRDI QIDQ4347409FDOQ4347409

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

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

zbMATH Keywords

heuristicsingle machinetotal tardinesssequencingnet benefit of relocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (7)

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

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)