Insights into two solution procedures for the single machine tardiness problem

DOI10.1057/palgrave.jors.2601384zbMath1130.90330OpenAlexW2016197135MaRDI QIDQ4656685

Bahram Alidaee, Jatinder N. D. Gupta, J. T. Naidu

Publication date: 14 March 2005

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.2601384

zbMATH Keywords

single machine schedulingmodified due date ruleminimizing tardinessoptimal and heuristic decomposition

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

A theoretical development for the total tardiness problem and its application in branch and bound algorithms ⋮ The single-machine total tardiness scheduling problem: review and extensions