![](https://dblp.uni-trier.de./img/logo.320x120.png)
![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
Yu-Sheng Zheng
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
2000 – 2009
- 2005
- [j16]Noel Watson, Yu-Sheng Zheng:
Decentralized Serial Supply Chains Subject to Order Delays and Information Distortion: Exploiting Real-Time Sales Data. Manuf. Serv. Oper. Manag. 7(2): 152-168 (2005) - 2004
- [j15]Teck-Hua Ho, Yu-Sheng Zheng:
Setting Customer Expectation in Service Delivery: An Integrated Marketing-Operations Perspective. Manag. Sci. 50(4): 479-488 (2004) - 2001
- [j14]Fangruo Chen, Awi Federgruen, Yu-Sheng Zheng:
Near-Optimal Pricing and Replenishment Strategies for a Retail/Distribution System. Oper. Res. 49(6): 839-853 (2001) - [j13]Marshall L. Fisher, Kamalini Ramdas
, Yu-Sheng Zheng:
Ending Inventory Valuation in Multiperiod Production Scheduling. Manag. Sci. 47(5): 679-692 (2001) - [j12]Fangruo Chen, Awi Federgruen, Yu-Sheng Zheng:
Coordination Mechanisms for a Distribution System with One Supplier and Multiple Retailers. Manag. Sci. 47(5): 693-708 (2001) - [j11]Wen Zhao, Yu-Sheng Zheng:
A Dynamic Model for Airline Seat Allocation with Passenger Diversion and No-Shows. Transp. Sci. 35(1): 80-98 (2001)
1990 – 1999
- 1999
- [j10]Morris A. Cohen, Yu-Sheng Zheng, Yunzeng Wang:
Identifying Opportunities for Improving Teradyne's Service-Parts Logistics System. Interfaces 29(4): 1-18 (1999) - 1998
- [j9]Fangruo Chen, Yu-Sheng Zheng:
Near-Optimal Echelon-Stock (R, nQ) Policies in Multistage Serial Systems. Oper. Res. 46(4): 592-602 (1998) - 1997
- [j8]Fangruo Chen, Yu-Sheng Zheng:
One-Warehouse Multiretailer Systems with Centralized Stock Information. Oper. Res. 45(2): 275-287 (1997) - [j7]Fangruo Chen, Yu-Sheng Zheng:
Sensitivity analysis of an (s, S) inventory model. Oper. Res. Lett. 21(1): 19-23 (1997) - 1992
- [j6]Yu-Sheng Zheng, Awi Federgruen:
Corrections to "Finding Optimal (s, S) Policies is About as Simple as Evaluating a Single Policy". Oper. Res. 40(1): 192 (1992) - [j5]Awi Federgruen, Yu-Sheng Zheng:
The Joint Replenishment Problem with General Joint Cost Structures. Oper. Res. 40(2): 384-403 (1992) - [j4]Awi Federgruen, Yu-Sheng Zheng:
An Efficient Algorithm for Computing an Optimal (r, Q) Policy in Continuous Review Stochastic Inventory Systems. Oper. Res. 40(4): 808-813 (1992) - [j3]Fangruo Chen, Yu-Sheng Zheng:
Waiting time distribution in (T, S) inventory systems. Oper. Res. Lett. 12(3): 145-151 (1992) - 1991
- [j2]Yu-Sheng Zheng, Awi Federgruen:
Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy. Oper. Res. 39(4): 654-665 (1991) - 1990
- [j1]Yu-Sheng Zheng, Paul H. Zipkin:
A Queueing Model to Analyze the Value of Centralized Inventory Information. Oper. Res. 38(2): 296-307 (1990)
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 2025-01-09 13:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint