default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. S. Sung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2010
[j16]J. S. Luo, C. S. Sung, W. S. Hsu, L. Y. Huang, Jeremy D. Russell:
Electron beam induced carbon deposition using hydrocarbon contamination for XTEM analysis. Microelectron. Reliab. 50(9-11): 1446-1450 (2010)- 2008
- [j15]Ik Sun Lee, C. S. Sung:
Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed. Eur. J. Oper. Res. 186(3): 931-952 (2008) - [j14]C. S. Sung, W. Yang:
An exact algorithm for a cross-docking supply chain network design problem. J. Oper. Res. Soc. 59(1): 119-136 (2008) - 2004
- [j13]C. S. Sung, H. C. Rim:
Receiver set partitioning and sequencing for multicasting traffic in a WDM lightwave single-hop network. J. Oper. Res. Soc. 55(6): 630-639 (2004) - 2003
- [j12]C. S. Sung, S. H. Song:
Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network. J. Oper. Res. Soc. 54(1): 72-82 (2003) - [j11]C. S. Sung, S. H. Song:
Integrated service network design for a cross-docking supply chain network. J. Oper. Res. Soc. 54(12): 1283-1295 (2003) - 2002
- [j10]C. S. Sung, Y. I. Choung, J. M. Hong, Y. H. Kim:
Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals. Comput. Oper. Res. 29(8): 995-1007 (2002) - 2001
- [j9]C. S. Sung, J. I. Min:
Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date. Eur. J. Oper. Res. 131(1): 95-106 (2001) - [j8]C. S. Sung, H. W. Jin:
Dual-based approach for a hub network design problem under non-restrictive policy. Eur. J. Oper. Res. 132(1): 88-105 (2001) - [j7]C. S. Sung, S. H. Kim:
Analysis of a multi-part spares inventory system subject to ambiguous fault isolation. J. Oper. Res. Soc. 52(4): 418-432 (2001) - 2000
- [j6]C. S. Sung, Y. I. Choung:
Minimizing makespan on a single burn-in oven in semiconductor manufacturing. Eur. J. Oper. Res. 120(3): 559-574 (2000) - [j5]C. S. Sung, Y. K. Cho:
Reliability optimization of a series system with multiple-choice and budget constraints. Eur. J. Oper. Res. 127(1): 159-171 (2000) - 1999
- [j4]C. S. Sung, J. M. Hong:
Branch-and-price algorithm for a multicast routing problem. J. Oper. Res. Soc. 50(11): 1168-1175 (1999) - 1994
- [j3]C. S. Sung, B. K. Yoo:
Parametric max flow problems in a class of networks with series-parallel structure. Comput. Oper. Res. 21(7): 769-776 (1994) - 1988
- [j2]C. S. Sung, Jai-Hyun Byun:
Technical note on a parallel-facilities production planning model with capacity constraints. Comput. Oper. Res. 15(6): 585-587 (1988) - 1987
- [j1]C. S. Sung, J. T. Rhee:
A dynamic production scheduling model with lost-sales or backlogging. Comput. Oper. Res. 14(2): 163-171 (1987)
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-05-08 01:03 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:
