The recurrent event process of a success preceded by a failure and its application.
The reliability of an element with alternating failure rate
The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up
This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves.
The single server queue and the storage model: large deviations and fixed points.
The single server queue with Erlang input and semi-Markov service times
The stationary G/G/ queue.
The stationary G/G/ queue with non-identical servers.
The stationary local sojourn time in single server tandem queues with renewal input.
The theory of networks of single server queues and the tandem queue model.
The transient M/G/1/0 queue: Some bounds and approximations for light traffic with application to reliability.
The Truncated Hyper-Poisson Queues: With Balking, Reneging and General Bulk Service Rule
The variance location problem on a network with continuously distributed demand
The Variance Location Problem on a Network with Continuously distributed demand
Most location problems on networks consider discrete nodal demand. However, for many problems, demands are better represented by continuous functions along the edges, in addition to nodal demands. Several papers consider the optimal location problem of one or more facilities when demands are continuously distributed along the network, and the objective function dealt with is the median one. Nevertheless, in location of public services it is desirable to use an equity criterion. One of the latter...
The vehicle routing problem
The weighted Fermat triangle problem.
The weighted minimax location problem with set-up costs and extensions
Three different operations research models for the same policy.
Three Dimensional Fixed Charge Bi-Criterion Indefinite Quadratic Transportation Problem
Three tabu search methods for the MI-FAP applied to 802.11 networks
Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...
Three tabu search methods for the MI-FAP applied to 802.11 networks
Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...