On a queue with correlated arrivals.
On a single-server queue with fixed accumulation level, state dependent service, and semi-Markov modulated input flow.
On a stochastic inventory model with deteriorating items.
On a Volume Flexible Production Policy in a Family Production Context
On adaptive control of mobile slotted ALOHA networks.
On adaptive replacement policies
On an asymptotic distribution connected with a loss queueing system
On an evaluation function for heuristic search as a path problem
On an queueing system.
On cycling in the simplex method of the transportation problem
This paper shows that cycling of the simplex method for the m × n transportation problem where k-1 zero basic variables are leaving and reentering the basis does not occur once it does not occur in the k × k assignment problem. A method to disprove cycling for a particular k is applied for k=2,3,4,5 and 6.
On designing connected rapid transit networks reducing the number of transfers
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum length in the rapid transit network between...
On designing connected rapid transit networks reducing the number of transfers
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum...
On -wise arc forwarding index and wavelength allocations in faulty all-optical hypercubes
Motivated by the wavelength division multiplexing in all-optical networks, we consider the problem of finding an optimal (with respect to the least possible number of wavelengths) set of internally node disjoint dipaths connecting all pairs of distinct nodes in the binary -dimensional hypercube, where . This system of dipaths constitutes a routing protocol that remains functional in the presence of up to faults (of nodes and/or links). The problem of constructing such protocols for general...
On finite capacity queueing systems with a general vacation policy.
On global maxima in multiphase queues
On heuristic optimization.
On improving a solution to the ATSP with fixed origin and precedence relationships.
Given the directed graph G1 = (N, A1) with a node origin and a penalty matrix C, the ATSP with fixed origin and precedence relationships (hereafter, ASTP-PR) consists of finding the permutation of the nodes from the set N, such that it minimizes a matrix C based function and does not violate the precedence relationships given by the set A1. In this work we present an algorithm for improving a given feasible solution to the problem, by performing a local search that uses 3- and 4-change based procedures....
On infinite dams with Markov dependent inputs
On infinite-server queues with cyclically dependent service times
On inverse queuing processes