☰

Yumei Huo, Ph.D. - Publications

Affiliations: 
2005 New Jersey Institute of Technology, Newark, NJ, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

24 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Huo Y. Parallel machine makespan minimization subject to machine availability and total completion time constraints Journal of Scheduling. 22: 433-447. DOI: 10.1007/S10951-017-0551-Z  0.435
2018 Huo Y, Zhao H. Two machine scheduling subject to arbitrary machine availability constraint Omega-International Journal of Management Science. 76: 128-136. DOI: 10.1016/J.Omega.2017.05.004  0.459
2015 Huo Y, Zhao H. Total completion time minimization on multiple machines subject to machine availability and makespan constraints European Journal of Operational Research. 243: 547-554. DOI: 10.1016/J.Ejor.2014.12.012  0.443
2014 Huo Y, Reznichenko B, Zhao H. Minimizing total weighted completion time with an unexpected machine unavailable interval Journal of Scheduling. 17: 161-172. DOI: 10.1007/S10951-013-0328-Y  0.457
2014 Huo Y. Makespan minimization on multiple machines subject to machine unavailability and total completion time constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8546: 56-65. DOI: 10.1007/978-3-319-07956-1_6  0.369
2013 Huo Y, Zhao H. Bi-criteria scheduling on multiple machines subject to machine availability constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7924: 325-338. DOI: 10.1007/978-3-642-38756-2_33  0.358
2012 Fu B, Huo Y, Zhao H. Coordinated scheduling of production and delivery with production window and delivery capacity constraints Theoretical Computer Science. 422: 39-51. DOI: 10.1016/J.Tcs.2011.11.035  0.35
2011 Huo Y, Zhao H. Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints Theoretical Computer Science. 412: 1081-1091. DOI: 10.1016/J.Tcs.2010.12.007  0.447
2011 Fu B, Huo Y, Zhao H. Approximation schemes for parallel machine scheduling with availability constraints Discrete Applied Mathematics. 159: 1555-1565. DOI: 10.1016/J.Dam.2011.06.007  0.457
2010 Huo Y, Leung JYT. Fast approximation algorithms for job scheduling with processing set restrictions Theoretical Computer Science. 411: 3947-3955. DOI: 10.1016/J.Tcs.2010.08.008  0.394
2010 Huo Y, Leung JYT. Parallel machine scheduling with nested processing set restrictions European Journal of Operational Research. 204: 229-236. DOI: 10.1016/J.Ejor.2009.10.025  0.455
2010 Huo Y, Leung JYT, Wang X. Integrated production and delivery scheduling with disjoint windows Discrete Applied Mathematics. 158: 921-931. DOI: 10.1016/J.Dam.2009.12.010  0.427
2010 Fu B, Huo Y, Zhao H. Approximation schemes for scheduling with availability constraints Lecture Notes in Computer Science. 6213: 77-88. DOI: 10.1007/978-3-642-14553-7_10  0.454
2009 Fu B, Huo Y, Zhao H. Makespan Minimization With Machine Availability Constraints Discrete Mathematics, Algorithms and Applications. 1: 141-151. DOI: 10.1142/S1793830909000129  0.434
2009 Huo Y, Leung JY-, Wang X. Preemptive Scheduling Algorithms With Nested Processing Set Restriction International Journal of Foundations of Computer Science. 20: 1147-1160. DOI: 10.1142/S012905410900708X  0.439
2009 Fu B, Huo Y, Zhao H. Exponential inapproximability and FPTAS for scheduling with availability constraints Theoretical Computer Science. 410: 2663-2674. DOI: 10.1016/J.Tcs.2009.03.012  0.449
2009 Huo Y, Leung JYT, Wang X. A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions Discrete Optimization. 6: 292-298. DOI: 10.1016/J.Disopt.2009.02.002  0.398
2009 Huo Y, Li H, Zhao H. Minimizing total completion time in two-machine flow shops with exact delays Computers & Operations Research. 36: 2018-2030. DOI: 10.1016/J.Cor.2008.06.015  0.422
2008 Huo Y, Leung JYT, Wang X. Online scheduling of equal-processing-time task systems Theoretical Computer Science. 401: 85-95. DOI: 10.1016/J.Tcs.2008.03.026  0.42
2007 Huo Y, Leung JYT, Zhao H. Complexity of two dual criteria scheduling problems Operations Research Letters. 35: 211-220. DOI: 10.1016/J.Orl.2006.01.007  0.33
2007 Huo Y, Leung JY-, Zhao H. Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness European Journal of Operational Research. 177: 116-134. DOI: 10.1016/J.Ejor.2005.06.067  0.442
2006 Huo Y, Leung JYT. Minimizing mean flow time for UET tasks Acm Transactions On Algorithms. 2: 244-262. DOI: 10.1145/1150334.1150340  0.413
2005 Huo Y, Leung JYT. Online scheduling of precedence constrained tasks Siam Journal On Computing. 34: 743-762. DOI: 10.1137/S0097539704444440  0.372
2005 Huo Y, Leung JYT. Minimizing total completion time for UET tasks with release time and outtree precedence constraints Mathematical Methods of Operations Research. 62: 275-279. DOI: 10.1007/S00186-005-0009-5  0.325
Show low-probability matches.