Insights into two solution procedures for the single machine tardiness problem

DOI10.1057/PALGRAVE.JORS.2601384MaRDI QIDQ4656685zbMATH OpenOpenAlexFDO

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

Publication date 14 March 2005

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

zbMATH Keywords

minimizing tardinessmodified due date ruleoptimal and heuristic decompositionsingle machine scheduling

Mathematics Subject Classification ID

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

Recommendations

• New insights on the single machine total tardiness problem
• Solution of the single machine total tardiness problem
• On the single machine total tardiness problem
• A heuristic for the single machine tardiness problem
• Decomposition of the single machine total tardiness problem
• The Single Machine Early/Tardy Problem
• Single machine total tardiness maximization problems: complexity and algorithms
• The single-machine total tardiness scheduling problem: review and extensions
• On the Single-machine Scheduling Problem with Tardiness Penalties
• Dynamic programming and decomposition approaches for the single machine total tardiness problem

Cited in

(4)

• The single-machine total tardiness scheduling problem: review and extensions
• A theoretical development for the total tardiness problem and its application in branch and bound algorithms
• The Single Machine Early/Tardy Problem
• New insights on the single machine total tardiness problem

This page was built for publication: Insights into two solution procedures for the single machine tardiness problem

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