default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert H. Storer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j15]Miao Bai
, Robert H. Storer, Gregory L. Tonkay:
Surgery Sequencing Coordination with Recovery Resource Constraints. INFORMS J. Comput. 34(2): 1207-1223 (2022)- 2009
- [j14]Clara Novoa, Robert H. Storer:
An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 196(2): 509-515 (2009) - [j13]João P. M. Gonçalves, Robert H. Storer, Jacek Gondzio:
A family of linear programming algorithms based on an algorithm by von Neumann. Optim. Methods Softw. 24(3): 461-478 (2009) - 2005
- [j12]Ross J. W. James, Robert H. Storer:
Techniques for solving subset sum problems within a given tolerance. Int. Trans. Oper. Res. 12(4): 437-453 (2005) - 2004
- [j11]Wonjoon Choi, Robert H. Storer:
Heuristic algorithms for a turbine-blade-balancing problem. Comput. Oper. Res. 31(8): 1245-1258 (2004) - 2001
- [j10]Kedar S. Naphade, S. David Wu, Robert H. Storer, Bhavin J. Doshi:
Melt Scheduling to Trade Off Material Waste and Shipping Performance. Oper. Res. 49(5): 629-645 (2001) - 1999
- [j9]S. David Wu, Eui-Seok Byeon, Robert H. Storer:
A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness. Oper. Res. 47(1): 113-124 (1999) - [j8]Andreas T. Ernst, Mohan Krishnamoorthy, Robert H. Storer:
Heuristic and exact algorithms for scheduling aircraft landings. Networks 34(3): 229-241 (1999) - 1998
- [j7]Eui-Seok Byeon, S. David Wu, Robert H. Storer:
Decomposition heuristics for robust job-shop scheduling. IEEE Trans. Robotics Autom. 14(2): 303-313 (1998) - 1997
- [j6]Kedar S. Naphade, S. David Wu, Robert H. Storer:
Problem space search algorithms for resource-constrained project scheduling. Ann. Oper. Res. 70: 307-326 (1997) - 1996
- [j5]Robert H. Storer, Seth W. Flanders, S. David Wu:
Problem space local search for number partitioning. Ann. Oper. Res. 63(4): 463-487 (1996) - 1995
- [j4]Robert H. Storer, S. David Wu, Renzo Vaccari:
Problem and Heuristic Space Search Strategies for Job Shop Scheduling. INFORMS J. Comput. 7(4): 453-467 (1995) - [j3]Muhammad K. Dhodhi, Imtiaz Ahmad, Robert H. Storer:
SHEMUS: synthesis of heterogeneous multiprocessor systems. Microprocess. Microsystems 19(6): 311-319 (1995) - [j2]Muhammad K. Dhodhi, Frank H. Hielscher, Robert H. Storer, Jayaram Bhasker:
Datapath synthesis using a problem-space genetic algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(8): 934-944 (1995) - 1993
- [j1]S. David Wu, Robert H. Storer, Pei-Chann Chang:
One-machine rescheduling heuristics with efficiency and stability as criteria. Comput. Oper. Res. 20(1): 1-14 (1993)
Conference and Workshop Papers
- 1988
- [c1]Robert H. Storer, James J. Swain, Sekhar Venkatraman, James R. Wilson:
Comparison methods for fitting data using Johnson translation distributions. WSC 1988: 476-481
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-24 22:51 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:
