Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: United States
Found
17049 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Tabu Search
1998,
Adenso-Diaz Belarmino
Network Optimization: Continuous and Discrete Models
1998,
Sherali Hanif D.
On conditions for mixtures of increasing failure rate distributions to have an increasing failure rate
1999,
Lynch J.D.
Consider a family of distributions with survival distributions that are log concave...
Effective bandwidths for Markov regenerative sources
1996,
Kulkarni Vidyadhar
In this paper we consider the multiplexing of indepdendent stochastic fluid sources...
Prox-regularization methods for generalized fractional programming
1998,
Gugat M.
If a fractional program does not have a unique solution or the feasible set is...
Relaxed cutting plane method for solving linear semi-infinite programming problems
1998,
Wu S.Y.
One of the major computational tasks of using the traditional cutting plane approach...
Capacitated selection problem
1999,
Lowe Timothy J.
Optimizing the selection of resources to accomplish a set of tasks involves evaluating...
Repairing misbehaving mathematical programming models: Concepts and a GAMS-based approach
1998,
McCarl Bruce A.
Mathematical-programming formulations can yield faulty answers. Models can be...
Introduction to Stochastic Programming
1998,
Ahmed Shabbir
Arrival and departure state distributions in the general bulk-service queue
1999,
Rosenberg Catherine
In this paper, we give an explicit relation between steady-state probability...
On the number of refusals in a busy period
1999,
Pekoz E. A.
Formulas are derived for moments of the number of refused customers in a busy period...
On the steady-state distribution of number in the queue Geom/G/1
1999,
Chaudhry M.L.
Discrete-time queues are frequently used in telecommunication networks. This paper...
Non-stationary waiting times in a closed exponential tandem queue
1996,
Stadje Wolfgang
A closed exponential tandem queue in which every customer has to be served by two...
M/G/∞ with alternating renewal breakdowns
1996,
Kella Offer
We consider an M/G/∞ queue where the service station is subject to occasional...
A numerically efficient method for the MAP/D/1/K queue via rational approximations
1996,
Akar Nail
The Markovian Arrival Process (MAP), which contains the Markov Modulated Poisson...
Distribution of spatial requirement for a MAP/G/1 queue when space and service times are dependent
1996,
Sengupta Bhaskar
In this paper, we consider a MAP/G/1 queue in which each customer arrives with a...
An M/G/1 queue with cyclic service times
1996,
Posner Morton J.M.
In this paper we consider a single server queue with Poisson arrivals and general...
On effects of arrival rate and burstiness in the queueing system: Analysis of Lb/d/1
1996,
Lee D.C.
This paper studies a single-server queueing system with deterministic service time in...
Stationary tail probabilities in exponential server tandems with renewal arrivals
1996,
Anantharam V.
The problem considered is that of estimating the tail stationary probability for two...
Higher order approximations for tandem queueing networks
1996,
Hu Jian-Qiang
In this paper a higher order approximation for single server queues and tandem...
A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
1996,
Knessl Charles
We consider two parallel M/M/1 queues which are fed by a single Poisson arrival...
A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
1999,
Pinedo Michael
We present a shifting bottleneck heuristic for minimizing the total weighted tardiness...
Ergodicity properties of rerouting strategies in queueing networks
1996,
Boel Rene
In this paper we study ergodicity properties for simple Markovian models describing...
General multiprocessor task scheduling
1999,
Lee Chung-Yee
Most papers in the scheduling field assume that a job can be processed by only one...
First Page
415
416
417
418
419
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers