IJPAM: Volume 51, No. 2 (2009)
|
Invited Lecture Delivered at
Fifth International Conference of Applied Mathematics
and Computing (Plovdiv, Bulgaria, August 12-18, 2008)
|
ON COMMON PROPERTIES OF TWO SCHEDULING
PROBLEMS WITH DIFFERENT OBJECTIVE CRITERIA
Nodari Vakhania
Science Faculty
State University of Morelos
Av. Universidad 1001, Cuernavaca, 62210, Morelos, MEXICO
e-mail: nodari@uaem.mx
Science Faculty
State University of Morelos
Av. Universidad 1001, Cuernavaca, 62210, Morelos, MEXICO
e-mail: nodari@uaem.mx
Abstract.We consider two scheduling problems with release times and due dates. In the first problem our objective is to minimize the total job completion time, whereas in the second problem we aim to minimize the number of late jobs. We show that two problems have inherent common properties which can lead to efficient common solution methods for these problems.
Received: August 14, 2008
AMS Subject Classification: 68Q25, 90B35
Key Words and Phrases: scheduling algorithms, time complexity, due-date
Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2009
Volume: 51
Issue: 2