Solution of the single machine total tardiness problem
type: Item
instance of: scholarly article
title: Solution of the single machine total tardiness problem
zbMATH Open document ID: 0963.90029
author: Wlodzimierz Szwarc
author: F. Della Croce
author: Andrea Grosso
published in: Journal of Scheduling
publication date: 2001-07-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1552715
zbMATH Keywords: single machine scheduling
zbMATH Keywords: due dates
zbMATH Keywords: tardiness
zbMATH Keywords: decomposition
zbMATH Keywords: lower bound
MaRDI profile type: Publication
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: The Total Tardiness Problem: Review and Extensions
cites work: Decomposition of the single machine total tardiness problem
cites work: A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
cites work: Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: On decomposition of the total tardiness problem
cites work: Decomposition in single-machine scheduling
OpenAlex ID: W2017470706
DOI: 10.1002/(SICI)1099-1425(199903/04)2:2%3C55::AID-JOS14%3E3.0.CO;2-5
full work available at URL: https://doi.org/10.1002/(sici)1099-1425(199903/04)2:2%3C55::aid-jos14%3E3.0.co
description: scientific article; zbMATH DE number 1552715