#### Filter Results:

- Full text PDF available (24)

#### Publication Year

2008

2018

- This year (1)
- Last 5 years (21)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Yoni Nazarathy, Gideon Weiss
- Annals OR
- 2009

We propose a method for the control of multi-class queueing networks over a finite time horizon. We approximate the multi-class queueing network by a fluid network and formulate a fluid optimizationâ€¦ (More)

- Yoni Nazarathy
- 2016

- Anat Kopzon, Yoni Nazarathy, Gideon Weiss
- Queueing Syst.
- 2009

We consider a two-node multiclass queueing network with two types of jobs moving through two servers in opposite directions, and there is infinite supply of work of both types. We assume exponentialâ€¦ (More)

We consider the asymptotic variance of the departure counting processD(t) of the GI/G/1 queue;D(t) denotes the number of departures up to time t. We focus on the case that the system load % equals 1,â€¦ (More)

- Yoni Nazarathy, Gideon Weiss
- Queueing Syst.
- 2008

We analyze the output process of finite capacity birth-death Markovian queues. We develop a formula for the asymptotic variance rate of the form Î»âˆ— + âˆ‘ vi where Î» âˆ— is the rate of outputs and vi areâ€¦ (More)

- Gerard Hoekstra, Robert D. van der Mei, Yoni Nazarathy, Bert Zwart
- NET-COOP
- 2009

The fundamental limits on channel capacity form a barrier to the sustained growth on the use of wireless networks. To cope with this, multi-path communication solutions provide a promising means toâ€¦ (More)

- Yoni Nazarathy, Thomas Taimre, Azam Asanjarani, Julia Kuhn, Brendan Patch, Aapeli Vuorinen
- 2015 5th Australian Control Conference (AUCC)
- 2015

We address the problem of stabilizing control for complex queueing systems where servers follow unobservable Markovian environments. The controller needs to assign servers to queues without fullâ€¦ (More)

- Yoni Nazarathy, Gideon Weiss
- J. Scheduling
- 2010

We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large volume job shops itâ€¦ (More)

We consider a simple discrete time controlled queueing system, where the controller has a choice of which server to use at each time slot and server performance varies according to a Markov modulatedâ€¦ (More)

- Yoni Nazarathy, Gideon Weiss
- VALUETOOLS
- 2008

We consider a push pull queueing network with two servers and two types of jobs which are processed by the two servers in opposite order, with stochastic generally distributed processing times. Thisâ€¦ (More)