default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShaler Stidham Jr.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j29]Anita J. Brogan
, Shaler Stidham Jr.:
Non-separation in the mean-lower-partial-moment portfolio optimization problem. Eur. J. Oper. Res. 184(2): 701-710 (2008)- 2005
- [j28]Shaler Stidham Jr.:
On the optimality of a full-service policy for a queueing system with discounted costs. Math. Methods Oper. Res. 62(3): 485-497 (2005) - 2004
- [j27]Shaler Stidham Jr.:
Pricing and congestion management in a network with heterogeneous users. IEEE Trans. Autom. Control. 49(6): 976-981 (2004) - 2002
- [j26]Shaler Stidham Jr.:
Analysis, Design, and Control of Queueing Systems. Oper. Res. 50(1): 197-216 (2002) - 2001
- [j25]Nicole Bäuerle, Shaler Stidham Jr.:
Conservation Laws for Single-Server Fluid Networks. Queueing Syst. Theory Appl. 38(2): 185-194 (2001) - 2000
- [j24]Tuell C. Green, Shaler Stidham Jr.:
Sample-path conservation laws, with applications to scheduling queues and fluid systems. Queueing Syst. Theory Appl. 36(1-3): 175-199 (2000)
1990 – 1999
- 1999
- [j23]Conrad J. Lautenbacher, Shaler Stidham Jr.:
The Underlying Markov Decision Process in the Single-Leg Airline Yield-Management Problem. Transp. Sci. 33(2): 136-146 (1999) - [j22]Janakiram Subramanian, Shaler Stidham Jr., Conrad J. Lautenbacher:
Airline Yield Management with Overbooking, Cancellations, and No-Shows. Transp. Sci. 33(2): 147-167 (1999) - 1998
- [j21]Eitan Altman, Serguei Foss, Eric Riehl, Shaler Stidham Jr.:
Performance Bounds and Pathwise Stability for Generalized Vacation and Polling Systems. Oper. Res. 46(1): 137-148 (1998) - 1997
- [j20]R. Hariharan, Magdi Sami Moustafa, Shaler Stidham Jr.:
Scheduling in a Multi-Class Series of Queues with Deterministic Service Times. Queueing Syst. Theory Appl. 24: 83-99 (1997) - 1995
- [j19]Srinivas Rajagopal, Vidyadhar G. Kulkarni, Shaler Stidham Jr.:
Optimal Flow Control of a Stochastic Fluid-Flow System. IEEE J. Sel. Areas Commun. 13(7): 1219-1228 (1995) - [j18]Shaler Stidham Jr.:
Editorial introduction. Queueing Syst. Theory Appl. 21(3-4): 239-243 (1995) - [j17]Eitan Altman, Shaler Stidham Jr.:
Optimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed information. Queueing Syst. Theory Appl. 21(3-4): 267-291 (1995) - 1993
- [j16]Muhammad El-Taha, Shaler Stidham Jr.:
Sample-path analysis of stochastic discrete-event systems. Discret. Event Dyn. Syst. 3(4): 325-346 (1993) - [j15]Shaler Stidham Jr., Muhammad El-Taha:
A note on sample-path stability conditions for input - output processes. Oper. Res. Lett. 14(1): 1-7 (1993) - [j14]Shaler Stidham Jr., Richard R. Weber:
A survey of Markov decision models for control of networks of queues. Queueing Syst. Theory Appl. 13(1-3): 291-314 (1993) - 1992
- [j13]Muhammad El-Taha, Shaler Stidham Jr.:
A filtered ASTA property. Queueing Syst. Theory Appl. 11(3): 211-222 (1992) - [j12]Muhammad El-Taha, Shaler Stidham Jr.:
Deterministic Analysis of Queueing Systems with Heterogeneous Servers. Theor. Comput. Sci. 106(2): 243-264 (1992)
1980 – 1989
- 1989
- [j11]Shaler Stidham Jr., Richard R. Weber:
Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs. Oper. Res. 37(4): 611-625 (1989) - [j10]Shaler Stidham Jr., Muhammad El-Taha:
Sample-Path Analysis of Processes with Imbedded Point Processes. Queueing Syst. Theory Appl. 5(1-3): 131-165 (1989) - 1986
- [j9]Shaler Stidham Jr.:
Clearing Systems and (s, S) Inventory Systems with Nonlinear Costs and Positive Lead Times. Oper. Res. 34(2): 276-280 (1986) - [j8]Jacob Wijngaard, Shaler Stidham Jr.:
Forward Recursion for Markov Decision Processes with Skip-Free-to-the-Right Transitions, Part I: Theory and Algorithm. Math. Oper. Res. 11(2): 295-308 (1986) - 1981
- [j7]Shaler Stidham Jr.:
On the convergence of successive approximations in dynamic programming with non-zero terminal reward. Z. Oper. Research 25(3): 57-77 (1981) - 1980
- [j6]Daniel P. Heyman, Shaler Stidham Jr.:
The Relation between Customer and Time Averages in Queues. Oper. Res. 28(4): 983-994 (1980)
1970 – 1979
- 1977
- [j5]Shaler Stidham Jr.:
Cost Models for Stochastic Clearing Systems. Oper. Res. 25(1): 100-127 (1977) - [j4]Steven A. Lippman, Shaler Stidham Jr.:
Individual versus Social Optimization in Exponential Congestion Systems. Oper. Res. 25(2): 233-247 (1977) - 1974
- [j3]Shaler Stidham Jr.:
Technical Note - A Last Word on L = λW. Oper. Res. 22(2): 417-421 (1974) - 1972
- [j2]Shaler Stidham Jr.:
L = λW: A Discounted Analogue and a New Proof. Oper. Res. 20(6): 1115-1126 (1972) - 1970
- [j1]Shaler Stidham Jr.:
On the Optimality of Single-Server Queuing Systems. Oper. Res. 18(4): 708-732 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
