default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaw-Sheng Chern
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j25]Maw-Sheng Chern, Ya-Lan Chan, Jinn-Tsair Teng, Suresh Kumar Goyal:
Nash equilibrium solution in a vendor-buyer supply chain model with permissible delay in payments. Comput. Ind. Eng. 70: 116-123 (2014)- 2012
- [j24]Jinn-Tsair Teng, Chun-Tao Chang, Maw-Sheng Chern:
Vendor-buyer inventory models with trade credit financing under both non-cooperative and integrated environments. Int. J. Syst. Sci. 43(11): 2050-2061 (2012)
2000 – 2009
- 2008
- [j23]Dar-Li Yang
, Wen-Hung Kuo, Maw-Sheng Chern:
Multi-family scheduling in a two-machine reentrant flow shop with setups. Eur. J. Oper. Res. 187(3): 1160-1170 (2008) - [j22]Maw-Sheng Chern, Hui-Ling Yang, Jinn-Tsair Teng, Sotirios Papachristos:
Partial backlogging inventory lot-size models for deteriorating items with fluctuating demand under inflation. Eur. J. Oper. Res. 191(1): 127-141 (2008) - 2007
- [j21]Jinn-Tsair Teng, Chun-Tao Chang, Maw-Sheng Chern, Ya-Lan Chan:
Retailer's optimal ordering policies with trade credit financing. Int. J. Syst. Sci. 38(3): 269-278 (2007) - 2006
- [j20]Rong-Hong Jan, Ching-Peng Lin, Maw-Sheng Chern:
An optimization model for Web content adaptation. Comput. Networks 50(7): 953-965 (2006) - 2005
- [j19]Maw-Sheng Chern, Ya-Lan Chan, Jinn-Tsair Teng:
A Comparison among Various inventory shortage Models for deteriorating items on the Basis of Maximizing Profit. Asia Pac. J. Oper. Res. 22(1): 121-134 (2005) - [j18]Jinn-Tsair Teng, Maw-Sheng Chern, Ya-Lan Chan:
Deterministic inventory lot-size models with shortages for fluctuating demand and unit purchase cost. Int. Trans. Oper. Res. 12(1): 83-100 (2005) - 2002
- [j17]Hui-Ling Yang, Jinn-Tsair Teng, Maw-Sheng Chern:
A forward recursive algorithm for inventory lot-size models with power-form demand and shortages. Eur. J. Oper. Res. 137(2): 394-400 (2002) - 2001
- [j16]Jinn-Tsair Teng, Maw-Sheng Chern, Ki-Hee Kim:
Entry strategies for multinational enterprises and host countries. Eur. J. Oper. Res. 133(1): 62-68 (2001) - 2000
- [j15]Dar-Li Yang, Maw-Sheng Chern:
Two-machine flowshop group scheduling problem. Comput. Oper. Res. 27(10): 975-985 (2000)
1990 – 1999
- 1999
- [j14]Jinn-Tsair Teng, Maw-Sheng Chern, Hui-Ling Yang, Yuchung J. Wang:
Deterministic lot-size inventory models with shortages and deterioration for fluctuating demand. Oper. Res. Lett. 24(1-2): 65-72 (1999) - 1994
- [j13]Kao-Chêng Lin, Maw-Sheng Chern:
The single most vital arc in the most economical path problem - A parametric analysis. Comput. Oper. Res. 21(3): 353-358 (1994) - 1993
- [j12]Kao-Chêng Lin, Maw-Sheng Chern:
The Most Vital Edges in the Minimum Spanning Tree Problem. Inf. Process. Lett. 45(1): 25-31 (1993) - [j11]Jyun-Jy Hu, Shi-Nine Yang, Maw-Sheng Chern:
A unidirectional ring partition problem. Networks 23(4): 299-308 (1993) - 1992
- [j10]Gen-Huey Chen, Maw-Sheng Chern:
A Pipelined Algorithm for Multiple-Choice 0/1 Knapsack Problem. Int. J. High Speed Comput. 4(1): 43-48 (1992) - [j9]Maw-Sheng Chern:
On the computational complexity of reliability redundancy allocation in a series system. Oper. Res. Lett. 11(5): 309-315 (1992) - 1991
- [j8]Lih-Hsing Hsu, Rong-Hong Jan, Yu-Che Lee, Chun-Nan Hung, Maw-Sheng Chern:
Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs. Inf. Process. Lett. 39(5): 277-281 (1991) - [j7]Gen-Huey Chen, Maw-Sheng Chern:
Synthesis of algorithms on processor arrays. Parallel Comput. 17(2-3): 279-284 (1991) - [j6]Wen-Hsien Tsai, Maw-Sheng Chern, Tsong-Ming Lin:
Technical Note - An Algorithm for Determining Whether m Given Demand Points Are on a Hemisphere or Not. Transp. Sci. 25(1): 91-97 (1991) - 1990
- [j5]Gen-Huey Chen, Maw-Sheng Chern, Jin Hwang Jang:
Pipeline architectures for dynamic programming algorithms. Parallel Comput. 13(1): 111-117 (1990) - [c3]Jyun-Jy Hu, Shi-Nine Yang, Maw-Sheng Chern, Cheng-Ming Weng:
An Efficient Distributed Selection Algorithm for General Tree Networks. ICPP (3) 1990: 348-349
1980 – 1989
- 1989
- [j4]Maw-Sheng Chern, Gen-Huey Chen, Pangfeng Liu:
An LC Branch-and-Branch Algorithm for the Module Assignment Problem. Inf. Process. Lett. 32(2): 61-71 (1989) - 1988
- [c2]G. H. Chen, Maw-Sheng Chern:
Designing parallel algorithms from forests and multistage graphs. COMPSAC 1988: 292-298 - 1987
- [j3]Gen-Huey Chen, Maw-Sheng Chern, Richard C. T. Lee:
A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems. BIT 27(2): 141-147 (1987) - [c1]Gen-Huey Chen, Maw-Sheng Chern:
Designing Parallel Algorithms from Regular Graphs and Semi-Regular Graphs. ICPP 1987: 363-366 - 1986
- [j2]Gen-Huey Chen, Maw-Sheng Chern:
Parallel Generation of Permutations and Conbinations. BIT 26(3): 277-283 (1986) - 1984
- [j1]Michael J. Magazine, Maw-Sheng Chern:
A Note on Approximation Schemes for Multidimensional Knapsack Problems. Math. Oper. Res. 9(2): 244-247 (1984)
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:46 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:
