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

An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems

โœ Scribed by V. A. Mikhailyuk

Book ID
118797396
Publisher
Springer US
Year
2012
Tongue
English
Weight
99 KB
Volume
48
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Probabilistic analysis of an asymptotica
Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
โœ C.T. Ng; X. Cai; T.C.E. Cheng ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 135 KB ๐Ÿ‘ 2 views

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima