Finding the Pareto-optima for the total and maximum tardiness single machine problem

DOI10.1016/S0166-218X(01)00334-1zbMath1005.90038MaRDI QIDQ1850123

Andrea Grosso, Roberto Tadei, Frederico Della Croce

Publication date: 2 December 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithm; \(\varepsilon\)-constraint approach; Pareto-optima; total and maximum tardiness

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C29: Multi-objective and goal programming

90B35: Deterministic scheduling theory in operations research

Related Items

The single-machine total tardiness scheduling problem: review and extensions, On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems., Pareto optima for total weighted completion time and maximum lateness on a single machine, Multicriteria scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• A bicriterion approach to time/cost trade-offs in sequencing
• Complexity of single machine, multi-criteria scheduling problems
• Solution of the single machine total tardiness problem
• A fully polynomial approximation scheme for the total tardiness problem
• A new decomposition approach for the single machine total tardiness scheduling problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Algorithmic paradoxes of the single-machine total tardiness problem