Energy Saving Operation of Manufacturing System Based on Dynamic Adaptive Fuzzy Reasoning Petri Net

Abstract

The energy efficient operation of a manufacturing system is important for sustainable development of industry. Apart from the device and process level, energy saving methods at the system level has attracted increasing attention with the rapid growth of the industrial Internet of things technology, which makes it possible to sense and collect real-time data from the production line and provide more opportunities for online control for energy saving purposes. In this paper, a dynamic adaptive fuzzy reasoning Petri net is proposed to decide the machine energy saving state considering the production information of a discrete stochastic manufacturing system. Fuzzy knowledge for energy saving operations of a machine is represented in weighted fuzzy production rules with certain values. The rules describe uncertain, imprecise, and ambiguous knowledge of machine state decisions. This makes an energy saving sleep decision in advance when a machine has the inclination of starvation or blockage, which is based on the real-time production rates and level of connected buffers. A dynamic adaptive fuzzy reasoning Petri net is formally defined to implement the reasoning process of the machine state decision. A manufacturing system case is used to demonstrate the application of our method and the results indicate its effectiveness for energy saving operation purposes.

1. Introduction

It has been shown that 37% of the energy consumption and 17% of carbon dioxide (CO₂) emissions come from the industrial sector [1]. Moreover, the energy consumption of industries has an annual growth rate of 1.3% from 2013 to 2025 [2]. The manufacturing industry is responsible for 38% of energy-related CO₂ emissions in China [3]. Its sustainable development requires industries to improve their energy efficiency eagerly [4,5]. The International Energy Agency reported that approximately 18–26% of the total energy consumption in manufacturing industries, i.e., 25-37 EJ, can be saved if proper actions are taken [6]. The energy-saving potential in manufacturing industries worldwide is estimated to be 20% until 2050 [7]. Therefore, energy management decisions are more and more important for manufacturing industries all over the world [8].

It is known that idle states are common in the shift time of non-bottleneck machines. The idle period took over 16% of the production time in an aircraft small-parts supplier and there was a turn-off opportunity to save at least 13% of the total energy consumption [9]. Apparently, the status of machines in a manufacturing system should be continuously monitored to make a decision. An OFF/SLEEP action could be taken for energy saving when a machine becomes idle (or tends to be idle). Later, it should be switched on or woken up to recover the production at an appropriate time slot without sacrificing the system throughput.

The development of the industrial internet of things (IoT) has endowed modern manufacturing systems with the sensible ability and real-time production data which can be collected, and provides more opportunities for energy saving operations. Currently, many new computerized numerical control (CNC) machines and robotics have energy-saving modes. However, most manufacturing execution systems have no module or function for energy saving decisions. From the system level, many works focus on the scheduling of jobs to minimize non-processing energy consumption [10]. Research on the dynamic decision of machine states for energy efficient manufacturing have gradually received significant attention from academics and industries.

The paper is organized as follows: Some related literatures are reviewed in Section 2. Section 3 describes the energy saving operations of a manufacturing system and the knowledge representation of machine state reasoning based on weighted fuzzy production rules are proposed. Section 4 proposes a dynamic adaptive fuzzy reasoning Petri net for machine state inferences to save energy considering the real-time production information. In Section 5, a serial manufacturing system is studied to demonstrate the effectiveness of our method and some discussions are also provided. Conclusions and future works are discussed in Section 6.

2. Related Works

In order to improve the energy efficiency of manufacturing systems, energy consumption control should not sacrifice the system throughput. Due to the complexity resulting from the interactions among machines and buffers, the real-time energy saving operation of manufacturing systems mainly focuses on policy methods and analytical models.

The energy saving action of machines can be defined in policies or rules. Mouzon et al. [11] gave several switch-off dispatching policies to minimize the energy consumption in a one-buffer-one-machine system. A simple policy is, e.g., machines were switched into the lower power idle mode when the idle time exceeded the defined threshold value, was used to reduce the energy consumption of idle status in [12]. In a pallet constrained flow shop, Mashaei et al. [13] described a switched-off policy to reduce energy consumption considering design constraints and two idle modes with deterministic warm-up durations. For a single machine with stochastic inter arrival times of parts, several policies, such as N-policy, upstream policy, downstream policy and upstream and downstream policy, were defined to switch off the machine [14]. Jia et al. [15] set both a higher and a lower threshold value of the buffer level to regulate the switch-on/off operations for reserve energy in Bernoulli serial lines. It is obvious that some knowledge of energy efficient production cannot be easily described quantitatively in polices. The parameters of the above control policies are hard to determine for different manufacturing systems.

A quantitative prediction of energy saving opportunities is also a method for energy efficient operation of manufacturing systems. By defining the shutdown time length of a machine without affecting the system throughput as an opportunity window, Chang et al. [16] predicted the switch-off period of a machine based on an approximate analytical model and a real-time control algorithm considering random downtime events. For serial manufacturing systems, Sun and Li [17] presented an analytical energy control opportunity estimation considering the utilization of buffers and stochastic failure of machines. They also proposed a Markov decision process model, which was solved by approximate dynamic programming to choose an optimal machine state [18]. Li et al. [19,20] estimated the energy saving window according to an event-based analysis, and a supervisory method was developed to execute opportunity windows periodically. Zou et al. [21] proposed a stochastic analytical model to calculate the machine shutdown time and recovery time based on a discrete-time Markov chain. They presented a distributed feedback production control method to improve the overall system profit and energy efficiency [22]. Hibino et al. [23] proposed an idle-time prediction model and transition model to decide a proper idle state. Analytical models for energy saving operations at a system level are usually useful to the appointed type of manufacturing systems and the reliability mode of machines. Some corrections must be made to the calculated energy opportunity window for unreliable manufacturing systems.

Fuzzy logic is an ideal method to describe human knowledge and has been widely used in the real-time control of production scheduling, planning and process control [24,25,26]. The fuzzy method applies to more expert production knowledge and relies less on mathematical models compared with conventional methods [27]. By decomposing a manufacturing system into three basic modules, Wang et al. [28,29] presented a fuzzy logic method to switch on/off machines considering real-time production data.

Petri nets (PNs) and its diverse variants are powerful tools for graphically/mathematically process modeling and formal verification in analysis and control of discrete manufacturing systems [30]. The PNs were used to model and evaluate energy consumption of machine tools and flexible manufacturing systems. Based on generalized stochastic Petri nets, Xie et al. [31] proposed an energy consumption model and an analysis method in order to assess the production time and energy consumption of machine tools. Pang and Le [32] built a weighted p-timed Petri net model to schedule a flexible manufacturing system and generate near-optimal energy schedules. For evaluating energy consumption, Wang et al. [33] presented an energy consumption model for machining systems based on colored timed Petri nets, where the uncertainty of task assignment and the volatility of operation time were treated by Petri net functions. Li et al. [34] used a colored timed object-oriented Petri net to model and predict hybrid energy behaviors of flexible machining systems. A small amount of literature has been found for real-time energy consumption control of machines based on the PNs method. Fei et al. [35] proposed a fuzzy Petri net model for machine ON/OFF reasoning and decisions, where the elements of the fuzzy rules were described as places and transitions. However, the fuzzy rules are static and cannot be adjusted according to real-time production conditions.

Fuzzy reasoning Petri nets (FRPNs) are extensions of the classical PNs for dealing with vague, imprecise or fuzzy information. FRPNs have been used to represent fuzzy production rules (FPRs) and formulate fuzzy rule-based reasoning automatically [36]. The main features of a FRPN are its graphical representations and dynamic processing abilities to model knowledge-based systems. By representing the operation knowledge in weighed fuzzy production rules (WFPRs), this paper presents a dynamic adaptive fuzzy reasoning Petri net (DAFRPN) to represent and infer machine states for energy saving decisions considering real-time buffer levels and production rates. Machine states are monitored and decision cycles switched on to decrease the duration of idle states and the total system energy consumption.

3. Problem Statement and Fuzzy Operation Knowledge Representation

3.1. System Description and Assumptions

For a serial discrete manufacturing system (Figure 1) in this paper, the assumptions are made in time (0,T] as follows.

• Machine M_i, i = 1, 2, …, n, has a constant cycle time ${\tau }_i$. The cycle time of machines can be the same or different, which means the system can be synchronous or asynchronous lines.
• Buffer B_i, i = 1, 2, …, n−1, has a finite buffer capacity L_i. The buffer level of B_i at time t is represented as b_i(t) at the beginning of each discrete time slot.
• The reliability models of machines are assumed to follow a known but not definitive probability distribution. The time dependent failure mode is used in this study.
• At the beginning of a discrete time slot, M_i is starved if it is powered on and its upstream buffer B_i-1 is empty. It is assumed that the first machine is never starved.
• At the beginning of a discrete time slot, M_i is blocked if it is powered on and its downstream buffer B_i is full. It is assumed that the last machine is never blocked.
• A power-on machine consumes materials, such as electricity, fuel, gas and compressed air. All consumed materials will be converted into energy.
• In this study, a machine has following states: Processing (PS), starvation (ST), blockage (BL), failure (FL), and sleep for energy saving (SL).

In a time unit, a machine in a processing state consumes the processing energy E_ps,i. The energy consumption of traditional idle states, i.e., starvation and blockage, is described as E_id,i. A machine consumes energy E_sl,i in the energy saving state, i.e., sleep state. It is assumed that E_sl,i < E_id,i < E_ps,i. A machine in a failure state does not consume energy. Buffers do not consume energy. The consumed energy E_i of a machine M_i in time (0,T] is calculated as:

$$E_i\left(T\right)=E_{ps,i}\times T_{ps,i}+E_{id,i}\times T_{id,i}+E_{sl,i}\times T_{sl,i},$$

(1)

where T_ps,i, T_id,i, T_sl,i are the time length of the corresponding machine state.

The overall energy consumption of a manufacturing system E_sys during time (0,T] is the summation of the energy consumption of all machines as follows:

$$E_{sys}\left(T\right)={\displaystyle \sum }_{i=1}^n{E}_i\left(T\right),$$

(2)

Based on E_sys, the total energy cost of machines in a manufacturing system can be achieved. In this paper, the total energy cost of machines, the system throughput and the energy consumption per part are the main energy performance indicators of a manufacturing system.

3.2. Knowledge Representation of Machine Energy Saving Operations

The machine idle states are the main non-valuable operational states with higher energy consumption. Reducing or eliminating the idle periods by switching a machine into the energy saving state for some reasonable duration, and then waking it up, is the main objective of our work. Regarding a power-on machine, the decision of whether or not to switch it into the sleep state is evaluated and executed between two consecutive time slots based on production data. If a sleep operation is decided, the machine enters the sleep state during the subsequent time period. If a running decision is made, the machine is woken up from the sleep state or keeps its running state.

Traditionally, an exact buffer level was assigned as the threshold value for switching ON/OFF a machine that approaches either starvation (due to upstream buffer) or blockage (due to downstream buffer) [14,15]. It is difficult to decide a precise level of all buffers for energy control purposes in different manufacturing systems due to the combinatorial explosion of the buffer levels. Fuzzy production rules (FPRs) are a good tool for processing uncertain, imprecise, ambiguous real-world knowledge, and the uncertainty of the fulfillment of the conditions in rules [27]. Fuzzy knowledge representations for energy saving machine operation based on weighted FPRs (WFPRs) is presented in this study to switch a machine into the energy saving state in advance, if the machine has an inclination of starvation or blockage based on the real level of its upstream buffer, downstream buffer and production rate.

Let R_x be a set of WFPRs for machine state reasoning. Based on the definition of a general WFPR [37], a specific WFPR for the energy saving operation of a power-on machine is described in this paper as follows:

$$R_x:\mathrm{IF}{b}_i\left(t\right)\mathrm{is}UB\mathrm{AND}{b}_{i+1}\left(t\right)\mathrm{is}DB\mathrm{THEN}{s}_i\left(t\right)\mathrm{is}SR\left(c{f}_i\left(t\right)={\mu }_x\right),{\omega }_{ub,x},{\omega }_{db,x},$$

(3)

where

• b_i(t) is the level of upstream buffer of M_i at time point t.
• b_i+1(t) is the level of downstream buffer of M_i at time point t.
• UB and DB are the fuzzy sets of buffer levels which are described in 3 linguistic variables {Low, Medium, High} in this paper.
• s_i(t) is the decided machine state, i.e., SR = {Sleep, Running}, at time t.
• The parameter μ_x = {μ_s, μ_r} defined in the universe of discourse [0,1] is the certainty factor (CF) representing the strength of the certainty of WFPRs when s_i(t) is {sleep} and {running} respectively.
• w_ub,x and w_db,x are the set of weights, which are defined in the universe of discourse [0,1] and assigned to the first and second antecedent propositions in the rules. The weights show the relative importance of each antecedent proposition to the consequence proposition. The sum of the proposition weights equals to 1.

All the knowledge defined in WFPRs for energy saving state decisions of power-on machine are shown in

Table 1. Weighted adaptive fuzzy production rules for machine state decisions.

No.	bi(t)	$\mathit{\omega }$ub,x	bi+1(t)	$\mathit{\omega }$db,x	si(t)	cfi(t)
1	Low	0.8	Low	0.2	Sleep	μs
2	Low	0.6	Medium	0.4	Sleep	μs
3	Low	0.5	High	0.5	Sleep	μs
4	Medium	0.4	Low	0.6	Running	μr
5	Medium	0.5	Medium	0.5	Running	μr
6	Medium	0.3	High	0.7	Sleep	μs
7	High	0.5	Low	0.5	Running	μr
8	High	0.6	Medium	0.4	Running	μr
9	High	0.2	High	0.8	Sleep	μs

and explained as following.

In the antecedent propositions of the WFPRs, six abbreviations are used as {UBL, UBM, UBH, DBL, DBM, DBH} in this paper. For example, UBL means the level of the upstream buffer is low and DBM means the level of the downstream buffer is medium. Each linguistic variable has a membership function. The triangle membership function of the buffer level is adopted in Figure 2 according to [28] and the optimization of membership function is not the focus of this paper. At each decision time point, the real level of buffers is sampled and the degree of membership is calculated. Different weighted fuzzy production rules can be activated for energy saving decisions based on the PN reasoning in the next section.

Each antecedent proposition has a weight, i.e., ${\omega }_{ub,x} \mathrm{and} {\omega }_{db,x}$, which means the relative degree of importance of a proposition contributing to the consequent proposition. For example, if the level of the upstream buffer b_i(t) is sampled as {Low} and the level of downstream buffer b_i+1(t) is also sampled as {Low} at a time point, the machine has a high-risk of starvation but a low-risk of blockage. For the energy saving purpose, the high-risk of starvation has a more important degree on a sleep decision comparing to a low-risk of blockage. It is reasonable to assign a larger weight to antecedent proposition {b_i(t) is Low} and a smaller weight to proposition {b_i+1(t) is Low} in the first rule shown in Table 1.

The CF in a WFPR indicates the degree of certainty of a rule. The larger the value of a certainty factor, the more the consequent proposition of a rule is believed. The traditional CF is a constant determined by an expert. Our objective is to sleep the machine and save more energy while not sacrificing the machine/system throughput. The decision rules should dynamically balance energy saving operations and product throughput between decision cycles. In this study, the CF is used to dynamically change the truth of a WFPR rule based on the production rate of a machine during the production. For example, when the production rate of a machine is low during a decision cycle, the sleep decision of a WFPR has small truth and the running decision has large truth in order to improve the machine/system throughput. The rules are defined to infer the CF of WFPRs in a decision cycle as follows:

$$R_y:\mathrm{IF}{r}_i\left(t\right)\mathrm{is}PR\mathrm{THEN}{\mu }_s\mathrm{is}CVS\mathrm{AND}{\mu }_r \mathrm{is} CVR,$$

(4)

where r_i(t) is the production rate of a machine within a decision cycle, PR is a fuzzy set, CVS and CVR are the certainty values of the sleep decision and the running decision respectively.

The r_i(t) of a machine is zero when no parts are processed during a decision cycle. The maximum production rate will be $\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{${\tau }_i$}\right.$ when the machine always processes parts in a decision cycle. The production rate is calculated as follows:

$$r_i\left(t\right)=\frac{T{P}_i\left(t\right)-T{P}_i\left(t-dc\right)}{dc}$$

(5)

where dc is the decision cycle, TP_i(t) and TP_i(t-dc) is the throughput of machine i.

The PR is represented with a fuzzy term set {Low, Medium, High}. This study uses a symmetrical triangle membership function $\left[0,\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$2{\tau }_i$}\right.,\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{${\tau }_i$}\right.\right]$ for PR shown in Figure 3a. CVS and CVR take the fuzzy term set {Small, Middle, Big} with the triangle membership function [0, 0.5, 1] as shown in Figure 3b,c. The rules for CF reasoning are shown in

Table 2. The fuzzy rules for certainty factor reasoning.

No.	ri	μs	μr
1	Low	Small	Big
2	Medium	Middle	Middle
3	High	Big	Small

. The Mandani scheme is used during the reasoning process of μ_s and μ_r. The knowledge of rules in Table 2 is straightforward. If the production rate of a machine is higher in a decision cycle, a bigger CF for a sleep decision and a smaller CF for a running decision will be assigned to the WFPRs aiming to compromise the energy saving behavior and the machine throughput in the next decision cycle.

4. Dynamic Adaptive Fuzzy Reasoning Petri Net for Energy Efficient Operation

4.1. Formal Definition of Dynamic Adaptive Fuzzy Reasoning Petri Net

As a graphical and mathematical modeling tool, a Petri net is widely used to describe and study information processing systems. For a rule-based reasoning process, the graphical description of a PN can visualize the structure of a rule-based system and make the model relatively simple and legible. The algebraic equations of a PN can provide a mathematical foundation to express the dynamic behavior of a system. In this section, a dynamic adaptive fuzzy reasoning PN is proposed to implement machine state reasoning for energy saving operations in a manufacturing system for the first time.

A dynamic adaptive fuzzy reasoning Petri net (Figure 4) is built for the machine states decision based on the fuzzy knowledge (Table 1 and Table 2) and can be defined as a 9-tuple:

$$DAFRPN=(P,TN,I,O,D,W,\mu ,\alpha ,\beta )$$

(6)

where

• $P=\left\{p_1,p_2,\dots ,p_m\right\}$ is a finite set of propositions or called places, $P=PS{\displaystyle \cup }PT$, including a set of starting places $PS=\left\{p\in P|{}^{*}p=\varnothing and{p}^{*}\ne \varnothing \right\}$, a set of terminating places $PT=\{p\in P│({}^{*}p\ne \varnothing and{p}^{*}=\varnothing \}$. Here, ${}^{*}p$ is the set of all input transitions of p, and $p^{*}$ is the set of all output transitions of p. Variable m is the number of propositions in the rules. In this paper, there are 8 places, i.e., m = 8. $\left|PS\right|=6$, which represent three linguistic levels of upstream buffers and three linguistic levels of downstream buffers. $\left|PT\right|=2$ represents the two decision states {sleep, running} of a machine.
• $TN=\left\{t{n}_1,t{n}_2, \dots , t{n}_x\right\}$ is a finite set of transitions, representing a set of fuzzy inference rules. Variable $x$ is the number of rules. In this paper, there are 9 rules and $x=9.$ Transitions $t{n}_1\to t{n}_9$ correspond to rules $R_1\to R_9$ shown in Table 1.
• $D=\left\{d_1,d_2, \dots , d_m\right\}$, a finite set of propositions in the fuzzy knowledge base. $\left|P\right|=\left|D\right|$. $P{\displaystyle \cap }T{\displaystyle \cap }D=\varnothing$. For example, the proposition $d_1=$ {UBL} describes the fuzzy level of upstream and the proposition $d_7=$ {Sleep} is the decision result of the machine at the next decision cycle.
• $I: PS\to TN$, the input function, defining the directed arcs from starting places to transitions.
• $O: TN\to PT$, the output function, defining the directed arcs from transitions to terminating places.
• $W: P\times TN\to \left[0, 1\right]$, an input function whose elements are the weights of input places, which indicates that how much an input place (or corresponding antecedent proposition) impacts on its transition. The sum of the antecedent proposition weights of a transition is equal to 1.
• $\mu : TN\times P\to \left[0, 1\right]$, an output function whose elements are the certainty factors of the transitions/rules, indicating how much a transition/rule impacts on its output places, i.e., the decided machine state. $\mu$ is adjusted automatically based on the changing production conditions.
• $\alpha : P\to \left[0, 1\right]$, a correlation function, representing mapping from a set of places to a set of real values in [0,1]. $\alpha \left(P_i\right)$ is the fuzzy value of a starting place, indicating the truth degree of proposition $d_i.$
• $\beta : P\to D$, a correlation function, represents a bidirectional mapping between a set of places and a set of propositions. For example, $\beta \left(p_1\right) \mathrm{means}\mathrm{the}\mathrm{mapping}\mathrm{between} d_1 \mathrm{and}$ {UBL}.

4.2. Knowledge Reasoning for Energy Saving State Decisions of A Machine

In our model, each starting place has a token. At each decision time point, the real level of the upstream and downstream buffer is collected from the manufacturing system by the IoT. The actual buffer level is converted into fuzzy linguistic values which have different fulfillment degrees, i.e., $\alpha \left(p_i\right),$ based on membership functions. Let $\left(tn\right)=\left\{p_i\right\},i=1,2,\dots 6,$ $O\left(tn\right)=\left\{p_k\right\}, k=7,8$, certainty factors $\mu \left(tn\right)=\left\{{\mu }_j\right\}, j=1,2,\dots ,9,$ the weights of input places are represented as $w_{11,}{w}_{12},\dots ,w_{ij}$.

• Enabling criterion

$\forall tn\in TN$, transition tn is enabled for $p_i\in I\left(tn\right)$,

$$\alpha \left(p_i\right)>0,$$

(7)

• Firing criterion

When tn is fired, a token in the starting place is copied and a token with an equivalent truth value is put into the output place.

If $\left|{}^{*}p\right|=1,$ the output place has only one input transition. The equivalent fuzzy value of an output place is defined by:

$$\alpha \left(p_k\right)={\mu }_j\times {\displaystyle \sum }\left[\alpha \left(p_i\right)\times w_{ij}\right],k=7,8$$

(8)

If $\left|{}^{*}p\right|>1,$ the output place has more than one input transition. The equivalent fuzzy value of an output place is determined by the input transition with the maximum equivalent fuzzy value as follows:

$$\alpha \left(p_k\right)=max\{{\mu }_j\times {{\displaystyle \sum }}^{\text{}}\left[\alpha \left(p_i\right)\times w_{ij}\right]\},k=7,8$$

(9)

The reasoning process of machine states can be realized in a parallel way by matrix equation as in [38] and is not described here.

• Decision Making

After the firing of all transitions, the conclusion proposition with the larger fuzzy truth value is chosen as the decided machine state at a current decision time point. During the production process, the fuzzy reasoning process based on DAFRPN will execute at each decision time point. The machine state will be switched to running or sleep, and the idle period of a machine can be reduced to achieve energy saving operations.

5. Numerical Experiments and Discussions

5.1. A Serial Automotive Powertrain Line

In order to illustrate the feasibility and effectiveness of our proposed method, a 6M5B serial manufacturing system is taken as a case study for comparison with the control method in [22,29]. This system is a simplified version of a real automotive powertrain production line and parameters are mocked up for confidence. The reliability models of machines are assumed as exponential distribution. The power rate is assumed to be 0.2 $/kWh. The simulation is repeated twenty times and all simulations last three weeks (30240 minutes).

Table 3. Parameters of machines in a serial manufacturing system.

Machine	M1	M2	M3	M4	M5	M6
MTBF (min)	5422	6301.2	11872.2	5440.2	6412.8	6250.8
MTTR (min)	130.8	208.2	409.8	279.6	205.2	250.8
Cycle time (min)	3.5	4.3	2.7	9.4	1.1	5.9
Working energy (kWh)	450	300	240	288	660	360

and

Table 4. Parameters of buffers in a serial manufacturing system.

Buffer	B1	B2	B3	B4	B5
Capacity	120	150	160	50	150
Initial level	70	30	50	40	50

show the system parameters.

This study conducted simulation experiments in three scenarios: Baseline without machine control (S1); only one machine is controlled (S2), e.g., M₂ or M₅; multi-machines are controlled (S3), i.e., M₁, M₂, M₃, M₅, except the bottleneck machine and the last machine for maximizing the system throughput. First, the baseline scenario is simulated and the system bottleneck is identified as M₄ based on the machine blockage and starvation data using the method in [39]. The decision cycle of each machine in controlled scenarios S2 and S3 is set as five times as much as its cycle time. The system performances of three scenarios are compared in

Table 5. Comparison of system performances in three scenarios.

Scenario	Sleep Time(min) [95% CI]	Throughput [95% CI]	Total Energy Cost [95% CI]	Energy Cost Per Part ($)
S1	-	3168.45 [3149.72,3187.18]	225727.80 [224839.67,226615.94]	71.24
S2 (M2)	14021.62 [13877.85,14165.38]	3168.45 [3149.72,3187.18]	211707.56 [210800.94,212614.18]	66.82
S2 (M5)	15468.38 [15346.97,15589.78]	3167.05 [3148.41,3185.69]	191700.72 [190945.86,192455.59]	60.53
S3	73722.71 [73323.99,74121.42]	3166.55 [3147.81,3185.29]	123747.56 [123055.63,124439.49]	39.08

.

From Table 5, the machines have notable sleep time in S2 and S3. For single machine control, the sleep time of M₂ (14021.62 min) and M₅ (15468.38 min) is about 46.37% and 51.15% of their total work time (30240 min). When multi-machines are controlled simultaneously, the total sleep time of M₁, M₂, M₃, M₅ (73722.71 min) is 60.95% of the four controlled machines’ work time. The system throughput has negligible loss in all control scenarios with distinct energy cost savings. Compared with energy cost in S1, the system energy cost reduces by 6.21%, 15.07%, 45.18% in S2(M₂), S2(M₅) and S3 when different machines are controlled. Regarding the energy cost per part, all controlled scenarios also have observable cost savings. The energy cost per part decreases from 71.24 $ in S1 to 39.08 $ in S3, which has a 45.14% cost reduction. The results show that the controlled scenarios are effective energy saving operations of the manufacturing system.

5.2. Discussions

The purpose of machine control is to sleep the machine when it has the tendency for starvation or blockage without sacrificing the machine and system throughput. The performances of M₂ and M₅ are shown in Figure 5 for the three scenarios. The throughput of M₂ only slightly reduces approximately by 0.16% and 1.8% in S2 and S3. The energy cost of M₂ dramatically reduces from 29497.95 (S1) to 15476.69 (S2) and 14043.98 (S3), which save 47.53% and 52.39% of the energy cost respectively. The M₅ has negligible throughput loss, i.e., 0.04% and 0.05% of S1, in controlled scenarios, which means the control method does not affect the productivity of M₅. The machine M₅ achieves a 52.34% energy cost reduction in S2 and a 65.73% energy cost reduction in S3 compared with S1. From the single machine aspect, the control method has a remarkable effect for energy saving operations.

Table 6. Time length of machine states and machine performances comparison in S1 and S3.

Time Length	Scenario	M1	M2	M3	M4	M5	M6
PS	S1 S3	11744.60 11475.28	14214.94 13959.09	8615.97 8563.86	29008.40 29007.46	3438.16 3436.46	18693.86 18682.65
BL	S1 S3	17894.49 0.00	15283.01 84.89	20841.81 373.36	6.26 7.20	0.00 0.00	0.00 0.00
ST	S1 S3	0.00 0.00	0.00 0.00	156.00 0.00	0.00 0.00	26117.82 6691.55	10641.95 10655.03
FL	S1 S3	600.91 600.15	742.05 742.21	626.21 626.35	1225.34 1225.34	684.02 684.10	904.19 902.33
SL	S3	18164.58	15453.81	20676.43	0.00	19427.90	0.00
TPL	%	2.29%	1.80%	0.60%	0.00%	0.05%	0.06%
ECR	%	61.28%	52.39%	69.82%	0.00%	65.73%	0.01%

shows the time length of different states, which are throughput loss (TPL) and energy cost reduction (ECR) of each machine in S1 and S3. It can be seen that the processing time of each machine in S3 has a slight reduction compared with S1, which results in a corresponding loss of the machine throughput. When multi-machines are controlled, the blockage and starvation time of machines are obviously decreased and are changed into sleep time. In S1, the total idle time of M₃ is 20997.81 minutes. In S3, machine M₃ has the longest sleep time, i.e., 20676.43 minutes, which reaches 98.47% conversion of the idle time and accounts for 68.37% of the total simulation time. Among the controlled machines, M₁ has the largest throughput loss percentage (2.29%) in S3. The throughput of bottleneck M₄ statistically keeps the same, which indicates the multi-machine control has no influence on the bottleneck machine M₄. Each controlled machine has gained over 50% of energy cost savings, with only 0.06% system throughput loss.

During the simulation, this study recorded the main parameters at each decision time point. Figure 6 is a randomly sampled experiment time phase in S3 from 22512 minutes to 24591 minutes, which shows the state changing, the production rate and the level of related buffers for M₂.

From Figure 6a, it can be concluded that the buffer, B₁ and B_2, are not empty or full when multi-machines are controlled in S3. Consequently, the blockage/starvation time of M₁, M₂ and M₃ are greatly decreased as shown in Table 6. Due to the sleep and failure times, the production rate of M₂ is changed accordingly in Figure 6b. Based on the buffer level and production rate, the state of M₂ is decided using the DAFRPN. For example, at time point 23142, the machine is still at the failure state with zero production rate and buffer level {b₁ = 115, b₂ = 98}. Twenty-one minutes later, i.e., 23163 minutes, the production rate is 0.0930 and the buffer level is b₁ = 112, b₂ = 102. The decided state of M₂ is running, as shown in Figure 6c. The machine continually processes parts until the next decision time point, 23184. The production rate is 0.2093 and the buffer level is b₁ = 110, b₂ = 107. The state of M₂ will be switched as sleep based on the DAFRPN. After two decision intervals, i.e., 23226 minutes, the machine will be woken up with the production rate 0.0233 and buffer level {b₁ = 110, b₂ = 108}. It reveals that M₂ is turned into a sleep state if it has the tendency of blockage or starvation with higher production rates.

In order to investigate the performance of our dynamic adaptive fuzzy reasoning Petri net method, the results of the mathematical method of energy saving opportunity windows [22] and the fuzzy control method [29] for the above case line are compared in

Table 7. System performance comparison of different methods.

Methods	[22]	M5		M1, M2, M3, M5
		[29]	Our	[29]	Our
Throughput loss (%)	2.70%	0.69%	0.04%	0.23%	0.06%
Energy cost reduction (%)	27.00%	25.48%	15.07%	51.76%	45.18%
Energy cost reduction per part (%)	24.98%	24.95%	15.03%	51.66%	45.14%
Increase of system profit (%) (300 $)	5.15%	7.07%	4.64%	15.90%	13.99%
Increase of system profit (%) (600 $)	0.68%	2.67%	1.98%	6.74%	6.02%

. Our method has the least throughput loss when a single machine and multi-machines are controlled. The energy cost reduction in S3 of our method is higher than [22] but lower than [29]. Compared with the fuzzy control method in [29], our method has less parameters to be set for control. There are many threshold values that must be adjusted for better control performance [29], which is time consuming and not practical in actual application. The mathematical method in [22] assumed that there was a slow machine in the line which meant their method is only applicable to asynchronous lines. Our method has no restriction on machine cycle time and can be used for both synchronous and asynchronous manufacturing systems. If it is assumed the profit per part produced is 300 $ and 600 $ respectively as in [22], the profit increase percentage of different methods considering throughput loss and energy cost can be calculated (Table 7). It is obvious that the increase percentage of a system profit will decrease owing to the reduced throughput with higher prices for parts. As the method in this study has the least throughput loss, it can be seen that the profit increase percentage of this method has less reduction when produced parts are more valuable.

The system performances of different decision cycles in S3 are compared in

Table 8. System performance comparison of different decision cycles in S3.

Decision Cycle (Times)	Sleep Time (min) [95% CI]	Throughput [95% CI]	Total Energy Cost [95% CI]	Energy Cost Per Part ($)
2	78560.86 [78103.31,79018.40]	3166.85 [3148.16,3185.54]	113726.48 [113025.77,114427.20]	35.91
5	73722.71 [73323.99,74121.42]	3166.55 [3147.81,3185.29]	123747.56 [123055.63,124439.49]	39.08
10	66122.12 [65619.01,66625.22]	3166.75 [3148.06,3185.44]	136515.89 [135625.89,137405.89]	43.11

with the same WFPR weights. Decision cycles are set as two times, five times and ten times as much as the machine cycle time respectively. From Table 8, it can be found that the system throughput do not have an obvious change under different decision cycles. When a longer decision cycle is adopted, the total sleep time gets smaller, and the total energy cost and the energy cost per part becomes larger. A longer decision interval means a less frequent data collection from the workshop, which makes it harder to catch the transient state of the system, thus missing some energy saving chances to reduce idle time. A smaller decision interval can catch much more energy saving opportunities but with a frequent switch between a sleep state and processing state. Based on the cycle time of machines and the results of simulation experiments, an appropriate decision cycle interval should be determined.

The selection of different input weight combinations will influence the effects of the energy saving method. Many groups of input weights have been adopted in our simulation experiments, from which three groups chosen as examples (G1, G2, G3) and the system performances of these three groups are shown in

Table 9. System performance comparison of input weights group in S3.

Input Weights Group 1	Sleep Time (min) [95% CI]	Throughput [95% CI]	Total Energy Cost [95% CI]	Energy Cost Per Part ($)
G1	73722.71 [73323.99,74121.42]	3166.55 [3147.381,3185.29]	123747.56 [123055.63,124439.49]	39.08
G2	73667.62 [73266.93,74068.31]	3166.55 [3147.81,3185.29]	123793.75 [123097.26,124490.24]	39.09
G3	60671.83 [60280.04,61063.62]	3167.35 [3148.63,3186.07]	152435.80 [151310.40,153561.20]	48.13

¹ G1 use the input weights in Table 1. In G2, the input weight ($\omega$_ub,x, $\omega$_db,x) of rule No. 1,6,9 in Table 1 is re-assigned as (0.7,0.3),(0.4,0.6), (0.3,0.7). In G3, the input weight ($\omega$_ub,x, $\omega$_db,x) of rule No. 2,4,8 in Table 1 is re-assigned as (0.7,0.3),(0.3,0.7), (0.7,0.3).

. The decision cycle is five times as much as the cycle time in these three experiments. It can be seen that different input weight groups all obtain the energy cost reduction and have certain effects on system performances. The optimal combination of input weights can be determined based on the results of simulation experiments and the actual situation of the shop floor in the future work.

In this paper, the authors do not consider the warm-up energy from a sleep state to a running state in order to compare the results with the literature [22,29]. The proposed method can be used when a warm-up process is taken into account. In our method, the elements of the DAFRPN, such as the amount of places and arcs, can be varied if the granularity of the buffer level in linguistic values and the number of decided machine states are changed. For example, the buffer level can be described in five grads {Very low, Low, Medium, High, Very high} and the machine can have three decided states {Light sleep, Deep sleep, Running}. The DAFRPN can be adjusted conveniently based on the newly defined WFPRs of the energy saving operation knowledge, which will have twenty-five rules. There will be ten starting places and three terminating places in the DAFRPN. This makes the DAFRPN method more flexible for different control granularity.

6. Conclusions

Energy saving operations of manufacturing systems is a popular research topic in academia and industry for sustainable development. Due to the stochastic and dynamic properties of manufacturing systems, the real-time energy saving operations considering production conditions is a difficult problem at a system level. A control method based on dynamic adaptive fuzzy reasoning Petri nets is proposed to make a decision on machine states for reducing idle times. Weighted fuzzy production rules with certain values are used to describe fuzzy knowledge of machine state decisions considering online production information. The real-time production rate and buffer levels are formatted as linguistic fuzzy sets to represent the imprecise knowledge of machine operations. The fuzzy knowledge describes the purpose for energy saving operation, i.e., turning the machine to sleep if the machine has an inclination of starvation or blockage during the production process. A dynamic adaptive fuzzy reasoning Petri net is formally defined in this paper to implement reasoning processes of machine state decisions. A serial automotive powertrain line is taken to conduct simulation experiments. The results of three scenarios show the effectiveness and flexibility of our method for energy saving manufacturing system operations. For future works, the energy saving operation method based on dynamic adaptive fuzzy reasoning Petri nets will be extended and applied to manufacturing systems with parallel, assembly or disassembly structures.