| 2008 |
|---|
| 17 | EE | 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 |
| 16 | EE | 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 |
| 15 | EE | Chung-Lun Li,
Gur Mosheiov,
Uri Yovel:
An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs.
Computers & OR 35(11): 3612-3619 (2008) |
| 14 | EE | Joseph Y.-T. Leung,
Chung-Lun Li:
An asymptotic approximation scheme for the concave cost bin packing problem.
European Journal of Operational Research 191(2): 582-586 (2008) |
| 13 | EE | Chung-Lun Li:
Quantifying supply chain ineffectiveness under uncoordinated pricing decisions.
Oper. Res. Lett. 36(1): 83-88 (2008) |
| 2006 |
|---|
| 12 | EE | Chung-Lun Li:
Scheduling unit-length jobs with machine eligibility restrictions.
European Journal of Operational Research 174(2): 1325-1328 (2006) |
| 2005 |
|---|
| 11 | EE | Chung-Lun Li,
Guohua Wan:
Improved algorithm for maximizing service of carousel storage.
Computers & OR 32: 2147-2150 (2005) |
| 10 | EE | Chung-Lun Li,
George Vairaktarakis,
Chung-Yee Lee:
Machine scheduling with deliveries to multiple customer locations.
European Journal of Operational Research 164(1): 39-51 (2005) |
| 2004 |
|---|
| 9 | EE | Sheng-Luen Chung,
Chung-Lun Li:
Information rich enough sample paths for machine identification.
SMC (2) 2004: 1619-1624 |
| 2002 |
|---|
| 8 | EE | 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) |
| 2001 |
|---|
| 7 | EE | 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) |
| 1996 |
|---|
| 6 | EE | Chung-Yee Lee,
Chung-Lun Li:
On the Fixed Interval Due-date Scheduling Problem.
Discrete Applied Mathematics 68(1-2): 101-117 (1996) |
| 1995 |
|---|
| 5 | EE | Chung-Lun Li,
T. C. Edwin Cheng,
Zhi-Long Chen:
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs.
Computers & OR 22(2): 205-219 (1995) |
| 4 | EE | Chung-Lun Li:
A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs.
Computers & OR 22(3): 277-283 (1995) |
| 1992 |
|---|
| 3 | EE | Chung-Lun Li,
S. Thomas McCormick,
David Simchi-Levi:
The point-to-point delivery and connection problems: complexity and algorithms.
Discrete Applied Mathematics 36(3): 267-292 (1992) |
| 1990 |
|---|
| 2 | EE | Chung-Lun Li,
S. Thomas McCormick,
David Simchi-Levi:
The complexity of finding two disjoint paths with min-max objective function.
Discrete Applied Mathematics 26(1): 105-115 (1990) |
| 1 | EE | David Eppstein,
Joan Feigenbaum,
Chung-Lun Li:
Equipartitions of graphs.
Discrete Mathematics 91(3): 239-248 (1990) |
