Li Liu

ORCID: 0000-0001-8548-7329
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Scheduling and Optimization Algorithms
  • Advanced Manufacturing and Logistics Optimization
  • Advanced Control Systems Optimization
  • Vehicle Routing Optimization Methods
  • Manufacturing Process and Optimization
  • Metaheuristic Optimization Algorithms Research
  • Distributed and Parallel Computing Systems
  • Assembly Line Balancing Optimization
  • Robotic Path Planning Algorithms
  • Energy Efficiency and Management
  • Management and Optimization Techniques
  • Educational and Technological Research
  • Big Data and Business Intelligence
  • Scientific Computing and Data Management
  • Complexity and Algorithms in Graphs
  • Cloud Computing and Resource Management
  • Sustainable Industrial Ecology
  • IoT and Edge/Fog Computing
  • Big Data Technologies and Applications
  • Service-Oriented Architecture and Web Services
  • Digital Transformation in Industry
  • Optimization and Packing Problems
  • Computational Geometry and Mesh Generation
  • Advanced Multi-Objective Optimization Algorithms

Nanyang Institute of Technology
2016-2024

Changchun University
2023

Hunan Normal University
2023

University of Science and Technology Liaoning
2020

Anhui Polytechnic University
2017

Johnson Matthey (Germany)
2017

Lanzhou University
2006-2008

HSBC Holdings
2005

University of Maryland, College Park
1988

10.1595/205651317x696225 article EN cc-by Johnson Matthey Technology Review 2017-10-01

The orienteering problem involves the selection of a path between an origin and destination which maximizes total score subject to time restriction. In previous work we presented effective heuristic for this NP-hard that outperformed other heuristics from literature. article describe test significantly improved procedure. new procedure is based on four concepts—center gravity, randomness, subgravity, learning. These concepts combine yield much faster results in more nearly optimal solutions...

10.1002/1520-6750(198806)35:3<359::aid-nav3220350305>3.0.co;2-h article EN Naval Research Logistics (NRL) 1988-06-01

Re-entrant hybrid flow shop scheduling problem (RHFSP) is widely used in industries. However, little attention paid to energy consumption cost with the raise of green manufacturing concept. This paper proposes an improved multiobjective ant lion optimization (IMOALO) algorithm solve RHFSP objectives minimizing makespan and under Time-of-Use (TOU) electricity tariffs. A right-shift operation then adjust starting time operations by avoiding period high price reduce as far possible. The...

10.1155/2020/8565921 article EN cc-by Complexity 2020-02-22

This paper focuses on the multi‐objective optimization of reentrant hybrid flowshop scheduling problem (RHFSP) with machines turning and off control strategy. RHFSP exhibits significance in many industrial applications, but both energy consumption consideration concept is relatively unexplored at present. In this study, an improved Multi‐Objective Multi‐Verse Optimizer (IMOMVO) algorithm proposed to optimize objectives makespan, maximum tardiness, idle consumption. To solve model more...

10.1155/2019/2573873 article EN cc-by Mathematical Problems in Engineering 2019-01-01

The main objective of this research is to establish and solve a scheduling model for the degraded flow shop taking completion time average device idle as optimization objectives. Therefore, considering interaction among schedule, production, maintenance degradation, mathematical with well constructed. Based on NSGA-II algorithm, local search strategy first proposed obtain junction points sparse according non-dominated sorted results. Subsequently, comparative experiments are conducted...

10.1109/access.2023.3234428 article EN cc-by IEEE Access 2023-01-01

For the green hybrid flow shop scheduling problem considering sequence dependent setup times (SDST) and transportation times, a mixed integer programming model is established with objectives of minimizing maximum completion time (makespan) total energy consumption simultaneously, an improved memetic algorithm proposed characteristics. First all, encoding method combining jobs code at first stage machine allocation designed to ensure that can search entire solution space greatest extent;...

10.1109/access.2023.3269293 article EN cc-by-nc-nd IEEE Access 2023-01-01

Abstract In the face of energy crisis, manufacturers pay more and attention to energy-saving scheduling. paper, we consider distributed heterogeneous re-entrant hybrid flow shop scheduling problem (DHRHFSP) with sequence dependent setup times (DHRHFSP-SDST) considering factory eligibility constraints under time use (TOU) price, which means that each job can only be assigned its available set factories all have different number machines processing capacity, so on. To deal DHRHFSP-SDST, a...

10.1038/s41598-022-23144-6 article EN cc-by Scientific Reports 2022-11-05

Although re-entrant hybrid flow shop scheduling is widely used in industry, its processing and delivery times are typically determined using precise values that frequently ignore the influence of machine failure, human factors, surrounding environment, other uncertain resulting a significant gap between theoretical research practical application. For fuzzy problem (FRHFSP), an integrated model established to minimize maximum completion time maximize average agreement index. According...

10.3233/jifs-221089 article EN Journal of Intelligent & Fuzzy Systems 2022-08-12

The problem of how to allocate the resources optimally and adaptively in dynamic, scalable distribute-controlled grid environment is introduced discussed numerously. But recent researches can't satisfy with needs resource allocation system thoroughly. In this paper, we use SuperScheduling concept system, which no explicit model. And introduce Ant Colony Optimization applied for those models implement allocation. We test validity gets good results global control.

10.1109/apscc.2006.112 article EN 2006-12-01

The classical hybrid flow shop scheduling problem (HFSP) only treats machines as the resource constraint, ignoring dominant role of workers in production and manufacturing. Considering dual flexibility machine worker, this paper studies multi-objective with constraints (DHFSP). Firstly, according to characteristics DHFSP various constraints, model is built minimize maximum completion time (makespan), total tardiness workload balance worker. Then, an improved memetic algorithm (IMOMA)...

10.1109/access.2020.2999680 article EN cc-by IEEE Access 2020-01-01

Aiming at the problem of integrated scheduling machines and AGVs in a flexible job shop, this paper constructs model with optimization objectives minimizing maximum completion time, machine load, total energy consumption. This is based on comprehensive consideration payload time no-load between loading unloading stations machining machines. An improved NSGA-II algorithm proposed to address problem. The adopts three-level coding structure processes, machines, AGVs, employs differentiated...

10.5755/j01.itc.53.4.37410 article EN cc-by Information Technology And Control 2024-12-21

Given the increasingly severe environmental challenges, distributed green manufacturing has garnered significant academic and industrial interest. This paper addresses two-stage flexible job shop scheduling problem (DTFJSP) under time-of-use (TOU) electricity pricing, with objective of minimizing both makespan total energy consumption costs (TEC). To tackle problem, a hybrid memetic algorithm (HMA) is proposed. Initially, three-tier vector encoding scheme three population initialization...

10.1038/s41598-024-81064-z article EN cc-by-nc-nd Scientific Reports 2024-12-28

This paper focuses on the scheduling problem of batch processing workstation (BPW) β1→β2 type in semiconductor wafer fabrication (SWF). The constraints consist incompatible families, limited waiting time, and re-entrant flow. BPW is a bottleneck SWF. In order to ensure that can process full-batch continuously, new pull-based algorithm proposed. According collaborative strategy, consists three sub-algorithms. They are one-to-one forming sub-algorithm, two-to-one pulling preceding jobs...

10.1080/0951192x.2017.1285425 article EN International Journal of Computer Integrated Manufacturing 2017-02-03

10.1016/j.disopt.2005.03.002 article EN publisher-specific-oa Discrete Optimization 2005-06-01

A workshop scheduling model considering machine resources, spatial and human resources is established for the flexible job shop problem (FJSP). An improved NSGA-III algorithm proposed to solve multi-objective optimization that incorporates makespan, total jobs movement distance, payroll. The enhances diversity of population by introducing Logistic chaotic mapping initialization algorithm. Furthermore, a adaptive local search strategy based on upper confidence bound (UCB) employed enhance...

10.1109/cvci59596.2023.10397364 article EN 2021 5th CAA International Conference on Vehicular Control and Intelligence (CVCI) 2023-10-27

It is challenging to schedule batch processing machine in the semiconductor wafer fabrication system. Based on rolling horizon scheme, overall decomposed into many time windows. One window corresponds one sub-problem. Regarding each sub-problem, a multiple-phase scheduling strategy performed, which consists of three phases: update parameters, sequence regrouping batches, and dispatch priority-batch. A unified model unifying β 2 sequencing focused 1 → type. In model, objective minimum total...

10.1177/0954405417738030 article EN Proceedings of the Institution of Mechanical Engineers Part B Journal of Engineering Manufacture 2017-11-06

After the fourth Industrial Revolution comes, whole world facing digitized era, it is imperative to revolution of fusing education and technology in China.This article deals with virtual reality plus teaching; virtual/cloudy computing big data artificial intelligence teaching, goal join these three aspects together provide issue, comb out different methods research.

10.2991/icsshe-18.2018.53 article EN cc-by-nc Proceedings of the 7th International Conference on Social Science and Higher Education (ICSSHE 2021) 2018-01-01

Before the emergence of concept e-science, applications and resources in research scientific areas have existed as grid applications. In order to use already existing efficiently an urgent problem "grid people" is how integrate those heritage systems grid-based There are many well developed with aid technologies. However, they almost fields dependent gaps between these resources. Neither architecture nor service oriented defined solve integration sharing among various field-specific...

10.1109/umedia.2008.4570904 article EN 2008-07-01

10.2514/6.2008-7100 article EN AIAA Modeling and Simulation Technologies Conference and Exhibit 2008-08-18

The time window (TW) generalizes the concept of due date. semiconductor wafer fabrication system is currently one most complex production processes, which has typical re-entrant batch processing machine (RBPM). RBPM a bottleneck. This paper addresses scheduling with job-dependent TWs. According to general modelling, an improved and new job-family-oriented modelling decomposition method that based on slack mixed integer linear programming proposed. First, complicated problem divided into...

10.1080/13873954.2017.1394327 article EN Mathematical and Computer Modelling of Dynamical Systems 2017-10-27

With the increasing concern of ecological crisis and sustainable development, issue green development has aroused widespread focus in academic practical domain. Green civilization are especially important to developing country, which interact both basis development. This paper analyzed present background, status, importance problem about China shared a case study practice Development Anshan, as well proposed specific tactics promote realization goal on two main direction from perspective...

10.1051/e3sconf/202015802004 article EN cc-by E3S Web of Conferences 2020-01-01
Coming Soon ...