| Single machine scheduling with release dates and rejection L Zhang, L Lu, J Yuan European Journal of Operational Research 198 (3), 975-978, 2009 | 153 | 2009 |
| The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan L Lu, L Zhang, J Yuan Theoretical Computer Science 396 (1-3), 283-289, 2008 | 84 | 2008 |
| Bounded single-machine parallel-batch scheduling with release dates and rejection L Lu, TCE Cheng, J Yuan, L Zhang Computers & Operations Research 36 (10), 2748-2751, 2009 | 72 | 2009 |
| Single-machine scheduling under the job rejection constraint L Zhang, L Lu, J Yuan Theoretical Computer Science 411 (16-18), 1877-1882, 2010 | 71 | 2010 |
| Single machine scheduling with release dates and job delivery to minimize the makespan L Lu, J Yuan, L Zhang Theoretical Computer Science 393 (1-3), 102-108, 2008 | 40 | 2008 |
| Optimal algorithms for single-machine scheduling with rejection to minimize the makespan L Lu, CT Ng, L Zhang International Journal of Production Economics 130 (2), 153-158, 2011 | 36 | 2011 |
| A note on the complexity of flow shop scheduling with transportation constraints J Yuan, A Soukhal, Y Chen, L Lu European Journal of Operational Research 178 (3), 918-925, 2007 | 35 | 2007 |
| Parallel-machine scheduling with release dates and rejection L Zhang, L Lu 4OR 14, 165-172, 2016 | 34 | 2016 |
| On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time CT Ng, L Lu Journal of Scheduling 15 (3), 391-398, 2012 | 33 | 2012 |
| Rescheduling with release dates to minimize total sequence disruption under a limit on the makespan J Yuan, Y Mu, L Lu, W Li Asia-Pacific Journal of Operational Research 24 (06), 789-796, 2007 | 32 | 2007 |
| The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard LF Lu, JJ Yuan European Journal of Operational Research 177 (2), 1302-1309, 2007 | 27 | 2007 |
| Unbounded parallel batch scheduling with job delivery to minimize makespan L Lu, J Yuan Operations Research Letters 36 (4), 477-480, 2008 | 24 | 2008 |
| Single machine scheduling with job delivery to minimize makespan L Lu, J Yuan Asia-Pacific Journal of Operational Research 25 (01), 1-10, 2008 | 19 | 2008 |
| Single machine unbounded parallel-batch scheduling with forbidden intervals J Yuan, X Qi, L Lu, W Li European Journal of Operational Research 186 (3), 1212-1217, 2008 | 18 | 2008 |
| In-house production and outsourcing under different discount schemes on the total outsourcing cost L Lu, L Zhang, J Ou Annals of Operations Research 298, 361-374, 2021 | 17 | 2021 |
| New results on two-machine flow-shop scheduling with rejection L Zhang, L Lu, S Li Journal of Combinatorial Optimization 31, 1493-1504, 2016 | 16 | 2016 |
| The unbounded parallel-batch scheduling with rejection LQ Zhang, LF Lu, CT Ng Journal of the Operational Research Society 63 (3), 293-298, 2012 | 15 | 2012 |
| Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time X Chai, L Lu, W Li, L Zhang Asia-Pacific Journal of Operational Research 35 (06), 1850048, 2018 | 11 | 2018 |
| Rescheduling with new orders and general maximum allowable time disruptions Q Zhao, L Lu, J Yuan 4OR 14, 261-280, 2016 | 11 | 2016 |
| Two-machine open-shop scheduling with rejection to minimize the makespan L Zhang, L Lu, J Yuan Or Spectrum 38, 519-529, 2016 | 10 | 2016 |
