A note on the SPT heuristic for solving scheduling problems with generalized due dates

Computers and Operations Research

Volumn 31, Issue 5, 2004, Pages 645-655

  Mosheiov, Gur ^a   Oron, Daniel ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Heuristics; Parallel identical machines; Scheduling

Indexed keywords

HEURISTIC METHODS; NUMERICAL METHODS; PROBLEM SOLVING; SCHEDULING;

SCHEDULING PROBLEMS; SHORTEST PROCESSING TIME (SPT);

OPERATIONS RESEARCH;

HEURISTICS;

EID: 0942269484     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00018-2     Document Type: Article

References (5)

1. Hall NG. Scheduling problems with generalized due-dates. IIE Transactions 1986;18:220-2.
2. Sriskandarajah C. A note on the generalized due-dates scheduling problems. Naval Research Logistics 1990;37: 587-97.
3. Hall NG, Sethi SP, Sriskandarajah C. On the complexity of generalized due-date scheduling problems. European Journal of Operational Research 1991;51:100-9.
4. Lenstra JK, Rinnooy Kan AHG, Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1977;1:343-62.
5. Du J, Leung JY-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 1990;15:483-95.