LZLi Zheng

Li Zheng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Li Zheng has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • An improved multi-objective Wild Horse optimization for the dual-resource-constrained flexible job shop scheduling problem: A comparative analysis with NSGA-II and a real case study

    by F. Peng, L. Zheng

    The equipment manufacturing industry needs skilled workers to operate a specific set of machines following process specifications. Optimizing machine and worker assignments to achieve maximum efficiency is a critical problem for workshop managers. This paper investigates a multi-objective dual-resource-constrained flexible job shop scheduling problem. An improved wild horse optimization (IWHO) algorithm is developed to simultaneously optimize three objectives: makespan, maximum machine workload, and total machine workload. To evaluate the quality of individuals in multi-objective optimization, the Pareto fast non-dominated sorting method is used, and the crowding distance is calculated. To update the algorithm's solution, the crossover and mutation operations are used. Further, a local neighborhood search strategy is employed to enhance searchability and avoid trapping into the local optima. The benchmark of the flexible job shop scheduling problem is extended to create test instances, and the performance of the suggested IWHO algorithm is evaluated compared with the NSGA-II. The computational results show that the IWHO algorithm provides a non-dominated efficient set within a reasonable running time. Furthermore, a buffers and chain coupler assembly process is designed to analyze the practical value of the IWHO algorithm. The proposed solutions can be used to generate daily schedules for managing machines, workers, and production cycles.


  • Open Access

    Integrating real-time manufacturing data into a novel serial two-stage adaptive alternate genetic fireworks algorithm for solving stochastic type-II simple assembly line balancing problem

    by Fei Peng, Li Zheng

    Due to various interference factors, a pre-planned assembly scheme and its cycle time can be disturbed, resulting in the failure of product delivery on schedule. However, when assembly data of the production line can be obtained in real time, the balance of the assembly line could be dynamically adjusted in case of experiencing serious interferences to optimize its cycle time in time and improve its production efficiency. Therefore, this paper proposes a dynamic rebalancing framework by integrating real time manufacturing data into a novel serial two-stage adaptive alternate genetic fireworks algorithm for solving a stochastic type-II simple assembly line balancing problem (SSALBP-II). MES (manufacturing execution system) is used to obtain some real time data such as the resource status, operation information and task information and to judge abnormal phenomenon and the overdue delivery caused by interferences. On this basis, the stochastic type-II simple assembly line balance model is constructed, with a new serial two-stage adaptive alternate genetic fireworks algorithm (STAGFA). This new algorithm can incorporate both genetic algorithm and fireworks algorithm to solve the model according to the transformation of population diversity discrimination index. Through the comparison between STAGFA and other algorithms such as fireworks algorithm, genetic algorithm, other improved intelligent algorithms, it is proved that the STAGFA is effective and superior in solving the assembly line (re)balance problem. Then, the rebalanced scheme verified by simulation is dispatched to control the physical assembly line and realize dynamic rebalancing cycle time effectively.


  • An Analytical Framework for Modeling, Analysis, and Improvement of Team Communication and Collaboration Process in Primary Care Clinics

    by Nan Chen, Xiaolei Xie, Philip A. Bain, Marlon P. Mundt, Li Zheng, Jingshan Li

    Primary care is the backbone of the U.S. healthcare delivery system. In primary care clinics, teams led by providers play a central role in care delivery. A care service task typically requires joint efforts among the care providers and support staff in the team. Thus, communications within a team are critical to ensure effective collaboration and coordination between team members to provide high quality of care. Due to such an importance, team communication and collaboration have received a considerable amount of research attention. However, most research is qualitative or based on empirical studies. This paper introduces an analytical framework of modeling, analysis, and improvement of team communication and collaboration process in primary care clinics. Specifically, using a queueing network model, the physicians, nurses, and medical assistants are modeled as servers and the communication and collaboration tasks are viewed as customers. The team members interact with each other multiple times to accomplish a task. The efficiency of the team communication and collaboration process is characterized by task throughput, task completion time, and the number of iterations to finish a task. Analytical formulas to evaluate such performances are derived and system properties are investigated. In addition, bottleneck analysis is carried out to identify the constraint that impedes the system performance in the strongest manner. Finally, a case study at a primary care clinic is presented to illustrate the applicability of the model.


  • Modeling and Analysis of the Waiting Time of Rapid Response Process in Acute Care

    by Nan Chen, Mengxin Wang, Xiaolei Xie, Li Zheng, Colleen H. Swartz

    To ensure patient safety, many hospitals have implemented rapid response process to provide care to acute patients who experience acute physiological deterioration. However, those patients sometimes have to wait for a long time before an appropriate decision can be made, due to low availability of care providers. In this letter, we develop an analytical model with the objective of reducing patient waiting time. A method to evaluate patient waiting time during deterioration process is presented. Structural properties are discussed. Continuous improvement issues are investigated by introducing an indicator to identify the bottleneck care provider whose response time reduction could lead to the largest decrease in patient waiting time. A simple approximation formula of bottleneck indicator is derived. Finally, a set of numerical experiments are performed to validate the model.


  • An integrated model for multi-resource constrained scheduling problem considering multi-product and resource-sharing

    by Changchun Liu, Xi Xiang, Li Zheng, Jing Ma

    This paper studies a multi-resource constrained scheduling problem considering multi-product and resource-sharing in the manufacturing supply chain, in which many independent production units coordinate with a truck resource manager. A mixed integer programming model is formulated to minimise the total system cost and some analytical properties are proposed to tighten the model. A Lagrangian relaxation-based heuristic with several enhancements, e.g. warm startup, approximating solve and parallel computation of subproblems, is proposed to solve the model. Finally, computational experiments are conducted to verify that (i) the proposed method has a better performance in both objective and CPU time than CPLEX, (ii) all three enhancements can help reduce the total computation time and (iii) a certain degree of resource-sharing can help reduce the total cost of the system.


  • A factory-level dynamic operator allocation policy: the bubble allocation

    by Chenjie Wang, Ningxuan Kang, Li Zheng

    In this paper, we propose a factory-level dynamic operator allocation policy called the bubble allocation policy. This policy is commonly implemented in labour-intensive industries in the presence of different operator speeds, high labour turnover, and learning effects. We prove the optimality of bubble allocation in several typical scenarios under deterministic and exponential processing time and different operator speed assumptions. When labour turnover and learning effects were considered, the effects of the bubble allocation were verified through simulation. Bubble allocation had a more significant positive effect on system throughput than the passive operator allocation policy. The positive effects of bubble allocation are enhanced with a larger production system scale (more parallel lines and more stations), higher turnover rate and slower learning process. Compared with active allocation policies such as work-sharing policy, bubble allocation policy has no requirements for additional cross-training and is not sensitive to the switching time of tasks. The bubble allocation policy stands out when the system is large and the flow line is designed in a balanced way.


  • MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem

    by Jing Xiao, Canrong Zhang, Li Zheng, Jatinder N. D. Gupta

    This paper examines the capacitated lot-sizing and scheduling problem (CLSP) with sequence-dependent setup times, time windows, machine eligibility and preference constraints. Such a problem frequently arises in the semiconductor manufacturing industry by which this paper is motivated. A mixed integer programming (MIP) model is constructed for the problem. Two MIP-based fix-and-optimise algorithms are proposed in which the binary decision variables associated with the assignment of machines are first fixed using the randomised least flexible machine (RLFM) rule and the rest of the decision variables are settled by an MIP solver. Extensive experiments show that the proposed algorithms outperform the state-of-the-art MIP-based fix-and-optimise algorithms in the literature, especially for instances with high machine flexibility and high demand variation.


  • Bi-ACO: A Tool for Solving Bi-Criteria Optimization

    by Wang Shidong, Zheng Li, Zhang Zhihai

    This paper deals with a hump scheduling problem in marshalling station which can be described as one machine scheduling with two objectives: minimizing the number of tardy jobs; minimizing the maximal tardiness of all the jobs. A bi-ACO algorithm aiming to solve the problem is proposed and an external collection E(P) is designed to find the approximation of frontier of the area of efficient solutions, which is used to record and update the pheromone. Meanwhile, two efficient problem-specific heuristics for each criterion have been developed. To validate the algorithm, experimental case is devoted and conclusions are discussed in the last section.