# Production Decision Optimization for Iron and Steel Scrap Remanufacturing considering Carbon Emission and Delivery Time

Authors: Changping Liu; Weiyu Zhou
Journal: Complexity
 (2021)

---

## Abstract

Under the requirements of the national carbon reduction target, the recycling and remanufacturing of scrap iron and steel are taken by major iron and steel enterprises as requirements for implementing industrial carbon emission reduction and are incorporated into their production strategies. The scheduling optimization of scrap iron and steel remanufacturing processes plays an important role in the energy saving and emission reduction of iron and steel enterprises. In this paper, a remanufacturing production decision model for scrap iron and steel considering both the product delivery time and carbon emissions was established, and a discrete krill swarm algorithm was designed to solve the multiobjective production decision model. The effectiveness of the model and the algorithm was verified by an example, demonstrating a good decision-making reference for the implementation of energy conservation and emission reduction in iron and steel enterprises.


---

## Body

## 1. Introduction

In traditional production decision-making, only economic indicators related to cost, profit, or quality are considered, and energy consumption indicators related to the environment are seldom considered. Under the constraints of the Kyoto Protocol, countries or regions must decompose their emission reduction targets from the macro level to the micro level of production and operation. As a key industry of energy conservation and emission reduction, the iron and steel industry plays an important role in the national carbon reduction target. The recycling and remanufacturing of scrap iron and steel are included in the production strategies of major iron and steel enterprises as a requirement for implementing industrial carbon emission reduction.At present, many scholars have studied the production decision optimization of remanufacturing enterprises under the influence of carbon emission reduction and have achieved some promising results. Generally speaking, these research results mainly focused on two aspects, the first of which was supply chain management under the consideration of carbon emissions. For example, Amar et al. proposed a carbon market-sensitive strategic planning model for sustainable supply chains [1]. Paksoy et al. studied closed-loop supply chains based on economic and environmental indicators [2]. Benjaafar et al. incorporated carbon emissions into the supply chain system and established an operation decision-making model for a single enterprise under various scenarios, such as a mandatory carbon emission quota and carbon tax and carbon quota trading [3]. Zakeri et al. studied the impact of carbon trading and carbon tax policies on enterprise management performance in a supply chain [4].The second aspect concerned the production decisions of manufacturing/remanufacturing enterprises considering carbon emissions. For example, Letmathe and Balakrishnan constructed the optimal linear model and mixed integer programming model and considered different environmental constraints and production constraints to determine the optimal product portfolio and production quantity. These models can help enterprises analyze the impact of carbon emission quota, carbon tax, and carbon trading cost on their production decisions [5]. Ferrer and Swaminathan studied the two-cycle and multicycle remanufacturing production and pricing problems under oligopoly and duopoly [6]. Du et al. studied the impact of the emission quota and trading mechanisms on the optimal production and operation of enterprises in a deterministic demand market [7]. Chang et al. analyzed the similarities and differences in enterprises’ remanufacturing technology selection behavior and production decisions under different scenarios, such as no carbon emission constraints and carbon quota, carbon tax, carbon subsidy, and carbon rights trading [8–10]. Chen and Xiong studied the manufacturing/remanufacturing decision-making problem under the mandatory emission reduction and carbon rights trading policies and compared the differences of manufacturers’ optimal decision-making under the two kinds of emission reduction policies [11]. In addition, Ren et al., Zhang et al., and Xu et al. studied the impact of carbon emissions on remanufacturing production decisions from different perspectives [12–14].The current research on the production decision-making of remanufacturing enterprises in the context of carbon reduction is mostly carried out at the macro level, and the research perspective is mainly focused on the impact of various carbon reduction factors on enterprises and their corresponding production decision-making. The research at the micro level, especially on specific industries, is relatively lacking. Based on the remanufacturing process for scrap iron and steel, this paper discusses the multiobjective production decision optimization of remanufacturing enterprises considering carbon emissions from the production operation level, and a discrete krill herd optimization algorithm was designed to solve it. The effectiveness of the algorithm was verified by an example, which can provide a reference for the production decision-making of remanufacturing enterprises in the iron and steel manufacturing industry.


## 2. Description of the Problem and Hypothesis

The remanufacturing of scrap iron and steel is a process in which recycled scrap steel is smelted as raw material to produce steel products, including two stages of reprocessing and remelting [15]. In the reprocessing stage, scrap steel remanufacturing enterprises adopt different treatment methods such as shearing, crushing, sorting, cleaning, and preheating to remove the nonferrous metal and nonmetallic impurities in various scrap steel as far as possible, so as to make the recycled scrap iron and steel into a qualified furnace burden for easy loading and transportation and suitable for steelmaking. The remelting stage is used to smelt the scrap steel processed in the reprocessing stage to produce steel products, which mainly includes steelmaking, continuous casting, cold rolling, hot rolling, rough rolling, finishing rolling, pickling, final finishing, annealing, and other processes. The whole process has a long cycle and different process properties.In this paper, it was assumed that the main goal of scrap steel remanufacturing enterprises is to shorten the product delivery time, so as to respond to market changes in a timely manner, to meet customer needs, and to improve customer satisfaction. Second, while meeting the first goal, enterprises hope that the carbon emissions in the production process will be as small as possible. According to the above objectives, the corresponding multiobjective production decision-making model was established. The first decision objective is represented by the minimum makespan of each batch of scrap steel from reprocessing to remelting. For simplicity, it does not consider the time consumption of the other links in the process from the production line to the final delivery. The second decision objective is represented by the minimum carbon emissions in the remanufacturing process of scrap iron and steel. The two decision-making objectives are equally important to scrap remanufacturing enterprises.The carbon emissions of the scrap iron and steel remanufacturing production process are mainly composed of three parts:(1)
The carbon emissions of equipment processing workpiece(2)
The carbon emission of equipment idling(3)
The carbon emission of workpiece waiting for processing [16]Among them, the first part of the carbon emissions, because of the time of machining each workpiece, is determined, so the total carbon emissions generated by machining the same batch of workpieces are the same. Constrained by the process flow of iron and steel processing, the different production decisions have different effects on the carbon emissions of the second and third parts. Experience shows that, in the manufacturing industry, the energy consumed when the equipment is idling accounts for a large proportion of the total energy consumption. Therefore, in the process of scrap steel processing, the equipment should be idling as little as possible. In particular, when the equipment is fully utilized, i.e., the machine is not idling, the carbon emissions of the second part is zero. For the same reason, the less the workpiece has to wait for the equipment to process, the better. When the workpiece does not stay or wait in the machine for the whole processing, that is, when the workpiece is not waiting, the carbon emissions of the third part are zero. Therefore, the second decision-making goal only needs to minimize the carbon emissions of the second and third parts. In the process of steel production, the carbon emissions of the second part are usually much higher than those of the third part.The above two decision-making objectives are contradictory. In order to achieve the first objective, in the whole process of scrap iron and steel processing, each workpiece process should be connected as much as possible, and the waiting time of the workpiece should be as short as possible. Constrained by steel processing technology, this will increase the idling time of the machine, which will increase the carbon emissions accordingly. In the same way, in order to achieve the second goal, the machine should idle as little as possible. Due to the process constraints, the waiting time of the workpiece will be increased, which will prolong the completion time and affect the delivery time.


## 3. Multiobjective Production Decision Model for Scrap Iron and Steel Remanufacturing

According to the above description and assumption, we established the production decision model of scrap iron and steel remanufacturing with two decision objectives, as shown in the following:(1)minf1=Cmax1π,minf2=η⋅Cmax2ω,subject to the following conditions:① The machine uniqueness constraint means that each machine can only process one workpiece at the same time② The uniqueness constraint of the workpiece means that a workpiece cannot be processed on different machines at the same time③ The machining process satisfies the nuninterruptible constraint④ The processing sequence of workpieces on each machine is the same and the time is determined⑤ The order of each workpiece machined is the sameIn the model, the decision objectivef1 is the shortest expected delivery time, the decision objective f2 is the least expected carbon emission, and η is the carbon dioxide emission coefficient. For the iron and steel manufacturing industry, it usually takes 264 kg/kWh, and ①∼⑤ are the constraints of the scrap iron and steel remanufacturing process.Without losing generality, it is assumed that each workpiece is processed in the order of machine 1∼m, and the delivery timeCmax1π in target ① is calculated according to equations (2) and (3):(2)Cj1,k=∑r=1ktj1,r,k=1,…,m,(3)Cji,k=Cji−1,1+∑r=1ktji,r+Δji,i=2,…,n;k=1,…,m,(4)Δji2≤i≤n=maxmax2≤k≤mCji−1,k−Cji−1,1−∑r=1k−1tji,r,0,(5)Cmax1π=Cjn,m.In the above equations,ji|i=1,…,n represents the set of jobs, kl|l=1,…,m represents the set of machines, tji,k represents the processing time of job ji on machine k, and Cji,k represents the completion time of job ji on machine k.Equation (2) shows the completion time of workpiece j1 on machine k; (3) shows the completion time of workpiece jii>1 on machine k; (4) shows the waiting time of workpiece ji due to the limited buffer between machines; in (5), Cmax1π is the completion time of processing n workpieces. We can see that (2)−(5) are a group of recursive equations.Similarly, assuming that each workpiece is processed in the order of machine 1∼m, the completion timeCmax2ω of the minimum carbon emission production decision in goal ② is calculated according to equations (6) and (7):(6)Cmax2ω=Cjn,m=∑k=2mfk−1,kjn+∑i=1ntji,1,(7)Δk−1,kji=tji,k+max0,Δk−1,kji−1−tji,k−1,i=2,3,…,n;k=2,3,…,m.Equations (6) and (7) are recursive equations for calculating Cmax2ω. tji,k represents the processing time of workpiece ji on machine k, and Cji,k represents the completion time of workpiece ji on machine k. Δk−1,kji denotes the completion time difference of workpiece ji on adjacent machines k−1 and kk=2,3,…,m. In particular, there is Δ1,2j1=tj1,2. The meanings of the other symbols are the same as above.


## 4. Multiobjective Production Decision Optimization of Scrap Iron and Steel Remanufacturing Based on the Discrete Krill Herd Algorithm

For multiobjective decision-making problems, there is usually no absolute optimal solution to ensure multiple objectives reach the optimal at the same time, so we need adopt different methods according to the characteristics of specific problems. The remanufacturing process of scrap iron and steel belongs to the flow shop production mode. In the two objective decision-making models of scrap iron and steel remanufacturing established by (1), the first decision-making objective is similar to the no-wait flow shop-scheduling model; the second decision-making objective is similar to the no-idle flow shop-scheduling model. It has been proven that the no-wait and no-idle flow shop-scheduling problems with three machines or more are nondeterministic problems with polynomial complexity. At present, there is no global optimization algorithm with polynomial computational complexity [17, 18]. In this paper, we designed a discrete krill herd optimization algorithm to solve the problem. The test results show that the designed algorithm is effective.


### 4.1. Discrete krill Herd Optimization Algorithm for the Multiobjective Production Decision of Scrap Steel Remanufacturing

The traditional krill herd optimization algorithm was proposed by Gandomi et al. [19], which is mainly used in the field of function optimization [20–23], and the application of combinatorial optimization is rare. In traditional krill herd algorithm, the individual position is encoded by a continuous value vector, and the position update operation is completed in continuous space. The multiobjective production decision-making problem is a combinatorial optimization problem, which needs to design the corresponding coding and location update methods according to the discrete nature of the problem. Based on the mechanism of the krill herd optimization algorithm, we designed a discrete krill swarm optimization algorithm to solve the multiobjective production decision-making problem.


#### 4.1.1. Individual Coding Mode

In the discrete krill herd algorithm, krill individuals are directly represented by integer coding based on an operation sequence, and the position vectorXi|i=1,…,n of krill individual i represents a sort of processing sequence of workpiece πj|j=1,…,m to establish mapping between the individual position and the processing sequence. This coding method is simple and feasible, and all of the solutions are feasible. For example, if the individual position vector is Xi=5,4,1,3,8,7,6,2, the processing sequence mapped to the workpiece is πj=j5,j4,j1,j3,j8,j7,j6,j2, so that the fitness of the scheduling solution corresponding to the individual position of krill can be calculated.


#### 4.1.2. Calculation Method of the Individual Distance

In the krill herd optimization algorithm of the function optimization problem, the distance between individuals is calculated by the Euclidean space distance, which is not suitable for the discrete krill herd optimization algorithm. According to the characteristics of the problem to be optimized, in the discrete krill herd optimization algorithm, the individual position vector is represented by the workpiece processing sequence, and different position vectors represent different processing sequences. Therefore, in the discrete krill herd optimization algorithm, the “individual distance” is represented by the degree of difference in the job processing and sequencing, which is defined as per the following equation:(8)rij=∑s=1nxj,s−xi,sR.In (8), xi,s and xj,s represent the s-th dimension codes of krill individual i and krill individual j, n represents the number of workpieces, and R is the upper limit of the molecular term value, which is calculated according to the following equation:(9)R=n22,n∈even number,n2−12,n∈odd number,where we can infer that rij∈0,1. The size of the “individual distance” reflects the degree of difference in the processing order. The farther the “distance,” the greater the difference between individuals.


#### 4.1.3. Location Update Strategy

Krill individual location updating is the core of the krill herd optimization algorithm. Affected by the three parts of virtual food location, individuals in the neighborhood, and random diffusion motion, the discrete krill herd optimization algorithm was designed for these three parts.


## 4.1. Discrete krill Herd Optimization Algorithm for the Multiobjective Production Decision of Scrap Steel Remanufacturing

The traditional krill herd optimization algorithm was proposed by Gandomi et al. [19], which is mainly used in the field of function optimization [20–23], and the application of combinatorial optimization is rare. In traditional krill herd algorithm, the individual position is encoded by a continuous value vector, and the position update operation is completed in continuous space. The multiobjective production decision-making problem is a combinatorial optimization problem, which needs to design the corresponding coding and location update methods according to the discrete nature of the problem. Based on the mechanism of the krill herd optimization algorithm, we designed a discrete krill swarm optimization algorithm to solve the multiobjective production decision-making problem.


### 4.1.1. Individual Coding Mode

In the discrete krill herd algorithm, krill individuals are directly represented by integer coding based on an operation sequence, and the position vectorXi|i=1,…,n of krill individual i represents a sort of processing sequence of workpiece πj|j=1,…,m to establish mapping between the individual position and the processing sequence. This coding method is simple and feasible, and all of the solutions are feasible. For example, if the individual position vector is Xi=5,4,1,3,8,7,6,2, the processing sequence mapped to the workpiece is πj=j5,j4,j1,j3,j8,j7,j6,j2, so that the fitness of the scheduling solution corresponding to the individual position of krill can be calculated.


### 4.1.2. Calculation Method of the Individual Distance

In the krill herd optimization algorithm of the function optimization problem, the distance between individuals is calculated by the Euclidean space distance, which is not suitable for the discrete krill herd optimization algorithm. According to the characteristics of the problem to be optimized, in the discrete krill herd optimization algorithm, the individual position vector is represented by the workpiece processing sequence, and different position vectors represent different processing sequences. Therefore, in the discrete krill herd optimization algorithm, the “individual distance” is represented by the degree of difference in the job processing and sequencing, which is defined as per the following equation:(8)rij=∑s=1nxj,s−xi,sR.In (8), xi,s and xj,s represent the s-th dimension codes of krill individual i and krill individual j, n represents the number of workpieces, and R is the upper limit of the molecular term value, which is calculated according to the following equation:(9)R=n22,n∈even number,n2−12,n∈odd number,where we can infer that rij∈0,1. The size of the “individual distance” reflects the degree of difference in the processing order. The farther the “distance,” the greater the difference between individuals.


### 4.1.3. Location Update Strategy

Krill individual location updating is the core of the krill herd optimization algorithm. Affected by the three parts of virtual food location, individuals in the neighborhood, and random diffusion motion, the discrete krill herd optimization algorithm was designed for these three parts.


## 4.1.1. Individual Coding Mode

In the discrete krill herd algorithm, krill individuals are directly represented by integer coding based on an operation sequence, and the position vectorXi|i=1,…,n of krill individual i represents a sort of processing sequence of workpiece πj|j=1,…,m to establish mapping between the individual position and the processing sequence. This coding method is simple and feasible, and all of the solutions are feasible. For example, if the individual position vector is Xi=5,4,1,3,8,7,6,2, the processing sequence mapped to the workpiece is πj=j5,j4,j1,j3,j8,j7,j6,j2, so that the fitness of the scheduling solution corresponding to the individual position of krill can be calculated.


## 4.1.2. Calculation Method of the Individual Distance

In the krill herd optimization algorithm of the function optimization problem, the distance between individuals is calculated by the Euclidean space distance, which is not suitable for the discrete krill herd optimization algorithm. According to the characteristics of the problem to be optimized, in the discrete krill herd optimization algorithm, the individual position vector is represented by the workpiece processing sequence, and different position vectors represent different processing sequences. Therefore, in the discrete krill herd optimization algorithm, the “individual distance” is represented by the degree of difference in the job processing and sequencing, which is defined as per the following equation:(8)rij=∑s=1nxj,s−xi,sR.In (8), xi,s and xj,s represent the s-th dimension codes of krill individual i and krill individual j, n represents the number of workpieces, and R is the upper limit of the molecular term value, which is calculated according to the following equation:(9)R=n22,n∈even number,n2−12,n∈odd number,where we can infer that rij∈0,1. The size of the “individual distance” reflects the degree of difference in the processing order. The farther the “distance,” the greater the difference between individuals.


## 4.1.3. Location Update Strategy

Krill individual location updating is the core of the krill herd optimization algorithm. Affected by the three parts of virtual food location, individuals in the neighborhood, and random diffusion motion, the discrete krill herd optimization algorithm was designed for these three parts.


## 5. The Impact of Virtual Food

The average fitness of the krill population is defined as virtual food, and the position is updated by comparing individual fitness with virtual food. The update strategy is shown in the following equation:(10)xit+1=LOXxit⊗xfoodt,iffi≺ffood,PMXxit⊗xgbest,elseiffi≻ffood,MUxit,else,where fi and ffood refer to the fitness of the krill individuals and virtual food, respectively, and t is the current search time. In the process of t+1 search, we compared the fitness of the i-th individual and virtual food. If fi≺ffood, the individual positions xit and xfoodt are crossed in a linear order to form a new individual position, xit+1; otherwise, the individual position xit and the optimal individual xgbest of the current population are crossed in partial mapping to form a new position, xit+1. If the above conditions are not met, the current individual position xit is mutated to produce a new position, xit+1. Among them, the linear order crossover operation can keep the relative position of the process between individuals and the absolute position of the front end of the process as far as possible, and the partial mapping crossover operation can satisfy the pattern theorem to a certain extent, so that the best pattern can be retained as much as possible.


### 5.1. The Influence of Neighborhood Groups on Individuals

According to the definition of the distance between krill individuals in (8), the neighborhood range can be determined, and the position is updated by comparing with the fitness of individuals in the neighborhood. The update strategy is shown in the following equation:(11)xit+1=xit⊗xj∈ngbt,iffxit⊗xj∈ngbt≻fxit,xit,else,where ngb represents the neighborhood range and xjt represents the spatial position of the j-th krill individual within the neighborhood range in the t-th search.The updating process is as follows: in thet+1 round search process, the neighborhood range is determined according to the distance between krill individuals, and individuals in the neighborhood are selected. Individual xit crosses with the selected individual xjt in the neighborhood, and the optimal individual is selected as the new individual, xit+1; if there are no krill individuals in the neighborhood, individual xit crosses with the optimal xgbest to form a new individual.


### 5.2. The Influence of Random Diffusion Motion

After each optimization, a certain proportion of individuals with poor performance are selected for reinitialization to increase the diversity of the population and to maintain the continuous evolution ability of the population.In this way, the position updating formula of the discrete krill herd optimization algorithm can be expressed by the following equation:(12)xit+1=Fxit⊕Nxit⊕Dxit.In the formula (12), Fxit represents the influence of virtual food, Nxit represents the influence of neighborhood groups, and Dxit represents the influence of individual random diffusion motion. The individual position updating of krill is completed by the comprehensive influence of these three aspects.The time complexity of the discrete krill swarm algorithm in this paper isOC⋅MaxT⋅m2, where C is a constant, MaxT is the maximum number of iterations, and m is the number of krill swarm individuals.


### 5.3. Simulation Experiment and Analysis

Aiming at the established multiobjective production decision-making model of scrap iron and steel remanufacturing, the effectiveness of the model and algorithm was verified by simulation experiments. Assuming that there are 20 batches of scrap iron and steel waiting to be processed, each batch of scrap iron and steel needs ten processing procedures, and the processing procedure needs to meet the constraints of steel manufacturing process. The processing time of each batch of scrap iron and steel waiting to be processed in each process is shown in Table1, and the time unit is minutes.Table 1
Processing time matrix.
JobsProcedure12345678910128183811972390527963250307582383928844857375503358564151297597465426629362910841467584684241862395307397633727985815172194848791668788973621596148512310093488474798559586117542571524749861044274019343338939661170947193148384873341260383455632870356888133933538726514293671472354520842310348481510071808947159033972616792357547099855941714233679465785195791833281261959809044331968339437337464502217209417542755347561041The parameters of the multiobjective discrete krill herd optimization algorithm were set as follows: the number of krill swarm,m = 30; the proportion of cross individuals in the neighborhood, 40%; the proportion of reinitialized individuals, 5%; the maximum number of searches, MaxT = 50; independent runs for the algorithm, 20 times. The optimization scheme obtained is shown in Table 2.Table 2
Multiobjective decision-making scheme.
SchemeCorresponding processing sequenceDelivery time (minutes)Carbon emissions (ton)110 13 11 4 9 12 3 18 16 8 6 7 15 5 17 1 2 19 14 2020422106210 13 11 4 9 12 17 1 2 5 8 6 7 15 19 3 18 16 14 2020432050310 13 11 4 9 12 17 1 2 19 3 18 5 8 6 7 15 16 14 2020462015410 20 14 13 11 4 9 12 2 19 3 17 1 18 5 8 6 7 15 1620501981510 13 11 4 12 17 1 18 9 3 2 19 5 8 6 7 15 16 14 2020711968610 1 2 19 3 13 11 4 9 12 17 18 5 8 6 7 15 16 14 2020821954710 17 1 2 19 14 20 13 11 4 9 12 3 18 5 8 6 7 15 1620901930810 13 18 17 1 2 19 3 11 4 9 12 5 8 6 7 15 16 14 2021001918910 17 1 9 12 2 19 3 11 4 20 14 13 18 5 8 6 7 15 16210719131010 1 2 19 3 16 14 13 11 4 9 12 17 18 5 8 6 7 15 2021261892According to the simulation results, we can see that different production decisions have different effects on the delivery date and carbon emissions. Under the constraints of the steel manufacturing process, there is a certain negative correlation between completion time and carbon emissions. The ten production decision schemes listed in Table2 are partial Pareto solutions found by the algorithm, as shown in Figure 1.Figure 1
Pareto solution of the multiobjective remanufacturing production decision.


## 5.1. The Influence of Neighborhood Groups on Individuals

According to the definition of the distance between krill individuals in (8), the neighborhood range can be determined, and the position is updated by comparing with the fitness of individuals in the neighborhood. The update strategy is shown in the following equation:(11)xit+1=xit⊗xj∈ngbt,iffxit⊗xj∈ngbt≻fxit,xit,else,where ngb represents the neighborhood range and xjt represents the spatial position of the j-th krill individual within the neighborhood range in the t-th search.The updating process is as follows: in thet+1 round search process, the neighborhood range is determined according to the distance between krill individuals, and individuals in the neighborhood are selected. Individual xit crosses with the selected individual xjt in the neighborhood, and the optimal individual is selected as the new individual, xit+1; if there are no krill individuals in the neighborhood, individual xit crosses with the optimal xgbest to form a new individual.


## 5.2. The Influence of Random Diffusion Motion

After each optimization, a certain proportion of individuals with poor performance are selected for reinitialization to increase the diversity of the population and to maintain the continuous evolution ability of the population.In this way, the position updating formula of the discrete krill herd optimization algorithm can be expressed by the following equation:(12)xit+1=Fxit⊕Nxit⊕Dxit.In the formula (12), Fxit represents the influence of virtual food, Nxit represents the influence of neighborhood groups, and Dxit represents the influence of individual random diffusion motion. The individual position updating of krill is completed by the comprehensive influence of these three aspects.The time complexity of the discrete krill swarm algorithm in this paper isOC⋅MaxT⋅m2, where C is a constant, MaxT is the maximum number of iterations, and m is the number of krill swarm individuals.


## 5.3. Simulation Experiment and Analysis

Aiming at the established multiobjective production decision-making model of scrap iron and steel remanufacturing, the effectiveness of the model and algorithm was verified by simulation experiments. Assuming that there are 20 batches of scrap iron and steel waiting to be processed, each batch of scrap iron and steel needs ten processing procedures, and the processing procedure needs to meet the constraints of steel manufacturing process. The processing time of each batch of scrap iron and steel waiting to be processed in each process is shown in Table1, and the time unit is minutes.Table 1
Processing time matrix.
JobsProcedure12345678910128183811972390527963250307582383928844857375503358564151297597465426629362910841467584684241862395307397633727985815172194848791668788973621596148512310093488474798559586117542571524749861044274019343338939661170947193148384873341260383455632870356888133933538726514293671472354520842310348481510071808947159033972616792357547099855941714233679465785195791833281261959809044331968339437337464502217209417542755347561041The parameters of the multiobjective discrete krill herd optimization algorithm were set as follows: the number of krill swarm,m = 30; the proportion of cross individuals in the neighborhood, 40%; the proportion of reinitialized individuals, 5%; the maximum number of searches, MaxT = 50; independent runs for the algorithm, 20 times. The optimization scheme obtained is shown in Table 2.Table 2
Multiobjective decision-making scheme.
SchemeCorresponding processing sequenceDelivery time (minutes)Carbon emissions (ton)110 13 11 4 9 12 3 18 16 8 6 7 15 5 17 1 2 19 14 2020422106210 13 11 4 9 12 17 1 2 5 8 6 7 15 19 3 18 16 14 2020432050310 13 11 4 9 12 17 1 2 19 3 18 5 8 6 7 15 16 14 2020462015410 20 14 13 11 4 9 12 2 19 3 17 1 18 5 8 6 7 15 1620501981510 13 11 4 12 17 1 18 9 3 2 19 5 8 6 7 15 16 14 2020711968610 1 2 19 3 13 11 4 9 12 17 18 5 8 6 7 15 16 14 2020821954710 17 1 2 19 14 20 13 11 4 9 12 3 18 5 8 6 7 15 1620901930810 13 18 17 1 2 19 3 11 4 9 12 5 8 6 7 15 16 14 2021001918910 17 1 9 12 2 19 3 11 4 20 14 13 18 5 8 6 7 15 16210719131010 1 2 19 3 16 14 13 11 4 9 12 17 18 5 8 6 7 15 2021261892According to the simulation results, we can see that different production decisions have different effects on the delivery date and carbon emissions. Under the constraints of the steel manufacturing process, there is a certain negative correlation between completion time and carbon emissions. The ten production decision schemes listed in Table2 are partial Pareto solutions found by the algorithm, as shown in Figure 1.Figure 1
Pareto solution of the multiobjective remanufacturing production decision.


## 6. Conclusions

Remanufacturing is not only an effective method for achieving sustainable development, but also one of the most important ways for manufacturing enterprises to implement low-carbon transformation. The mode of remanufacturing is conducive to achieving the comprehensive goals of environmental protection and sustainable economic development.Taking the remanufacturing of scrap iron and steel as an example, this paper established a multiobjective production decision-making model considering both carbon emissions and delivery time and designed a discrete krill swarm optimization algorithm to solve the model. The effectiveness of the algorithm was verified by an example. The multiple optimization schemes obtained by the intelligent optimization algorithm were a Pareto solution set, which were equivalent in theory. However, in reality, remanufacturing enterprises can only choose one optimization scheme to implement. According to the actual market situation, enterprises can assign different weights to different objectives and can choose an optimization scheme, so as to provide a reference for remanufacturing enterprises’ production decision-making.



---

*Source: 9967868-2021-05-12.xml*