Finding the Pareto-optima for the total and maximum tardiness single machine problem
type: Item
instance of: scholarly article
title: Finding the Pareto-optima for the total and maximum tardiness single machine problem
zbMATH Open document ID: 1005.90038
DOI: 10.1016/S0166-218X(01)00334-1
published in: Discrete Applied Mathematics
publication date: 2002-12-02T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1839084
zbMATH Keywords: total and maximum tardiness
zbMATH Keywords: \(\varepsilon\)-constraint approach
zbMATH Keywords: Pareto-optima
zbMATH Keywords: branch-and-bound algorithm
author: Roberto Tadei
author: Andrea Grosso
author: F. Della Croce
MaRDI profile type: Publication
cites work: Complexity of single machine, multi-criteria scheduling problems
cites work: A new decomposition approach for the single machine total tardiness scheduling problem
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: Q4002567
cites work: Q4124332
cites work: A fully polynomial approximation scheme for the total tardiness problem
cites work: Solution of the single machine total tardiness problem
cites work: Algorithmic paradoxes of the single-machine total tardiness problem
cites work: A bicriterion approach to time/cost trade-offs in sequencing
full work available at URL: s0166-218x(01)00334-1
OpenAlex ID: W1994488876
description: scientific article; zbMATH DE number 1839084