default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMing-Jong Yao
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]Chang Liu, Zhen Li, Jiafu Tang
, Xuequn Wang, Ming-Jong Yao:
How SERU production system improves manufacturing flexibility and firm performance: an empirical study in China. Ann. Oper. Res. 316(1): 529-554 (2022)- 2021
- [j14]Ming-Jong Yao, Jen-Yen Lin, Chieh Lee, Po-Hung Wang:
Optimal replenishment and inventory financing strategy in a three-echelon supply chain under the variable demand and default risk. J. Oper. Res. Soc. 72(10): 2196-2210 (2021) - 2020
- [j13]Jen-Yen Lin, Ming-Jong Yao:
The joint replenishment problem with trade credits. J. Glob. Optim. 76(2): 347-382 (2020)
2010 – 2019
- 2017
- [j12]Ming-Jong Yao, Jia-Yen Huang:
Optimal lot-sizing and joint replenishment strategy under a piecewise linear warehousing cost structure. J. Intell. Manuf. 28(3): 791-803 (2017) - 2014
- [j11]Ming-Jong Yao, Jia-Yen Huang:
Scheduling of transportation fleet maintenance service by an improved Lipschitz optimization algorithm. Optim. Methods Softw. 29(3): 592-609 (2014)
2000 – 2009
- 2008
- [j10]Jia-Yen Huang, Ming-Jong Yao:
On the coordination of maintenance scheduling for transportation fleets of many branches of a logistic service provider. Comput. Math. Appl. 56(5): 1303-1313 (2008) - [j9]Ming-Jong Yao, Weng-Ming Chu, Yen-Fei Lin:
Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule. Comput. Oper. Res. 35(10): 3230-3242 (2008) - 2007
- [j8]Ming-Jong Yao, Weng-Ming Chu:
A new approximation algorithm for obtaining the probability distribution function for project completion time. Comput. Math. Appl. 54(2): 282-295 (2007) - 2006
- [j7]Jia-Yen Huang, Ming-Jong Yao:
A new algorithm for optimally determining lot-sizing policies for a deteriorating item in an integrated production-inventory system. Comput. Math. Appl. 51(1): 83-104 (2006) - [j6]Ming-Jong Yao, Yu-Chun Wang:
A new algorithm for one-warehouse multi-retailer systems under stationary nested policy. Optim. Methods Softw. 21(1): 41-56 (2006) - 2005
- [j5]Ming-Jong Yao:
The Economic Lot Scheduling Problem without Capacity Constraints. Ann. Oper. Res. 133(1-4): 193-205 (2005) - 2004
- [j4]Ming-Jong Yao, Chuang-Chun Chiou:
On a replenishment coordination model in an integrated supply chain with one vendor and multiple buyers. Eur. J. Oper. Res. 159(2): 406-419 (2004) - 2003
- [j3]Fang-Chuan Lee, Ming-Jong Yao:
A global optimum search algorithm for the joint replenishment problem under power-of-two policy. Comput. Oper. Res. 30(9): 1319-1333 (2003) - 2001
- [j2]Ming-Jong Yao:
The peak load minimization problem in cyclic production. Comput. Oper. Res. 28(14): 1441-1460 (2001) - [j1]Salah E. Elmaghraby, Hanijanto Soewandi, Ming-Jong Yao:
Chance-constrained programming in activity networks: A critical evaluation. Eur. J. Oper. Res. 131(2): 440-458 (2001)
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:20 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:
