๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On minimizing the sum of k tardiness

โœ Scribed by Gerhard Woeginger

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
482 KB
Volume
38
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing the sum of the k largest func
Minimizing the sum of the k largest functions in linear time
โœ Wlodzimierz Ogryczak; Arie Tamir ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 93 KB

Given a collection of n functions defined on R d , and a polyhedral set Q โŠ‚ R d , we consider the problem of minimizing the sum of the k largest functions of the collection over Q. Specifically we focus on collections of linear functions and several classes of convex, piecewise linear functions whic

A note on the equivalence of two heurist
A note on the equivalence of two heuristics to minimize total tardiness
โœ 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