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

DOI10.1057/palgrave.jors.2600400zbMath0882.90075OpenAlexW2076149487MaRDI QIDQ4347409

Randolph M. Russell, J. Edward Holsenback

Publication date: 10 March 1998

Published in: 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

single machinesequencingheuristictotal tardinessnet benefit of relocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ Evaluation of leading heuristics for the single machine tardiness problem ⋮ The single-machine total tardiness scheduling problem: review and extensions

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