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
Lumpability and time reversibility in the aggregation-disaggregation method for large Markov chains
1989,
Sumita Ushio
The aggregation-disaggregation algorithm of Takahashi is a rank-reduction method for...
Optimal acquisition of automated flexible manufacturing processes
1989,
Monahan George E.
The authors formulate the problem of converting a labor-intensive batch production...
A resource allocation problem in a random environment
1989,
Righter Rhonda
We consider a resource allocation problem in which various parameters of the model...
Identifying forecast horizons in nonhomogeneous Markov decision processes
1989,
Hopp Wallace J.
A procedure for identifying forecast horizons in nonhomogeneous Markov decision...
An approach to postoptimality and sensitivity analysis of zero-one goal programs
1988,
Wilson George R.
In this article the authors present a methodology for postoptimality and sensitivity...
A hard knapsack problem
1988,
Hung Ming S.
In this article the authors develop a class of general knapsack problems which are...
Probabilistic analysis of the multidimensional knapsack problem
1989,
Dyer M.E.
The authors analyse the multi-constraint zero-one knapsack problem, under the...
Boundary behavior of interior point algorithms in linear programming
1989,
Megiddo Nimrod
This paper studies the boundary behavior of some interior point algorithms fo linear...
Coercion functions and decentralized linear programming
1989,
Feinberg Brion
This paper describes a decentralized linear programming solution procedure. Unlike the...
Variance-penalized Markov decision processes
1989,
Filar Jerzy A.
The authors consider a Markov decision process with both the expected limiting...
Dual algorithms for pure network problems
1989,
Padman Rema
This paper reports the development of a new algorithmic implementation of the dual...
A strongly polynomial algorithm for minimum cost submodular flow problems
1989,
Fujishige Satoru
The only known strongly polynomial algorithm for solving minimum cost submodular flow...
Optimal block replacement policies with multiple choice at failure
1988,
Kadi Daoud Ait
In this article the authors consider block replacement policies where the operating...
Checking policy for deteriorating multistate systems
1988,
Karpinski Janusz
In this article a multistate system under some checking policy is considered. The...
Second-order properties of the throughput of a closed queueing network
1988,
Shanthikumar J. George
The authors show that the throughput of a single-class closed queueing network (CQN)...
Ordinary CLT and WLLN versions of L=λW
1988,
Glynn Peter W.
The familiar queueing principle expressed by the formula L = λW (Little’s...
An LIL version of L=λW
1988,
Glynn Peter W.
This paper establishes a law-of-the-iterated-logarithm (LIL) version of the...
A light-traffic approximation for single-class departure processes from multi-class queues
1988,
Whitt Ward
This paper discusses an approximation for single-class departure processes from...
Minimizing the sum of weighted completion times of n-independent jobs when resource availability varies over time: Performance of a simple priority rule
1988,
Surkis Julius
In this article the objective is to evaluate the performance of a WSPT (weighted...
A cyclic service tandem queueing model with parallel queues in the first stage
1988,
Katayama Tsuyoshi
This paper presents an analysis for the steady state of a two-stage tandem queueing...
Scheduling tasks with sequence-dependent processing times
1988,
Bianco Lucio
In this article the authors consider the problem of minimizing the maximum completion...
A fluid reservoir regulated by a birth-death process
1988,
Doorn E.A. van
This paper is concerned with a reservoir which receives and releases fluid flows at...
A recent survey of production scheduling
1988,
Rodammer Frederick A.
Recent advances in the theory and practice of production scheduling cut across...
The busy period of the M/G/1 vacation model with a Bernoulli schedule
1988,
Ramaswamy Ravi
The server busy period for the M / G /1 vacation model with a Bernoulli schedule is...
First Page
704
705
706
707
708
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers