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

Authors:
R. Tadei;A. Grosso;F. Della Croce
Affiliations:
Dipart. di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy;Dipart. di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy;Dipart. di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy
Venue:
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
Year:
2002

Citing 2
Cited 3

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Decomposition of the single machine total tardiness problem

Operations Research Letters

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems

Theoretical Computer Science
Pareto optima for total weighted completion time and maximum lateness on a single machine

Discrete Applied Mathematics
Minimizing maximum tardiness and delivery costs in a batched delivery system

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper deals with the single machine scheduling problem where both total and maximum tardiness musl be mimmized. The ε-constraint approach is adopted to search for all the Pareto-optima, leading to cope with a total tardiness problem with deadlines. This latter problem is studied, identifying several dominance properties, decomposition rules and polynomially and pseudopolynomially solvable cases. A branch and bound algorithm for finding the Pareto-optima is proposed and computational results are reported for instances up to 70 jobs in size.