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

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

Roberto Tadei, Frederico Della Croce, Andrea Grosso

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00334-1

zbMATH Keywords

branch-and-bound algorithm\(\varepsilon\)-constraint approachPareto-optimatotal and maximum tardiness

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items

A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization, A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization, 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, The prize-collecting scheduling problem with deadlines, New results for scheduling to minimize tardiness on one machine with rejection and related problems, The single-machine total tardiness scheduling problem: review and extensions, Multicriteria scheduling, Parallel Machine Scheduling with Due Date-to-Deadline Window, Order Sharing and Time Value of Money

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