default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJihong Ou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j15]Ding Ding, Jihong Ou, James Ang:
Analysis of ticket queues with reneging customers. J. Oper. Res. Soc. 66(2): 231-246 (2015)
2000 – 2009
- 2009
- [j14]Liuxin Chen, Youyi Feng, Jihong Ou:
Coordinating Batch Production and Pricing of a Make-to-Stock Product. IEEE Trans. Autom. Control. 54(7): 1674-1680 (2009) - 2008
- [j13]Xiaohong Zhang, Jihong Ou, Stephen M. Gilbert:
Coordination of stocking decisions in an assemble-to-order environment. Eur. J. Oper. Res. 189(2): 540-558 (2008) - [j12]Youyi Feng, Jihong Ou, Zhan Pang:
Optimal control of price and production in an assemble-to-order system. Oper. Res. Lett. 36(4): 506-512 (2008) - 2007
- [j11]Susan H. Xu, Long Gao
, Jihong Ou:
Service Performance Analysis and Improvement for a Ticket Queue with Balking Customers. Manag. Sci. 53(6): 971-990 (2007) - 2006
- [j10]Mahmut Parlar, Moosa Sharafali, Jihong Ou:
Optimal parking of idle elevators under myopic and state-dependent policies. Eur. J. Oper. Res. 170(3): 863-886 (2006) - [j9]Jihong Ou, Mahmut Parlar, Moosa Sharafali:
A differentiated service scheme to optimize website revenues. J. Oper. Res. Soc. 57(11): 1323-1340 (2006) - [j8]Liuxin Chen, Youyi Feng, Jihong Ou:
Joint management of finished goods inventory and demand process for a make-to-stock product: a computational approach. IEEE Trans. Autom. Control. 51(2): 258-273 (2006) - 2005
- [j7]Heng-Qing Ye, Jihong Ou, Xue-Ming Yuan:
Stability of Data Networks: Stationary and Bursty Models. Oper. Res. 53(1): 107-125 (2005) - [c2]Antonin Descampe, Jihong Ou, Philippe Chevalier, Benoît Macq:
Data prefetching for smooth navigation of large scale JPEG 2000 images. ICME 2005: 908-911 - 2004
- [j6]Christopher S. Tang, Kumar Rajaram, Aydin Alptekinoglu, Jihong Ou:
The Benefits of Advance Booking Discount Programs: Model and Analysis. Manag. Sci. 50(4): 465-478 (2004) - 2003
- [j5]Jihong Ou, B. Madhu Rao:
Benefits of providing amenities to impatient waiting customers. Comput. Oper. Res. 30(14): 2211-2225 (2003) - [j4]Wei-Shi Lim, Jihong Ou, Chung-Piaw Teo:
Inventory Cost Effect of Consolidating Several One-Warehouse Multiretailer Systems. Oper. Res. 51(4): 668-672 (2003) - 2001
- [j3]Kim-Lin Chew, Johnny Pang, Qizhang Liu, Jihong Ou, Chung-Piaw Teo:
An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT. Ann. Oper. Res. 108(1-4): 111-122 (2001)
1990 – 1999
- 1998
- [c1]Chung-Piaw Teo, Jihong Ou, Kok-Choon Tan:
Multi-Item Inventory Staggering Problems: Heuristic and Bounds. SODA 1998: 584-593 - 1996
- [j2]Jihong Ou, Lawrence M. Wein:
Sequential Screening in Semiconductor Manufacturing, II: Exploiting Lot-to-Lot Variability. Oper. Res. 44(1): 196-205 (1996) - 1992
- [j1]Jihong Ou, Lawrence M. Wein:
On the improvement from scheduling a two-station queueing network in heavy traffic. Oper. Res. Lett. 11(4): 225-232 (1992)
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 23:08 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:
