ANOR
2002
13 years 11 months ago
2002
We present a review of methods for increasing discrimination between efficient DMUs in Data Envelopment Analysis. These methods were classified into two groups: those that incorpor...
ANOR
2002
13 years 11 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
ANOR
2002
13 years 11 months ago
2002
The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set of crew members such that a set of activities is partitioned and the costs for that assignmen...
ANOR
2002
13 years 11 months ago
2002
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
ANOR
2002
13 years 11 months ago
2002
This article is devoted to adverse selection problems in which individual private information is a whole utility function and cannot be reduced to some finite-dimensional parameter...
ANOR
2002
13 years 11 months ago
2002
Queueing networks are studied with finite capacities for clusters of stations, rather than for individual stations. First, an instructive tandem cluster example is studied to show...
ANOR
2002
13 years 11 months ago
2002
A subgame perfection refinement of Nash equilibrium is suggested for games of the following type: each of an infinite number of identical players selects an action using his privat...
ANOR
2002
13 years 11 months ago
2002
ANOR
2002
13 years 11 months ago
2002
This paper provides the asymptotic analysis of the loss probability in the GI/M/1/n queueing system as n increases to infinity. The approach of this paper is alternative to that of...
ANOR
2002
13 years 11 months ago
2002
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...