A greedy heuristic for the mean tardiness sequencing problem
type: Item
instance of: scholarly article
title: A greedy heuristic for the mean tardiness sequencing problem
zbMATH Open document ID: 0796.90034
DOI: 10.1016/0305-0548(94)90094-9
author: Adam Fadlalla
author: James R. Evans
author: Martin S. Levy
published in: Computers \& Operations Research
publication date: 1994-09-26T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 527452
zbMATH Keywords: mean tardiness problem
zbMATH Keywords: sequencing a set of jobs
zbMATH Keywords: single processor
zbMATH Keywords: average tardiness
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)90094-9
OpenAlex ID: W2093215438
cites work: An experimental comparison of solution algorithms for the single-machine tardiness problem
cites work: Q4658190
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: A dual algorithm for the one-machine scheduling problem
cites work: Q4124332
cites work: Q4000368
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: Minimizing Total Costs in One-Machine Scheduling
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 527452