# Production Task Allocation Decision Based on Cloud Robot Cell-Line

Authors: Yi Du; Yongqiang Wang; Jialin Wang; Tianpeng Zhang
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

Cloud manufacturing is a new service-oriented efficient and low-consumption agile manufacturing mode integrating information, manufacturing, Internet of Things, and other technologies. One of the key decisions of production enterprises is production task allocation based on cloud robot cell-line, which determines the efficiency and flexibility of the production system and affects various production links, such as job-shop logistics, production planning, and production scheduling. This paper explores the production task allocation, from the angle of the optimal combination of cloud manufacturing resources. First, a mathematical model was established, based on the transport cost of different sub-tasks and the tardiness cost of product delivery, and solved by quantum firefly algorithm (QFA). Next, QFA was proved superior to traditional firefly algorithm (FA), improved FA, and the FA optimized by cat swarm optimization (CSO-FA), in terms of time complexity and spatial complexity. The research enriches the theory and methodology of allocating operation-level cloud manufacturing resources based on cloud robot cell-line and provides decision support to manufacturers, which want to implement operation-level allocation of cloud manufacturing resources based on cloud robot cell-line.


---

## Body

## 1. Introduction

Big manufacturers like China are improving the intelligence level of the manufacturing industry. Cloud intelligence can increase the utilization efficiency of production lines, lower the production cost, and avoid repeated investment and construction, contributing to the improvement of our living standards.Unlike traditional flow lines, the cell-line combines a few similar stations into a novel type of production line. There are two advantages of the cell-line: First, it is of the same production efficiency as a conveyor belt flow line. Second, the flexible production of production units adapts well to the market needs of various small batches of products. Therefore, the cell-line is regarded as an ideal production mode to realize massive customization. Besides, the cell-line provides a green and economic production method.Scholars at home and abroad have explored robotic automation production lines extensively. Focusing on the variable process pathway, Tian et al. [1] established a minimum delay time function and constructed a scheduling module, in the light of collaborative, differentiated agents. In addition, agents were adopted to realize global optimization, aiming to minimize the makespan. Zacharia and Nearchou [2] summarized the features of job-shop scheduling with multiple robotic manufacturing units, created a mathematical model for minimizing the makespan of the problem, and solved the model effectively with a hybrid genetic algorithm. Liu et al. [3] utilized the minimum completion time to solve the flexible job-shop scheduling with loading/unloading robots, established a mathematical model of the problem, and searched for the scheduling results with a tabu search and greedy algorithm. Miyake [4] used the minimum production cycle to solve the multi-process job-shop scheduling with transport time, constructed a nonlinear mathematical model, and solved the model with improved genetic algorithm, realizing batch scheduling. Du et al. [5] explored the reconstruction and scheduling of multi-stage variable-batch production lines in labor-intensive enterprises, adopted different algorithms for production lines of different scales, and compared the applicable scopes of two joint optimization algorithms with examples. Wu et al. [6] studied the optimal control of event-driven conveyor belt feeding and processing system.There are some limitations that present opportunities for future research. Our Stackelberg game modeled the operator as the leader and the suppliers as the followers. It might be beneficial for practical applications to explore other power structures. In future research, a supplier-led power structure (e.g., a large-scale enterprise building a platform) could be an important extension of this model. Moreover, we studied two types of substitutable cloud services that can satisfy client demands. In reality, there might be multiple types of cloud services that meet the same requirement. Future research should consider the case of multiple types of substitutable cloud services in the CMfg system.Cao et al. [7] stated that there are some limitations that present opportunities for future research. Our Stackelberg game modeled the operator as the leader and the suppliers as the followers. It might be beneficial for practical applications to explore other power structures. In future research, a supplier-led power structure (e.g., a large-scale enterprise building a platform) could be an important extension of this model. Moreover, we studied two types of substitutable cloud services that can satisfy client demands. In reality, there might be multiple types of cloud services that meet the same requirement. Future research should consider the case of multiple types of substitutable cloud services in the CMfg system. Carlucci et al. [8] observed that a key limitation of the research is the use of homogeneous resources shared in the network. Future research could take into account different categories of resources that are characterized by different rules in order to determine the win or lose state. Another important research issue to further investigate is the dynamic composition of the network based on the obtained performance, i.e., how the participant in the network can decide to enter or leave the network.To sum up, there are very few studies on cell-line cloud manufacturing resource scheduling based on cloud robots, which could avoid resource waste, repetitive building of production lines, and low utilization of units. This paper explores production task allocation from the angle of the optimal combination of cloud manufacturing resources. Specifically, a mathematical model was established based on the transport cost of different sub-tasks and the tardiness cost of product delivery, and solved by quantum firefly algorithm (QFA). The effectiveness of the model and algorithm was demonstrated through example analysis.At present, there are many researches on the single technology of cloud manufacturing. With the in-depth research and application of cloud manufacturing, the cloud manufacturing service platform oriented to the whole life cycle of products will become the next research hotspot. New product development is an important life cycle stage of complex electronic products. There are very few researches on cloud manufacturing resource scheduling of the Japanese unit production line based on cloud robot. However, the results of researches can avoid the waste of resources, repeated line construction, and low utilization rate of units.The driving effect of electronic information industry to China's economic growth is showing a sustained and scale of growth. Moreover, the promotion and penetration effect to the upgrading of traditional industrial structure gradually increases. The high-tech industry represented by the electronic information industry has developed far faster than the traditional industry, and the export of high-tech products has shown a rapid growth trend. By observing the development of electronic information industry and the track of technological upgrading, it is concluded that China has a strong and obvious comparative advantage in processing and assembly, and the manufacturing of electronic information products in the world is forming a tendency to be concentrated in some areas of China. First, due to the epidemic, foreign orders have increased, and some manufacturers have blindly expanded production scale, resulting in serious excess production capacity. However, some manufacturers have insufficient orders and idle production resources. Second, the processing technology of small batch products is more and more complex and often the production resources of an enterprise cannot meet the requirements of product processing. The cloud platform can contact enterprises in multiple regions to complete manufacturing resource scheduling tasks together.


## 2. Problem Formulation

In 2010, James first put forward the definition of “cloud” robot; it points out that the cloud robotics is robot to store and retrieve information, such as a robot with a camera around the photo upload cloud server, a search on the server, find the similar photos, to plan the robot path tracing, and store the pictures, as search information for the back of the machine. All robots can share this library to reduce the developer effort and time.Suppose there are requests forI types of products on the cloud platform. Each product request contains N sub-tasks Fi, i = {1, 2, …, N} to be processed on k intelligent cloud scheduling production lines. Each sub-task contains Pi operations, and Ki optional production lines. The production task can be expressed as follows:(1)F=minf1f2,where f1 is the minimum processing time of the manufacturing resources of a task, which depends on the sub-task with the longest processing time:(2)f1=minmax∑t=1T∑i=1I∑k=1KetikεtiLtik+xk,k+iqtikhti,where eikt is a 0–1 variable (if eikt = 1, product i is processed through t stages on production line k; if eikt = 0, product i is not processed through t stages on production line k); εti is the number of product i through t stages; likt is the processing time of product i through t stages on production line k; qtik is the transport time of 1,000 products i from production line k to production line k+1; xk,k + i is a 0–1 variable (if xk,k + i = 1, product i is transported from production line k to production line k+1 through t stages; if xk,k + i = 0, product i is not transported from production line k to production line k+1 through t stages); hti is the multiple of 1,000 products i through t stages.f2 is the minimum cost of all sub-tasks of manufacturing resource processing:(3)f2=minmax∑t=1T∑i=1I∑k=1KetikεtiCtik+fitk−sitk∗dit,where Ctik is the manufacturing cost of product i through t stages on production line k; fitk is the processing time of product i through t stages on production line k (including transport time); sitk is the delivery period of product i through t stages on production line k; and ditfitk is the tardiness cost constraint of product i through t stages.The processing of the current operation of a sub-task should not begin before the completion of the previous operation:(4)∑k=1Mijeijkt=1,where tendij and tstartij+1 are the completion time of the previous operation and the start time of the current operation, respectively.Operation is the minimum granularity of scheduling. Each operation can only occupy one logic manufacturing resource.


## 3. Algorithm Design

The QFA is designed in the following steps [9–14]. First, a swarm of h quantum fireflies is generated. Each quantum firefly has a quantum position and a position. The position of each quantum firefly is represented by a D-dimensional numerical string {0, 1}, with D being the dimensionality of the solution space. In the t-th iteration, the quantum position of the i-th quantum firefly can be expressed as follows:(5)vit=αi1tαi2t...αi1Dtβi1tβi2t...βiDt,where αilt2+βilt2=11=1,2,…,D. The quantum positions αilt and βilt satisfy 0 ≤αilt≤1, and 0 ≤βilt≤1. At the beginning, all the quantum positions of the quantum fireflies are initialized as 1. For simplicity, the quantum position of the i-th quantum firefly in the t-th iteration can be denoted as vit=vi1t,vi2t,…,viDt (i = 1, 2, ..., h). The position of a quantum firefly can be derived from the measured quantum position. The position of the i-th quantum firefly can be expressed as xit=xi1t,xi2t.…xiDt (i = 1, 2, ..., h). The global optimal position of the i-th quantum firefly in the t-th iteration can be expressed as pgt=pg1t,pg2t,…,pgDt.According to the fluorescein update rule, the fitness Fpit of quantum firefly i (i = 1, 2, ..., h) at the local optimal position in the t-th iteration can be converted into fluorescein Lit:(6)Lit=1−γLit−1+εFpit,where γ∈0,1 is the disappearance rate of fluorescein, which gradually weakens with the growing distance and media absorption; ε is the update rate of fluorescein. The i-th quantum firefly obtains the learning neighborhood by certain rules. The quantum fireflies are selected from the neighborhood based on the fluorescein value and position similarity. In the t-th iteration, the i-th quantum firefly obtains the learning neighborhood by the following equation:(7)Nit=q|D−diqt≤rit且Lit≤Lqt,where Nit is the set of labels of the learning neighborhood of the i-th quantum firefly; diqt is the distance between the local optimal positions of the i-th and q-th quantum fireflies; rit is the radius of the dynamic decision domain of the i-th quantum firefly; and Lqt is the fluorescein value of the q-th quantum firefly in the t-th iteration. The number of quantum fireflies in the learning neighborhood equals the number of labels in the label set of that neighborhood in the current iteration.In each iteration, each quantum firefly selects its moving direction according to the quantum fireflies in the neighborhood. In the t-th iteration, the probability for the i-th quantum firefly to move to the q-th quantum firefly in its neighborhood can be expressed as(8)Piq′=Lqt−Lit∑j=NitLjt−Lit.In each iteration, if the learning neighborhood of the i-th quantum firefly is empty, then the evolution of the l-th dimensional quantum position of that quantum firefly can be expressed as follows:(9)vilt+1=Nviltθilt+1=0andμilt+1<c1absUθilt+1vilt,where quantum rotation angle θilt+1=e1pilt−xilt+e2pglt−xilti=1,2,...,h;l=1,2,...,D;e1 and e2 are the degree of influence of local optimal position and global optimal position on quantum rotation angle, respectively; μilt+1 is a random number uniformly distributed in [0, 1]; c1, a constant in [0, 1/D], is the mutation probability of the quantum position at the quantum rotation angle of 0; abs. is the absolute value that limits each dimension of the quantum position in [0, 1]; Uθilt+1  =  cosθilt+1sinθilt+1−sinθilt+1cosθilt+1 is the quantum rotation gate; and N¯=0110=0110 is the quantum NOT gate.If the learning neighborhood of the i-th quantum firefly is not empty, each quantum firefly labeledz in the neighborhood satisfies z =  argmaxq∈NitmaxPiq¯t. In the t-th iteration, then the evolution of the l-th dimensional quantum position of the i-th quantum firefly can be expressed as follows:(10)vilt+1=N¯viltθilt+1=0andμilt+1<c2absUθilt+1vilt,where quantum rotation angle θilt+1=e3pilt−xilt+e4pzlt−xilt++e5pglt−xilt;i=1,2,...,h;l=1,2,...,D;pzlt is the l-th dimension of the local optimal position, i.e., the position with the highest fluorescein, in the learning neighborhood of the i-th quantum firefly; e3,e4, and e5 are the degree of influence of the local optimal position of the i-th quantum firefly, the local optimal position, i.e., the position with the highest fluorescein, in the learning neighborhood of the i-th quantum firefly, and the global optimal position of the i-th quantum firefly on quantum rotation angle, respectively; c2, a constant in [0, 1/D], is the mutation probability of the quantum position at the quantum rotation angle of 0. The position of the i-th quantum firefly can be derived from the measured quantum position:(11)xilt+1=1,ηilt+1>αilt+120,ηilt+1≤αilt+12,where l = 1,2, ..., D; ηilt+1∈0,1 is a random number obeying uniform distribution; αilt+12 is the probability of zero appearing at quantum position vilt+1.The radius of the dynamic decision domain of the i-th quantum firefly can be updated by the following expression:(12)rit+1=minRs,max0,rit+ζnt−sizeNit,where ζ is a constant update rate of the dynamic decision domain; Rs≥rit is a constant perception domain; min and max are the minimum and maximum functions, respectively; nt is the parameter controlling the number of quantum fireflies in the learning neighborhood; and sizeNit is the number of quantum fireflies in the learning neighborhood of the i-th quantum firefly.For the cloud scheduling of production line, the fitness function of the QFA should minimize the production time of the production line. After computing the maximum production time and cost of cloud scheduling, the minimization of the two values is adopted as the optimization goal. Then, the fitness function of the current positionxit=xi1t,xi2t,…,xiDt (i = 1,2, ..., h) of the i-th firefly can be expressed as follows:(13)Fxit=−MSLLxit,IFcrat≤erat−ρ.MSLLxit,where MSLLxit is the maximum production time and cost of cloud scheduling constructed by xit; ρ≤1;crat and erat are the calculated and expected coverage rates, respectively [15–19].Based on the QFA, the production time and cost of the cloud manufacturing production line can be minimized through the following steps:Step 1.
Establish the mathematical model of the production time and cost of cloud computing production line, determine the key parameters of the QFA corresponding to the production time and cost, initialize the quantum positions of quantum fireflies, and measure their positions.Step 2.
Map the position of each quantum firefly to the corresponding parameters of the established model, import these parameters to the fitness function, compute the fitness at the position of the quantum firefly, and determine the local and global optimal positions according to the fitness.Step 3.
Update the fluorescein value and learning neighborhood of each quantum firefly, according to the fitness at the local optimal position of that quantum firefly.Step 4.
Change the quantum position of each quantum firefly with new data.Step 5.
Change the radius of the dynamic decision domain of each quantum firefly with new data.Step 6.
Compute the fitness of each firefly at the new position by the fitness function and determine the local and global optimal positions according to the fitness again.Step 7.
If the maximum number of iterations is reached, execute Step8; otherwise, return to Step 3.Step 8.
Output the global optimal position [20–25].(Flow chart as Figure 1)
The test example and calculation results are shown in Tables1 and 2, respectively.Figure 1
Program flow chart.Table 1
Example of cloud manufacturing resource allocation.
Orderdi (10,000 yuan/1,000 pieces/day)SuborderProduction linecik (10,000 yuan/1,000 pieces)lik/dayJ11F1,1K3/ K5/ K73/3/55/5/3F1,2K1/ K6/ K75/8/88/5/5F1,3K3/ K56/33/6F1,4K5/ K94/33/4J21F2,1K4/ K910/44/10F2,2K2/ K5/ K108/5/44/5/8F2,3K3/ K83/55/3F2,4K1/ K3/ K76/2/62/6/2J31F3,1K3/K9/K104/3/43/4/3F3,2K1/K5/K103/4/34/3/4F3,3K3/K4/K93/6/46/3/4J41F4,1K2/K4/K73/6/46/3/4F4,2K1/K6/K86/8/78/6/7F4,3K1/K4/K105/8/78/5/7F4,4K5/K6/K95/9/35/3/9J51F5,1K5/K6/K92/6/26/2/6F5,2K3/K43/77/3F5,3K2/K7/K105/4/33/4/5F5,4K1/K3/K5/K84/3/4/64/6/4/3J61F6,1K2/K65/66/5F6,2K4/K5/K106/4/64/6/4F6,3K2/K6/K98/10/68/6/10F6,4K4/K7/K1010/7/55/7/10J71F7,1K3/K63/88/3F7,2K2/K85/55/5F7,3K3/K84/77/4F7,4K2/K6/K93/7/23/2/7F7,5K2/K4/K85/4/65/6/4J81F8,1K1/K6/K105/6/66/5/5F8,2K1/K5/K73/3/99/9/3F8,3K3/K6/K93/6/46/3/4F8,4K2/K3/K85/3/43/5/4F8,5K1/K5/K85/3/43/5/4F8,6K1/K9/K105/4/45/5/4Table 2
Transport cost.
Production line transport cost (10,000 yuan/1,000 pieces)/(day/1,000 pieces)K1K2K3K4K5K6K7K8K9K10K10/02/11/0.52/13/1.52/14/24/21/0.52/1K23/0.50/02/13/1.51/0.52/12/13/1.52/11/0.5K32/0.53/1.50/01/0.52/23/1.52/12/13/1.53/1.5K41/0.52/12/10/01/0.53/1.53/1.52/13/1.52/1K51/0.53/1.51/0.53/1.50/02/14/23./1.52/13/1.5K62/0.52/12/14/22/10/03/1.53/1.54/22/1K73/0.53/1.53/1.53/1.52/13/1.50/02/13/1.52/1K82/0.53/1.53/1.52/12/12/12/10/02/13/1.5K93/0.52/14/22/13/1.54/23/1.51/0.50/03/1.5R101/0.52/12/13/1.52/15/2.52/13/1.53/1.50/0


## 4. Example Analysis

Two swarms were initialized in our example. For convenience, each type of the product can be used after completion one production cycle. The initial swarms 1 and 2 were combinations of ones in each row of Table1. Our algorithm IFA was compared with traditional firefly algorithm (FA), improved FA, and the FA optimized by cat swarm optimization (CSO-FA). The swarm size for all these intelligent optimization algorithms was fixed at 50(Set in the program). The maximum number of iterations was set to 350 (Set in the program), the expected coverage rate to 0.7(In (13), erat is the expected filling rate), ρ  = 0.001 (In Formula (13) ρ≤1), the update rate of dynamic decision domain to 0.8 (Formula (12) ζ is the update rate of the dynamic decision domain), the initial fluorescein value to 5, e1=0.06e2=0.03e3=0.06e4=0.03, e5=0.01, θilt+1=e3pilt−xilt+e4pzlt−xilt++e5pglt−xilt;i=1,2,...,h;l=1,2,...,D;pzlt and e2 are the degree of influence of local optimal position and global optimal position on quantum rotation angle, θilt+1=e3pilt−xilt+e4pzlt−xilt++e5pglt−xilt;i=1,2,...,h;l=1,2,...,D;pzlt is the l-th dimension of the local optimal position, i.e., the position with the highest fluorescein, in the learning neighborhood of the i-th quantum firefly; e3,e4, and e5 are the degree of influence of the local optimal position of the i-th quantum firefly) and c1  =  c2  = 0.1/D.


## 5. Conclusions

This paper mainly solves the cloud robot scheduling of a cell-line involving various small batches of products, which are produced in multiple cycles, in the light of transport cost. The QFA was adopted to reasonably allocate the resources in the cloud environment. Besides, the ideas of quantum computing were added to the FA to speed up the search, while maintaining the swarm search ability. Compared with the traditional FA, improved FA, and CSO-FA, the proposed QFA (as Figures2 and 3) achieves excellent optimization ability and a fast search speed. Finally, our algorithm was demonstrated through an example analysis on the production order scheduling of an electronic product manufacturer. The results show that the QFA is capable of effectively solving the multiobjective scheduling of cloud manufacturing resources [26, 27].Figure 2
Convergence curves of different algorithms.Figure 3
Operation time of different algorithms.



---

*Source: 5892943-2022-03-24.xml*