About
192
Publications
24,849
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
6,095
Citations
Introduction
Junqing Li currently works at the School of Information Science and Engineering, Shandong Normal University. Junqing does research in Artificial Intelligence, Information Science and Control Systems Engineering. Their current project is 'Re-manufacturing scheduling'.
Skills and Expertise
Publications
Publications (192)
With the global energy shortage, climate anomalies, environmental pollution becoming increasingly prominent, energy saving scheduling has attracted more and more concern than before. This paper studies the energy-efficient distributed hybrid flow-shop scheduling problem (DHFSP) with blocking constraints. Our aim is to find the job sequence with low...
As multi-factory production models are more widespread in modern manufacturing systems, a distributed blocking flowshop scheduling problem (DBFSP) is studied in which no buffer between adjacent machines and setup time constraints are considered. To address the above problem, a mixed integer linear programming (MILP) model is first constructed, and...
Energy conservation, emission reduction, and green and low carbon are of great significance to sustainable development, and are also the theme of the transformation and upgrading of the manufacturing industry. This paper concentrates on studying the energy-efficient hybrid flowshop scheduling problem with consistent sublots (HFSP_ECS) with the obje...
Due to the multiple factory production pattern is becoming increasingly apparent, the distributed permutation flowshop scheduling problem (DPFSP) and its extension are studied. In this study, we consider the no buffers between adjacent machines and the setup time of adjacent jobs in DPFSP, and formed a distributed blocking flowshop scheduling probl...
This paper introduces a new flow shop combinatorial optimization problem, called the blocking hybrid flow shop group scheduling problem (BHFGSP). In the problem, no buffers exist between any adjacent machines, and a set of jobs with different sequence-dependent setup times needs to be scheduled and processed at organized manufacturing cells. We ver...
The hybrid flow shop scheduling problem (HFSP) is one of the most relevant optimization problems in manufacturing industry. This paper aims to minimize the makespan for a hybrid flow shop scheduling problem with blocking constraints (BHFSP), which is an extension of traditional HFSP and has more practical significance. We construct the mathematical...
With the increase in production levels, a pattern of industrial production has shifted from a single factory to multiple factories, resulting in a distributed production model. The distributed flowshop scheduling problem (DPFSP) is of great research significance as a frequent pattern in real production activities. In this paper, according to real-w...
Automated Guided Vehicles (AGVs) have become indispensable transportation tools in intelligent production workshops. The current AVG scheduling system has almost no processing capacity for temporary special cases and mostly depends on the path planning part to solve them, which can only reduce the cost waste caused to a certain extent. A dynamic AG...
Research in robotic scheduling has gained significant focus, especially for multi-factory manufacturing systems. In addition, production orders should be considered during the scheduling procedure. Therefore, this study considers an extension of the distributed permutation flow shop problem (DPFSP) with order constraints, in which the jobs of the s...
To meet the multi-cooperation production demand of enterprises, the distributed permutation flow shop scheduling problem (DPFSP) has become the frontier research in the field of manufacturing systems. In this paper, we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup times. To solve DPFSPs, s...
Copy number variation (CNV), is defined as repetitions or deletions of genomic segments of 1 Kb to 5 Mb, and is a major trigger for human disease. The high-throughput and low-cost characteristics of next-generation sequencing technology provide the possibility of the detection of CNVs in the whole genome, and also greatly improve the clinical pract...
The outbreak of the novel coronavirus clearly highlights the importance of the need of effective physical examination scheduling. As treatment times for patients are uncertain, this remains a strongly NP-hard problem. Therefore, we introduce a complex flexible job shop scheduling model. In the process of physical examination for suspected patients,...
In recent years, sustainable development and green manufacturing have attracted widespread attention to environmental problems becoming increasingly serious. Meanwhile, affected by the intensification of market competition and economic globalization, distributed manufacturing systems have become increasingly common. This paper addresses the energy-...
In this study, we propose an efficient optimization algorithm that is a hybrid of the iterated greedy and simulated annealing algorithms (hereinafter, referred to as IGSA) to solve the flexible job shop scheduling problem with crane transportation processes (CFJSP). Two objectives are simultaneously considered, namely, the minimization of the maxim...
The distributed hybrid flowshop scheduling (DHFS) problem is a common scheduling problem that has been researched in both academic and industrial fields during recent years. The uncertainty levels in realistic applications are generally too high to be represented by a deterministic value or a triangular fuzzy number (TFN) value. Considering the DHF...
Lot streaming is the most widely used technique of supporting the overlap of consecutive operations. Inspired by the real-world scenarios, this paper introduces this issue into the hybrid flowshop scheduling problem with consistent sublots (HFSP_CS). The innovations of this paper lie in developing a mixed integer linear programming (MILP) model, an...
Distributed flow shop scheduling is a very interesting research topic. This paper studies the distributed permutation flow shop scheduling problem with mixed no-idle constraints, which have important applications in practice. The optimization goal is to minimize total flowtime. A mixed-integer linear programming model is presented and an Adaptive I...
Abstract In recent years, with the advent of robust solvers such as Cplex and Gurobi, constraint programing (CP) has been widely applied to a variety of scheduling problems. This paper presents CP models for formulating four scheduling problems with minimal makespan and complex constraints: the no‐wait hybrid flow shop scheduling problem, the hybri...
Distributed flexible job shop scheduling has attracted research interest due to the development of global manufacturing. However, constraints including crane transportation and energy consumption should be considered with the realistic requirements. To address this issue, first, we modeled the problem by utilizing an integer programming method, whe...
This paper investigates the electric vehicle routing problem with time windows and nonlinear charging constraints (EVRPTW-NL), which is more practical due to battery degradation. A hybrid algorithm combining an improved differential evolution and several heuristic (IDE) is proposed to solve this problem, where the weighted sum of the total trip tim...
In this study, the flexible task scheduling problem in a cloud computing system is studied and solved by a hybrid discrete artificial bee colony (ABC) algorithm, where the considered problem is firstly modeled as a hybrid flowshop scheduling (HFS) problem. Both a single objective and multiple objectives are considered. In multiple objective HFS pro...
With the global warming problem and increasing energy cost, manufacturing firms are paying more and more attention to reducing energy consumption. This paper addresses the distributed flexible job shop scheduling problem (DFJSP) with minimizing energy consumption. To solve the problem, firstly, a novel mixed integer linear programming (MILP) model...
The flexible job shop problem (FJSP), as one branch of the job shop scheduling, has been studied during recent years. However, several realistic constraints including the transportation time between machines and energy consumptions are generally ignored. To fill this gap, this study investigated a FJSP considering energy consumption and transportat...
The resource-constrained hybrid flowshop problem (RCHFS) has been investigated thoroughly in recent years. However, the practical case that considers both resource-constrained and energy consumption still has rare research. To address this issue, a discrete imperialist competitive algorithm (DICA) was proposed to minimize the makespan and energy co...
The resource constrained scheduling problem has been investigated widely in recent years, and many heuristic algorithms have been applied to solve this problem. In this study, we propose a discrete imperialist competitive algorithm (DICA) to solve a variety of resource-constrained hybrid flowshop scheduling problems with the objective of minimizing...
In practical applications, particularly in flexible manufacturing systems, there is a high level of uncertainty. A type-2 fuzzy logic system (T2FS) has several parameters and an enhanced ability to handle high levels of uncertainty. This study proposes an improved artificial immune system (IAIS) algorithm to solve a special case of the flexible job...
In the multi-chiller of the air conditioning system, the optimal chiller loading (OCL) is an important research topic. This research is to find the appropriate partial load ratio (PLR) for each chiller in order to minimize the total energy consumption of the multi-chiller under the system cooling load (CL) requirements. However, this optimization p...
In this study, we consider a canonical vehicle routing problem (VRP) in the cold chain logistic system, where three special constraints are included, i.e., the dispatching time windows for each customer, different types of vehicles, and different energy consumptions and capacities for each vehicle. The objective is to minimize the total cost includ...
This article is concerned with the problem of adaptive neural controller design for multi-input/multi-output nonlinear systems with input-saturations and disturbances. In the proposed design mechanism, we will take advantage of hyperbolic tangent functions to smooth the sharp corners of the input saturations and use Young's inequality to handle the...
Sustainable scheduling problems have been attracted great attention from researchers. For the flow shop scheduling problems, researches mainly focus on reducing economic costs, and the energy consumption has not yet been well studied up to date especially in the blocking flow shop scheduling problem. Thus, we construct a multi-objective optimizatio...
Copy number variation (CNV) is a very important phenomenon in tumor genomes and plays a significant role in tumor genesis. Accurate detection of CNVs has become a routine and necessary procedure for a deep investigation of tumor cells and diagnosis of tumor patients. Next-generation sequencing (NGS) technique has provided a wealth of data for the d...
Flexible job shop scheduling has been widely researched due to its application in many types of fields. However, constraints including setup time and transportation time should be considered simultaneously among the realistic requirements. Moreover, the energy consumptions during the machine processing and staying at the idle time should also be ta...
In some special rescue scenarios, the needed goods should be transported by drones because of the landform. Therefore, in this study, we investigate a multi-objective vehicle routing problem with time window and drone transportation constraints. The vehicles are used to transport the goods and drones to customer locations, while the drones are used...
Machine recovery is met from time to time in real-life production. Rescheduling is often a necessary procedure to cope with it. Its instability gauges the number of changes to the existing scheduling solutions. It is a key criterion to measure a rescheduling solution’s quality. This work aims at solving a flexible job shop problem with machine reco...
Recent years, the multi-objective evolutionary algorithm based on decomposition (MOEA/D) has been researched and applied for numerous optimization problems. In this study, we propose an improved version of MOEA/D with problem-specific heuristics, named PH-MOEAD, to solve the hybrid flowshop scheduling (HFS) lot-streaming problems, where the variabl...
Prefabricated construction has attracted research interest as it can significantly improve the energy, cost, and time efficiency of construction. However, dispatching the required prefabricated components to construction sites in a prefabricated system is challenging. To address this issue, we modeled the dispatching problem as a special type of ve...
In this study, an improved invasive weed optimisation (CMIWO) algorithm is investigated to solve the dynamic economic dispatch (DED) problem with valve-point effects. In the proposed algorithm, a hybrid operator including selective crossover, random mutation and row crossover is proposed to improve the exploration and exploitation abilities. Moreov...
In this article, an adaptive approximation-based output-feedback tracking control scheme is presented for a class of stochastic switched lower-triangular nonlinear systems with input saturation and unmeasurable state variables. First, to overcome the design obstacle caused by the nondifferential saturation nonlinearity, a carefully selected nonline...
In this article, we propose a hybrid artificial bee colony (ABC) algorithm to solve a parallel batching distributed flow-shop problem (DFSP) with deteriorating jobs. In the considered problem, there are two stages as follows: 1) in the first stage, a DFSP is studied and 2) after the first stage has been completed, each job is transferred and assemb...
This paper investigates the finite-time adaptive neural control and almost disturbance decoupling problems for multi-input/multi-output (MIMO) nonlinear systems with disturbances and non-strict-feedback structure. In the design procedure of the adaptive controller, neural networks are employed to estimate the unknown nonlinearities and Young’s ineq...
This paper dedicates to dealing with the adaptive neural design problem for uncertain stochastic nonlinear systems with non-lower triangular pure-feedback form and input constraint. On the basis of the mean-value theorem, the pure-feedback structure is first transformed into the desired affine structure, and then the well-known backstepping technol...
In this study, we propose an improved iterated greedy algorithm for solving the distributed permutation flowshop problem, where there is a single robot in each factory and the makespan needs to be minimized. In the problem considered, the robot is used to transfer each job from the predecessor machine to the successor machine. A blocking constraint...
q‐Rung orthopair fuzzy sets (q‐ROFSs), originally presented by Yager, are a powerful fuzzy information representation model, which generalize the classical intuitionistic fuzzy sets and Pythagorean fuzzy sets and provide more freedom and choice for decision makers (DMs) by allowing the sum of the qth power of the membership and the qth power of the...
A q‐rung orthopair uncertain linguistic set can be served as an extension of an uncertain linguistic set (ULS) and a q‐rung orthopair fuzzy set, which can also be treated as a generalized form of the existing intuitionistic ULS and Pythagorean ULS. The new linguistic set uses the uncertain linguistic variable to express the qualitative evaluation i...
This paper studies a hot rolling batch scheduling problem in compact strip production (CSP), which is decomposed into a two-stage problem. The first stage is the strip combination problem aimed at determining the strip combination of each rolling turn and the number of rolling turns with the objective of minimizing the number of virtual strips, and...
With the trend of manufacturing globalization, distributed production has attracted wide attention from the industry and academia. Nevertheless, there has been little research on the distributed hybrid flowshop scheduling (DHFS) problem. To make up for the gap, this study aims to solve the DHFS problem, in which multiple factories with hybrid flows...
One of the most important and widely faced optimization problems in real applications is the interval multiobjective optimization problems (IMOPs). The state-of-the-art evolutionary algorithms (EAs) for IMOPs (IMOEAs) need a great deal of objective function evaluations to find a final Pareto front with good convergence and even distribution. Furthe...
In this paper, the problem of adaptive neural tracking control for a type of uncertain switched nonlinear nonlower-triangular system is considered. The innovations of this paper are summarized as follows: 1) input to state stability of unmodeled dynamics is removed, which is an indispensable assumption for the design of nonswitched unmodeled dynami...
In this study, a hybrid invasive weed optimization (HIWO) algorithm that hybridizes the invasive weed optimization (IWO) algorithm and genetic algorithm (GA) has been proposed to solve economic dispatch (ED) problems in power systems. In the proposed algorithm, the IWO algorithm is used as the main optimizer to explore the solution space, whereas t...
In this paper, we address the adaptive neural tracking control problem for a class of uncertain switched stochastic nonlinear pure-feedback systems with nonlower triangular form. The significant design difficulty is the completely unknown nonlinear functions with all state variables that can neither be directly estimated by radial basis function (R...
The data for "An Improved Brain Storm Optimization for a Hybrid Renewable Energy System"
This paper proposes an improved artificial bee colony (IABC) algorithm for addressing the distributed flow shop considering the distance coefficient found in precast concrete production system, with the minimization of the makespan. In the proposed algorithm, each solution is first represented by a two-dimensional vector, where the first dimensiona...
Distributed assembly permutation flowshop scheduling problem (DAPFSP) has important applications in modern assembly systems. In this paper, we present three variants of the discrete invasive weed optimization (DIWO) for the DAPFSP with total flowtime criterion. For solving such a problem, we present a two-level representation that consists of a pro...
In this paper, an improved brain storm optimization (BSO) algorithm is proposed to solve the optimization problem in a hybrid renewable energy system. The objective of the proposed algorithm is the minimization of the annualized costs of the system (ACS), the loss of power supply probability (LPSP), and the total fuel emissions. In the proposed alg...
Blocking lot-streaming flow shop scheduling problem with stochastic processing time has a wide range of applications in various industrial systems. However, this problem has not yet been well studied. In this paper, the above problem is transformed into a determinate multi-objective optimization one using Monte Carlo sampling method. A Multi-Object...
This paper develops an adaptive radical basis function (RBF) neural-network-based controller design strategy that uses integral Lyapunov functions for a class of non-strict-feedback nonlinear systems subject to perturbations. The design difficulty caused by the non-strict-feedback system structure is handled by using the inherent property of the sq...
How to select an appropriate and effective health-care waste treatment technology (HCW-TT) is an especially important task in the management of health-care waste (HCW), which can be regarded as a typical multi-attribute group decision making (MAGDM) problem. In the selection of HCW-TT, the expression of evaluation information given by decision make...
The interval data from different surveyed persons for one linguistic word can reflect the intra- and inter-uncertainties of the word. This study shows how to construct shadowed set models for linguistic words based on the surveyed interval data. Firstly, corresponding to the popularly used fuzzy sets for linguistic words, four kinds of shadowed set...
This paper proposes a novel adaptive intelligent tracking controller design scheme for a type of nonlinear delayed systems with completely unknown nonlinearities and non-strict-feedback structure. In the backsteppping-based design architecture, the intelligent estimation technique is utilized to approximate the unknown nonlinear functions via neura...
In this paper, an adaptive neural-network-based dynamic surface control (DSC) method is proposed for a class of stochastic interconnected nonlinear nonstrict-feedback systems with unmeasurable states and dead zone input. First, an appropriate state observer is constructed to estimate the unmeasured state variables of the stochastic interconnected s...
Lot-streaming scheduling problem has been an active area of research due to its important applications in modern industries. This paper deals with the lot-streaming flowshop problem with sequence-dependent setup times with makespan criterion. An effective discrete invasive weed optimization (DIWO) algorithm is presented with new characteristics. A...
Many optimization problems exist in the world. The Vehicle Routing Problem (VRP) is a relatively complex and high-level issue. The ant colony algorithm has certain advantages for solving the capacity-based vehicle routing problem (CVRP), but is prone to local optimization and high search speed problems. To solve these problems, this paper proposes...
Blocking lot-streaming flow shop (BLSFS) scheduling problems have considerable applications in various industrial systems, however, they have not yet been well studied. In this paper, an optimization model of BLSFS scheduling problems is formulated, and an improved migrating birds optimization (iMBO) algorithm is proposed to solve the above optimiz...
A modified multi-objective evolutionary algorithm based on decomposition (MOEA/D) is used to solve the optimal chiller loading (OCL) problem. In a multi-chiller system, the chillers are usually partially loaded for most of the running time. If the chillers are unreasonably managed, their consumption noticeably increases. To reduce power consumption...
Assembled building flow distribution has become the main problem facing the industry. The vehicle routing problem (VRP) is the key link in the distribution system. This article systematically summarizes the classification of common and the basic algorithm of VRP problems. It fully understands the commonly used and efficient heuristic algorithms for...