Year |
Citation |
Score |
2020 |
Lu T, Lee C, Lee L. Coordinating Pricing and Empty Container Repositioning in Two-Depot Shipping Systems Transportation Science. DOI: 10.1287/Trsc.2020.0980 |
0.347 |
|
2019 |
Qiu X, Lee C. Quantity discount pricing for rail transport in a dry port system Transportation Research Part E-Logistics and Transportation Review. 122: 563-580. DOI: 10.1016/J.Tre.2019.01.004 |
0.373 |
|
2019 |
Yang R, Lee C, Liu Q, Zheng S. A carrier–shipper contract under asymmetric information in the ocean transport industry Annals of Operations Research. 273: 377-408. DOI: 10.1007/S10479-017-2532-1 |
0.337 |
|
2018 |
Xu Z, Lee C. New Lower Bound and Exact Method for the Continuous Berth Allocation Problem Operations Research. 66: 778-798. DOI: 10.1287/Opre.2017.1687 |
0.401 |
|
2018 |
Zhang Z, Liu M, Lee C, Wang J. The Quay Crane Scheduling Problem With Stability Constraints Ieee Transactions On Automation Science and Engineering. 15: 1399-1412. DOI: 10.1109/Tase.2018.2795254 |
0.435 |
|
2018 |
Yu M, Fransoo JC, Lee C. Detention decisions for empty containers in the hinterland transportation system Transportation Research Part B-Methodological. 110: 188-208. DOI: 10.1016/J.Trb.2018.02.007 |
0.342 |
|
2017 |
Lu T, Fransoo JJ, Lee C. Carrier Portfolio Management for Shipping Seasonal Products Operations Research. 65: 1250-1266. DOI: 10.1287/Opre.2017.1616 |
0.395 |
|
2016 |
Zhang H, Lee CY, Li T. The value of specific cargo information for substitutable modes of inland transport Transportation Research Part E: Logistics and Transportation Review. 85: 23-39. DOI: 10.1016/J.Tre.2015.10.010 |
0.319 |
|
2016 |
Wang S, Meng Q, Lee CY. Liner container assignment model with transit-time-sensitive container shipment demand and its applications Transportation Research Part B: Methodological. 90: 135-155. DOI: 10.1016/J.Trb.2016.04.014 |
0.394 |
|
2015 |
Li C, Qi X, Lee C. Disruption Recovery for a Vessel in Liner Shipping Transportation Science. 49: 900-921. DOI: 10.1287/Trsc.2015.0589 |
0.42 |
|
2015 |
Lee C, Liu M, Chu C. Optimal Algorithm for the General Quay Crane Double-Cycling Problem Transportation Science. 49: 957-967. DOI: 10.1287/Trsc.2014.0563 |
0.457 |
|
2015 |
Yu M, Kim KH, Lee C. Inbound container storage pricing schemes Iie Transactions. 47: 800-818. DOI: 10.1080/0740817X.2014.999179 |
0.337 |
|
2013 |
Lee C, Li X. Economic lot sizing Operations Research Letters. 41: 670-674. DOI: 10.1016/J.Orl.2013.09.010 |
0.402 |
|
2011 |
Benjaafar S, ElHafsi M, Lee CY, Zhou W. Optimal control of an assembly system with multiple stages and multiple demand classes Operations Research. 59: 522-529. DOI: 10.1287/Opre.1100.0889 |
0.375 |
|
2009 |
Fu K, Hsu VN, Lee C. Note---Optimal Component Acquisition for a Single-Product, Single-Demand Assemble-to-Order Problem with Expediting Manufacturing & Service Operations Management. 11: 229-236. DOI: 10.1287/Msom.1070.0202 |
0.432 |
|
2009 |
Lee C, Qi X. Vehicle scheduling with combinable delivery and pickup operations Operations Research Letters. 37: 399-404. DOI: 10.1016/J.Orl.2009.06.002 |
0.414 |
|
2009 |
Zhang J, Lee C, Chen J. Inventory control problem with freight cost and stochastic demand Operations Research Letters. 37: 443-446. DOI: 10.1016/J.Orl.2009.04.009 |
0.393 |
|
2009 |
Zhou SX, Chao X, Lee CY. Optimal transportation policies for production/inventory systems with an unreliable and a reliable carrier Journal of Global Optimization. 44: 251-271. DOI: 10.1007/S10898-008-9322-X |
0.345 |
|
2007 |
Jaruphongsa W, Çetinkaya S, Lee CY. Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions Operations Research Letters. 35: 813-822. DOI: 10.1016/J.Orl.2007.02.009 |
0.334 |
|
2007 |
Lee C, Yu G. Single machine scheduling under potential disruption Operations Research Letters. 35: 541-548. DOI: 10.1016/J.Orl.2006.08.005 |
0.467 |
|
2006 |
Fu K, Hsu VN, Lee C. Inventory and Production Decisions for an Assemble-to-Order System with Uncertain Demand and Limited Assembly Capacity Operations Research. 54: 1137-1150. DOI: 10.1287/Opre.1060.0335 |
0.375 |
|
2006 |
Gribkovskaia IV, Lee C, Strusevich VA, Werra DD. Three is easy, two is hard: open shop sum-batch scheduling problem refined Operations Research Letters. 34: 459-464. DOI: 10.1016/J.Orl.2005.07.006 |
0.465 |
|
2006 |
Lee C, Leung JY, Yu G. Two Machine Scheduling under Disruptions with Transportation Considerations Journal of Scheduling. 9: 35-48. DOI: 10.1007/S10951-006-5592-7 |
0.486 |
|
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.462 |
|
2004 |
Lee C. Inventory replenishment model: lot sizing versus just-in-time delivery Operations Research Letters. 32: 581-590. DOI: 10.1016/J.Orl.2003.12.008 |
0.364 |
|
2004 |
Jaruphongsa W, Çetinkaya S, Lee CY. A two-echelon inventory optimization model with demand time window considerations Journal of Global Optimization. 30: 347-366. DOI: 10.1007/S10898-004-6092-Y |
0.422 |
|
2003 |
Lee CY, Çetinkaya S, Jaruphongsa W. A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse Operations Research. 51. DOI: 10.1287/Opre.51.5.735.16752 |
0.441 |
|
2002 |
Çetinkaya S, Lee C. Optimal outbound dispatch policies: Modeling inventory and cargo capacity Naval Research Logistics. 49: 531-556. DOI: 10.1002/Nav.10030 |
0.404 |
|
2001 |
Lee C, Çetinkaya S, Wagelmans APM. A Dynamic Lot-Sizing Model with Demand Time Windows Management Science. 47: 1384-1395. DOI: 10.1287/Mnsc.47.10.1384.10259 |
0.396 |
|
2001 |
Lee C, Lin C. Single-machine scheduling with maintenance and repair rate-modifying activities European Journal of Operational Research. 135: 493-513. DOI: 10.1016/S0377-2217(00)00322-2 |
0.424 |
|
2001 |
Lee C, Chen Z. Machine scheduling with transportation considerations Journal of Scheduling. 4: 3-24. DOI: 10.1002/1099-1425(200101/02)4:1<3::Aid-Jos57>3.0.Co;2-D |
0.425 |
|
2000 |
Çetinkaya S, Lee C. Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems Management Science. 46: 217-232. DOI: 10.1287/Mnsc.46.2.217.11923 |
0.378 |
|
2000 |
Lee C, He Y, Tang G. A note on “parallel machine scheduling with non-simultaneous machine available time” Discrete Applied Mathematics. 100: 133-135. DOI: 10.1016/S0166-218X(99)00201-2 |
0.41 |
|
1999 |
Chen J, Lee C. General Multiprocessor Task Scheduling Naval Research Logistics. 46: 57-74. DOI: 10.1002/(Sici)1520-6750(199902)46:1<57::Aid-Nav4>3.0.Co;2-H |
0.467 |
|
1997 |
Lee C, Uzsoy R, Martin-Vega LA. Letter to the Editor---Addendum to “Efficient Algorithms for Scheduling Semiconductor Burn-In Operations Operations Research. 45: 153-154. DOI: 10.1287/Opre.45.1.153 |
0.33 |
|
1997 |
Lee C. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint Operations Research Letters. 20: 129-139. DOI: 10.1016/S0167-6377(96)00041-7 |
0.481 |
|
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.49 |
|
1995 |
Vairaktarakis GL, Lee C. The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs Iie Transactions. 27: 250-256. DOI: 10.1080/07408179508936738 |
0.442 |
|
1995 |
Chen HD, Hearn DW, Lee CY. Minimizing the error bound for the dynamic lot size model Operations Research Letters. 17: 57-68. DOI: 10.1016/0167-6377(94)00063-C |
0.372 |
|
1994 |
Lee C, Vairaktarakis GL. Minimizing makespan in hybrid flowshops Operations Research Letters. 16: 149-158. DOI: 10.1016/0167-6377(94)90026-4 |
0.35 |
|
1993 |
Lee C, Cheng TCE, Lin BMT. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem Management Science. 39: 616-625. DOI: 10.1287/Mnsc.39.5.616 |
0.435 |
|
1993 |
Liman SD, Lee C. Error Bound of a Heuristic for the Common Due Date Scheduling Problem Informs Journal On Computing. 5: 420-425. DOI: 10.1287/Ijoc.5.4.420 |
0.412 |
|
1993 |
Chandru V, Lee CY, Uzsoy R. Minimizing total completion time on a batch processing machine with job families Operations Research Letters. 13: 61-65. DOI: 10.1016/0167-6377(93)90030-K |
0.428 |
|
1993 |
Lee C, Liman SD. Capacitated two-parallel machines scheduling to minimize sum of job completion times Discrete Applied Mathematics. 41: 211-222. DOI: 10.1016/0166-218X(90)90055-H |
0.476 |
|
1992 |
Lee C, Uzsoy R, Martin-Vega LA. Efficient algorithms for scheduling semiconductor burn-in operations Operations Research. 40: 764-775. DOI: 10.1287/Opre.40.4.764 |
0.438 |
|
1992 |
Lee CY, Uzsoy R. A new dynamic programming algorithm for the parallel machines total weighted completion time problem Operations Research Letters. 11: 73-75. DOI: 10.1016/0167-6377(92)90035-2 |
0.415 |
|
1992 |
Lee CY, Liman SD. Single machine flow-time scheduling with scheduled maintenance Acta Informatica. 29: 375-382. DOI: 10.1007/Bf01178778 |
0.403 |
|
1991 |
Lee C, Danusaputro SL, Lin C. Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date Computers & Operations Research. 18: 379-389. DOI: 10.1016/0305-0548(91)90098-C |
0.412 |
|
1991 |
Lee CY. Parallel machines scheduling with nonsimultaneous machine available time Discrete Applied Mathematics. 30: 53-61. DOI: 10.1016/0166-218X(91)90013-M |
0.452 |
|
1991 |
Denardo EV, Lee C. Error bound for the dynamic lot size model with backlogging Annals of Operations Research. 28: 213-228. DOI: 10.1007/Bf02055582 |
0.301 |
|
1990 |
Danusaputro S, Lee C, Martin-Vega LA. An efficient algorithm for drilling printed circuit boards Computers & Industrial Engineering. 18: 145-151. DOI: 10.1016/0360-8352(90)90025-H |
0.333 |
|
1989 |
Hwang J, Chow Y, Anger FD, Lee C. Scheduling precedence graphs in systems with interprocessor communication times Siam Journal On Computing. 18: 244-257. DOI: 10.1137/0218016 |
0.35 |
|
1988 |
Lee C, Hwang J, Chow Y, Anger FD. Multiprocessor scheduling with interprocessor communication delays Operations Research Letters. 7: 141-147. DOI: 10.1016/0167-6377(88)90080-6 |
0.336 |
|
1986 |
Lee C, Denardo EV. Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model Mathematics of Operations Research. 11: 423-432. DOI: 10.1287/Moor.11.3.423 |
0.331 |
|
Show low-probability matches. |