Page 1 Next

Displaying 1 – 20 of 96

Showing per page

A RED modified weighted moving average for soft real-time application

Joanna Domańska, Adam Domański, Dariusz R. Augustyn, Jerzy Klamka (2014)

International Journal of Applied Mathematics and Computer Science

The popularity of TCP/IP has resulted in an increase in usage of best-effort networks for real-time communication. Much effort has been spent to ensure quality of service for soft real-time traffic over IP networks. The Internet Engineering Task Force has proposed some architecture components, such as Active Queue Management (AQM). The paper investigates the influence of the weighted moving average on packet waiting time reduction for an AQM mechanism: the RED algorithm. The proposed method for...

An Exact Method for Solving the Multi-Processor Flow-Shop

Jacques Carlier, Emmanuel Neron (2010)

RAIRO - Operations Research

The aim of this paper is to present a new branch and bound method for solving the Multi-Processor Flow-Shop. This method is based on the relaxation of the initial problem to m-machine problems corresponding to centers. Release dates and tails are associated with operations and machines. The branching scheme consists in fixing the inputs of a critical center and the lower bounds are those of the m-machine problem. Several techniques for adjusting release dates and tails have also been introduced....

An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem

Peng Wuliang, Huang Min, Hao Yongping (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an independent...

An SMDP model for a multiclass multi-server queueing control problem considering conversion times

Zhicong Zhang, Na Li, Shuai Li, Xiaohui Yan, Jianwen Guo (2014)

RAIRO - Operations Research - Recherche Opérationnelle

We address a queueing control problem considering service times and conversion times following normal distributions. We formulate the multi-server queueing control problem by constructing a semi-Markov decision process (SMDP) model. The mechanism of state transitions is developed through mathematical derivation of the transition probabilities and transition times. We also study the property of the queueing control system and show that optimizing the objective function of the addressed queueing control...

Analysis of a MX/G(a,b)/1 queueing system with vacation interruption

M. Haridass, R. Arumuganathan (2012)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary job is interrupted abruptly and the server resumes for primary...

Analysis of a MX/G(a,b)/1 queueing system with vacation interruption

M. Haridass, R. Arumuganathan (2012)

RAIRO - Operations Research

In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary...

Aspects of Impatience in a Finite Buffer Queue

Medhi Pallabi, Amit Choudhury (2012)

RAIRO - Operations Research

In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions...

Currently displaying 1 – 20 of 96

Page 1 Next