An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment. - Liji Shen (OR, 2007)

An integrated tabu search algorithm for the lot streaming problem in job shops. - Udo Buscher; Liji Shen (Eur. J. Oper. Res., 2009)

MIP formulations and heuristics for solving parallel batching problems. - Udo Buscher; Liji Shen (J. Syst. Sci. Complex., 2010)

Solving the serial batching problem in job shop manufacturing systems. - Liji Shen; Udo Buscher (Eur. J. Oper. Res., 2012)

An iterative approach for the serial batching problem with parallel machines and job families. - Liji Shen; Lars Mönch; Udo Buscher (Ann. Oper. Res., 2013)

A tabu search algorithm for the job shop problem with sequence dependent setup times. - Liji Shen (Comput. Ind. Eng., 2014)

A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times. - Hongyun Xu; Zhipeng Lü; Aihua Yin; Liji Shen; Udo Buscher (Comput. Oper. Res., 2014)

Flow shop batching and scheduling with sequence-dependent setup times. - Liji Shen; Jatinder N. D. Gupta; Udo Buscher (J. Sched., 2014)

A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups. - Liji Shen; Lars Mönch; Udo Buscher (J. Sched., 2014)

Solving the flexible job shop scheduling problem with sequence-dependent setup times. - Liji Shen; Stéphane Dauzère-Pérès; Janis Sebastian Neufeld (Eur. J. Oper. Res., 2018)

Family scheduling with batch availability in flow shops to minimize makespan. - Liji Shen; Jatinder N. D. Gupta (J. Sched., 2018)

A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem. - Junwen Ding; Zhipeng Lü; Chu-Min Li 001; Liji Shen; Liping Xu; Fred W. Glover (AAAI, 2019)

Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration. - Junwen Ding; Liji Shen; Zhipeng Lü; Bo Peng 010 (Comput. Oper. Res., 2019)

Heuristics for Order-Lot Pegging In Multi-Fab Settings. - Lars Mönch; Liji Shen; John W. Fowler (WSC, 2020)

Solving parallel machine problems with delivery times and tardiness objectives. - Söhnke Maecker; Liji Shen (Ann. Oper. Res., 2020)

A Hybrid Memetic Algorithm for the Parallel Machine Scheduling Problem With Job Deteriorating Effects. - Junwen Ding; Liji Shen; Zhipeng Lü; Liping Xu; Una Benlic (IEEE Trans. Emerg. Top. Comput. Intell., 2020)

Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization. - Junwen Ding; Sven Schulz; Liji Shen; Udo Buscher; Zhipeng Lü (Comput. Oper. Res., 2021)

Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing. - Lars Mönch; Liji Shen (Comput. Oper. Res., 2021)

Corrigendum to: "Solving the flexible job shop scheduling problem with sequence-dependent setup times", [European Journal of Operational Research 265, 503-516, 2018]. - Liji Shen; Stéphane Dauzère-Pérès; Janis S. Neufeld (Eur. J. Oper. Res., 2022)

Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness. - Söhnke Maecker; Liji Shen; Lars Mönch (Comput. Oper. Res., 2023)

A Novel Evolutionary Algorithm for Energy-Efficient Scheduling in Flexible Job Shops. - Junwen Ding; Stéphane Dauzère-Pérès; Liji Shen; Zhipeng Lü (IEEE Trans. Evol. Comput., 2023)

Energy cost efficient scheduling in flexible job-shop manufacturing systems. - Liji Shen; Stéphane Dauzère-Pérès; Söhnke Maecker (Eur. J. Oper. Res., 2023)

The flexible job shop scheduling problem: A review. - Stéphane Dauzère-Pérès; Junwen Ding; Liji Shen; Karim Tamssaouet (Eur. J. Oper. Res., 2024)