| Year |
Citation |
Score |
| 2021 |
Zhan Y, Wang Z, Wan G. Home service routing and appointment scheduling with stochastic service times European Journal of Operational Research. 288: 98-110. DOI: 10.1016/J.Ejor.2020.05.037 |
0.408 |
|
| 2019 |
Su H, Wan G, Wang S. Online scheduling for outpatient services with heterogeneous patients and physicians Journal of Combinatorial Optimization. 37: 123-149. DOI: 10.1007/S10878-017-0216-Z |
0.379 |
|
| 2018 |
Zhan Y, Wan G. Vehicle routing and appointment scheduling with team assignment for home services Computers & Operations Research. 100: 1-11. DOI: 10.1016/J.Cor.2018.07.006 |
0.378 |
|
| 2017 |
Cao Q, Li Y, Wan G. Online Order Scheduling Problem with the Same Order Size on Two Identical Machines Asia-Pacific Journal of Operational Research. 34: 1-9. DOI: 10.1142/S0217595917500063 |
0.313 |
|
| 2017 |
Yue Q, Wan G. Order scheduling with controllable processing times, common due date and the processing deadline Journal of Systems Science and Systems Engineering. 26: 199-218. DOI: 10.1007/S11518-016-5323-3 |
0.441 |
|
| 2017 |
Su H, Pinedo M, Wan G. Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness Naval Research Logistics. 64: 249-267. DOI: 10.1002/Nav.21744 |
0.407 |
|
| 2016 |
Yue Q, Wan G. Single machine SLK/DIF due window assignment problem with job-dependent linear deterioration effects Journal of the Operational Research Society. 67: 872-883. DOI: 10.1057/Jors.2015.107 |
0.451 |
|
| 2016 |
Cao Q, Wan G. Semi-online scheduling with combined information on two identical machines in parallel Journal of Combinatorial Optimization. 31: 686-695. DOI: 10.1007/S10878-014-9778-1 |
0.31 |
|
| 2015 |
Wang S, Su H, Wan G. Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling Journal of Combinatorial Optimization. 30: 982-995. DOI: 10.1007/S10878-015-9860-3 |
0.44 |
|
| 2014 |
Ge D, Wan G, Wang Z, Zhang J. A note on appointment scheduling with piecewise linear cost functions Mathematics of Operations Research. 39: 1244-1251. DOI: 10.1287/Moor.2013.0631 |
0.422 |
|
| 2012 |
Cao Q, Cheng TCE, Wan G, Li Y. Several semi-online scheduling problems on two identical machines with combined information Theoretical Computer Science. 457: 35-44. DOI: 10.1016/J.Tcs.2012.07.005 |
0.418 |
|
| 2011 |
Huang S, Lu M, Wan G. Integrated order selection and production scheduling under MTO strategy International Journal of Production Research. 49: 4085-4101. DOI: 10.1080/00207543.2010.496797 |
0.421 |
|
| 2010 |
Leung JYT, Pinedo M, Wan G. Competitive Two-Agent Scheduling and Its Applications Operations Research. 58: 458-469. DOI: 10.1287/Opre.1090.0744 |
0.384 |
|
| 2010 |
Wan G, Vakati SR, Leung JY-, Pinedo M. Scheduling two agents with controllable processing times European Journal of Operational Research. 205: 528-539. DOI: 10.1016/J.Ejor.2010.01.005 |
0.422 |
|
| 2010 |
Wan G, Qi X. Scheduling with variable time slot costs Naval Research Logistics. 57: 159-171. DOI: 10.1002/Nav.20393 |
0.384 |
|
| 2009 |
Wan G, Yen BP-. Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs European Journal of Operational Research. 195: 89-97. DOI: 10.1016/J.Ejor.2008.01.029 |
0.453 |
|
| 2007 |
Wan G, Leung JY-, Pinedo ML. Scheduling imprecise computation tasks on uniform processors Information Processing Letters. 104: 45-52. DOI: 10.1016/J.Ipl.2007.05.004 |
0.311 |
|
| 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.377 |
|
| 2005 |
Cao D, Chen M, Wan G. Parallel machine selection and job scheduling to minimize machine cost and job tardiness Computers & Operations Research. 32: 1995-2012. DOI: 10.1016/J.Cor.2004.01.001 |
0.431 |
|
| 2002 |
Wan G, Yen BP-. Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties European Journal of Operational Research. 142: 271-281. DOI: 10.1016/S0377-2217(01)00302-2 |
0.451 |
|
| 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.392 |
|
| Show low-probability matches. |