Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: programming: markov decision
Found
203 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Two-parameter optimal stopping problem with switching costs
1990,
Tanaka Teruo
This paper is concerned with the optimal stopping problem for discrete time...
Optimal selection problem with three stops
1989,
Ano Katsunori
Optimal selection problems with multiple choices, like secretary, dowry or marriage...
An algorithm for quadratic zero-one programs
1990,
Bagchi Ansuman
The authors present an algorithm for the quadratic zero-one minimization by...
Forecasting replacement of transit vehicle components using Markovian process modeling
1989,
Miller Floyd G.
Vehicle maintenance in the public transportation industry is a vital concern for the...
On the maintenance of systems composed of highly reliable components
1989,
Katehakis Michael N.
The authors consider the dynamic repair allocation problem for a general...
Dynamic process improvement
1989,
Fine Charles H.
This paper explores the economics so investing in gradual process improvement, a key...
Continuous-time Markov duels: Theory and application
1989,
Barfoot C. Bernard
This article extends the previous research on Markov duels (stochastic duels between...
Dynamic programming by exchangeability
1989,
Li Shuo-Yen Robert
This article introduces the concept of exchangeable stopping time and a technique of...
Deterministic retrial times are optimal in queues with forbidden states
1989,
Kulkarni V.G.
Consider a customer X, who wishes to obtain service at a queueing system. When X...
A Markov decision process model for computer system load control
1989,
Chanson Samuel
This paper combines a queueing network representation with a Markov decision process...
Transient analysis of multiple-unit reliability systems
1989,
Sharma O.P.
A general Markovian model representing several multiple-unit redundant repairable...
First Page
7
8
9
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers