Chung-Lun Li - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 48 from 48

2020

Rescheduling production and outbound deliveries when transportation service is disruptedChung-Lun Li, Feng Li. eor, 286(1):138-148, 2020. [doi]

2019

Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container PortShuai Jia, Chung-Lun Li, Zhou Xu 0001. transci, 53(3):728-745, 2019. [doi]

Work Package Sizing and Project PerformanceChung-Lun Li, Nicholas G. Hall. ior, 67(1):123-142, 2019. [doi]

2016

2015

Improved algorithms for single-machine common due window assignment and scheduling with batch deliveriesChung-Lun Li. TCS, 570:30-39, 2015. [doi]

Scheduling jobs with release dates, equal processing times, and inclusive processing set restrictionsChung-Lun Li, Qingying Li. jors, 66(3):516-523, 2015. [doi]

2014

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic ProgramsNir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi. siamdm, 28(4):1725-1796, 2014. [doi]

2012

Berth allocation with time-dependent physical limitations on vesselsDongsheng Xu, Chung-Lun Li, Joseph Y.-T. Leung. eor, 216(1):47-56, 2012. [doi]

A note on parallel-machine due-window assignmentDongsheng Xu, Chung-Lun Li, Q. Han. jors, 63(6):821-825, 2012. [doi]

2010

Scheduling parallel machines with inclusive processing set restrictions and job release timesChung-Lun Li, Xiuli Wang. eor, 200(3):702-710, 2010. [doi]

2009

2008

Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project NetworksNir Halman, Chung-Lun Li, David Simchi-Levi. approx 2008: 91-103 [doi]

Fully polynomial time approximation schemes for stochastic dynamic programsNir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi. soda 2008: 700-709 [doi]

An asymptotic approximation scheme for the concave cost bin packing problemJoseph Y.-T. Leung, Chung-Lun Li. eor, 191(2):582-586, 2008. [doi]

Quantifying supply chain ineffectiveness under uncoordinated pricing decisionsChung-Lun Li. orl, 36(1):83-88, 2008. [doi]

A note on unrelated parallel machine scheduling with time-dependent processing timesChung-Lun Li. jors, 59(12):1696-1697, 2008. [doi]

An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobsChung-Lun Li, Gur Mosheiov, Uri Yovel. cor, 35(11):3612-3619, 2008. [doi]

2006

Scheduling unit-length jobs with machine eligibility restrictionsChung-Lun Li. eor, 174(2):1325-1328, 2006. [doi]

2005

Machine scheduling with deliveries to multiple customer locationsChung-Lun Li, George Vairaktarakis, Chung-Yee Lee. eor, 164(1):39-51, 2005. [doi]

Improved algorithm for maximizing service of carousel storageChung-Lun Li, Guohua Wan. cor, 32:2147-2150, 2005. [doi]

2004

Information rich enough sample paths for machine identificationSheng-Luen Chung, Chung-Lun Li. SMC 2004: 1619-1624 [doi]

Dynamic Lot Sizing with Batch Ordering and Truckload DiscountsChung-Lun Li, Vernon Ning Hsu, Wen-Qiang Xiao. ior, 52(4):639-654, 2004. [doi]

2003

Online modeling refinement for discrete event systemsSheng-Luen Chung, Chung-Lun Li, Jun-Chin Wu, Shih-Tung Wang. SMC 2003: 2739-2744 [doi]

2002

Interblock Crane Deployment in Container TerminalsRaymond K. Cheung, Chung-Lun Li, Wuqin Lin. transci, 36(1):79-93, 2002. [doi]

A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysisYongpei Guan, Wen-Qiang Xiao, Raymond K. Cheung, Chung-Lun Li. orl, 30(5):343-350, 2002. [doi]

2001

A feature-based approach to injection mould cooling system designChung-Lun Li. cad, 33(14):1073-1090, 2001. [doi]

Single machine scheduling to minimize total compression plus weighted flow cost is NP-hardGuohua Wan, Benjamin P.-C. Yen, Chung-Lun Li. ipl, 79(6):273-280, 2001. [doi]

1999

A configuration space approach to the automatic design of multiple-state mechanical devicesChung-Lun Li, K. W. Chan, Sooi-Thor Tan. cad, 31(10):621-653, 1999. [doi]

1996

Single-machine scheduling with trade-off between number of tardy jobs and resource allocationT. C. E. Cheng, Zhi-Long Chen, Chung-Lun Li. orl, 19(5):237-242, 1996. [doi]

On the Fixed Interval Due-date Scheduling ProblemChung-Yee Lee, Chung-Lun Li. DAM, 68(1-2):101-117, 1996. [doi]

1995

A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobsChung-Lun Li. cor, 22(3):277-283, 1995. [doi]

Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobsChung-Lun Li, T. C. Edwin Cheng, Zhi-Long Chen. cor, 22(2):205-219, 1995. [doi]

1993

A note on one-processor scheduling with asymmetric earliness and tardiness penaltiesChung-Lun Li, Zhi-Long Chen, T. C. Edwin Cheng. orl, 13(1):45-48, 1993. [doi]

1992

1990

Equipartitions of graphsDavid Eppstein, Joan Feigenbaum, Chung-Lun Li. DM, 91(3):239-248, 1990. [doi]

Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing ProblemsChung-Lun Li, David Simchi-Levi. informs, 2(1):64-73, 1990. [doi]

The complexity of finding two disjoint paths with min-max objective functionChung-Lun Li, S. Thomas McCormick, David Simchi-Levi. DAM, 26(1):105-115, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL