# Modeling of RFID-Enabled Real-Time Manufacturing Execution System in Mixed-Model Assembly Lines

Authors: Zhixin Yang; Wei Xu; Pak-Kin Wong; Xianbo Wang
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

To quickly respond to the diverse product demands, mixed-model assembly lines are well adopted in discrete manufacturing industries. Besides the complexity in material distribution, mixed-model assembly involves a variety of components, different process plans and fast production changes, which greatly increase the difficulty for agile production management. Aiming at breaking through the bottlenecks in existing production management, a novel RFID-enabled manufacturing execution system (MES), which is featured with real-time and wireless information interaction capability, is proposed to identify various manufacturing objects including WIPs, tools, and operators, etc., and to trace their movements throughout the production processes. However, being subject to the constraints in terms of safety stock, machine assignment, setup, and scheduling requirements, the optimization of RFID-enabled MES model for production planning and scheduling issues is a NP-hard problem. A new heuristical generalized Lagrangian decomposition approach has been proposed for model optimization, which decomposes the model into three subproblems: computation of optimal configuration of RFID senor networks, optimization of production planning subjected to machine setup cost and safety stock constraints, and optimization of scheduling for minimized overtime. RFID signal processing methods that could solve unreliable, redundant, and missing tag events are also described in detail. The model validity is discussed through algorithm analysis and verified through numerical simulation. The proposed design scheme has important reference value for the applications of RFID in multiple manufacturing fields, and also lays a vital research foundation to leverage digital and networked manufacturing system towards intelligence.


---

## Body

## 1. Introduction

In recent years, with the development of information technology and advanced manufacturing technology, modern manufacturing industries have changed greatly to match fierce global competition. The development trends include increased personalization, diversified product demands, gradually shortening product life cycle, and increasing delivery requirements from customers, which make shop-floor management be crucial in the whole manufacturing system. To quickly respond to the diverse product demands in terms of multiple product types and different delivery times, mixed-model assembly lines, as a flexible production mode, are well adopted in discrete manufacturing industries. Compared with single mass production, mixed-model assembly production needs to handle complex material distribution. Mixed-model assembly involves a variety of parts, complex processes, and fast production changes, which greatly increase the difficulty for agile production management. The workstations used, process sequences, and operating time vary according to different products that are fed into the mixed-model assembly lines. The production management of shop-floor with mixed-model assembly lines faces challenges to reach agility when information among manufacturing objects could not be acquired and processed to generate interactive means in real-time. Although many enterprises have adopted ERP or MRP for leveraging production management, however, in dynamic shop-floor environment, materials can hardly be distributed accurately and sequentially due to the lack of real-time production status tracking. Meanwhile, unpredictable and fast changing market demands require manufacturing enterprises to have quick response ability, which, however, is usually insufficient in the currently available production line modeling and simulation software packages. The performance of manufacturing process agility is a major determinant of whether or not enterprises could process manufacturing events quickly, respond to dynamic demands of market customers robustly, build dynamic alliances efficiently with partners for increasing innovative capabilities, and eventually win in global competition. Therefore, aiming at breaking through the development bottlenecks in existing production management, a novel manufacturing execution system (MES), which is featured with real-time and active information interaction technologies, is urgently required to be deployed in mixed-model assembly shop-floor through innovative production organization and management model.Meanwhile, RFID (Radio Frequency Identification) technology has been increasingly realized as a promising information interaction tool and has been widely used in manufacturing industries to conduct real-time monitoring of large amount of site data. Owing to the intrinsic properties of RFID technology including large information storage capacity, ability to simultaneously identify multiple tags in one moment, and noncontact recognition, it enables a fundamental change in the ways to control industry process, especially in fields of manufacturing and logistics supply chain. Potential benefit and influence of RFID technology on manufacturing industry include increasing the visibility and accuracy of information, real-time production control, improving the flexibility of production planning and scheduling, tracking production related objects (such as Work-In-Process (WIP), workstations, and workers), tracking the utilization rate of reusable assets (such as containers, tools, and removable equipment), effective maintenance management, inventory control of raw materials and finished products, cost reduction, and improving customer satisfaction level [1, 2]. Therefore, RFID is an attractive technology for fitting real-time requirements in terms of data acquisition and process control in modern manufacturing system. However, existing researches on the application of RFID technology mainly focus on how to build corresponding RFID application systems individually. In the open literature, the theoretical model regarding the optimal configuration and framework integration of RFID sensor networks in various applications are still lacking a unified and detailed study. Many systematic researches are based on the assumption that the acquisition system underlying RFID could meet specific application environment by generating signal in ideal status, while, in fact, RFID system may output unreliable data. Few researchers addressed how to optimize RFID system performance to reduce the influence of noise factors and guarantee system stability in specific application environment. This paper adopts RFID equipment, the high caliber wireless communication tool, for real-time information acquisition and processing in complex production system towards real-time MES. The relevant model configuration, data purifying, and optimization issues are therefore worth being studied in this paper.The remainder of this paper is organized as follows. In the following section, relevant works related to this study will be reviewed. The system architecture, model analysis for optimization of system configuration, and production planning and scheduling are described in Section3. In addition, the reliability of RFID data processing and generalized Lagrangian decomposing approach are presented in Sections 4 and 5, respectively. The algorithm analysis and model validity are examined in Section 6. Finally, a summary of modeling methodology, together with a discussion on the directions for future research, is made.


## 2. Literature Review

To study a real-time MES model for complex product manufacturing system, the study involves research efforts in two subareas: wireless technique for information acquisition and optimization of production planning and scheduling. Correspondingly, this section reviews the applications of RFID for real-time information acquisition and facility monitoring in manufacturing execution system and also gives a brief summary on production planning and scheduling optimization studies of manufacturing system.


### 2.1. RFID-Enabled Real-Time MES

Researches on the application of RFID in manufacturing process control mainly addressed the following three aspects: determination of specific application fields and functions of RFID technology, process control of RFID system, and RFID system integration. Currently, many scholars begin to focus on RFID applications in manufacturing workshops to strengthen production process management by effectively improving the transparency of manufacturing workshop [3–5].The automatic control problem in production process could be solved using RFID technology [6]. A RFID based intelligent product was proposed to make products have automatic information interaction, accurate information, and real-time acquisition ability and thus support workshop production decisions and automatic control. Based on the characteristic comparison of RFID and barcode technology, RFID was selected to manufacture control system based on programmable logic controller. The control system was combined with multi-agent technology as information interaction media between RFID equipment and other agents [7]. A manufacturing system framework based on RFID was therefore built. Huang’s group [8–10] proposed the concept of realizing JIT through wireless manufacturing (WM) technology, where WM collected real-time manufacturing workshop site information by fully relying on wireless devices such as RFID, Auto ID sensor, or wireless information network. The application of RFID in remote monitoring in enterprise production management was reported [11], which could improve the efficiency of production process by readapting IT system and reduce human errors via applying RFID technology. A new device based on RFID technology has been reported to strengthen information exchange among workshops and information system optimization throughout the whole factory [5]. Another effort on system design using RFID could assist grinding apparatus production when combined with ERP system [12]. It was also reported to apply such combined system for logistics control of integrated circuit assembly industry in order to improve production efficiency [13]. With respect to production control problem of flexible assembly line, a production control mathematic model based on RFID real-time data collection was built [14], which could be used for designing an intelligent production control decision support system. Chen and Tu [15] put forward a manufacturing control and collaboration system based on multi-agent and applied RFID to real-time manufacturing workshop to monitor and control dynamic production process for improvement of visual tracking ability of product customization of a large number of customers. Risk management system based on RFID technology in manufacturing industry was analyzed, which could not only identify potential risks in production but also propose relevant solutions to control risks [16, 17]. Huang et al. [18] applied WM concept to workshop real-time management of work in process, workshop adaptive assembly planning and control, and fixed worker mobile assembly management of working points. More recently, Huang et al. [19] employed RFID technology and wireless network communication technology (such as Bluetooth and Zigbee) in manufacturing workshop and proposed an advanced wireless manufacturing model via building and manipulating smart workshop objects.


### 2.2. Production Planning and Scheduling

Production planning and scheduling integrated optimization problem can be solved by three categories of strategies:(
1
) layered serial solution; (
2
) layered iteration solution; and (
3
) full space solution. Production planning and scheduling belong to different decision layers in manufacturing system, respectively. While they are closely related, the decisions made on production planning layer are treated as optimized constraining conditions for the optimization computing in schedule layer, and vice versa. Research works on solving strategies of production planning and scheduling integrated optimization model are summarized in Table 1.Table 1
Brief summary of solving strategies for production planning and scheduling optimization.
Literature works
Research domain and approach
[20, 21]
Decomposing according to the structure of integrated model;iterative standard mathematical programming approach.
[22–24]
Decomposing according to the structure of integrated model;Laplace relaxation decomposition approach.
[25–28]
Solve production planning problem under total capacity constraint;ensure the feasibility of scheduling layer.
[29]
Single-stage continuous multiproducts workshop;simultaneous optimization of production planning and scheduling.
[30]
Pharmaceutical industry; layered iterative solution;multiscale planning and scheduling model.
[31]
Production planning and scheduling integrated optimization problem;standard mathematical programming approach.
[32]
Operating workshop; linear programming solution;production planning and scheduling integrated optimization.
[33]
Single-stage production system; linear programming solution;batch determination and scheduling sequence optimization model.


## 2.1. RFID-Enabled Real-Time MES

Researches on the application of RFID in manufacturing process control mainly addressed the following three aspects: determination of specific application fields and functions of RFID technology, process control of RFID system, and RFID system integration. Currently, many scholars begin to focus on RFID applications in manufacturing workshops to strengthen production process management by effectively improving the transparency of manufacturing workshop [3–5].The automatic control problem in production process could be solved using RFID technology [6]. A RFID based intelligent product was proposed to make products have automatic information interaction, accurate information, and real-time acquisition ability and thus support workshop production decisions and automatic control. Based on the characteristic comparison of RFID and barcode technology, RFID was selected to manufacture control system based on programmable logic controller. The control system was combined with multi-agent technology as information interaction media between RFID equipment and other agents [7]. A manufacturing system framework based on RFID was therefore built. Huang’s group [8–10] proposed the concept of realizing JIT through wireless manufacturing (WM) technology, where WM collected real-time manufacturing workshop site information by fully relying on wireless devices such as RFID, Auto ID sensor, or wireless information network. The application of RFID in remote monitoring in enterprise production management was reported [11], which could improve the efficiency of production process by readapting IT system and reduce human errors via applying RFID technology. A new device based on RFID technology has been reported to strengthen information exchange among workshops and information system optimization throughout the whole factory [5]. Another effort on system design using RFID could assist grinding apparatus production when combined with ERP system [12]. It was also reported to apply such combined system for logistics control of integrated circuit assembly industry in order to improve production efficiency [13]. With respect to production control problem of flexible assembly line, a production control mathematic model based on RFID real-time data collection was built [14], which could be used for designing an intelligent production control decision support system. Chen and Tu [15] put forward a manufacturing control and collaboration system based on multi-agent and applied RFID to real-time manufacturing workshop to monitor and control dynamic production process for improvement of visual tracking ability of product customization of a large number of customers. Risk management system based on RFID technology in manufacturing industry was analyzed, which could not only identify potential risks in production but also propose relevant solutions to control risks [16, 17]. Huang et al. [18] applied WM concept to workshop real-time management of work in process, workshop adaptive assembly planning and control, and fixed worker mobile assembly management of working points. More recently, Huang et al. [19] employed RFID technology and wireless network communication technology (such as Bluetooth and Zigbee) in manufacturing workshop and proposed an advanced wireless manufacturing model via building and manipulating smart workshop objects.


## 2.2. Production Planning and Scheduling

Production planning and scheduling integrated optimization problem can be solved by three categories of strategies:(
1
) layered serial solution; (
2
) layered iteration solution; and (
3
) full space solution. Production planning and scheduling belong to different decision layers in manufacturing system, respectively. While they are closely related, the decisions made on production planning layer are treated as optimized constraining conditions for the optimization computing in schedule layer, and vice versa. Research works on solving strategies of production planning and scheduling integrated optimization model are summarized in Table 1.Table 1
Brief summary of solving strategies for production planning and scheduling optimization.
Literature works
Research domain and approach
[20, 21]
Decomposing according to the structure of integrated model;iterative standard mathematical programming approach.
[22–24]
Decomposing according to the structure of integrated model;Laplace relaxation decomposition approach.
[25–28]
Solve production planning problem under total capacity constraint;ensure the feasibility of scheduling layer.
[29]
Single-stage continuous multiproducts workshop;simultaneous optimization of production planning and scheduling.
[30]
Pharmaceutical industry; layered iterative solution;multiscale planning and scheduling model.
[31]
Production planning and scheduling integrated optimization problem;standard mathematical programming approach.
[32]
Operating workshop; linear programming solution;production planning and scheduling integrated optimization.
[33]
Single-stage production system; linear programming solution;batch determination and scheduling sequence optimization model.


## 3. Model Analysis

### 3.1. Model Framework

In modern industries, such as automotive and mobile phone makers, mixed-model assembly lines are typical configuration where a set of workpieces will be assigned on different workstations and be transported along correspondingly different assembly lines. This paper assumes that the workshop hasM sets of machines with different stamping processing capacity, M
¯
=
{
1
,
…
,
M
}. m is machine index and m
∈
M
¯. Each machine is installed with a RFID information collection sensor; that is, the RFID readers for relatively fixed manufacturing resources (such as manufacturing equipment) and RFID tags for relatively moving manufacturing resources (such as manufacturing workers, containers for loading materials, and key components and parts) are deployed in the system. When those moving tags that are mounted on manufacturing objects fall into the active identification range of their nearby readers, tags information can be automatically acquired in real-time. Through mapping mechanism, the attached manufacturing resources could then be identified for dynamic control. It is planned to produce N types of workpieces in a period consisting of T production cycles, where T
¯
=
{
1
,
…
,
T
}, N
¯
=
{
1
,
…
,
N
}. In addition, i
,
j are workpiece indexes, where i
,
j
=
1
,
…
,
N. v
,
w are product process index, where v
,
w
=
1
,
…
,
n
i. Each workpiece i contains n
i processes, n
¯
i
=
{
1
,
…
,
n
i
}. (
i
,
v
) is the vth working process of workpiece i; we also assume that multiple machines can complete each processing plan simultaneously. In cycle t
(
t
∈
T
¯
), the demand of workpiece i is known to be d
i
,
t. Reasonable production planning and scheduling are required to be conducted so as to ensure all of the production tasks in each cycle can be completed, and processing time can be extended within appropriate ranger.The RFID configuration in sensing network for information collection in mixed-model assembly manufacturing is complex. The optimization of such configuration mainly aims at minimizing RFID total costs while meeting the objective of detectingK collection capacity and collection accuracy through M RFID equipment corresponding to manufacturing resources configuration. In addition, the key of production planning is to formulate production capacity X
i
,
t of various workpieces, so as to minimize the total cost of production cost, inventory cost, and shortage penalty cost. Production scheduling is to assign machines for each type of products and to determine product process sequence of each piece of equipment. The start and completion time of each workpiece in one machine could be computed, which may require workers to work overtime in some machines. For minimizing the total cost that includes machine setup cost and overhead, the interacting production planning and scheduling processes will be optimized in an integrated manner that covers all relevant cost while ensuring feasible scheduling.It is well known that setup process often involves die and mold changes, changes of tools or workpieces and the corresponding calibration, and so forth, which usually take certain significant time during a planning cycle. For the example of stamping process, the stamping part with different setup requirements may be produced insufficiently and thus be unable to meet the demands from the downstream welding workshop. Meanwhile, as product demands are dynamically changed for fitting urgent orders or emergency, welding workshop will increase the demand for stamped parts. To cope with such case, certain level of inventory control method will be explored, typically, how to set the safety stock? Generally, safety stock is a rigid requirement and is treated as a constraint. However, this requirement cannot be met under limited production capacity. Therefore, safety stock can be treated as an objective for fulfilling, instead of a constraint. If the safety stock level cannot be satisfied, penalty cost will be incurred accordingly.


### 3.2. Notations and Assumption

I
i
,
t
(
I
i
,
t
≥
0
) is used to denote the inventory of product i at the end of production cycle t. If it is greater than the specified safety stock value R
I
i
,
t, that is, I
i
,
t
≥
R
I
i
,
t, then the exceeded parts are called excess safety stock, which is denoted as S
I
i
,
t
+ (i.e., if I
i
,
t
≥
R
I
i
,
t, S
I
i
,
t
+
=
max
⁡
{
I
i
,
t
-
R
I
i
,
t
,
0
}). If the inventory is smaller than R
I
i
,
t, I
i
,
t
≤
R
I
i
,
t, then the insufficient part is called shortfall safety stock, which is denoted as S
I
i
,
t
- (i.e., if I
i
,
t
≤
R
I
i
,
t, S
I
i
,
t
-
=
max
⁡
{
R
I
i
,
t
-
I
i
,
t
,
0
}). Therefore, the inventory status of one product i is composed of specified safety stock R
I
i
,
t, safety stock excess S
I
i
,
t
+, and safety stock shortfall S
I
i
,
t
- which could be denoted as I
i
,
t
=
R
I
i
,
t
+
S
I
i
,
t
+
-
S
I
i
,
t
-. The unit penalty costs for safety stock shortfall and excess of product i in production cycle t are represented using variables C
h
i
,
t
-, C
h
i
,
t
+, respectively, and meet the condition of C
h
i
,
t
-
>
C
h
i
,
t
+. The summary of notations is used in this paper (see Notation).


### 3.3. Optimal Configuration of RFID Equipment

To leverage wireless application in mixed-model assembly manufacturing environment, identifying physical objects and tracing their movement throughout the production processes will be one of the fundamental supporting factors. Targeted objects are stuck or embedded with RFID tags, which are visible and traceable by those nearby physical readers that are deployed at some key control points. The identified physical objects become intelligent via dynamic information feedback and sharing capability provided by RFID facilities. Each unique RFID tag is mounted with one individual object. When one tag falls into the identification range of the active readers, these active readers will execute simple link layer protocol to retrieve the object identification information embedded in the identified tag. However, due to the characteristics of frequency identification wireless communication and the influence of complex application environment in mixed-model assembly manufacturing workshop, it suffers from receiving repeated readings of tags, missing reading of tags, and redundant objects data when multiple tags are associated with it. Consequently, the raw RFID data flow is unreliable in terms of data redundancy and incompleteness, which in turn results in difficulties for rational downstream applications and also limits its application feasibility. Therefore, the mixed-model assembly manufacturing environment requires proper configuration of RFID equipment prior to data collection and analysis, which is essential for effective system monitoring. The schematic diagram of RFID based real-time manufacturing information in physical workshop operation system is shown in Figure1.Figure 1
Schematic diagram of RFID based real-time MES in physical workshop environment.The nature of production monitoring techniques is to infer whether the manufacturing objects under tracking are in a specific “state,” “event,” or matching certain “rules,” according to basic object information, such as time, space, and interrelationship. A real-time MES monitoring system requires synthesising all the relevant information related to those selected objects for monitoring and will ignore the other objects and system noise. To sum up, there are lots of objects that can be monitored in any production environment, while it is neither practical nor necessary to implement full monitoring for all of them. For example, the objects under tracking could be selective, and only those high-value parts, or staffs, materials, and equipment located in key regions are included. When designing the model configuration of production monitoring schemes, “cost performance” of monitoring tasks will be adopted as the primary indicator for determination of whether the targeting objects, data collection methods and relevant processing technologies shall be applied or not.RFID devices are used to track manufacturing objects, by means of reading and writing radio signals, without physical or optical contact with the objects to be identified. The technology mainly consists of two types of sensor mechanisms. Passive sensors are not equipped with internal battery, which absorb and convert energy from RFID reader. Comparably, active sensors send signals by internal power, which can measure multiple types of sensors, such as temperature, pressure, and motion sensors. Which sensor is optimal for the real-time manufacturing process? It mainly depends on the workshop physical operating environment. Active sensor is suitable for tracking moving objects in a wide area, whereas it is a viable choice for passive sensor to identify information in nearby field. In this paper, RFID active and passive tags are assumed to be attached to single component or whole batch package. With respect to RFID equipment configuration regarding sensor network for manufacturing information acquisition in MES, the following mathematical model can be used for computing the optimal configuration:(1)
Min
⁡
Z
1
=
∑
i
=
1
M
‍
cost
ActiveSensor_
i
+
∑
j
=
1
N
‍
cost
PassiveSensor_
j
,
χ
1
,
…
,
χ
K
∈
χ
Sensor_
1
,
…
,
χ
Sensor_
M
+
N
,
φ
1
,
…
,
φ
K
∈
φ
Sensor_
1
,
…
,
φ
Sensor_
M
+
N
,
X
Sensor_
Ψ
-
X
i
2
+
Y
Sensor_
Ψ
-
Y
i
2
+
Z
Sensor_
Ψ
-
Z
i
2
≤
Θ
i
,
Sensor
Ψ
=
ActiveSensor_
i
Ψ
=
i
,
i
∈
1
,
M
PassiveSensor_
j
Ψ
=
j
,
j
∈
1
,
N
,
Ψ
∈
1
,
M
+
N
,
where the objective function is for K number of RFID data acquisitions to be detected, to minimize total costs while meeting the objective of detecting K acquisition quantity and accuracy through M
+
N sensing equipment (ActiveSensor_
i and PassiveSensor_
j) and accessory equipment corresponding to manufacturing resource configuration. The constraints are to ensure that the selected sensing equipment could meet K number of RFID acquisitions (
χ
1
,
…
,
χ
K
) and acquisition accuracy (
φ
1
,
…
,
φ
K
), respectively, as well as to ensure the reliability of sensor equipment configuration; that is, the distances between the installation location of the selected sensing equipment (
X
Sensor_
Ψ
,
Y
Sensor_
Ψ
,
Z
Sensor_
Ψ
) and working position of effective Reader
i
(
X
i
,
Y
i
,
Z
i
) are within the farthest sensor identification range.


### 3.4. Optimization of Production Planning

Production planning is for enterprises to make a series of decisions regarding production rate, inventory and shortage quantity, and so forth, for various products under the constraint of production capacity. The optimization of production planning aims at minimizing total expenses of the above decisions, where the production objectives and inventory level in each production cycle form control parameters. Generally, production planning and scheduling are formulated in sequence, that is, generating production planning first and then specifying scheduling based on such planning result. The main drawback of formulating production planning and scheduling by hierarchical approach is that information in detailed scheduling layer is not taken into account when formulating production planning. The resulted scheduling thus tends to be infeasible; that is to say, decisions made according to the planning layer may cause infeasible scheduling. Therefore, machine setup time, which is used for adjusting the machine configuration according to mixed-model assembly workshops processes, will be estimated for production batch optimization. In this paper, machine setup is set as variableα
i
,
v
m
,
t; the production planning model could be determined using the formula where the minimum overall production expense is adopted as the objective function:
(2)
Min
⁡
Z
2
=
∑
t
=
1
T
‍
∑
i
=
1
N
‍
C
h
i
,
t
+
S
I
i
,
t
+
+
C
h
i
,
t
-
S
I
i
,
t
-
+
C
p
i
,
t
X
i
,
t
∑
i
=
1
N
‍
∑
i
=
1
N
‍
+
H
+
C
b
i
,
t
L
i
,
t
+
C
u
i
,
t
y
i
,
t
.The main expense in this model is composed of penalty cost of safety stock excess, penalty cost of safety stock shortfall, production expenses, shortage cost, and production preparation cost. The constraint conditions are given by(3)
INV
i
+
L
i
,
1
+
X
i
,
1
=
I
i
,
1
+
d
i
,
1
,
∀
i
,
(4)
I
i
,
t
-
1
+
L
i
,
t
+
X
i
,
t
=
I
i
,
t
+
d
i
,
t
,
t
=
2
,
…
,
T
,
∀
i
,
(5)
∑
i
,
v
∈
J
m
‍
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
X
i
,
t
α
i
,
v
m
,
t
≤
ω
′
W
t
,
∀
m
,
t
,
(6)
S
I
i
,
t
+
=
max
⁡
I
i
,
t
-
R
I
i
,
t
,
0
,
∀
i
,
t
,
(7)
S
I
i
,
t
-
=
max
⁡
R
I
i
,
t
-
I
i
,
t
,
0
,
∀
i
,
t
,
(8)
m
l
i
y
i
,
t
≤
X
i
,
t
≤
M
l
i
y
i
,
t
,
∀
i
,
t
,
(9)
L
i
,
t
≤
d
i
,
t
,
∀
i
,
t
,
(10)
S
I
i
,
t
+
,
S
I
i
,
t
-
,
I
i
,
t
,
L
i
,
t
,
X
i
,
t
∈
z
N
×
T
+
,
y
i
,
t
∈
0,1
,
∀
i
,
t
,
where constraints (3) and (4) express materials balance equations. Formula (5) is production capacity constraint, where α
i
,
v
m
,
t is a constant. ω
′ represents coefficient of production capacity, and ω
′
=
1 if it is not allowed to work overtime; otherwise, ω
′
>
1. Constraints (6) and (7) give formulas to calculate safety stock excess and safety stock shortfall, respectively. Constraint (8) represents upper limit and lower limit of production batch. Constraints (9) and (10) restrict the upper limits of safety stock shortfall and workpiece shortage quantity.


### 3.5. Optimization of Production Scheduling

Production planning and scheduling, which are the two most important tasks in manufacturing production and operation management, are closely related to each other and significantly influence profits gaining, resource utilization efficiency, and punctual product delivery. Solutions of production planning (production objectives) are the input conditions for scheduling problems. Meanwhile, production capacity constraints involved in production planning problems are often related to scheduling solutions.The main task of production scheduling is to make machines assignment decision and to specify the sequence of production processes in each production cycle formulated in production planning. It could thus determine the start and completion time of each product in every working procedure on corresponding machines. Currently, the key that seriously hinders classical scheduling theoretical researches from making major progress and breakthroughs is NP nature of scheduling problem. The actual scheduling problems are always very complex without certain rules to follow and exact solutions are difficult to be obtained within limited time. Applying the classical scheduling theory based analytic optimization to actual scheduling problems that belong to NP-hard problems will inevitably encounter such obstacles.The scheduling problem we are handling is with delivery constraint, which assigns machines based on the minimum processing time for each process and machine load condition according to processing schedule from top to bottom. Since such NP-hard scheduling problem cannot find an overall exact solution directly, we propose to partially fix the solved batch planning result as a basis and use it to solve scheduling problem. Such method could finally get a near optimal solution through limited iterations. When the value of production batchX
i
,
t is known, variables X
i
,
t
,
y
i
,
t in the following constraints are known. Then, production scheduling model is as follows:
(11)
Min
⁡
Z
3
=
∑
m
=
1
M
‍
∑
t
=
1
T
‍
∑
i
=
1
N
‍
∑
v
=
1
n
i
‍
C
s
i
,
v
m
α
i
,
v
m
,
t
+
∑
m
=
1
M
‍
∑
t
=
1
T
‍
C
t
m
,
t
O
m
,
t
.Formula (11) takes minimum setup cost in terms of die and mold change, calibration cost, and overtime cost as objective functions. The corresponding constraint conditions are given by
(12)
α
i
,
v
m
,
t
≤
f
i
,
v
m
,
v
∈
n
¯
i
,
∀
i
,
m
,
t
,
(13)
C
i
,
v
t
≥
B
i
,
v
t
+
∑
m
∈
M
i
,
v
‍
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
x
i
,
t
α
i
,
v
m
,
t
,
v
∈
n
¯
i
,
∀
i
,
t
,
(14)
C
i
,
v
t
≤
B
i
,
v
+
1
t
,
v
∈
n
¯
i
,
∀
i
,
t
,
(15)
B
i
,
v
t
+
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
X
i
,
t
α
i
,
v
m
,
t
-
1
-
δ
i
,
v
,
j
,
w
m
,
t
G
≤
B
j
,
w
t
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
,
(16)
B
j
,
w
t
+
s
j
,
w
m
y
j
,
t
+
p
j
,
w
m
x
j
,
t
α
j
,
w
m
,
t
-
1
-
δ
j
,
w
,
i
,
v
m
,
t
G
≤
B
i
,
v
t
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
,
(17)
∑
m
∈
M
(
i
,
v
)
‍
α
i
,
v
m
,
t
=
y
i
,
t
,
v
∈
n
¯
i
,
∀
i
,
t
,
(18)
∑
(
i
,
v
)
∈
J
1
(
m
)
‍
δ
i
,
v
,
j
,
w
m
,
t
=
α
j
,
w
m
,
t
,
m
∈
M
j
,
w
,
w
∈
n
¯
j
,
∀
j
,
t
,
(19)
∑
(
j
,
w
)
∈
J
2
(
m
)
‍
δ
i
,
v
,
j
,
w
m
,
t
=
α
i
,
v
m
,
t
,
m
∈
M
i
,
v
,
v
∈
n
¯
i
,
∀
i
,
t
,
(20)
∑
(
i
,
v
)
∈
J
(
m
)
‍
δ
0
,
w
,
i
,
v
m
,
t
≤
1
,
w
=
m
,
∀
m
,
t
,
(21)
∑
(
i
,
v
)
∈
J
2
(
m
)
‍
δ
i
,
v
,
0
,
w
m
,
t
=
0
,
w
=
m
,
∀
m
,
t
,
(22)
∑
(
i
,
v
)
∈
J
(
m
)
‍
δ
i
,
v
,
n
+
1
,
w
m
,
t
≤
1
,
w
=
m
,
∀
m
,
t
,
(23)
∑
(
i
,
v
)
∈
J
1
(
m
)
‍
δ
n
+
1
,
w
,
i
,
v
m
,
t
=
0
,
w
=
m
,
∀
m
,
t
,
(24)
F
m
,
t
=
max
⁡
(
i
,
n
i
)
∈
J
(
m
)
C
i
,
n
i
t
-
1
-
δ
i
,
n
i
,
n
+
1
,
l
m
,
t
G
,
w
=
m
,
∀
m
,
t
,
(25)
F
m
,
t
≤
W
t
+
0
m
,
t
,
∀
m
,
t
,
v
,
(26)
0
≤
0
m
,
t
≤
ω
W
t
,
∀
m
,
t
,
(27)
B
i
,
v
t
,
C
i
,
v
t
,
0
m
,
t
≥
0
,
α
i
,
v
m
,
t
,
δ
i
,
v
,
j
,
w
m
,
t
∈
0,1
,
0
≤
ω
≤
1
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
,
where constraint (12) expresses that working procedure can only be processed on the allowed machines. Formulas (13) and (14) are processing sequence constraints of the same workpiece, respectively. Constraints (15) and (16) mean production adjustment and processing work, which can only complete at most one working procedure at the same time, on any one machine in the same period, respectively. Constraint (17) shows that each process can only be processed on one machine when producing products. Constraints (18) and (19) emphasize that each working procedure has one immediate predecessor activity and one immediate successor activity. Constraints (20)–(23) denote that virtual working procedure can only be processed firstly and lastly on each machine. Constraint (24) gives an approach to calculate completion time of each machine. Formula (25) indicates that completion time of each machine cannot exceed the available time, which ensures feasibility of scheduling, and constraint (26) remarks the overtime limit.


## 3.1. Model Framework

In modern industries, such as automotive and mobile phone makers, mixed-model assembly lines are typical configuration where a set of workpieces will be assigned on different workstations and be transported along correspondingly different assembly lines. This paper assumes that the workshop hasM sets of machines with different stamping processing capacity, M
¯
=
{
1
,
…
,
M
}. m is machine index and m
∈
M
¯. Each machine is installed with a RFID information collection sensor; that is, the RFID readers for relatively fixed manufacturing resources (such as manufacturing equipment) and RFID tags for relatively moving manufacturing resources (such as manufacturing workers, containers for loading materials, and key components and parts) are deployed in the system. When those moving tags that are mounted on manufacturing objects fall into the active identification range of their nearby readers, tags information can be automatically acquired in real-time. Through mapping mechanism, the attached manufacturing resources could then be identified for dynamic control. It is planned to produce N types of workpieces in a period consisting of T production cycles, where T
¯
=
{
1
,
…
,
T
}, N
¯
=
{
1
,
…
,
N
}. In addition, i
,
j are workpiece indexes, where i
,
j
=
1
,
…
,
N. v
,
w are product process index, where v
,
w
=
1
,
…
,
n
i. Each workpiece i contains n
i processes, n
¯
i
=
{
1
,
…
,
n
i
}. (
i
,
v
) is the vth working process of workpiece i; we also assume that multiple machines can complete each processing plan simultaneously. In cycle t
(
t
∈
T
¯
), the demand of workpiece i is known to be d
i
,
t. Reasonable production planning and scheduling are required to be conducted so as to ensure all of the production tasks in each cycle can be completed, and processing time can be extended within appropriate ranger.The RFID configuration in sensing network for information collection in mixed-model assembly manufacturing is complex. The optimization of such configuration mainly aims at minimizing RFID total costs while meeting the objective of detectingK collection capacity and collection accuracy through M RFID equipment corresponding to manufacturing resources configuration. In addition, the key of production planning is to formulate production capacity X
i
,
t of various workpieces, so as to minimize the total cost of production cost, inventory cost, and shortage penalty cost. Production scheduling is to assign machines for each type of products and to determine product process sequence of each piece of equipment. The start and completion time of each workpiece in one machine could be computed, which may require workers to work overtime in some machines. For minimizing the total cost that includes machine setup cost and overhead, the interacting production planning and scheduling processes will be optimized in an integrated manner that covers all relevant cost while ensuring feasible scheduling.It is well known that setup process often involves die and mold changes, changes of tools or workpieces and the corresponding calibration, and so forth, which usually take certain significant time during a planning cycle. For the example of stamping process, the stamping part with different setup requirements may be produced insufficiently and thus be unable to meet the demands from the downstream welding workshop. Meanwhile, as product demands are dynamically changed for fitting urgent orders or emergency, welding workshop will increase the demand for stamped parts. To cope with such case, certain level of inventory control method will be explored, typically, how to set the safety stock? Generally, safety stock is a rigid requirement and is treated as a constraint. However, this requirement cannot be met under limited production capacity. Therefore, safety stock can be treated as an objective for fulfilling, instead of a constraint. If the safety stock level cannot be satisfied, penalty cost will be incurred accordingly.


## 3.2. Notations and Assumption

I
i
,
t
(
I
i
,
t
≥
0
) is used to denote the inventory of product i at the end of production cycle t. If it is greater than the specified safety stock value R
I
i
,
t, that is, I
i
,
t
≥
R
I
i
,
t, then the exceeded parts are called excess safety stock, which is denoted as S
I
i
,
t
+ (i.e., if I
i
,
t
≥
R
I
i
,
t, S
I
i
,
t
+
=
max
⁡
{
I
i
,
t
-
R
I
i
,
t
,
0
}). If the inventory is smaller than R
I
i
,
t, I
i
,
t
≤
R
I
i
,
t, then the insufficient part is called shortfall safety stock, which is denoted as S
I
i
,
t
- (i.e., if I
i
,
t
≤
R
I
i
,
t, S
I
i
,
t
-
=
max
⁡
{
R
I
i
,
t
-
I
i
,
t
,
0
}). Therefore, the inventory status of one product i is composed of specified safety stock R
I
i
,
t, safety stock excess S
I
i
,
t
+, and safety stock shortfall S
I
i
,
t
- which could be denoted as I
i
,
t
=
R
I
i
,
t
+
S
I
i
,
t
+
-
S
I
i
,
t
-. The unit penalty costs for safety stock shortfall and excess of product i in production cycle t are represented using variables C
h
i
,
t
-, C
h
i
,
t
+, respectively, and meet the condition of C
h
i
,
t
-
>
C
h
i
,
t
+. The summary of notations is used in this paper (see Notation).


## 3.3. Optimal Configuration of RFID Equipment

To leverage wireless application in mixed-model assembly manufacturing environment, identifying physical objects and tracing their movement throughout the production processes will be one of the fundamental supporting factors. Targeted objects are stuck or embedded with RFID tags, which are visible and traceable by those nearby physical readers that are deployed at some key control points. The identified physical objects become intelligent via dynamic information feedback and sharing capability provided by RFID facilities. Each unique RFID tag is mounted with one individual object. When one tag falls into the identification range of the active readers, these active readers will execute simple link layer protocol to retrieve the object identification information embedded in the identified tag. However, due to the characteristics of frequency identification wireless communication and the influence of complex application environment in mixed-model assembly manufacturing workshop, it suffers from receiving repeated readings of tags, missing reading of tags, and redundant objects data when multiple tags are associated with it. Consequently, the raw RFID data flow is unreliable in terms of data redundancy and incompleteness, which in turn results in difficulties for rational downstream applications and also limits its application feasibility. Therefore, the mixed-model assembly manufacturing environment requires proper configuration of RFID equipment prior to data collection and analysis, which is essential for effective system monitoring. The schematic diagram of RFID based real-time manufacturing information in physical workshop operation system is shown in Figure1.Figure 1
Schematic diagram of RFID based real-time MES in physical workshop environment.The nature of production monitoring techniques is to infer whether the manufacturing objects under tracking are in a specific “state,” “event,” or matching certain “rules,” according to basic object information, such as time, space, and interrelationship. A real-time MES monitoring system requires synthesising all the relevant information related to those selected objects for monitoring and will ignore the other objects and system noise. To sum up, there are lots of objects that can be monitored in any production environment, while it is neither practical nor necessary to implement full monitoring for all of them. For example, the objects under tracking could be selective, and only those high-value parts, or staffs, materials, and equipment located in key regions are included. When designing the model configuration of production monitoring schemes, “cost performance” of monitoring tasks will be adopted as the primary indicator for determination of whether the targeting objects, data collection methods and relevant processing technologies shall be applied or not.RFID devices are used to track manufacturing objects, by means of reading and writing radio signals, without physical or optical contact with the objects to be identified. The technology mainly consists of two types of sensor mechanisms. Passive sensors are not equipped with internal battery, which absorb and convert energy from RFID reader. Comparably, active sensors send signals by internal power, which can measure multiple types of sensors, such as temperature, pressure, and motion sensors. Which sensor is optimal for the real-time manufacturing process? It mainly depends on the workshop physical operating environment. Active sensor is suitable for tracking moving objects in a wide area, whereas it is a viable choice for passive sensor to identify information in nearby field. In this paper, RFID active and passive tags are assumed to be attached to single component or whole batch package. With respect to RFID equipment configuration regarding sensor network for manufacturing information acquisition in MES, the following mathematical model can be used for computing the optimal configuration:(1)
Min
⁡
Z
1
=
∑
i
=
1
M
‍
cost
ActiveSensor_
i
+
∑
j
=
1
N
‍
cost
PassiveSensor_
j
,
χ
1
,
…
,
χ
K
∈
χ
Sensor_
1
,
…
,
χ
Sensor_
M
+
N
,
φ
1
,
…
,
φ
K
∈
φ
Sensor_
1
,
…
,
φ
Sensor_
M
+
N
,
X
Sensor_
Ψ
-
X
i
2
+
Y
Sensor_
Ψ
-
Y
i
2
+
Z
Sensor_
Ψ
-
Z
i
2
≤
Θ
i
,
Sensor
Ψ
=
ActiveSensor_
i
Ψ
=
i
,
i
∈
1
,
M
PassiveSensor_
j
Ψ
=
j
,
j
∈
1
,
N
,
Ψ
∈
1
,
M
+
N
,
where the objective function is for K number of RFID data acquisitions to be detected, to minimize total costs while meeting the objective of detecting K acquisition quantity and accuracy through M
+
N sensing equipment (ActiveSensor_
i and PassiveSensor_
j) and accessory equipment corresponding to manufacturing resource configuration. The constraints are to ensure that the selected sensing equipment could meet K number of RFID acquisitions (
χ
1
,
…
,
χ
K
) and acquisition accuracy (
φ
1
,
…
,
φ
K
), respectively, as well as to ensure the reliability of sensor equipment configuration; that is, the distances between the installation location of the selected sensing equipment (
X
Sensor_
Ψ
,
Y
Sensor_
Ψ
,
Z
Sensor_
Ψ
) and working position of effective Reader
i
(
X
i
,
Y
i
,
Z
i
) are within the farthest sensor identification range.


## 3.4. Optimization of Production Planning

Production planning is for enterprises to make a series of decisions regarding production rate, inventory and shortage quantity, and so forth, for various products under the constraint of production capacity. The optimization of production planning aims at minimizing total expenses of the above decisions, where the production objectives and inventory level in each production cycle form control parameters. Generally, production planning and scheduling are formulated in sequence, that is, generating production planning first and then specifying scheduling based on such planning result. The main drawback of formulating production planning and scheduling by hierarchical approach is that information in detailed scheduling layer is not taken into account when formulating production planning. The resulted scheduling thus tends to be infeasible; that is to say, decisions made according to the planning layer may cause infeasible scheduling. Therefore, machine setup time, which is used for adjusting the machine configuration according to mixed-model assembly workshops processes, will be estimated for production batch optimization. In this paper, machine setup is set as variableα
i
,
v
m
,
t; the production planning model could be determined using the formula where the minimum overall production expense is adopted as the objective function:
(2)
Min
⁡
Z
2
=
∑
t
=
1
T
‍
∑
i
=
1
N
‍
C
h
i
,
t
+
S
I
i
,
t
+
+
C
h
i
,
t
-
S
I
i
,
t
-
+
C
p
i
,
t
X
i
,
t
∑
i
=
1
N
‍
∑
i
=
1
N
‍
+
H
+
C
b
i
,
t
L
i
,
t
+
C
u
i
,
t
y
i
,
t
.The main expense in this model is composed of penalty cost of safety stock excess, penalty cost of safety stock shortfall, production expenses, shortage cost, and production preparation cost. The constraint conditions are given by(3)
INV
i
+
L
i
,
1
+
X
i
,
1
=
I
i
,
1
+
d
i
,
1
,
∀
i
,
(4)
I
i
,
t
-
1
+
L
i
,
t
+
X
i
,
t
=
I
i
,
t
+
d
i
,
t
,
t
=
2
,
…
,
T
,
∀
i
,
(5)
∑
i
,
v
∈
J
m
‍
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
X
i
,
t
α
i
,
v
m
,
t
≤
ω
′
W
t
,
∀
m
,
t
,
(6)
S
I
i
,
t
+
=
max
⁡
I
i
,
t
-
R
I
i
,
t
,
0
,
∀
i
,
t
,
(7)
S
I
i
,
t
-
=
max
⁡
R
I
i
,
t
-
I
i
,
t
,
0
,
∀
i
,
t
,
(8)
m
l
i
y
i
,
t
≤
X
i
,
t
≤
M
l
i
y
i
,
t
,
∀
i
,
t
,
(9)
L
i
,
t
≤
d
i
,
t
,
∀
i
,
t
,
(10)
S
I
i
,
t
+
,
S
I
i
,
t
-
,
I
i
,
t
,
L
i
,
t
,
X
i
,
t
∈
z
N
×
T
+
,
y
i
,
t
∈
0,1
,
∀
i
,
t
,
where constraints (3) and (4) express materials balance equations. Formula (5) is production capacity constraint, where α
i
,
v
m
,
t is a constant. ω
′ represents coefficient of production capacity, and ω
′
=
1 if it is not allowed to work overtime; otherwise, ω
′
>
1. Constraints (6) and (7) give formulas to calculate safety stock excess and safety stock shortfall, respectively. Constraint (8) represents upper limit and lower limit of production batch. Constraints (9) and (10) restrict the upper limits of safety stock shortfall and workpiece shortage quantity.


## 3.5. Optimization of Production Scheduling

Production planning and scheduling, which are the two most important tasks in manufacturing production and operation management, are closely related to each other and significantly influence profits gaining, resource utilization efficiency, and punctual product delivery. Solutions of production planning (production objectives) are the input conditions for scheduling problems. Meanwhile, production capacity constraints involved in production planning problems are often related to scheduling solutions.The main task of production scheduling is to make machines assignment decision and to specify the sequence of production processes in each production cycle formulated in production planning. It could thus determine the start and completion time of each product in every working procedure on corresponding machines. Currently, the key that seriously hinders classical scheduling theoretical researches from making major progress and breakthroughs is NP nature of scheduling problem. The actual scheduling problems are always very complex without certain rules to follow and exact solutions are difficult to be obtained within limited time. Applying the classical scheduling theory based analytic optimization to actual scheduling problems that belong to NP-hard problems will inevitably encounter such obstacles.The scheduling problem we are handling is with delivery constraint, which assigns machines based on the minimum processing time for each process and machine load condition according to processing schedule from top to bottom. Since such NP-hard scheduling problem cannot find an overall exact solution directly, we propose to partially fix the solved batch planning result as a basis and use it to solve scheduling problem. Such method could finally get a near optimal solution through limited iterations. When the value of production batchX
i
,
t is known, variables X
i
,
t
,
y
i
,
t in the following constraints are known. Then, production scheduling model is as follows:
(11)
Min
⁡
Z
3
=
∑
m
=
1
M
‍
∑
t
=
1
T
‍
∑
i
=
1
N
‍
∑
v
=
1
n
i
‍
C
s
i
,
v
m
α
i
,
v
m
,
t
+
∑
m
=
1
M
‍
∑
t
=
1
T
‍
C
t
m
,
t
O
m
,
t
.Formula (11) takes minimum setup cost in terms of die and mold change, calibration cost, and overtime cost as objective functions. The corresponding constraint conditions are given by
(12)
α
i
,
v
m
,
t
≤
f
i
,
v
m
,
v
∈
n
¯
i
,
∀
i
,
m
,
t
,
(13)
C
i
,
v
t
≥
B
i
,
v
t
+
∑
m
∈
M
i
,
v
‍
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
x
i
,
t
α
i
,
v
m
,
t
,
v
∈
n
¯
i
,
∀
i
,
t
,
(14)
C
i
,
v
t
≤
B
i
,
v
+
1
t
,
v
∈
n
¯
i
,
∀
i
,
t
,
(15)
B
i
,
v
t
+
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
X
i
,
t
α
i
,
v
m
,
t
-
1
-
δ
i
,
v
,
j
,
w
m
,
t
G
≤
B
j
,
w
t
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
,
(16)
B
j
,
w
t
+
s
j
,
w
m
y
j
,
t
+
p
j
,
w
m
x
j
,
t
α
j
,
w
m
,
t
-
1
-
δ
j
,
w
,
i
,
v
m
,
t
G
≤
B
i
,
v
t
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
,
(17)
∑
m
∈
M
(
i
,
v
)
‍
α
i
,
v
m
,
t
=
y
i
,
t
,
v
∈
n
¯
i
,
∀
i
,
t
,
(18)
∑
(
i
,
v
)
∈
J
1
(
m
)
‍
δ
i
,
v
,
j
,
w
m
,
t
=
α
j
,
w
m
,
t
,
m
∈
M
j
,
w
,
w
∈
n
¯
j
,
∀
j
,
t
,
(19)
∑
(
j
,
w
)
∈
J
2
(
m
)
‍
δ
i
,
v
,
j
,
w
m
,
t
=
α
i
,
v
m
,
t
,
m
∈
M
i
,
v
,
v
∈
n
¯
i
,
∀
i
,
t
,
(20)
∑
(
i
,
v
)
∈
J
(
m
)
‍
δ
0
,
w
,
i
,
v
m
,
t
≤
1
,
w
=
m
,
∀
m
,
t
,
(21)
∑
(
i
,
v
)
∈
J
2
(
m
)
‍
δ
i
,
v
,
0
,
w
m
,
t
=
0
,
w
=
m
,
∀
m
,
t
,
(22)
∑
(
i
,
v
)
∈
J
(
m
)
‍
δ
i
,
v
,
n
+
1
,
w
m
,
t
≤
1
,
w
=
m
,
∀
m
,
t
,
(23)
∑
(
i
,
v
)
∈
J
1
(
m
)
‍
δ
n
+
1
,
w
,
i
,
v
m
,
t
=
0
,
w
=
m
,
∀
m
,
t
,
(24)
F
m
,
t
=
max
⁡
(
i
,
n
i
)
∈
J
(
m
)
C
i
,
n
i
t
-
1
-
δ
i
,
n
i
,
n
+
1
,
l
m
,
t
G
,
w
=
m
,
∀
m
,
t
,
(25)
F
m
,
t
≤
W
t
+
0
m
,
t
,
∀
m
,
t
,
v
,
(26)
0
≤
0
m
,
t
≤
ω
W
t
,
∀
m
,
t
,
(27)
B
i
,
v
t
,
C
i
,
v
t
,
0
m
,
t
≥
0
,
α
i
,
v
m
,
t
,
δ
i
,
v
,
j
,
w
m
,
t
∈
0,1
,
0
≤
ω
≤
1
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
,
where constraint (12) expresses that working procedure can only be processed on the allowed machines. Formulas (13) and (14) are processing sequence constraints of the same workpiece, respectively. Constraints (15) and (16) mean production adjustment and processing work, which can only complete at most one working procedure at the same time, on any one machine in the same period, respectively. Constraint (17) shows that each process can only be processed on one machine when producing products. Constraints (18) and (19) emphasize that each working procedure has one immediate predecessor activity and one immediate successor activity. Constraints (20)–(23) denote that virtual working procedure can only be processed firstly and lastly on each machine. Constraint (24) gives an approach to calculate completion time of each machine. Formula (25) indicates that completion time of each machine cannot exceed the available time, which ensures feasibility of scheduling, and constraint (26) remarks the overtime limit.


## 4. Reliability of RFID Data Processing

The ability to track real-time manufacturing information of workshop physical operating environment is the key for achieving agile production management. RFID technology is a promising technology to acquire real-time manufacturing feedback information. However, data acquisition using RFID technology in complex manufacturing environment may encounter redundant or missing readings, and signal fluctuation due to obstacles and noise. Consequently, a large amount of unreliable data flow will be output to the downstream MES applications. Therefore, how to process RFID events so as to provide reliable and meaningful real application information for downstream applications is the key technical issue that will be solved for successful application of RFID.This paper proposes a hierarchical data processing model to improve RFID system application reliability in multitag and multireader mixed-model manufacturing system application environment. It could clean and compensate unreliable data and solve RFID abnormal reading phenomena from the perspective of system application, so as to improve system identification rate and reliability level. Data processing model uses a hierarchical structure, which is composed of RFID equipment network layer, basic event processing layer, complex event processing layer, and application layer, as shown in Figure2. RFID equipment network generates basic events using a set of multiple types of readers that receive signal from neighbouring tags. Redundant RFID basic events caused by repeated reading could be filtered out and form simplified logical reading events. Complex event processing layer receives logical reading events uploaded by basic event processing layer. It could analyze and classify logical reading events based on default application integrity constraint rules, then be able to detect abnormal reading, and perform clean-up operations on received unreliable data. Such data process module will ensure the system integrity, provide meaningful application data, and output reliable interrelated information among tags and their associated objects, such as interdistance and moving directions, for agile production management applications in the application layer.Figure 2
Data processing model structure of RFID manufacturing information system reliability.


### 4.1. RFID Basic Event Processing

Plenty of data recording signals fired by tags will be sent out by the distributed logical control point reader network as input for the basic event processing layer. The distributed deployment in logical control points and its structure consists of distributed physical reader adapter, RFID basic event queue, tag event filter, logical reading event filter, object event queue, and logical mapping engine, as shown in Figure3. The logical mapping engine stores the mapping relations between one identified tag and its corresponding physical object.Figure 3
Structure of RFID basic event processing layer.Reader adapter first collects raw data generated by corresponding physical readers and forms RFID basic events for uploading into tag event filter, which cleans redundant tag information collected by multiple readers according to the unique tag logical matching mechanism.In multitag and multireader application schemes, more than one tag event in RFID basic event queue may be pointed to one physical object. In other words, RFID basic events may contain repeated records for single physical object. Logical reading event filter will filter out duplicated object events according to logical mapping engine via following the principle of not allowing repeated physical object event in each logical control point. Finally, each object and its solely associated tag event are stored in the object event queue and will be uploaded into the correlated logical control point for further processing in the complex event processing module.


### 4.2. RFID Complex Event Processing

Although basic event layer could clean repeated and redundant data in logical control points and eliminate duplicated tag reading by multiple readers, it does not deal with unreliability caused by redundant and missing reading of tags. Complex event processing layer will be followed to improve the reliability of RFID system application through detecting and correcting redundant data according to RFID application integrity constraint rules. Integrity constraints are based on different perspectives, such as weight, location and motion paths of tag, and, of course, their associative identified physical objects. The constraints could also be based on mutual relations among different objects such as inclusion and exclusion relationships. The structure of complex event processing layer is shown in Figure4, which mainly consists of manufacturing object information base, integrity constraint rules base, event classification engine, normal event processor, redundant reading processor, and missing reading processor. Integrity constraint rules are the fundamental rules and are set as the default constraint in initial condition.Figure 4
Structure of RFID complex event processing layer.In manufacturing system, some identified physical objects tend to move along predetermined routes to destinations, such as WIP in production lines and warehouse products. When the detected actual route is different from the pre-specified one, it can report that physical object has encountered unreliable reading phenomena at some logical control points. So, redundant and missed read-write phenomena are extracted using management information base that records motion routes of physical objects. The associated relationship between objects and schema is also utilized.


## 4.1. RFID Basic Event Processing

Plenty of data recording signals fired by tags will be sent out by the distributed logical control point reader network as input for the basic event processing layer. The distributed deployment in logical control points and its structure consists of distributed physical reader adapter, RFID basic event queue, tag event filter, logical reading event filter, object event queue, and logical mapping engine, as shown in Figure3. The logical mapping engine stores the mapping relations between one identified tag and its corresponding physical object.Figure 3
Structure of RFID basic event processing layer.Reader adapter first collects raw data generated by corresponding physical readers and forms RFID basic events for uploading into tag event filter, which cleans redundant tag information collected by multiple readers according to the unique tag logical matching mechanism.In multitag and multireader application schemes, more than one tag event in RFID basic event queue may be pointed to one physical object. In other words, RFID basic events may contain repeated records for single physical object. Logical reading event filter will filter out duplicated object events according to logical mapping engine via following the principle of not allowing repeated physical object event in each logical control point. Finally, each object and its solely associated tag event are stored in the object event queue and will be uploaded into the correlated logical control point for further processing in the complex event processing module.


## 4.2. RFID Complex Event Processing

Although basic event layer could clean repeated and redundant data in logical control points and eliminate duplicated tag reading by multiple readers, it does not deal with unreliability caused by redundant and missing reading of tags. Complex event processing layer will be followed to improve the reliability of RFID system application through detecting and correcting redundant data according to RFID application integrity constraint rules. Integrity constraints are based on different perspectives, such as weight, location and motion paths of tag, and, of course, their associative identified physical objects. The constraints could also be based on mutual relations among different objects such as inclusion and exclusion relationships. The structure of complex event processing layer is shown in Figure4, which mainly consists of manufacturing object information base, integrity constraint rules base, event classification engine, normal event processor, redundant reading processor, and missing reading processor. Integrity constraint rules are the fundamental rules and are set as the default constraint in initial condition.Figure 4
Structure of RFID complex event processing layer.In manufacturing system, some identified physical objects tend to move along predetermined routes to destinations, such as WIP in production lines and warehouse products. When the detected actual route is different from the pre-specified one, it can report that physical object has encountered unreliable reading phenomena at some logical control points. So, redundant and missed read-write phenomena are extracted using management information base that records motion routes of physical objects. The associated relationship between objects and schema is also utilized.


## 5. Generalized Lagrangian Decomposition Approach

The model described above contains RFID optimal configuration, production planning, and scheduling optimization, which belongs to a typical NP-hard problem. Although no exact solution could be found within the limited time, this paper proposes to solve the problem using a novel Lagrangian decomposition approach. By introducing three groups of new constraints and settingχ
(
z
)
=
1, if z
>
0, and χ
(
z
)
=
0, otherwise; the overall objective function can be shown as follows:
(28)
Min
⁡
Z
=
Min
⁡
Z
1
+
Min
⁡
Z
2
+
Min
⁡
Z
3
.The new constraints for integrated optimization model include the following:(29)
X
i
,
t
=
Q
i
,
t
,
∀
i
,
t
,
(30)
α
i
,
v
m
,
t
=
β
i
,
v
m
,
t
,
∀
i
,
t
,
(31)
y
¯
i
,
t
=
χ
Q
i
,
t
,
∀
i
,
t
,
(32)
∑
i
,
v
∈
J
m
‍
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
x
i
,
t
β
i
,
v
m
,
t
≤
W
t
+
O
m
,
t
,
∀
m
,
t
,
(33)
C
i
,
v
t
≥
B
i
,
v
t
+
∑
m
∈
M
i
,
v
‍
s
i
,
v
m
y
¯
i
,
t
+
p
i
,
v
m
Q
i
,
t
α
i
,
v
m
,
t
,
v
∈
n
¯
i
,
∀
i
,
t
,
(34)
C
i
,
v
t
≥
B
i
,
v
t
+
∑
m
∈
M
i
,
v
‍
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
X
i
,
t
β
i
,
v
m
,
t
,
v
∈
n
¯
i
,
∀
i
,
t
,
(35)
B
i
,
v
t
+
s
i
,
v
m
y
¯
i
,
t
+
p
i
,
v
m
Q
i
,
t
α
i
,
v
m
,
t
-
1
-
δ
i
,
v
,
j
,
w
m
,
t
G
≤
B
j
,
w
t
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
,
(36)
B
j
,
w
t
+
s
j
,
w
m
y
¯
j
,
t
+
p
j
,
w
m
Q
j
,
t
α
j
,
w
m
,
t
-
1
-
δ
j
,
w
,
i
,
v
m
,
t
G
≤
B
i
,
v
t
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
,
(37)
∑
m
∈
M
(
i
,
v
)
‍
α
i
,
v
m
,
t
=
y
¯
i
,
t
,
v
∈
n
¯
i
,
∀
i
,
t
,
where Q
i
,
t, β
i
,
v
m
,
t, as specified in constraints (29) and (30), are artificial variables that connect production planning and scheduling. Constraint (31) determines whether product i is produced in cycle t and ensures that production preparation is carried out only when certain kinds of products are determined to be processed. In order to use Lagrangian algorithm, which carries out computing the variables in production planning and scheduling will be transferred and coordinated in each time of Lagrangian iteration cycle. The variables Q
i
,
t, y
¯
i
,
t in scheduling problem are set to be the corresponding output values X
i
,
t, y
i
,
t, computed in the production planning process. Similarly, variable α
i
,
v
m
,
t of machine setup in scheduling problem is assigned as β
i
m used in planning problem. In order to decompose and coordinate planning and scheduling, constraints (32) and (34) are followed in Lagrangian treatment of planning subproblem, where β
i
,
v
m
,
t is a constant.Formulas (33), (35), and (36) will be used in scheduling subproblem of Lagrangian approach (Q
i
,
t and y
¯
i
,
t are treated as constants). Constraint (33) shows that processing machines are assigned only when there is production demand, that is, y
¯
i
,
t
=
1. We introduce Lagrangian multipliers μ
=
{
μ
i
,
t
}, v
=
{
v
i
,
v
m
,
t
}, i
∈
N
¯, v
∈
n
¯
i, m
∈
M
¯, t
∈
T
¯, and θ
=
(
μ
,
v
). Lagrangian multipliers μ
i
,
t, v
i
,
v
m
,
t correspond to the artificial variables Q
i
,
t and β
i
m, which will be considered as shadow prices. μ
i
,
t can be interpreted as profits obtained by selling unit production capacity and resources, and v
i
,
v
m
,
t is profits gained by enterprises leasing equipment.Lagrangian multipliersμ
=
{
μ
i
,
t
}, v
=
{
v
i
,
v
m
,
t
} are used in the objective function to relax the constraints; the corresponding relaxation model is then given by
(38)
Z
LR
=
Z
+
∑
i
=
1
N
‍
∑
t
=
1
T
‍
μ
i
,
t
X
i
,
t
-
Q
i
,
t
+
∑
t
=
1
T
‍
∑
m
=
1
M
‍
∑
i
=
1
N
‍
∑
v
=
1
n
i
‍
v
i
,
v
m
,
t
α
i
,
v
m
,
t
-
β
i
,
v
m
,
t
=
∑
t
=
1
T
‍
∑
i
=
1
N
‍
C
h
i
+
S
I
i
,
t
+
+
C
h
i
-
S
I
i
,
t
-
+
(
C
p
i
,
t
+
μ
i
,
t
)
X
i
,
t
∑
i
=
1
N
‍
∑
i
=
1
N
‍
H
+
C
b
i
,
t
L
i
,
t
+
C
u
i
,
t
y
i
,
t
C
h
i
+
S
I
i
,
t
+
+
C
h
i
-
S
I
i
,
t
-
+
(
C
p
i
,
t
+
μ
i
,
t
)
X
i
,
t
-
∑
t
=
1
T
‍
∑
m
=
1
M
‍
∑
i
=
1
N
‍
∑
v
=
1
n
i
‍
v
i
,
v
m
,
t
+
∑
t
=
1
T
‍
∑
m
=
1
M
‍
∑
i
=
1
N
‍
∑
v
=
1
n
i
‍
C
s
i
,
v
m
+
v
i
,
v
m
,
t
α
i
,
v
m
,
t
+
∑
m
=
1
M
‍
∑
t
=
1
T
‍
C
t
m
,
t
O
m
,
t
,
(39)
μ
i
,
t
=
λ
C
p
i
,
v
i
,
v
m
,
t
=
λ
C
s
i
,
v
m
,
0
≤
λ
≤
1
.Note that this model in fact cannot be decomposed into mutually independent subproblems of planning and scheduling, and thus this problem cannot be solved by being decomposed into a series of subproblems by standard Lagrangian decomposition approach. However, approximate solution of this problem can be obtained by a generalized Lagrangian decomposition approach. That is to say, this problem is decomposed into two subproblems, involving production plan problem assigned by fixed machines and production scheduling problem with fixed volume, and then is solved by alternating iterations. This generalized Lagrangian decomposition approach can be seen as a combination of standard Lagrangian approach with Gauss-Seidel iterative principle. In previous literature, the established aggregate production planning model is decomposed into labor model and production planning model, when studying production batch planning problem of labor-constrained production system. However, these two subproblems are not independent, and production planning model involves two variables, namely, production batch and labor force, among which quantity variable of labor is related to variables in labor subproblem. Besides, when solving inventory routing problem by Lagrangian, this problem is decomposed into inventory problem and routing problem. Vehicle distribution route is fixed when solving inventory problem, while inventory variable is seen as a constant when optimizing distribution vehicle routes. Therefore, these are essentially generalized Lagrangian decomposition approach.We can setx
=
(
S
I
+
,
S
I
-
,
X
,
L
,
y
) and π
=
(
α
,
δ
,
B
,
C
) as decision variables of batch production plan and scheduling subproblem, respectively, and denote Z
¯
2
(
x
∣
θ
,
β
¯
) as relaxation production planning problem with fixed machine assignment β as β
¯ and Z
¯
3
(
π
∣
θ
,
Q
¯
) as relaxation scheduling subproblem with fixed production batch Q as Q
¯. Machine assignment variable β
i
,
v
m
,
t can be fixed as constant β
¯
i
,
v
m
,
t. In each time of iteration of Lagrangian algorithm, take the value of constant β
¯
i
,
v
m
,
t in production planning as constant δ
¯
i
,
v
,
j
,
w
m
,
t; that is, fix the sequencing results of scheduling subproblem in last iteration and substitute β
¯
i
,
v
m
,
t and δ
¯
i
,
v
,
j
,
w
m
,
t into original constraint formula. Thus, we can get Lagrangian model of production planning subproblem specifically as follows:
(40)
Z
¯
2
x
∣
θ
,
β
¯
=
∑
t
=
1
T
‍
∑
i
=
1
N
‍
C
h
i
+
S
I
i
,
t
+
+
C
h
i
-
S
I
i
,
t
-
=
=
∑
i
=
1
N
‍
∑
i
=
1
N
‍
+
(
C
p
i
,
t
+
μ
i
,
t
)
X
i
,
t
+
G
b
i
,
t
L
i
,
t
+
C
u
i
,
t
y
i
,
t
h
i
+
S
I
i
,
t
+
+
C
h
i
-
S
I
i
,
t
-
-
∑
t
=
1
T
‍
∑
m
=
1
M
‍
∑
i
=
1
N
‍
∑
v
=
1
n
i
‍
v
i
,
v
m
,
t
β
¯
i
,
v
m
,
t
,
(41)
∑
i
,
v
∈
J
m
‍
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
x
i
,
t
β
¯
i
,
v
m
≤
1
+
ω
W
t
,
∀
m
,
t
,
(42)
C
i
,
v
t
≥
B
i
,
v
t
+
m
∑
m
∈
M
i
,
v
‍
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
x
i
,
t
β
¯
i
,
v
m
,
∀
m
,
t
,
(43)
B
i
,
v
t
+
s
i
,
v
m
y
i
,
t
+
p
i
,
v
m
X
i
,
t
β
¯
i
,
v
m
,
t
-
1
-
δ
¯
i
,
v
,
j
,
w
m
,
t
G
≤
B
j
,
w
t
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
,
(44)
B
j
,
w
t
+
s
j
,
w
m
y
j
,
t
+
p
j
,
w
m
X
j
,
t
β
¯
j
,
w
m
,
t
-
1
-
δ
¯
j
,
w
,
i
,
v
m
,
t
G
≤
B
i
,
v
t
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
,
(45)
F
m
,
t
=
max
⁡
i
,
n
i
∈
J
m
C
i
,
n
i
t
-
1
-
δ
¯
i
,
n
i
,
n
+
1
,
w
m
,
t
G
,
w
=
m
,
m
∈
M
¯
,
t
∈
T
¯
.Formula (41) is production capacity constraint with fixed machine assignment variable, and the remaining formulas are production batch constraints after fixing machine processing sequence, aiming at completing formulated production planning in prescribed production cycle, that is, ensuring that the obtained planning is feasible. It is worth pointing out that, for overtime variable O
m of each cycle in Lagrangian production planning model, t is substituted by the maximum available overtime, and this change does not affect solution to the objective function, because in the optimal solution, the batch planning ensures obtaining feasible scheduling, while specific overtime is determined by Lagrangian scheduling subproblem. Here, we denote variable Q
i
,
t in the above constraints as constant Q
¯
i
,
t and reach constraints of Lagrangian scheduling subproblem. During the running of Lagrangian algorithm, for each time of iteration, Q
¯
i
,
t takes batch value X
i
,
t obtained in last iteration in production planning. Lagrangian scheduling model is specifically given by
(46)
Z
¯
3
π
∣
θ
,
Q
¯
=
∑
m
=
1
M
‍
∑
t
=
1
T
‍
C
t
m
,
t
∑
t
=
1
T
‍
∑
m
=
1
M
‍
∑
i
=
1
N
‍
∑
v
=
1
n
i
‍
C
s
i
,
v
m
+
υ
i
,
v
m
,
t
α
i
,
v
m
,
t
-
∑
i
=
1
N
‍
∑
t
=
1
T
‍
μ
i
,
t
Q
¯
i
,
t
,
(47)
y
¯
i
,
t
=
x
Q
¯
i
,
t
,
∀
,
i
,
t
,
(48)
C
i
,
v
t
≥
B
i
,
v
t
+
∑
m
∈
M
i
,
v
‍
s
i
,
v
m
y
¯
i
,
v
+
p
i
,
v
m
Q
¯
i
,
v
α
i
,
v
m
,
v
∈
n
¯
i
,
∀
i
,
t
,
(49)
B
i
,
v
t
+
s
i
,
v
m
y
¯
i
,
v
+
p
i
,
v
m
Q
¯
i
,
v
α
i
,
v
m
,
t
-
1
-
δ
j
,
w
,
i
,
v
m
,
t
G
≤
B
i
,
v
t
,
v
∈
n
¯
i
,
w
∈
n
¯
j
,
∀
i
,
j
,
m
,
t
.With a given batch planning, Lagrangian relaxation scheduling problem (LRSP) is a scheduling problem with delivery constraint and is solved by hierarchical approach in this paper. Firstly, an improved localization approach is designed to determine machine assignment problem and assigns machines for operating process with machine load conditions. The main idea is to form a processing schedule firstly by lining up processes of all workpieces (the same workpieces are not separated when lining up, and workpieces are lined up according to workpiece number) and then assign machines based on the minimum processing time of each process and machine load conditions according to processing schedule from top to bottom. However, the assignment results rely on workpiece arrangement locations. References [34, 35] improve this method, that is, selecting two workpieces randomly and exchanging locations of both workpieces in the schedule. This paper makes further improvement; that is, machines are not required to be assigned for processes in strict accordance with sequence specified in schedule. An unassigned process could be randomly selected each time (select from processes that have not been assigned with machines and have the minimum number of processes) and be assigned with a machine for it according to the minimum processing time and machine load conditions.


## 6. Algorithms and Numerical Simulations

### 6.1. RFID Data Processing Algorithm in MES

Definition 1.
At timeτ, all tags within the identification range of physical readers are detected, and data interaction is conducted once. That is to say, physical readers detect the tags that generate just one RFID basic event e at time τ. Generally, data generated by RFID basic event can be expressed by triple p
e
=
(
p
r
,
e
p
c
,
τ
), where p
r is a physical reader identifier, e
p
c is a tag identifier, τ is the time of event, and p
e denotes an example of RFID basic event.The above definition is used for Algorithm1.Algorithm 1:RFID basic event processing algorithm.
Step  1. Receive RFID basic reading events p
e
1
=
(
p
r
1
,
e
p
c
1
,
τ
) generated by physical readers.
Step  2. Query RFID basic event queue based on e
p
c
1, and skip to Step  7 if there are RFID
basic events with the same tag numbers.
Step  3. Insert e
p
c
1 into the RFID basic event queue.
Step  4. Search physical object numbers in mapping relation table between objects and tags
based on e
p
c
1; if none is found, skip to Step  7.
Step  5. Search logical reading events with the same object numbers in logical reading event
queue according to physical object numbers. If it is positive, skip to Step  7.
Step  6. Assemble p
e
1 into logical reading events according to physical object numbers, and
insert l
e
k
=
(
l
p
k
,
o
k
,
τ
) into logical reading event queue.
Step  7. Abandon RFID basic event; skip to Step  1.In consideration of physical object route constraintR
(
L
P
,
A
), where logical control points are corresponding to l
p
∈
L
P, possible routes of physical object among logical control points are corresponding to a
∈
A. Physical object moves along the prespecified routes l
p
1
,
…
,
l
p
m, which are called default object routes. To judge sequence relationship of logical control points on object routes, the following definition is given.Definition 2.
For any two logical control pointsl
p
i and l
p
j, if l
p
i is in front of l
p
j, then physical object passes l
p
i first and then l
p
j, and l
p
i
<
l
p
j. If logical reading event l
e
k
=
(
l
p
k
,
o
k
,
τ
) is currently received, redundant reading and reading leak phenomena of physical objects can be determined by the following method.
Search for physical object that will pass in default routes in logical control point,l
p
pre. If l
p
pre
=
l
p
k, physical object is identified in normal status; if l
p
pre
<
l
p
k, it is redundant reading phenomenon; otherwise if l
p
pre
>
l
p
k, physical object has reading leak phenomenon at all logical control points. l
p
leak will be positioned in between l
p
k and l
p
pr
e in default routes 〈
l
p
1
,
…
,
l
p
k
,
…
,
l
p
pre
,
…
,
l
p
j
〉. The relationship l
p
k
<
l
p
leak
<
l
p
pre or l
p
k
=
l
p
leak will be held.According to the above definition, RFID complex event processing algorithm can be obtained as in Algorithm2.Algorithm 2:RFID complex event processing algorithm.
Step  1. Receive logical reading event l
e
k
=
(
l
p
k
,
o
k
,
τ
) uploaded by logical control points where k is from 1 to K.
Step  2. Get logical control point l
p
pre that should be actually passed at present from route constraints rule.
If l
p
k
=
l
p
pre, skip to Step  4; if l
p
k
<
l
p
pre, skip to Step  5.
Step  3. Find logical control point of reading leak l
p
leak from route constraints rule based on o
k and l
p
k.
The system executes compensation reading from object k and adds reading leak records
(
o
k
,
l
p
leak, “compensation,” τ
) to the object information base.
Step  4. Add normal identification records to object information base.
Step  5. Abandon logical reading event l
p
k, and skip to Step  1.


### 6.2. Production Planning and Scheduling Optimization Algorithm

For generalized Lagrangian relaxation algorithm used in this paper, planning and scheduling subproblems will be solved, respectively, in each time of Lagrangian iteration. Among each iteration, planning subproblem uses the sequencing results of scheduling in last iteration, and vice versa. That is, solving planning subproblem with fixed sequence (by accurate optimization method solved by branch and bound method) and solving scheduling by fixing the solved batch. Thus, this algorithm is essentially an alternating iteration method. Lasserre proposed to solve workshop production planning and scheduling integrated optimization problem by alternating iteration method, that is, alternating “solving planning problem with a fixed sequence” and “solving scheduling problem with fixed planning” [32, 36]. It was proved that this algorithm can converge to a local optimal solution through limited iterations under the condition that planning and scheduling subproblems are solved by accurate optimization method. Solution to scheduling by fixed planning of this algorithm is actually to seek good scheduling with given planning, so that planning objectives can be further improved in the next iteration. It will be pointed out that “accurate optimization method applied to both planning and scheduling subproblems” is an ideal condition, as it is unpractical to solve scheduling subproblem by accurate method (Algorithm 3).Algorithm 3:Production planning and scheduling optimization algorithm.
Step  1 (initialize). Set coefficient λ
0
=
0 in formula (39), and select a group of β
¯
0 randomly.
Set Lagrangian multiplier upgrade step  size Δ
λ and maximum number of iterations,
iteration number η
=
1 and V
=
+
∞.
Step  2 (update penalty coefficient). Calculate new penalty coefficient, λ
η
=
λ
η
-
1
+
Δ
λ, and determine the value of θ
η.
Step  3 (solve production planning subproblem). Obtain solution θ
η of Z
¯
2
(
x
∣
θ
η
,
β
¯
η
-
1
),
where the solution of batch X is denoted as X
η, and set Q
¯
η
=
X
η.
Step  4 (solve scheduling subproblem). Obtain the solution π
η of Z
¯
3
(
π
∣
θ
η
,
Q
¯
η
), where
solution of assignment variable a is denoted as a
η, and set β
¯
η
=
a
η
,
δ
¯
η
=
δ
η.
Step  5 (target values of problems). Set target values Z
η
=
Z
¯
2
(
x
∣
θ
η
,
β
¯
η
-
1
)
+
Z
¯
3
(
π
∣
θ
η
,
Q
¯
η
), s
o
l
T
=
(
x
T
,
π
T
),
and when η
=
1, set U
=
s
o
l
η.
Step  6 (determine whether the end condition is met). If η is less than iterations,
output target value V and solution U, the algorithm ends; otherwise, set η
=
η
+
1, and skip to Step  2.Comparing to Lasserre’s method, this paper proposes to solve planning subproblem and scheduling subproblem in pairs in each time of iteration. These two subproblems are coordinated and optimized through Lagrangian multipliers. In addition, generalized Lagrangian relaxation algorithm used in this paper is essentially a heuristic algorithm, and the end condition of it is set as the number of iterations reaches the prescribed number.


### 6.3. Numerical Simulations

Joint decision model is a nonconvex and nonconcave nonlinear programming model with a fraction. Traditional nonlinear programming approach can be adopted, such as GINO, gradient search, and semi-Newton method. However, these approaches tend to suffer from local minima. As the number of suppliers, manufacturers, and product categories increases, multiple components manufacturing lines will produce diverse products simultaneously and feed them to corresponding mixed-model assembly lines. The calculation and optimization solution becomes very complex and difficult. It is hard, if not impossible, for traditional nonlinear programming algorithms to solve the optimal solution.This paper takes the automobile stamping workshop with five sets of equipment (m
1
,
…
,
m
5) as the case study example; the interval of production plan covers three production cycles. The normal production capacity of each cycle is 8-hour working time (i.e., 28,800 s) and the largest overtime is 4,800 s. Six kinds of workpieces can be stamped. The other relevant parameters are set as follows: d
i
,
1
=
650, d
i
,
2
=
d
i
,
3
=
800; R
I
i
,
t
=
200; C
p
i
,
t
=
C
h
i
,
t
+
=
40, C
h
i
,
1
-
=
160, C
h
i
,
2
-
=
135, C
h
i
,
3
-
=
110, C
b
i
,
1
-
=
560, C
b
i
,
2
-
=
375, C
b
i
,
3
-
=
180, C
u
i
,
1
-
=
210, i
=
1
,
…
,
6
,
t
=
1
,
…
,
3. Stamping processing capacity of each machine is assumed to be m
1
=
m
2
=
650, m
3
=
m
4
=
850, m
5
=
1000, respectively. In addition, the equipment with low stamping capacity cannot process those working procedures with high stamping requirement (see Table 2).Table 2
Working procedure
J
1
J
2
J
3
J
4
J
5
J
6
m
1
2
5
5
3
4
1
m
2
2
5
3
1
2
3
m
3
1
5
2
4
4
3
m
4
5
2
2
4
3
m
5
1The production batch can be obtained from the above production plan modelX
=
(
X
1
,
X
2
,
X
3
)
=
(
850,850,850,850,850,850
), also S
I
i
+
=
S
I
i
-
=
0
(
i
=
1,2
,
3
). The shortage quantity of production in three cycles is initialized as L
1
=
L
2
=
L
3
=
0. The objective function of the production planning is achieved as 668300. If we assign the WIP to pass along the computed machining sequence, the completion time of each production cycle is beyond the maximally allowed processing time. It means that there is no match between production plan and production scheduling. However, if we adopt the model proposed in this paper to resolve the global optimum solution, the total completion times of the three production cycles are 33247, 33247, and 32567, respectively. Each of them is less than its correspondingly maximally allowed production capacity. Therefore, the computed production plan is feasible, which indicates the effectiveness of the proposed optimization model.


## 6.1. RFID Data Processing Algorithm in MES

Definition 1.
At timeτ, all tags within the identification range of physical readers are detected, and data interaction is conducted once. That is to say, physical readers detect the tags that generate just one RFID basic event e at time τ. Generally, data generated by RFID basic event can be expressed by triple p
e
=
(
p
r
,
e
p
c
,
τ
), where p
r is a physical reader identifier, e
p
c is a tag identifier, τ is the time of event, and p
e denotes an example of RFID basic event.The above definition is used for Algorithm1.Algorithm 1:RFID basic event processing algorithm.
Step  1. Receive RFID basic reading events p
e
1
=
(
p
r
1
,
e
p
c
1
,
τ
) generated by physical readers.
Step  2. Query RFID basic event queue based on e
p
c
1, and skip to Step  7 if there are RFID
basic events with the same tag numbers.
Step  3. Insert e
p
c
1 into the RFID basic event queue.
Step  4. Search physical object numbers in mapping relation table between objects and tags
based on e
p
c
1; if none is found, skip to Step  7.
Step  5. Search logical reading events with the same object numbers in logical reading event
queue according to physical object numbers. If it is positive, skip to Step  7.
Step  6. Assemble p
e
1 into logical reading events according to physical object numbers, and
insert l
e
k
=
(
l
p
k
,
o
k
,
τ
) into logical reading event queue.
Step  7. Abandon RFID basic event; skip to Step  1.In consideration of physical object route constraintR
(
L
P
,
A
), where logical control points are corresponding to l
p
∈
L
P, possible routes of physical object among logical control points are corresponding to a
∈
A. Physical object moves along the prespecified routes l
p
1
,
…
,
l
p
m, which are called default object routes. To judge sequence relationship of logical control points on object routes, the following definition is given.Definition 2.
For any two logical control pointsl
p
i and l
p
j, if l
p
i is in front of l
p
j, then physical object passes l
p
i first and then l
p
j, and l
p
i
<
l
p
j. If logical reading event l
e
k
=
(
l
p
k
,
o
k
,
τ
) is currently received, redundant reading and reading leak phenomena of physical objects can be determined by the following method.
Search for physical object that will pass in default routes in logical control point,l
p
pre. If l
p
pre
=
l
p
k, physical object is identified in normal status; if l
p
pre
<
l
p
k, it is redundant reading phenomenon; otherwise if l
p
pre
>
l
p
k, physical object has reading leak phenomenon at all logical control points. l
p
leak will be positioned in between l
p
k and l
p
pr
e in default routes 〈
l
p
1
,
…
,
l
p
k
,
…
,
l
p
pre
,
…
,
l
p
j
〉. The relationship l
p
k
<
l
p
leak
<
l
p
pre or l
p
k
=
l
p
leak will be held.According to the above definition, RFID complex event processing algorithm can be obtained as in Algorithm2.Algorithm 2:RFID complex event processing algorithm.
Step  1. Receive logical reading event l
e
k
=
(
l
p
k
,
o
k
,
τ
) uploaded by logical control points where k is from 1 to K.
Step  2. Get logical control point l
p
pre that should be actually passed at present from route constraints rule.
If l
p
k
=
l
p
pre, skip to Step  4; if l
p
k
<
l
p
pre, skip to Step  5.
Step  3. Find logical control point of reading leak l
p
leak from route constraints rule based on o
k and l
p
k.
The system executes compensation reading from object k and adds reading leak records
(
o
k
,
l
p
leak, “compensation,” τ
) to the object information base.
Step  4. Add normal identification records to object information base.
Step  5. Abandon logical reading event l
p
k, and skip to Step  1.


## 6.2. Production Planning and Scheduling Optimization Algorithm

For generalized Lagrangian relaxation algorithm used in this paper, planning and scheduling subproblems will be solved, respectively, in each time of Lagrangian iteration. Among each iteration, planning subproblem uses the sequencing results of scheduling in last iteration, and vice versa. That is, solving planning subproblem with fixed sequence (by accurate optimization method solved by branch and bound method) and solving scheduling by fixing the solved batch. Thus, this algorithm is essentially an alternating iteration method. Lasserre proposed to solve workshop production planning and scheduling integrated optimization problem by alternating iteration method, that is, alternating “solving planning problem with a fixed sequence” and “solving scheduling problem with fixed planning” [32, 36]. It was proved that this algorithm can converge to a local optimal solution through limited iterations under the condition that planning and scheduling subproblems are solved by accurate optimization method. Solution to scheduling by fixed planning of this algorithm is actually to seek good scheduling with given planning, so that planning objectives can be further improved in the next iteration. It will be pointed out that “accurate optimization method applied to both planning and scheduling subproblems” is an ideal condition, as it is unpractical to solve scheduling subproblem by accurate method (Algorithm 3).Algorithm 3:Production planning and scheduling optimization algorithm.
Step  1 (initialize). Set coefficient λ
0
=
0 in formula (39), and select a group of β
¯
0 randomly.
Set Lagrangian multiplier upgrade step  size Δ
λ and maximum number of iterations,
iteration number η
=
1 and V
=
+
∞.
Step  2 (update penalty coefficient). Calculate new penalty coefficient, λ
η
=
λ
η
-
1
+
Δ
λ, and determine the value of θ
η.
Step  3 (solve production planning subproblem). Obtain solution θ
η of Z
¯
2
(
x
∣
θ
η
,
β
¯
η
-
1
),
where the solution of batch X is denoted as X
η, and set Q
¯
η
=
X
η.
Step  4 (solve scheduling subproblem). Obtain the solution π
η of Z
¯
3
(
π
∣
θ
η
,
Q
¯
η
), where
solution of assignment variable a is denoted as a
η, and set β
¯
η
=
a
η
,
δ
¯
η
=
δ
η.
Step  5 (target values of problems). Set target values Z
η
=
Z
¯
2
(
x
∣
θ
η
,
β
¯
η
-
1
)
+
Z
¯
3
(
π
∣
θ
η
,
Q
¯
η
), s
o
l
T
=
(
x
T
,
π
T
),
and when η
=
1, set U
=
s
o
l
η.
Step  6 (determine whether the end condition is met). If η is less than iterations,
output target value V and solution U, the algorithm ends; otherwise, set η
=
η
+
1, and skip to Step  2.Comparing to Lasserre’s method, this paper proposes to solve planning subproblem and scheduling subproblem in pairs in each time of iteration. These two subproblems are coordinated and optimized through Lagrangian multipliers. In addition, generalized Lagrangian relaxation algorithm used in this paper is essentially a heuristic algorithm, and the end condition of it is set as the number of iterations reaches the prescribed number.


## 6.3. Numerical Simulations

Joint decision model is a nonconvex and nonconcave nonlinear programming model with a fraction. Traditional nonlinear programming approach can be adopted, such as GINO, gradient search, and semi-Newton method. However, these approaches tend to suffer from local minima. As the number of suppliers, manufacturers, and product categories increases, multiple components manufacturing lines will produce diverse products simultaneously and feed them to corresponding mixed-model assembly lines. The calculation and optimization solution becomes very complex and difficult. It is hard, if not impossible, for traditional nonlinear programming algorithms to solve the optimal solution.This paper takes the automobile stamping workshop with five sets of equipment (m
1
,
…
,
m
5) as the case study example; the interval of production plan covers three production cycles. The normal production capacity of each cycle is 8-hour working time (i.e., 28,800 s) and the largest overtime is 4,800 s. Six kinds of workpieces can be stamped. The other relevant parameters are set as follows: d
i
,
1
=
650, d
i
,
2
=
d
i
,
3
=
800; R
I
i
,
t
=
200; C
p
i
,
t
=
C
h
i
,
t
+
=
40, C
h
i
,
1
-
=
160, C
h
i
,
2
-
=
135, C
h
i
,
3
-
=
110, C
b
i
,
1
-
=
560, C
b
i
,
2
-
=
375, C
b
i
,
3
-
=
180, C
u
i
,
1
-
=
210, i
=
1
,
…
,
6
,
t
=
1
,
…
,
3. Stamping processing capacity of each machine is assumed to be m
1
=
m
2
=
650, m
3
=
m
4
=
850, m
5
=
1000, respectively. In addition, the equipment with low stamping capacity cannot process those working procedures with high stamping requirement (see Table 2).Table 2
Working procedure
J
1
J
2
J
3
J
4
J
5
J
6
m
1
2
5
5
3
4
1
m
2
2
5
3
1
2
3
m
3
1
5
2
4
4
3
m
4
5
2
2
4
3
m
5
1The production batch can be obtained from the above production plan modelX
=
(
X
1
,
X
2
,
X
3
)
=
(
850,850,850,850,850,850
), also S
I
i
+
=
S
I
i
-
=
0
(
i
=
1,2
,
3
). The shortage quantity of production in three cycles is initialized as L
1
=
L
2
=
L
3
=
0. The objective function of the production planning is achieved as 668300. If we assign the WIP to pass along the computed machining sequence, the completion time of each production cycle is beyond the maximally allowed processing time. It means that there is no match between production plan and production scheduling. However, if we adopt the model proposed in this paper to resolve the global optimum solution, the total completion times of the three production cycles are 33247, 33247, and 32567, respectively. Each of them is less than its correspondingly maximally allowed production capacity. Therefore, the computed production plan is feasible, which indicates the effectiveness of the proposed optimization model.


## 7. Conclusion

Mixed-model assembly lines have been widely used in various industries, including automotive assembly, mobile phone making, and computer production. This paper introduces RFID technology to manufacturing workshop to convert manufacturing objects to be “smart manufacturing objects” which are enabled for dynamic interactions among them in real-time. Considering the theoretical model regarding the optimal configuration and framework integration of RFID sensor networks for general applications has not yet been well addressed, this paper proposes a novel generalized RFID-enabled MES model that integrates three submodels including RFID network configuration, the production planning, and scheduling optimization. This combined model overcomes the local minima defects of subobjective function perspective where linear summation approach is deployed for solving only one part of the overall problem. The individually formed subproblems, that include RFID optimal allocation, production planning and scheduling, could be solved by alternating iterations. The closely connected scheduling and production planning are well taken care of by setting the precomputed parameters as constraints. For production planning, to ensure its feasibility, the machine assignment and detailed scheduling parameters are treated as constraints when formulating production planning optimization model. To maintain the intercoordination, production planning subproblem and scheduling subproblem are solved in pairs in each time of iteration through Lagrangian multipliers. The optimization of such integrated model is complicated and belongs to NP-hard problem, which, however, could be solved using the proposed generalized Lagrangian decomposition approach that combines standard Lagrangian approach with Gauss-Seidel iterative principle. The algorithm analysis and numerical simulation have verified the feasibility and effectiveness of the proposed method for modeling and optimization.In addition, reliable identification and tracking of manufacturing objects is the key to realize agile production management. Due to the influence of characteristics of wireless communication and complex application environment in manufacturing workshop, raw data acquired from RFID devices is often duplicated, missing, or with noise. By defining the RFID data flow as event, the real-time RFID data processing technology is proposed via construction of RFID event model which contains basic events and complex events. The proposed RFID configuration model could improve the accuracy of the MES monitoring information in real shop-floor environment. The proposed model structure and its optimization solution are quite generally applicable for converting the traditional MES into real-time interactive wireless manufacturing scenario.



---

*Source: 575402-2015-01-14.xml*