![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
James C. Bean
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j20]Shubin Xu, James C. Bean:
Scheduling parallel-machine batch operations to maximize on-time delivery performance. J. Sched. 19(5): 583-600 (2016)
2000 – 2009
- 2009
- [j19]Jeffrey W. Ohlmann, James C. Bean:
Resource-constrained management of heterogeneous assets with stochastic deterioration. Eur. J. Oper. Res. 199(1): 198-208 (2009) - 2007
- [c1]Shubin Xu, James C. Bean:
A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines. CISched 2007: 143-150 - 2004
- [j18]Zong-Zhi Lin, James C. Bean, Chelsea C. White III:
A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes. INFORMS J. Comput. 16(1): 27-38 (2004) - [j17]Jeffrey W. Ohlmann, James C. Bean, Shane G. Henderson:
Convergence in Probability of Compressed Annealing. Math. Oper. Res. 29(4): 837-860 (2004)
1990 – 1999
- 1997
- [j16]Atidel Ben Hadj-Alouane
, James C. Bean:
A Genetic Algorithm for the Multiple-Choice Integer Program. Oper. Res. 45(1): 92-101 (1997) - 1994
- [j15]James C. Bean:
Genetic Algorithms and Random Keys for Sequencing and Optimization. INFORMS J. Comput. 6(2): 154-160 (1994) - 1993
- [j14]James C. Bean, Robert L. Smith:
Conditions for the discovery of solution horizons. Math. Program. 59: 215-229 (1993) - 1992
- [j13]James C. Bean, Wallace J. Hopp, Izak Duenyas:
A Stopping Rule for Forecasting Horizons in Nonhomogeneous Markov Decision Processes. Oper. Res. 40(6): 1188-1199 (1992) - [j12]Sarah M. Ryan, James C. Bean, Robert L. Smith:
A Tie-Breaking Rule for Discrete Infinite Horizon Optimization. Oper. Res. 40(Supplement-1): S117-S126 (1992) - [j11]James C. Bean, Julia L. Higle, Robert L. Smith:
Capacity Expansion Under Stochastic Demands. Oper. Res. 40(Supplement-2): S210-S216 (1992) - [j10]H. Edwin Romeijn, Robert L. Smith, James C. Bean:
Duality in infinite dimensional linear programming. Math. Program. 53: 79-97 (1992) - 1991
- [j9]James C. Bean, John R. Birge
, John Mittenthal, Charles E. Noon:
Matchup Scheduling with Multiple Resources, Release Dates and Disruptions. Oper. Res. 39(3): 470-483 (1991) - [j8]Charles E. Noon, James C. Bean:
A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem. Oper. Res. 39(4): 623-632 (1991) - 1990
- [j7]Julia L. Higle, James C. Bean, Robert L. Smith:
Deterministic Equivalence in Stochastic Infinite Horizon Problems. Math. Oper. Res. 15(3): 396-407 (1990)
1980 – 1989
- 1989
- [j6]Sarah M. Ryan
, James C. Bean:
Degeneracy in infinite horizon optimization. Math. Program. 43(1-3): 305-316 (1989) - 1987
- [j5]James C. Bean, John R. Birge
, Robert L. Smith:
Aggregation in Dynamic Programming. Oper. Res. 35(2): 215-220 (1987) - [j4]Wallace J. Hopp, James C. Bean, Robert L. Smith:
A New Optimality Criterion for Nonhomogeneous Markov Decision Processes. Oper. Res. 35(6): 875-883 (1987) - 1985
- [j3]James C. Bean, Margaret H. Bean:
An integer programming approach to reference staff scheduling. Inf. Process. Manag. 21(5): 459-464 (1985) - 1984
- [j2]James C. Bean:
Technical Note - A Langrangian Algorithm for the Multiple Choice Integer Program. Oper. Res. 32(5): 1185-1193 (1984) - [j1]James C. Bean, Robert L. Smith:
Conditions for the Existence of Planning Horizons. Math. Oper. Res. 9(3): 391-401 (1984)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint