| Year |
Citation |
Score |
| 2020 |
Li C, Li F. Rescheduling production and outbound deliveries when transportation service is disrupted European Journal of Operational Research. 286: 138-148. DOI: 10.1016/J.Ejor.2020.03.033 |
0.402 |
|
| 2018 |
Xu X, Li C, Xu Z. Integrated train timetabling and locomotive assignment Transportation Research Part B-Methodological. 117: 573-593. DOI: 10.1016/J.Trb.2018.09.015 |
0.371 |
|
| 2016 |
Ding Y, Jia S, Gu T, Li CL. SGICT builds an optimization-based system for daily berth planning Interfaces. 46: 281-296. DOI: 10.1287/Inte.2016.0848 |
0.347 |
|
| 2016 |
Li C, Li Q. Polynomial-Time Solvability of Dynamic Lot Size Problems Asia-Pacific Journal of Operational Research. 33: 1-20. DOI: 10.1142/S0217595916500184 |
0.412 |
|
| 2016 |
Li Q, Guo P, Li C, Song JJ. Equilibrium Joining Strategies and Optimal Control of a Make-to-Stock Queue Production and Operations Management. 25: 1513-1527. DOI: 10.1111/Poms.12565 |
0.37 |
|
| 2016 |
Li CL, Lee K. A note on scheduling jobs with equal processing times and inclusive processing set restrictions Journal of the Operational Research Society. 67: 83-86. DOI: 10.1057/Jors.2015.56 |
0.455 |
|
| 2016 |
Leung JY-, Li C. Scheduling with processing set restrictions: A literature update International Journal of Production Economics. 175: 1-11. DOI: 10.1016/J.Ijpe.2014.09.038 |
0.351 |
|
| 2016 |
Hall NG, Leung JYT, Li CL. Multitasking via alternate and shared processing: Algorithms and complexity Discrete Applied Mathematics. 208: 41-58. DOI: 10.1016/J.Dam.2016.03.018 |
0.462 |
|
| 2015 |
Hall NG, Leung JYT, Li CL. The Effects of Multitasking on Operations Scheduling Production and Operations Management. 24: 1248-1265. DOI: 10.1111/Poms.12331 |
0.518 |
|
| 2015 |
Matta RED, Hsu VN, Li C. Coordinated production and delivery for an exporter Iie Transactions. 47: 373-391. DOI: 10.1080/0740817X.2014.928961 |
0.344 |
|
| 2015 |
Li C, Li Q. Scheduling Jobs with Release Dates, Equal Processing Times, and Inclusive Processing Set Restrictions Journal of the Operational Research Society. 66: 516-523. DOI: 10.1057/Jors.2014.22 |
0.456 |
|
| 2015 |
Li C. Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries Theoretical Computer Science. 570: 30-39. DOI: 10.1016/J.Tcs.2014.12.021 |
0.512 |
|
| 2015 |
Ou J, Zhong X, Li CL. Faster algorithms for single machine scheduling with release dates and rejection Information Processing Letters. DOI: 10.1016/J.Ipl.2016.02.008 |
0.442 |
|
| 2012 |
Xu D, Li C, Han Q. A note on parallel-machine due-window assignment Journal of the Operational Research Society. 63: 821-825. DOI: 10.1057/Jors.2011.75 |
0.489 |
|
| 2012 |
Xu D, Li C, Leung JY-. Berth allocation with time-dependent physical limitations on vessels European Journal of Operational Research. 216: 47-56. DOI: 10.1016/J.Ejor.2011.07.012 |
0.484 |
|
| 2012 |
Li C, Ou J, Hsu VN. Dynamic lot sizing with all‐units discount and resales Naval Research Logistics. 59: 230-243. DOI: 10.1002/Nav.21484 |
0.415 |
|
| 2011 |
Pang KW, Xu Z, Li CL. Ship routing problem with berthing time clash avoidance constraints International Journal of Production Economics. 131: 752-762. DOI: 10.1016/J.Ijpe.2011.03.013 |
0.465 |
|
| 2011 |
Kellerer H, Leung JY-, Li C. Multiple subset sum with inclusive assignment set restrictions Naval Research Logistics. 58: 546-563. DOI: 10.1002/Nav.20466 |
0.38 |
|
| 2010 |
Ou J, Hsu VN, Li C. Scheduling Truck Arrivals at an Air Cargo Terminal Production and Operations Management. 19: 83-97. DOI: 10.1111/J.1937-5956.2009.01068.X |
0.453 |
|
| 2010 |
Li C, Wang X. Scheduling parallel machines with inclusive processing set restrictions and job release times European Journal of Operational Research. 200: 702-710. DOI: 10.1016/J.Ejor.2009.02.011 |
0.465 |
|
| 2010 |
Xu Z, Xu L, Li C. Approximation results for min‐max path cover problems in vehicle routing Naval Research Logistics. 57: 728-748. DOI: 10.1002/Nav.20434 |
0.43 |
|
| 2009 |
Li C, Erlebacher SJ, Kropp DH. Investment In Setup Cost, Lead Time, And Demand Predictability Improvement In The Eoq Model Production and Operations Management. 6: 341-351. DOI: 10.1111/J.1937-5956.1997.Tb00478.X |
0.352 |
|
| 2009 |
Li C, Cheng TCE. An Economic Production Quantity Model With Learning And Forgetting Considerations Production and Operations Management. 3: 118-132. DOI: 10.1111/J.1937-5956.1994.Tb00114.X |
0.353 |
|
| 2009 |
Halman N, Li CL, Simchi-Levi D. Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks Operations Research Letters. 37: 239-244. DOI: 10.1016/J.Orl.2009.03.002 |
0.427 |
|
| 2009 |
Li C. A new solution method for the finite-horizon discrete-time EOQ problem European Journal of Operational Research. 197: 412-414. DOI: 10.1016/J.Ejor.2008.06.007 |
0.399 |
|
| 2008 |
Halman N, Klabjan D, Li CL, Orlin J, Simchi-Levi D. Fully Polynomial Time Approximation Schemes for stochastic dynamic programs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 700-709. DOI: 10.1137/130925153 |
0.39 |
|
| 2008 |
Chen Z, Li C. Scheduling with subcontracting options Iie Transactions. 40: 1171-1184. DOI: 10.1080/07408170801975057 |
0.443 |
|
| 2008 |
Li C. A note on unrelated parallel machine scheduling with time-dependent processing times Journal of the Operational Research Society. 59: 1696-1697. DOI: 10.1057/Palgrave.Jors.2602648 |
0.403 |
|
| 2008 |
Leung JY-, Li C. Scheduling with processing set restrictions: A survey International Journal of Production Economics. 116: 251-262. DOI: 10.1016/J.Ijpe.2008.09.003 |
0.489 |
|
| 2008 |
Cheung BK-, Choy KL, Li C, Shi W, Tang J. Dynamic Routing Model and Solution Methods for Fleet Management with Mobile Technologies International Journal of Production Economics. 113: 694-705. DOI: 10.1016/J.Ijpe.2007.10.018 |
0.361 |
|
| 2008 |
Leung JY-, Li C. An asymptotic approximation scheme for the concave cost bin packing problem European Journal of Operational Research. 191: 582-586. DOI: 10.1016/J.Ejor.2007.08.031 |
0.418 |
|
| 2008 |
Li C, Mosheiov G, Yovel U. Technical Note: An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs Computers & Operations Research. 35: 3612-3619. DOI: 10.1016/J.Cor.2007.03.006 |
0.462 |
|
| 2008 |
Ou J, Leung JY-, Li C. Scheduling parallel machines with inclusive processing set restrictions Naval Research Logistics. 55: 328-338. DOI: 10.1002/Nav.20286 |
0.489 |
|
| 2007 |
Li CL, Ou J. Coordinated scheduling of customer orders with decentralized machine locations Iie Transactions (Institute of Industrial Engineers). 39: 899-909. DOI: 10.1080/07408170600972990 |
0.48 |
|
| 2007 |
Li C, Vairaktarakis G. Coordinating Production and Distribution of Jobs with Bundling Operations Iie Transactions. 39: 203-215. DOI: 10.1080/07408170600735561 |
0.445 |
|
| 2006 |
Li C. Scheduling unit-length jobs with machine eligibility restrictions European Journal of Operational Research. 174: 1325-1328. DOI: 10.1016/J.Ejor.2005.03.023 |
0.481 |
|
| 2006 |
Li C, Chen Z. Bin‐packing problem with concave costs of bin utilization Naval Research Logistics. 53: 298-308. DOI: 10.1002/Nav.20142 |
0.426 |
|
| 2005 |
Hsu VN, Li C, Xiao W. Dynamic lot size problems with one-way product substitution Iie Transactions. 37: 201-215. DOI: 10.1080/07408170590899607 |
0.395 |
|
| 2005 |
Li C, Vairaktarakis GL, Lee C. Machine scheduling with deliveries to multiple customer locations European Journal of Operational Research. 164: 39-51. DOI: 10.1016/J.Ejor.2003.11.022 |
0.499 |
|
| 2005 |
Li C, Wan G. Improved algorithm for maximizing service of carousel storage Computers & Operations Research. 32: 2147-2150. DOI: 10.1016/J.Cor.2004.02.005 |
0.383 |
|
| 2005 |
Li C, Ou J. Machine scheduling with pickup and delivery Naval Research Logistics. 52: 617-630. DOI: 10.1002/Nav.20101 |
0.498 |
|
| 2004 |
Li C, Hsu VN, Xiao W. Dynamic Lot Sizing with Batch Ordering and Truckload Discounts Operations Research. 52: 639-654. DOI: 10.1287/Opre.1040.0121 |
0.424 |
|
| 2004 |
Caglar D, Li CL, Simchi-Levi D. Two-echelon spare parts inventory system subject to a service constraint Iie Transactions (Institute of Industrial Engineers). 36: 655-666. DOI: 10.1080/07408170490278265 |
0.409 |
|
| 2004 |
Li C, Vairaktarakis GL. Loading and unloading operations in container terminals Iie Transactions. 36: 287-297. DOI: 10.1080/07408170490247340 |
0.422 |
|
| 2004 |
Li C, Xiao W. Lot streaming with supplier–manufacturer coordination Naval Research Logistics. 51: 522-542. DOI: 10.1002/Nav.20013 |
0.371 |
|
| 2003 |
Liu J, Li C, Chan C. Mixed truck delivery systems with both hub-and-spoke and direct shipment Transportation Research Part E-Logistics and Transportation Review. 39: 325-339. DOI: 10.1016/S1366-5545(03)00005-X |
0.322 |
|
| 2002 |
Cheung RK, Li C, Lin W. Interblock Crane Deployment in Container Terminals Transportation Science. 36: 79-93. DOI: 10.1287/Trsc.36.1.79.568 |
0.425 |
|
| 2002 |
Xiao W, Li C. Approximation algorithms for common due date assignment and job scheduling on parallel machines Iie Transactions. 34: 467-477. DOI: 10.1023/A:1013567219570 |
0.507 |
|
| 2002 |
Guan Y, Xiao W, Cheung RK, Li C. A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis Operations Research Letters. 30: 343-350. DOI: 10.1016/S0167-6377(02)00147-5 |
0.499 |
|
| 2001 |
Wan G, Yen BP-, Li C. Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard Information Processing Letters. 79: 273-280. DOI: 10.1016/S0020-0190(01)00143-0 |
0.445 |
|
| 2001 |
Bish EK, Leong TY, Li CL, Ng JWC, Simchi-Levi D. Analysis of a new vehicle scheduling and location problem Naval Research Logistics. 48: 363-385. DOI: 10.1002/Nav.1024 |
0.472 |
|
| 1999 |
Li C, Kouvelis P. Flexible and Risk-Sharing Supply Contracts Under Price Uncertainty Management Science. 45: 1378-1398. DOI: 10.1287/Mnsc.45.10.1378 |
0.314 |
|
| 1999 |
Li C, Cheng TCE. Due-date determination with resequencing Iie Transactions. 31: 183-188. DOI: 10.1080/07408179908969817 |
0.45 |
|
| 1998 |
Li C, Cai X, Lee CY. Scheduling with multiple-job-on-one-processor pattern Iie Transactions. 30: 433-445. DOI: 10.1080/07408179808966484 |
0.506 |
|
| 1998 |
Cai X, Lee CY, Li C. Minimizing total completion time in two‐processor task systems with prespecified processor allocations Naval Research Logistics. 45: 231-242. DOI: 10.1002/(Sici)1520-6750(199803)45:2<231::Aid-Nav7>3.0.Co;2-9 |
0.452 |
|
| 1998 |
Cheng TCE, Chen Z, Li C, Lin BM-. Scheduling to minimize the total compression and late costs Naval Research Logistics. 45: 67-82. DOI: 10.1002/(Sici)1520-6750(199802)45:1<67::Aid-Nav4>3.0.Co;2-J |
0.518 |
|
| 1997 |
Eynan A, Li C. Lot-splitting decisions and learning effects Iie Transactions. 29: 139-146. DOI: 10.1023/A:1018554725338 |
0.381 |
|
| 1997 |
Li C, Lee CY. Scheduling with agreeable release times and due dates on a batch processing machine European Journal of Operational Research. 96: 564-569. DOI: 10.1016/0377-2217(95)00332-0 |
0.492 |
|
| 1996 |
Cheng TCE, Chen ZL, Li C. Parallel-machine scheduling with controllable processing times Iie Transactions. 28: 177-180. DOI: 10.1080/07408179608966263 |
0.483 |
|
| 1996 |
Cheng TCE, Chen ZL, Li C. Single-machine scheduling with trade-off between number of tardy jobs and resource allocation Operations Research Letters. 19: 237-242. DOI: 10.1016/S0167-6377(96)00035-1 |
0.482 |
|
| 1996 |
Lee C, Li C. On the fixed interval due-date scheduling problem Discrete Applied Mathematics. 68: 101-117. DOI: 10.1016/0166-218X(95)00049-W |
0.553 |
|
| 1995 |
Li C. Scheduling to minimize the total resource consumption with a constraint on the sum of completion times European Journal of Operational Research. 80: 381-388. DOI: 10.1016/0377-2217(93)E0255-V |
0.506 |
|
| 1995 |
Li C, Cheng TCE, Chen Z-. Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs Computers & Operations Research. 22: 205-219. DOI: 10.1016/0305-0548(94)E0012-V |
0.521 |
|
| 1995 |
Li C. A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs Computers & Operations Research. 22: 277-283. DOI: 10.1016/0305-0548(94)00027-6 |
0.485 |
|
| 1995 |
Li C, Sewell EC, Cheng TCE. Scheduling to minimize release-time resource consumption and tardiness penalties Naval Research Logistics. 42: 949-966. DOI: 10.1002/1520-6750(199509)42:6<949::Aid-Nav3220420607>3.0.Co;2-3 |
0.506 |
|
| 1994 |
Li C. Scheduling with resource-dependent release dates: a comparison of two different resource consumption functions Naval Research Logistics. 41: 807-819. DOI: 10.1002/1520-6750(199410)41:6<807::Aid-Nav3220410609>3.0.Co;2-8 |
0.456 |
|
| 1994 |
Li C, Cheng TCE. The parallel machine min-max weighted absolute lateness scheduling problem Naval Research Logistics. 41: 33-46. DOI: 10.1002/1520-6750(199402)41:1<33::Aid-Nav3220410104>3.0.Co;2-S |
0.498 |
|
| 1993 |
Bramel J, Li C, Simchi-Levi D. Probabilistic analysis of a vehicle routing problem with time windows American Journal of Mathematical and Management Sciences. 13: 267-322. DOI: 10.1080/01966324.1993.10737360 |
0.415 |
|
| 1993 |
Li C, Chen ZL, Cheng TCE. A note on one-processor scheduling with asymmetric earliness and tardiness penalties Operations Research Letters. 13: 45-48. DOI: 10.1016/0167-6377(93)90084-T |
0.497 |
|
| 1992 |
Li C, Simchi-Levi D, Desrochers M. On the Distance Constrained Vehicle Routing Problem Operations Research. 40: 790-799. DOI: 10.1287/Opre.40.4.790 |
0.377 |
|
| 1992 |
Li CL, McCormick ST, Simchi-Levi D. On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems Operations Research Letters. 11: 303-308. DOI: 10.1016/0167-6377(92)90007-P |
0.363 |
|
| 1992 |
Li CL, McCormick ST, Simchi-Levi D. The point-to-point delivery and connection problems: complexity and algorithms Discrete Applied Mathematics. 36: 267-292. DOI: 10.1016/0166-218X(92)90258-C |
0.392 |
|
| 1992 |
Gavish B, Li CL, Simchi-Levi D. Analysis of heuristics for the design of tree networks Annals of Operations Research. 36: 77-86. DOI: 10.1007/Bf02094324 |
0.372 |
|
| 1992 |
Li C, McCormick ST, Simchi-Levi D. Finding disjoint paths with different path-costs : complexity and algorithms Networks. 22: 653-667. DOI: 10.1002/Net.3230220705 |
0.406 |
|
| 1990 |
Li C, Simchi-Levi D. Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems Informs Journal On Computing. 2: 64-73. DOI: 10.1287/Ijoc.2.1.64 |
0.421 |
|
| 1990 |
Li CL, McCormick ST, Simchi-Levi D. The complexity of finding two disjoint paths with min-max objective function Discrete Applied Mathematics. 26: 105-115. DOI: 10.1016/0166-218X(90)90024-7 |
0.396 |
|
| Show low-probability matches. |