Rescheduling with Release dates to minimize Total Sequence Disruption under a Limit on the makespan. - Jinjiang Yuan; Yundong Mu; Lingfa Lu; Wenhua Li (Asia Pac. J. Oper. Res., 2007)

The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard. - Lingfa Lu; Jinjiang Yuan (Eur. J. Oper. Res., 2007)

A note on the complexity of flow shop scheduling with transportation constraints. - Jinjiang Yuan; Ameur Soukhal; Youjun Chen; Lingfa Lu (Eur. J. Oper. Res., 2007)

Single Machine Scheduling with Job Delivery to minimize makespan. - Lingfa Lu; Jinjiang Yuan (Asia Pac. J. Oper. Res., 2008)

Single machine unbounded parallel-batch scheduling with forbidden intervals. - Jinjiang Yuan; Xianglai Qi; Lingfa Lu; Wenhua Li (Eur. J. Oper. Res., 2008)

Unbounded parallel batch scheduling with job delivery to minimize makespan. - Lingfa Lu; Jinjiang Yuan (Oper. Res. Lett., 2008)

Single machine scheduling with release dates and job delivery to minimize the makespan. - Lingfa Lu; Jinjiang Yuan; Liqi Zhang (Theor. Comput. Sci., 2008)

The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. - Lingfa Lu; Liqi Zhang; Jinjiang Yuan (Theor. Comput. Sci., 2008)

Bounded single-machine parallel-batch scheduling with release dates and rejection. - Lingfa Lu; T. C. Edwin Cheng; Jinjiang Yuan; Liqi Zhang (Comput. Oper. Res., 2009)

Single machine scheduling with release dates and rejection. - Liqi Zhang; Lingfa Lu; Jinjiang Yuan (Eur. J. Oper. Res., 2009)

Single-machine scheduling under the job rejection constraint. - Liqi Zhang; Lingfa Lu; Jinjiang Yuan (Theor. Comput. Sci., 2010)

The unbounded parallel-batch scheduling with rejection. - L. Q. Zhang; Lingfa Lu; C. T. Ng 001 (J. Oper. Res. Soc., 2012)

On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time. - C. T. Ng 001; Lingfa Lu (J. Sched., 2012)

Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time. - Youjun Chen; Lingfa Lu; Jinjiang Yuan (Theor. Comput. Sci., 2015)

Integrated production and delivery scheduling on a serial batch machine to minimize the makespan. - Lingfa Lu; Liqi Zhang; Long Wan (Theor. Comput. Sci., 2015)

Parallel-machine scheduling with release dates and rejection. - Liqi Zhang; Lingfa Lu (4OR, 2016)

Rescheduling with new orders and general maximum allowable time disruptions. - Qiulan Zhao; Lingfa Lu; Jinjiang Yuan (4OR, 2016)

New results on two-machine flow-shop scheduling with rejection. - Liqi Zhang; Lingfa Lu; Shisheng Li (J. Comb. Optim., 2016)

Scheduling problems with rejection to minimize the maximum flow time. - Liqi Zhang; Lingfa Lu (J. Syst. Sci. Complex., 2016)

Two-machine open-shop scheduling with rejection to minimize the makespan. - Liqi Zhang; Lingfa Lu; Jinjiang Yuan (OR Spectr., 2016)

Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time. - Youjun Chen; Lingfa Lu; Jinjiang Yuan (Theor. Comput. Sci., 2016)

Online Single Machine Scheduling to Minimize the Maximum Starting Time. - Lingfa Lu; Liqi Zhang (Asia Pac. J. Oper. Res., 2017)

Single-machine scheduling with production and rejection costs to minimize the maximum earliness. - Lingfa Lu; Liqi Zhang (J. Comb. Optim., 2017)

Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time. - Xing Chai; Lingfa Lu; Wenhua Li; Liqi Zhang (Asia Pac. J. Oper. Res., 2018)

Single-machine scheduling with positional due indices and positional deadlines. - Rubing Chen; Jinjiang Yuan; Lingfa Lu (Discret. Optim., 2019)

A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan. - Lingfa Lu; Liqi Zhang (RAIRO Oper. Res., 2019)

Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates. - Lingfa Lu; Liqi Zhang; Jie Zhang; Lili Zuo (Asia Pac. J. Oper. Res., 2020)

Single Machine Scheduling with Rejection to Minimize the Weighted Makespan. - Lingfa Lu; Liqi Zhang; Jinwen Ou (AAIM, 2021)

Single Machine Scheduling with Rejection and Generalized Parameters. - Xue Yu; Lingfa Lu; Liqi Zhang (COCOA, 2021)

In-house production and outsourcing under different discount schemes on the total outsourcing cost. - Lingfa Lu; Liqi Zhang; Jinwen Ou (Ann. Oper. Res., 2021)

Single Machine Scheduling with Rejection to Minimize the k-th Power of the Makespan. - Liqi Zhang; Lingfa Lu (COCOON, 2022)

Pareto-scheduling of two competing agents with their own equal processing times. - Rubing Chen; Zhichao Geng; Lingfa Lu; Jinjiang Yuan; Yuan Zhang (Eur. J. Oper. Res., 2022)

Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost. - Lingfa Lu; Liqi Zhang (J. Comb. Optim., 2023)

Single Machine Scheduling with Rejection and a Non-Availability Interval to Minimize the Maximum Delivery Completion Time Plus the Total Rejection Cost. - Lili Zuo; Lingfa Lu; Liqi Zhang (Asia Pac. J. Oper. Res., 2023)

Parallel-batch scheduling with rejection: Structural properties and approximation algorithms. - Jinwen Ou; Lingfa Lu; Xueling Zhong (Eur. J. Oper. Res., 2023)

Rescheduling for new orders on a single machine with rejection. - Kan Fang; Wenchang Luo; Michael L. Pinedo; Miaomiao Jin; Lingfa Lu (J. Oper. Res. Soc., 2024)

A note on the online hierarchical scheduling for lp-norm load balancing. - Xianglai Qi; Lingfa Lu; Shiguo Zhou (Discret. Appl. Math., 2025)

Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan. - Han Zhang; Lingfa Lu; Jinjiang Yuan (J. Comb. Optim., 2025)

Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties. - Zhichao Geng; Lingfa Lu (J. Comb. Optim., 2025)