Displaying 141 – 160 of 190

Showing per page

Optimal QoS control of interacting service stations

Abdelkrim Haqiq, I. Lambadaris, N. Mikou, L. Orozco-Barbosa (2002)

RAIRO - Operations Research - Recherche Opérationnelle

We consider a system of three queues and two types of packets. Each packet arriving at this system finds in front of it a controller who either sends it in the first queue or rejects it according to a QoS criterion. When the packet finishes its service in the first queue, it is probabilistically routed to one of two other parallel queues. The objective is to minimize a QoS discounted cost over an infinite horizon. The cost function is composed of a waiting cost per packet in each queue and a rejection...

Optimal QoS control of interacting service stations

Abdelkrim Haqiq, I. Lambadaris, N. Mikou, L. Orozco–Barbosa (2010)

RAIRO - Operations Research

We consider a system of three queues and two types of packets. Each packet arriving at this system finds in front of it a controller who either sends it in the first queue or rejects it according to a QoS criterion. When the packet finishes its service in the first queue, it is probabilistically routed to one of two other parallel queues. The objective is to minimize a QoS discounted cost over an infinite horizon. The cost function is composed of a waiting cost per packet in each queue and a rejection...

Optimal scheduling of the 3-machine assembly-type flow shop

Mohamed Haouari, Thouraya Daouas (2010)

RAIRO - Operations Research

We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This problem is known to be NP-complete in the strong sense. We propose an exact branch and bound method based on a recursive enumeration of potential inputs and outputs of the machines. Using this algorithm, several large size instances have been solved to optimality.

Optimal transportation networks as free Dirichlet regions for the Monge-Kantorovich problem

Giuseppe Buttazzo, Eugene Stepanov (2003)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

In the paper the problem of constructing an optimal urban transportation network in a city with given densities of population and of workplaces is studied. The network is modeled by a closed connected set of assigned length, while the optimality condition consists in minimizing the Monge-Kantorovich functional representing the total transportation cost. The cost of trasporting a unit mass between two points is assumed to be proportional to the distance between them when the transportation is carried...

Optimisation de plans de financement immobiliers

Frédéric Gardi (2010)

RAIRO - Operations Research

La finance de marché est devenue un des domaines d'ap- plication privilégiés de la recherche opérationnelle. D'un autre côté, rares sont les applications touchant la banque de détail, tournée vers le grand public. Dans ce papier, nous abordons un problème d'actualité dans le secteur bancaire français : l'optimisation de plans de financement immobiliers. Le travail que nous présentons a été effectué dans le cadre du développement par la société Experian-Prologia d'une nouvelle application d'instruction...

Currently displaying 141 – 160 of 190