ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 1 (1984), S. 23-42 
    ISSN: 1572-9338
    Keywords: Hierarchical planning problem ; stochastic programming ; heuristic ; performance measure ; probabilistic analysis ; asymptotic optimality ; machine scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract As we have argued in previous papers, multi-level decision problems can often be modeled as multi-stage stochastic programs, and hierarchical planning systems designed for their solution, when viewed as stochastic programming heuristics, can be subjected to analytical performance evaluation. The present paper gives a general formulation of such stochastic programs and provides a framework for the design and analysis of heuristics for their solution. The various ways to measure the performance of such heuristics are reviewed, and some relations between these measures are derived. Our concepts are illustrated on a simple two-level planning problem of a general nature and on a more complicated two-level scheduling problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Computing 31 (1983), S. 287-303 
    ISSN: 1436-5057
    Keywords: 68 E 05 ; Sorting ; probabilistic analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Bei dem distributiven Sortierverfahren von Dobosiewicz wird sowohl das Intervall zwischen Minimum und Median als auch das Intervall zwischen Median und Maximum inn/2 Teilintervalle gleicher Länge zerlegt; die Prozedur wird dann rekursiv in jedem, mindestens vier Zahlen enthaltenden Teilintervall angesetzt. In dieser Arbeit werden einige Aspekte des Verfahrens verfeinert und erweitert. Insbesondere wird das asymptotisch lineare Verhalten unter verschiedene Wahrscheinlichkeits-Annahmen untersucht.
    Notes: Abstract In the distributive sorting method of Dobosiewicz, both the interval between the minimum and the median of the numbers to be sorted and the interval between the median and the maximum are partitioned inton/2 subintervals of equal length; the procedure is then applied recursively on each subinterval containing more than three numbers. We refine and extend previous analyses of this method, e.g., by establishing its asymptotic linear behaviour under various probabilistic assumptions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...