One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons

DOI10.1287/opre.2013.1253zbMath1304.90095OpenAlexW2134644346MaRDI QIDQ2875603

John J. Kanet

Publication date: 11 August 2014

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2013.1253

zbMATH Keywords

schedulingsingle machinesequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Erratum—One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons

Cites Work

• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Solution of the single machine total tardiness problem
• A decomposition algorithm for the single machine total tardiness problem
• A new decomposition approach for the single machine total tardiness scheduling problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Principles of Sequencing and Scheduling
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• On the Single-machine Scheduling Problem with Tardiness Penalties
• Minimizing Total Costs in One-Machine Scheduling
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• New Precedence Theorems for One-Machine Weighted Tardiness
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Algorithmic paradoxes of the single-machine total tardiness problem

This page was built for publication: One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons