All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 13 Next

Displaying 241 – 260 of 1558

Showing per page

Airspace sectorization with constraints

Huy Trandac, Philippe Baptiste, Vu Duong (2005)

RAIRO - Operations Research - Recherche Opérationnelle

We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework. Experimental...

Airspace sectorization with constraints

Huy Trandac, Philippe Baptiste, Vu Duong (2010)

RAIRO - Operations Research

We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework. Experimental...

Algorithm for turnpike policies in the dynamic lot size model

Stanisław Bylka (1996)

Applicationes Mathematicae

This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted that determine...

Algoritmos heurísticos deterministas y aleatorios en secuenciación de proyectos con recursos limitados.

Ramón Alvarez-Valdés Olaguíbel, José Manuel Tamarit Goerlich (1989)

Qüestiió

En este trabajo se estudia la eficiencia relativa de un conjunto de algoritmos heurísticos, deterministas y aleatorizados, para el problema de la secuenciación de proyectos con limitación de recursos. Se presentan los resultados de un extenso estudio computacional y se aplican tests no paramétricos para contrastar estadísticamente las conclusiones obtenidas.

Algunos progresos y problemas en la Ciencia de la decisión.

Sixto Ríos (1998)

Revista Matemática Complutense

The study of decision making and problem solving has attracted much attention. Since the middle of this century the notion of rational decision making was associated with expected utility maximization, albeit in a very different way than D. Bernoulli (1738) envisioned. For decisions under risk, Von Neumann and Morgenstern (1947) formulated the axioms for expected utility. For decisions under uncertainty Savage (1954) developed the axioms leading simultaneously to subjective probability and expected...

Allocating servers to facilities, when demand is elastic to travel and waiting times

Vladimir Marianov, Miguel Rios, Francisco Javier Barros (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Public inoculation centers are examples of facilities providing service to customers whose demand is elastic to travel and waiting time. That is, people will not travel too far, or stay in line for too long to obtain the service. The goal, when planning such services, is to maximize the demand they attract, by locating centers and staffing them so as to reduce customers’ travel time and time spent in queue. In the case of inoculation centers, the goal is to maximize the people that travel to the...

Allocating servers to facilities, when demand is elastic to travel and waiting times

Vladimir Marianov, Miguel Rios, Francisco Javier Barros (2006)

RAIRO - Operations Research

Public inoculation centers are examples of facilities providing service to customers whose demand is elastic to travel and waiting time. That is, people will not travel too far, or stay in line for too long to obtain the service. The goal, when planning such services, is to maximize the demand they attract, by locating centers and staffing them so as to reduce customers' travel time and time spent in queue. In the case of inoculation centers, the goal is to maximize the people that travel to the...

Almost Higher Order Stochastic Dominance

Cuizhen Niu, Xu Guo (2014)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, we develop the concept of almost stochastic dominance for higher order preferences and investigate the related properties of this concept.

Currently displaying 241 – 260 of 1558