A note on the equivalence of two heurist
โ
Bahram Alidaee; Suresh Gopalan
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 272 KB
Over the last thirty years, many researchers have studied single machine static and deterministic scheduling with the objective of minimizing total tardiness. It has been established that the tardiness problem is NP-hard. So it is unlikely that a polynomial time algorithm can be found for developing