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

On Splitting of a Recursive Set with Polynomial Time Minimal Pairs

โœ Scribed by Chen Zhixiang

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
562 KB
Volume
35
Category
Article
ISSN
0044-3050

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

Lower bounds and algorithms for flowtime
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
โœ Simon Dunstall; Andrew Wirth; Kenneth Baker ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer US ๐ŸŒ English โš– 165 KB ๐Ÿ‘ 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this

On the Polynomials of A. O. Gelfond Havi
On the Polynomials of A. O. Gelfond Having Minimal Deviation from Zero together with Their Derivatives
โœ Francisco Luquin ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 508 KB

Abatrrct. Some results of A.O. GELFOND concerning monk polynomials of least deviation (uniform) from zero together with their derivatives are extended to certain L,nonm and to several variables. Aa M application we extend a recent mult of X l A o ~l N 0 HUNG to functions f E C(")([-l, 11) which rati