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

An improved minimizing algorithm for the sum of disjoint products with the inversion of a single variable

โœ Scribed by H.H. Liu; W.T. Yang; C.C. Liu

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
593 KB
Volume
33
Category
Article
ISSN
0026-2714

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Polynomial time algorithms for minimizin
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
โœ Philippe Baptiste ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer US ๐ŸŒ English โš– 102 KB ๐Ÿ‘ 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t