default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChung-Lun Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j41]Kai Pan
, Ming Zhao, Chung-Lun Li, Feng Qiu:
A Polyhedral Study on Fuel-Constrained Unit Commitment. INFORMS J. Comput. 34(6): 3309-3324 (2022)- 2020
- [j40]Chung-Lun Li, Feng Li:
Rescheduling production and outbound deliveries when transportation service is disrupted. Eur. J. Oper. Res. 286(1): 138-148 (2020)
2010 – 2019
- 2019
- [j39]Chung-Lun Li, Nicholas G. Hall:
Work Package Sizing and Project Performance. Oper. Res. 67(1): 123-142 (2019) - [j38]Shuai Jia, Chung-Lun Li, Zhou Xu:
Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port. Transp. Sci. 53(3): 728-745 (2019) - 2016
- [j37]Chung-Lun Li, Qingying Li:
Polynomial-Time Solvability of Dynamic Lot Size Problems. Asia Pac. J. Oper. Res. 33(3): 1650018:1-1650018:20 (2016) - [j36]Nicholas G. Hall, Joseph Y.-T. Leung, Chung-Lun Li:
Multitasking via alternate and shared processing: Algorithms and complexity. Discret. Appl. Math. 208: 41-58 (2016) - [j35]Yi Ding, Shuai Jia, Tianyi Gu, Chung-Lun Li:
SGICT Builds an Optimization-Based System for Daily Berth Planning. Interfaces 46(4): 281-296 (2016) - [j34]Jinwen Ou, Xueling Zhong, Chung-Lun Li:
Faster algorithms for single machine scheduling with release dates and rejection. Inf. Process. Lett. 116(8): 503-507 (2016) - [j33]Chung-Lun Li, Kangbok Lee:
A note on scheduling jobs with equal processing times and inclusive processing set restrictions. J. Oper. Res. Soc. 67(1): 83-86 (2016) - 2015
- [j32]Chung-Lun Li, Qingying Li:
Scheduling jobs with release dates, equal processing times, and inclusive processing set restrictions. J. Oper. Res. Soc. 66(3): 516-523 (2015) - [j31]Chung-Lun Li:
Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries. Theor. Comput. Sci. 570: 30-39 (2015) - 2014
- [j30]Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi:
Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs. SIAM J. Discret. Math. 28(4): 1725-1796 (2014) - 2012
- [j29]Dongsheng Xu, Chung-Lun Li, Joseph Y.-T. Leung:
Berth allocation with time-dependent physical limitations on vessels. Eur. J. Oper. Res. 216(1): 47-56 (2012) - [j28]Dongsheng Xu, Chung-Lun Li, Q. Han:
A note on parallel-machine due-window assignment. J. Oper. Res. Soc. 63(6): 821-825 (2012) - 2010
- [j27]Chung-Lun Li, Xiuli Wang:
Scheduling parallel machines with inclusive processing set restrictions and job release times. Eur. J. Oper. Res. 200(3): 702-710 (2010)
2000 – 2009
- 2009
- [j26]Chung-Lun Li:
A new solution method for the finite-horizon discrete-time EOQ problem. Eur. J. Oper. Res. 197(1): 412-414 (2009) - [j25]Nir Halman, Chung-Lun Li, David Simchi-Levi:
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks. Oper. Res. Lett. 37(4): 239-244 (2009) - [c5]Chung-Lun Li, Sheng-Luen Chung:
Enthalpy-based automatic temperature control for automobiles. CCA/ISIC 2009: 222-227 - 2008
- [j24]Chung-Lun Li, Gur Mosheiov, Uri Yovel:
An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs. Comput. Oper. Res. 35(11): 3612-3619 (2008) - [j23]Joseph Y.-T. Leung, Chung-Lun Li:
An asymptotic approximation scheme for the concave cost bin packing problem. Eur. J. Oper. Res. 191(2): 582-586 (2008) - [j22]Chung-Lun Li:
A note on unrelated parallel machine scheduling with time-dependent processing times. J. Oper. Res. Soc. 59(12): 1696-1697 (2008) - [j21]Chung-Lun Li:
Quantifying supply chain ineffectiveness under uncoordinated pricing decisions. Oper. Res. Lett. 36(1): 83-88 (2008) - [c4]Nir Halman, Chung-Lun Li, David Simchi-Levi:
Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks. APPROX-RANDOM 2008: 91-103 - [c3]Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi:
Fully polynomial time approximation schemes for stochastic dynamic programs. SODA 2008: 700-709 - 2006
- [j20]Chung-Lun Li:
Scheduling unit-length jobs with machine eligibility restrictions. Eur. J. Oper. Res. 174(2): 1325-1328 (2006) - 2005
- [j19]Chung-Lun Li, Guohua Wan:
Improved algorithm for maximizing service of carousel storage. Comput. Oper. Res. 32: 2147-2150 (2005) - [j18]Chung-Lun Li, George L. Vairaktarakis, Chung-Yee Lee:
Machine scheduling with deliveries to multiple customer locations. Eur. J. Oper. Res. 164(1): 39-51 (2005) - 2004
- [j17]Chung-Lun Li, Vernon Ning Hsu, Wen-Qiang Xiao:
Dynamic Lot Sizing with Batch Ordering and Truckload Discounts. Oper. Res. 52(4): 639-654 (2004) - [c2]Sheng-Luen Chung, Chung-Lun Li:
Information rich enough sample paths for machine identification. SMC (2) 2004: 1619-1624 - 2003
- [c1]Sheng-Luen Chung, Chung-Lun Li, Jun-Chin Wu, Shih-Tung Wang:
Online modeling refinement for discrete event systems. SMC 2003: 2739-2744 - 2002
- [j16]Yongpei Guan, Wen-Qiang Xiao, Raymond K. Cheung, Chung-Lun Li:
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Oper. Res. Lett. 30(5): 343-350 (2002) - [j15]Raymond K. Cheung, Chung-Lun Li, Wuqin Lin:
Interblock Crane Deployment in Container Terminals. Transp. Sci. 36(1): 79-93 (2002) - 2001
- [j14]Guohua Wan, Benjamin P.-C. Yen, Chung-Lun Li:
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. Inf. Process. Lett. 79(6): 273-280 (2001)
1990 – 1999
- 1996
- [j13]Chung-Yee Lee, Chung-Lun Li:
On the Fixed Interval Due-date Scheduling Problem. Discret. Appl. Math. 68(1-2): 101-117 (1996) - [j12]T. C. E. Cheng, Zhi-Long Chen, Chung-Lun Li:
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation. Oper. Res. Lett. 19(5): 237-242 (1996) - 1995
- [j11]Chung-Lun Li, T. C. Edwin Cheng, Zhi-Long Chen:
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs. Comput. Oper. Res. 22(2): 205-219 (1995) - [j10]Chung-Lun Li:
A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs. Comput. Oper. Res. 22(3): 277-283 (1995) - 1993
- [j9]Chung-Lun Li, Zhi-Long Chen, T. C. Edwin Cheng:
A note on one-processor scheduling with asymmetric earliness and tardiness penalties. Oper. Res. Lett. 13(1): 45-48 (1993) - 1992
- [j8]Bezalel Gavish, Chung-Lun Li, David Simchi-Levi:
Analysis of heuristics for the design of tree networks. Ann. Oper. Res. 36: 77-86 (1992) - [j7]Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
The point-to-point delivery and connection problems: complexity and algorithms. Discret. Appl. Math. 36(3): 267-292 (1992) - [j6]Chung-Lun Li, David Simchi-Levi, Martin Desrochers:
On the Distance Constrained Vehicle Routing Problem. Oper. Res. 40(4): 790-799 (1992) - [j5]Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
Finding disjoint paths with different path-costs: Complexity and algorithms. Networks 22(7): 653-667 (1992) - [j4]Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Oper. Res. Lett. 11(5): 303-308 (1992) - 1990
- [j3]Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
The complexity of finding two disjoint paths with min-max objective function. Discret. Appl. Math. 26(1): 105-115 (1990) - [j2]David Eppstein, Joan Feigenbaum, Chung-Lun Li:
Equipartitions of graphs. Discret. Math. 91(3): 239-248 (1990) - [j1]Chung-Lun Li, David Simchi-Levi:
Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems. INFORMS J. Comput. 2(1): 64-73 (1990)
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 2025-01-21 00:12 CET 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:
