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

Probabilistic analysis of the minimum weighted flowtime scheduling problem

โœ Scribed by Alberto Marchetti Spaccamela; Wan Soo Rhee; Leen Stougie; Sara van de Geer

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
295 KB
Volume
11
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the asymptotic probabilistic analysis
On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints
โœ Giulia Galbiati ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 719 KB

In this paper we address a hierarchical scheduling problem for n jobs to be processed on a suitable number of parallel machines: the jobs require random amounts of processing time, no job splitting is allowed, and random precedence constraints between the jobs are present. We present two stochastic

A note on the single-machine scheduling
A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
โœ Suresh Chand; Hans Schneeberger ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th

A new probabilistic analysis of Karger's
A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems
โœ Yang Dai; Kazuo Iwano; Naoki Katoh ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 556 KB

Recently Karger proposed a new randomized algorithm for finding a minimum cut of an n-vertex graph (weighted or unweighted) with probability fi (a-'). In this paper we present a new probabilistic analysis of Karger's randomized algorithm for a few classes of unweighted graphs. For random graphs whos