A note on the SPT heuristic for solving scheduling problems with generalized due dates
type: Item
instance of: scholarly article
title: A note on the SPT heuristic for solving scheduling problems with generalized due dates
zbMATH Open document ID: 1048.90107
DOI: 10.1016/S0305-0548(03)00018-2
author: Gur Mosheiov
author: Daniel Oron
published in: Computers \& Operations Research
publication date: 2004-06-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 2075495
zbMATH Keywords: Scheduling
zbMATH Keywords: Parallel identical machines
zbMATH Keywords: Heuristics
MaRDI profile type: Publication
cites work: Q3197606
cites work: On the complexity of generalized due date scheduling problems
cites work: Q4055377
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
full work available at URL: s0305-0548(03)00018-2
OpenAlex ID: W1989949708
description: scientific article; zbMATH DE number 2075495