default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaymond G. Vickson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j17]Raymond G. Vickson, Elkafi Hassini
, Nader Azad:
A Benders decomposition approach to product location in carousel storage systems. Ann. Oper. Res. 284(2): 623-643 (2020)
2000 – 2009
- 2006
- [j16]Raymond G. Vickson, Elkafi Hassini:
Lot streaming for quality control in two-stage batch production. Eur. J. Oper. Res. 170(3): 824-843 (2006) - 2004
- [j15]Elizabeth M. Jewkes, Chulung Lee, Raymond G. Vickson:
Product location, allocation and server home base location for an order picking line with multiple servers. Comput. Oper. Res. 31(4): 623-636 (2004) - [j14]Mohammed Fazle Baki, Raymond G. Vickson:
One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective. Optim. Methods Softw. 19(2): 165-178 (2004) - 2003
- [j13]Elkafi Hassini, Raymond G. Vickson:
A two-carousel storage location problem. Comput. Oper. Res. 30(4): 527-539 (2003)
1990 – 1999
- 1998
- [j12]R. G. Vickson, Xinjian Lu:
Optimal product and server locations in one-dimensional storage racks. Eur. J. Oper. Res. 105(1): 18-28 (1998) - [c1]R. G. Vickson, Elkafi Hassini:
Optimal inspection intervals in a two-stage manufacturing process. SMC 1998: 378-382 - 1997
- [j11]Raymond G. Vickson:
On the probability distribution of total quality under sublot inspection and process restoration. Oper. Res. Lett. 20(5): 243-247 (1997) - [j10]Zhe George Zhang, Raymond G. Vickson, Michel J. A. van Eenige:
Optimal Two-Threshold Policies in an M/G/1 Queue With Two Vacation Types. Perform. Evaluation 29(1): 63-80 (1997) - 1995
- [j9]Richard F. Hartl, Suresh P. Sethi, Raymond G. Vickson:
A Survey of the Maximum Principles for Optimal Control Problems with State Constraints. SIAM Rev. 37(2): 181-218 (1995) - 1993
- [j8]Zhe George Zhang, Raymond G. Vickson:
A simple approximation for mean waiting time in M/G/1 queue with vacations and limited service discipline. Oper. Res. Lett. 13(1): 21-26 (1993) - 1991
- [j7]Krishan Rana, R. G. Vickson:
Routing Container Ships Using Lagrangean Relaxation and Decomposition. Transp. Sci. 25(3): 201-214 (1991)
1980 – 1989
- 1988
- [j6]Krishan Rana, Raymond G. Vickson:
A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership. Transp. Sci. 22(2): 83-95 (1988) - 1987
- [j5]J. David Fuller, R. G. Vickson:
The Optimal Timing of New Plants for Oil from the Alberta Tar Sands. Oper. Res. 35(5): 704-715 (1987) - 1982
- [j4]R. G. Vickson:
Optimal Control of Production Sequences: A Continuous Parameter Analysis. Oper. Res. 30(4): 659-679 (1982) - 1980
- [j3]R. G. Vickson:
Generalized Value Bounds and Column Reduction in Finite Markov Decision Problems. Oper. Res. 28(2): 387-394 (1980) - [j2]R. G. Vickson:
Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine. Oper. Res. 28(5): 1155-1167 (1980)
1970 – 1979
- 1977
- [j1]R. G. Vickson:
Stochastic Orderings from Partially Known Utility Functions. Math. Oper. Res. 2(3): 244-252 (1977)
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-04-26 18:26 CEST 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:
