Displaying similar documents to “Approximating the solution of a dynamic, stochastic multiple knapsack problem”

On modelling planning under uncertainty in manufacturing.

A. Alonso-Ayuso, L. F. Escudero, M.T. Ortuño (2007)

SORT

Similarity:

We present a modelling framework for two-stage and multi-stage mixed 0-1 problems under uncertainty for strategic Supply Chain Management, tactical production planning and operations assignment and scheduling. A scenario tree based scheme is used to represent the uncertainty. We present the Deterministic Equivalent Model of the stochastic mixed 0-1 programs with complete recourse that we study. The constraints are modelled by compact and splitting variable representations via scenarios. ...

Algorithmic Background of the Host Recommendation in the Adaptive Distributed Multimedia Server

Szkaliczki, Tibor, Goldschmidt, Balázs, Böszörmenyi, Laszlo (2007)

Serdica Journal of Computing

Similarity:

Partial support of the Hungarian State Eötvös Scholarship, the Hungarian National Science Fund (Grant No. OTKA 42559 and 42706) and the Mobile Innovation Center, Hungary is gratefully acknowledged. In a distributed server architecture an obvious question is where to deploy the components. Host recommendation, which gives the answer, faces problems such as server selection, host deployment and, in case of multimedia servers, video replication. It is especially relevant for the...