Year |
Citation |
Score |
2020 |
Jiang X, Lee K, Pinedo ML. Ideal schedules in parallel machine settings European Journal of Operational Research. DOI: 10.1016/J.Ejor.2020.08.010 |
0.538 |
|
2020 |
Hong J, Lee K, Pinedo ML. Scheduling equal length jobs with eligibility restrictions Annals of Operations Research. 285: 295-314. DOI: 10.1007/S10479-019-03172-8 |
0.548 |
|
2019 |
Zheng F, Pinedo ML, Lee K, Liu M, Xu Y. Towards robustness of response times: minimising the maximum inter-completion time on parallel machines International Journal of Production Research. 57: 182-199. DOI: 10.1080/00207543.2018.1466063 |
0.444 |
|
2019 |
Lee K, Zheng F, Pinedo ML. Online scheduling of ordered flow shops European Journal of Operational Research. 272: 50-60. DOI: 10.1016/J.Ejor.2018.06.008 |
0.422 |
|
2017 |
Chopra S, Filipecki B, Lee K, Ryu M, Shim S, Vyve MV. An extended formulation of the convex recoloring problem on a tree Mathematical Programming. 165: 529-548. DOI: 10.1007/S10107-016-1094-3 |
0.341 |
|
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.477 |
|
2016 |
He C, Leung JY-, Lee K, Pinedo ML. An improved binary search algorithm for the Multiple-Choice Knapsack Problem Rairo-Operations Research. 50: 995-1001. DOI: 10.1051/Ro/2015061 |
0.412 |
|
2016 |
Chopra S, Lee K, Ryu M, Shim S. Separation Algorithm for Tree Partitioning Inequalities Electronic Notes in Discrete Mathematics. 52: 109-116. DOI: 10.1016/J.Endm.2016.03.015 |
0.38 |
|
2016 |
Lei L, Lee K, Dong H. A heuristic for emergency operations scheduling with lead times and tardiness penalties European Journal of Operational Research. 250: 726-736. DOI: 10.1016/J.Ejor.2015.10.005 |
0.473 |
|
2016 |
He C, Leung JY-, Lee K, Pinedo ML. Scheduling a single machine with parallel batching to minimize makespan and total rejection cost Discrete Applied Mathematics. 204: 150-163. DOI: 10.1016/J.Dam.2015.10.021 |
0.534 |
|
2016 |
He C, Leung JYT, Lee K, Pinedo ML. Improved algorithms for single machine scheduling with release dates and rejections 4or. 1-15. DOI: 10.1007/S10288-016-0303-5 |
0.45 |
|
2015 |
Wang G, Lei L, Lee K. Supply chain scheduling with receiving deadlines and non-linear penalty Journal of the Operational Research Society. 66: 380-391. DOI: 10.1057/Jors.2014.2 |
0.424 |
|
2014 |
Lee K, Leung JY-, Pinedo ML. Two dimensional load balancing Operations Research Letters. 42: 539-544. DOI: 10.1016/J.Orl.2014.09.006 |
0.521 |
|
2014 |
Lee K, Hwang H, Lim K. Semi-online scheduling with GoS eligibility constraints International Journal of Production Economics. 153: 204-214. DOI: 10.1016/J.Ijpe.2014.03.001 |
0.522 |
|
2014 |
Lee K, Leung JYT, Jia ZH, Li W, Pinedo ML, Lin BMT. Fast approximation algorithms for bi-criteria scheduling with machine assignment costs European Journal of Operational Research. 238: 54-64. DOI: 10.1016/J.Ejor.2014.03.026 |
0.527 |
|
2013 |
Lee K, Lei L, Pinedo M, Wang S. Operations scheduling with multiple resources and transportation considerations International Journal of Production Research. 51: 7071-7090. DOI: 10.1080/00207543.2013.781283 |
0.351 |
|
2013 |
Lee K, Lim K. Semi-online scheduling problems on a small number of machines Journal of Scheduling. 16: 461-477. DOI: 10.1007/S10951-013-0329-X |
0.549 |
|
2013 |
Choi B, Lee K. Two-stage proportionate flexible flow shop to minimize the makespan Journal of Combinatorial Optimization. 25: 123-134. DOI: 10.1007/S10878-011-9423-1 |
0.386 |
|
2013 |
Lee K, Leung JY-, Pinedo ML. Makespan minimization in online scheduling with machine eligibility Annals of Operations Research. 204: 189-222. DOI: 10.1007/S10479-012-1271-6 |
0.48 |
|
2012 |
Choi BC, Lee K, Leung JYT, Pinedo ML, Briskorn D. Container Scheduling: Complexity and Algorithms Production and Operations Management. 21: 115-128. DOI: 10.1111/J.1937-5956.2011.01238.X |
0.425 |
|
2012 |
Leung JY-, Lee K, Pinedo ML. Bi-criteria scheduling with machine assignment costs International Journal of Production Economics. 139: 321-329. DOI: 10.1016/J.Ijpe.2012.05.016 |
0.469 |
|
2012 |
Lee K, Leung JY-, Pinedo ML. Coordination mechanisms for parallel machine scheduling European Journal of Operational Research. 220: 305-313. DOI: 10.1016/J.Ejor.2012.02.001 |
0.481 |
|
2012 |
Lee K, Choi B, Leung JY, Pinedo ML, Briskorn D. Minimizing the total weighted delivery time in container transportation scheduling Naval Research Logistics. 59: 266-277. DOI: 10.1002/Nav.21480 |
0.4 |
|
2012 |
Lee K, Lei L, Pinedo M. Production scheduling with history-dependent setup times Naval Research Logistics. 59: 58-68. DOI: 10.1002/Nav.21472 |
0.519 |
|
2011 |
Lim K, Lee K, Chang SY. Improved bounds for online scheduling with eligibility constraints Theoretical Computer Science. 412: 5211-5224. DOI: 10.1016/J.Tcs.2011.05.029 |
0.479 |
|
2011 |
Lee K, Choi B. Two-stage production scheduling with an outsourcing option European Journal of Operational Research. 213: 489-497. DOI: 10.1016/J.Ejor.2011.03.037 |
0.407 |
|
2011 |
Lee K, Leung JY-, Pinedo ML. Coordination mechanisms with hybrid local policies Discrete Optimization. 8: 513-524. DOI: 10.1016/J.Disopt.2011.05.001 |
0.493 |
|
2011 |
Lee K, Leung JY-, Pinedo ML. Scheduling jobs with equal processing times subject to machine eligibility constraints Journal of Scheduling. 14: 27-38. DOI: 10.1007/S10951-010-0190-0 |
0.56 |
|
2010 |
Briskorn D, Choi B, Lee K, Leung JY-, Pinedo M. Complexity of single machine scheduling subject to nonnegative inventory constraints European Journal of Operational Research. 207: 605-619. DOI: 10.1016/J.Ejor.2010.05.036 |
0.512 |
|
2010 |
Choi B, Lee K, Leung JY-, Pinedo ML. Flow shops with machine maintenance: Ordered and proportionate cases European Journal of Operational Research. 207: 97-104. DOI: 10.1016/J.Ejor.2010.04.018 |
0.533 |
|
2010 |
Lee K, Leung JY-, Pinedo ML. Makespan minimization in online scheduling with machine eligibility A Quarterly Journal of Operations Research. 8: 331-364. DOI: 10.1007/S10288-010-0149-1 |
0.485 |
|
2009 |
Lee K, Leung JYT, Pinedo ML. Online scheduling on two uniform machines subject to eligibility constraints Theoretical Computer Science. 410: 3975-3981. DOI: 10.1016/J.Tcs.2009.06.032 |
0.506 |
|
2009 |
Lee K, Leung JYT, Pinedo ML. A note on graph balancing problems with restrictions Information Processing Letters. 110: 24-29. DOI: 10.1016/J.Ipl.2009.09.015 |
0.349 |
|
2009 |
Lee K, Choi B, Leung JYT, Pinedo ML. Approximation algorithms for multi-agent scheduling to minimize total weighted completion time Information Processing Letters. 109: 913-917. DOI: 10.1016/J.Ipl.2009.04.018 |
0.501 |
|
2009 |
Lee K, Leung JYT, Pinedo ML. A note on “An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs” Information Processing Letters. 109: 608-610. DOI: 10.1016/J.Ipl.2009.02.010 |
0.477 |
|
2006 |
Park J, Chang SY, Lee K. Online and semi-online scheduling of two machines under a grade of service provision Operations Research Letters. 34: 692-696. DOI: 10.1016/J.Orl.2005.11.004 |
0.473 |
|
2005 |
Hwang H, Lee K, Chang SY. The effect of machine availability on the worst-case performance of LPT Discrete Applied Mathematics. 148: 49-61. DOI: 10.1016/J.Dam.2004.12.002 |
0.506 |
|
2004 |
Lee K, Chang SY, Hong Y. Continuous slab caster scheduling and interval graphs Production Planning & Control. 15: 495-501. DOI: 10.1080/09537280410001714279 |
0.403 |
|
2004 |
Hwang H, Chang SY, Lee K. Parallel machine scheduling under a grade of service provision Computers & Operations Research. 31: 2055-2061. DOI: 10.1016/S0305-0548(03)00164-3 |
0.416 |
|
Show low-probability matches. |