On decomposition of the total tardiness problem
type: Item
instance of: scholarly article
title: On decomposition of the total tardiness problem
zbMATH Open document ID: 0858.90072
DOI: 10.1016/0167-6377(95)00027-H
author: Yanyan Li
published in: Operations Research Letters
publication date: 1996-10-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 937081
zbMATH Keywords: backward shift
zbMATH Keywords: one-machine total tardiness problem
zbMATH Keywords: decomposition algorithm
MaRDI profile type: Publication
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: Q4124332
cites work: A decomposition algorithm for the single machine total tardiness problem
full work available at URL: 0167-6377(95)00027-h
OpenAlex ID: W2170188992
description: scientific article; zbMATH DE number 937081