Title of article
A note on the SPT heuristic for solving scheduling problems with generalized due dates
Author/Authors
Gur Mosheiov، نويسنده , , Daniel Oron، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2004
Pages
11
From page
645
To page
655
Abstract
Two NP-hard scheduling problems on parallel identical machines with generalized due dates are studied. We focus on two objectives: (i) minimizing maximum tardiness and (ii) minimizing total tardiness. In both cases, we introduce a shortest processing time first (SPT)-based heuristic and simple lower bounds on the optimal cost. Our numerical study indicates that the SPT heuristic performs extremely well in all settings.
Keywords
Heuristics , Parallel identical machines , Scheduling
Journal title
Computers and Operations Research
Serial Year
2004
Journal title
Computers and Operations Research
Record number
928043
Link To Document