A heuristic for the single machine tardiness problem
type: Item
instance of: scholarly article
title: A heuristic for the single machine tardiness problem
zbMATH Open document ID: 0782.90057
DOI: 10.1016/0377-2217(93)90241-E
published in: European Journal of Operational Research
publication date: 1994-02-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 474843
zbMATH Keywords: heuristic
zbMATH Keywords: mean tardiness
zbMATH Keywords: single machine sequencing
zbMATH Keywords: due dates
author: S. S. Panwalkar
author: Milton L. Smith
author: C. Koulamas
MaRDI profile type: Publication
cites work: An experimental comparison of solution algorithms for the single-machine tardiness 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: A dual algorithm for the one-machine scheduling problem
cites work: Q3815120
cites work: A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
cites work: Q4124332
cites work: Scheduling with deadlines and loss functions
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: Dynamic programming and decomposition approaches for the single machine total tardiness problem
cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
cites work: A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
description: scientific article; zbMATH DE number 474843