
Citation: Alessio Russo, Francisco J Escobedo, Stefan Zerbe. Quantifying the local-scale ecosystem services provided by urban treed streetscapes in Bolzano, Italy[J]. AIMS Environmental Science, 2016, 3(1): 58-76. doi: 10.3934/environsci.2016.1.58
[1] | Guohui Zhang, Jinghe Sun, Xing Liu, Guodong Wang, Yangyang Yang . Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm. Mathematical Biosciences and Engineering, 2019, 16(3): 1334-1347. doi: 10.3934/mbe.2019065 |
[2] | Kongfu Hu, Lei Wang, Jingcao Cai, Long Cheng . An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem. Mathematical Biosciences and Engineering, 2023, 20(9): 17407-17427. doi: 10.3934/mbe.2023774 |
[3] | Jianguo Duan, Mengting Wang, Qinglei Zhang, Jiyun Qin . Distributed shop scheduling: A comprehensive review on classifications, models and algorithms. Mathematical Biosciences and Engineering, 2023, 20(8): 15265-15308. doi: 10.3934/mbe.2023683 |
[4] | Cong Zhao, Na Deng . An actor-critic framework based on deep reinforcement learning for addressing flexible job shop scheduling problems. Mathematical Biosciences and Engineering, 2024, 21(1): 1445-1471. doi: 10.3934/mbe.2024062 |
[5] | Zilong Zhuang, Zhiyao Lu, Zizhao Huang, Chengliang Liu, Wei Qin . A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates. Mathematical Biosciences and Engineering, 2019, 16(5): 4491-4505. doi: 10.3934/mbe.2019224 |
[6] | Yifan Gu, Hua Xu, Jinfeng Yang, Rui Li . An improved memetic algorithm to solve the energy-efficient distributed flexible job shop scheduling problem with transportation and start-stop constraints. Mathematical Biosciences and Engineering, 2023, 20(12): 21467-21498. doi: 10.3934/mbe.2023950 |
[7] | Shaofeng Yan, Guohui Zhang, Jinghe Sun, Wenqiang Zhang . An improved ant colony optimization for solving the flexible job shop scheduling problem with multiple time constraints. Mathematical Biosciences and Engineering, 2023, 20(4): 7519-7547. doi: 10.3934/mbe.2023325 |
[8] | Wenqiang Zhang, Chen Li, Mitsuo Gen, Weidong Yang, Zhongwei Zhang, Guohui Zhang . Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem. Mathematical Biosciences and Engineering, 2022, 19(9): 8833-8865. doi: 10.3934/mbe.2022410 |
[9] | Xuyin Wang, Weiguo Liu, Lu Li, Peizhen Zhao, Ruifeng Zhang . Resource dependent scheduling with truncated learning effects. Mathematical Biosciences and Engineering, 2022, 19(6): 5957-5967. doi: 10.3934/mbe.2022278 |
[10] | Yufan Zheng, Rafiq Ahmad . Feature extraction and process planning of integrated hybrid additive-subtractive system for remanufacturing. Mathematical Biosciences and Engineering, 2020, 17(6): 7274-7301. doi: 10.3934/mbe.2020373 |
Remanufacturing, as an industrial process of restoring discarded products/components back to their useful lives, is of growing importance due to the emerging pressure of legislation and increasing awareness of environmental conservation. As an ultimate form of recycling, remanufacturing maintains much of the value added from original material and reprocessing conservation, leading to lower production costs and improved profits [1]. A recent wall street journal revealed that large scale remanufacturing in the United States employs more than 500, 000 people and contributes to approximately $100 billion of goods sold each year [2]. More successful industry applications can be seen in automobile remanufacturing, aerospace remanufacturing and electronic remanufacturing [3, 4, 5].
Compared to manufacturing, remanufacturing is more complicated in the way that (1) the supply of returned products is unpredictable in timing and quantities; (2) the quality and composition of returned products varies; and (3) the process routings are not necessarily fixed but rather adapt to the actual conditions of products/components [6]. Such characteristics have led many new methodologies to deal with various operation management issues in remanufacturing as summarized in the survey literature [7]. One of the challenges, which is the focus of this paper, is remanufacturing job shop scheduling. With the high level of uncertainty and resource limitation, it becomes extremely difficult to carry out various remanufacturing tasks for different products and still achieve maximal system performance.
Guide and his colleagues are the first group of researchers that looked into the remanufacturing scheduling. Through simulation, they examined the performance of several static dispatching rules in a repair shop. They assumed the system has stochastic arrivals, exponentially distributed process times and probabilistic process routings [8]. Extended from this work, an analytical model was further developed to explore the impact of those rules on system performance in terms of weighted average sojourn time [9]. While the pursued simulation and model analysis provided insights to practicing managers in a repair shop, much of work is needed for complex job shop settings where various products/parts with uncertain remanufacturing routings compete for constrained resources.
A second line of work has focused on economic lot scheduling with random returns. For instance, Tang and Teunter considered a hybrid system where (re)manufacturing operations of multiple products are performed on the same production line [10]. The work formulated the problem as a mixed integer linear program to determine the optimal cycle time and production starting times for (re)manufacturing. The research was further extended to relax the constraint of common cycle time and a single (re)manufacturing lot per item per cycle [11]. By dividing the returns into different quality grades, Sun et al. investigated a lot scheduling problem where the remanufacturing rate increases as the quality grade increases and holding costs for serviceable products are higher than returns [12]. The objective is to minimize the average total cost by optimizing the acquisition lot size and scheduling the remanufacturing sequence. However, the deterministic nature of the assumptions (i.e., constant demand and returns, and constant remanufacturing rate) made in those works failed to address the uncertainty inherent in remanufacturing. Moreover, the authors considered remanufacturing as a single-stage process. Given that refurbishing used products up to like-new condition tends to involve a sequence of recovery operations, such single-stage scheduling methods present practical limitation.
A third line of researches have tackled the multi-stage and multi-product remanufacturing scheduling problem. For instance, Kim et al. considered a remanufacturing system with a single disassembly workstation, parallel flow-shop-type reprocessing lines, and a single reassembly workstation [13]. A hybrid scheduling heuristic is proposed to determine the sequences of products to be disassembled, to be reprocessed at each reprocessing lines and to be reassembled. The authors, however, treated the problem deterministic and static. Luh et al. presented another work that considered a similar remanufacturing system but tried to address the underlying uncertainty [14]. The main novelty of the research is that it considered stochastic asset arrival time and part repair time to model the dynamics of rotable inventory for optimization. Nevertheless, the authors presumed that each asset goes through a fixed series of overhaul operations. Giglio et al. studied a production system which produces multi-class single-level products through both manufacturing of raw materials and remanufacturing of return products [15]. A mixed-integer programming formulation is proposed to obtain the optimal lot size and job shop schedules with minimum total cost. This work presented the same limitation that the recovery process routings of returns are deterministic. By considering the alternatives of remanufacturing process routes for worn cores, Zhang et al. proposed a simulation based genetic algorithm approach for remanufacturing process planning and scheduling, where the processing time of each alternative routes are assume to be known a priori [16].
Summarizing the findings of the above discussion, no study has comprehensively dealt with remanufacturing job shop scheduling in subjecting to alternative recovery operations, random operation times and limited resource conflicts. In a practical remanufacturing system, the quality of returned products/cores varies, ranging from slightly used with minor blemishes to significantly damaged and requiring extensive repair. Such differences in the condition of products/cores strongly affect the set of recovery operations necessary to bring them up to a quality standard. In addition, the time that each recovery operation takes varies as well with respect to different damages of the cores. Those stochastic natures in remanufacturing triggers the potential conflicts of limited machine resources to a noticeable extend. Such characteristics have led a number of studies to investigate the operation management issues in remanufacturing environment by using different modeling methods, i.e., through analytic model [8, 9, 11, 12, 17], through Mixed Integer Programming model [10, 13, 15, 16], through Lagrangian Relaxation [14] and through Petri nets model [18, 19]. While our previous work [17] and [20] investigated the remanufacturing processes of worn cores with uncertain failure conditions and proposed an analytical model to study such dynamics in recovery process routings through probabilistic measures, how to incorporate those dynamic measures into remanufacturing scheduling has yet to be undertaken.
The colored timed Petri nets (CTPN) is an extension of ordinary Petri nets where the time and color are introduced to describe the logic structure and dynamic behavior of complex systems [21]. By taking advantage of both the well-formed formalism of CTPN and the robustness of Simulated Annealing (SA) for global optimization, the paper tackles this challenge and makes the following contributions. First, a colored timed Petri net is designed to explicitly model the dynamic of remanufacturing processes, such as various process routings, different uncertain operation times for cores, and real-time machine resource conflicts. With the color attributes in Petri nets, two types of decision points, recovery routing selection and resource dispatching, are introduced and embedded in places of CTPN model. With time attributes in Petri nets, the temporal aspect of recovery operations for cores as well as the evolution dynamics in cores' operational stages is mathematically analyzed. Second, a hybrid meta-heuristic algorithm embedded scheduling strategy over CTPN is proposed to search for the optimal recovery routings for worn cores and their recovery operation sequences on workstations, in minimizing the total production cost.
The rest of the paper is organized as follows. Section 2 presents the CTPN model. Section 3 describes the hybrid meta-heuristics based on SA and minimum slack time (MST) dispatching rule. A case study is conducted in Section 4, followed by the conclusion and future research in Section 5.
This paper considers a typical remanufacturing job shop where its clients drop their used products with an expectation to get them fully recovered within a fixed time frame. The remanufacturing processes are traditionally complicated including disassembly that disassembles a worn product into components/cores, cores' recovery operations and assembly that assembles recovered cores back into the product. Figure 1 gives an organizational structure of the remanufacturing job shop.
In this case, each used product (e.g., the lth used product) arrives at the job shop with an arrival time AT(l) and a due date Due(l). The used product is first disassembled into what so called "cores" that are disassembled subassemblies or components. The cores are then classified into "reusable", "repairable", and "disposal" through the inspection process as depicted in Figure 1. This paper focuses on the recovery activities only. The challenge arises when dealing with the repairable cores with different levels of damage that need to go through a set of recovery operations to restore their size and property.
In a remanufacturing job shop, the quality of repairable cores commonly ranges from slightly used with minor blemishes to significantly damaged and requiring extensive recovery. Such quality variations strongly affect the set of recovery operations necessary to bring them up to a quality standard. As exemplified in Figure 2, there are several process routings for the remanufacturing of used machine tool cores of different types and various damage conditions. For instance, the lathe spindles can be inspected and classified into either "abrasion", "corrosion", or "micro-cracks", on which a set of specific recovery operations are designated for their remanufacturing.
With a wide variety of recovery technologies being applied into remanufacturing industry, some recovery process routings for cores with a certain type of damage can be alternative. For instance, if a spindle is detected with severe abrasion, two typical process routings would be "grinding → chromium electroplating" or "grinding → cold welding → fine grind" to regain the surface accuracy. Each alternative process routing consists of a set of predesigned recovery operations, with each operation being performed by a certain kind of machine equipment in a workstation, resulting in a specified recovery quality and unit processing cost [22, 23]. As an upper level of process planning, different combinations of recovery process routings for cores would lead to much variation in remanufacturing cost and real-time machine workload in remanufacturing job shop.
With the recovery routings determined in the upper level, the core then travels to and is processed by a set of recovery workstations sequentially according to the designed process flow. However, the recovery operation time for a particular core in a given workstation is not fixed but rather dependent on the actual condition of the core. While different routings might demand operation times on the same workstation, various cores would compete for constrained machine resource to be recovered.
Our objective is to consider such variation for efficient resource utilization in fulfilling the demand with the minimum cost (i.e., operation cost and tardiness penalty). The remanufacturing job shop scheduling problem is strongly NP-hard due to: a) assignment decisions of reparable cores to recovery process routings and b) sequencing decisions of recovery operations of cores in each workstation. For that purpose, the paper makes the following assumptions:
(1) Each workstation has only one machine and each machine can process at most one task at a time.
(2) Each task is non-preemptive, requiring one and only one machine at a time.
(3) The transportation time between buffers is negligible.
(4) Penalty is charged if the system does not meet the due date of a product.
The ordinary of Petri nets (PN) does not include time and color, which limits its capability to describe the logic structure and behavior of modeled systems, but not its evolution over time and color [24, 25]. In view of the specific characteristics of remanufacturing system to be modeled, this section introduces time and color attributes to a Petri net and proposes a CTPN. The model considers not only recovery process routings and stochastic operation times, but also integrates recovery routing assignments and efficient resource dispatching.
Definition 1: A colored timed Petri net (CTPN) is defined as 7-tuple: CTPN = (P, T, I, O, M, U, C).
(1) P = S ∪ W, where the set of places in S represents buffers, the set of places in W stands for workstations.
(2) T = Ta ∪ Te, where the finite set of transitions in Ta represent recovery operations, and the ones in Te stand for transportation.
(3) I: P×T→{0, 1} is the input function that defines the set of ordered pairs (pi, tk), where I(pi, tk) = 1, if pi is an input place for tk (i.e., ∀pi $ \in $·tk), otherwise 0.
(4) O: P×T→{0, 1} is the output function that defines the set of ordered pairs (pi, tk), where O(pi, tk) = 1, if pi is an output place for tk (i.e., ∀pi $ \in $·tk·), otherwise 0.
(5) M: P→{0, 1, 2, …} is a marking vector, where M(pi) represents the number of tokens in pi.
(6) U: Ta→Θ is a non-zero time function that assigns to each recovery operation t∈Ta, while U: Tb→Θ is a zero time function such that the transportation time between buffers is negligible.
(7) C: P→Σ is a color function that assigns to each place p∈ S ∪W with a color set C(p).
Figure 3 gives an example of the proposed CTPN that corresponds to recovery process routings for used machine tools in Figure 2. The description for the places and transitions in CTPN are given Table 1. For the modeling and optimization purpose, some basic notations are introduced. Table 2 shows the index used in the CTPN model. Table 3 and Table 4 gives the model parameters and decision variables in the CTPN, respectively.
Places and transitions in CTPN | Description |
s0 | The output buffer of the inspection center |
si (i=1, 2, ..., 12) | The input buffer of each recovery workstation |
sz (z=13, 14, 15, 16) | The output buffer of each recovery workstation |
s17 | The input buffer of the reassembly center |
wk (k=1, 2, ..., 12) | Workstation places |
ti, j (i, j=1, 2, ..., 12, i≠j) | Recovery operations |
t0, i, ti, z, ti,17 (i=1, 2, ..., 12, z=13, 14, 15, 16) | Transportation transitions |
Index | Description |
L= {1, 2, ..., L} | index set of used products |
D= {1, 2, ..., D} | index set of component types |
K= {1, 2, ..., K} | index set of workstations |
H= {1, 2, ..., H} | index set of recovery process routings |
Parameters | Description |
ϑld | the dth core disassembled from the lth product |
wk | the kth workstation that performs a specific recovery operation |
Rh | the hth recovery process routing designed for worn cores and is represented as a set of recovery operations |
pre(tij, Rh) | the operational stages of recovery operation tij in Rh |
Last(Rh) | the last recovery operation in Rh |
aldh | a binary variable with a value 1 indicates the hth routing for the core ϑld |
u(tij, ϑld) | the time for a core ϑld to be processed in transition tij |
AT(si, ϑld) | the arrival time of the core ϑld at buffer place si |
ST(wk, ϑld) | the start time of the core ϑld being processed by wk |
Com(wk, ϑld) | the completion time of the core ϑld processed by wk |
ρ(ϑld) | the makespan of the component ϑld |
χ(ϑld) | the tardiness of the component ϑld |
$\zeta (l)$ | the tardiness of the lth product |
Probld | the probability of a core ϑld being selected for routing reassignment |
$\Pi _{ld}^{h, x}$ | the difference of the total average waiting time between the hth routing and the xth one for the core ϑld |
WTk | the average waiting time per core consumed in the kth workstation |
h | the total average waiting time per core consumed in the hth routing |
$v_{ld}^{h, x}$ | the probability of the xth routing being selected to replace the current hth routing for the core ϑld |
Slackxy | slack time of a core ϑxy in scheduling horizon |
Decision variables | Description |
rldh | a binary variable with a value 1 indicates that the hth process routing is assigned to a core ϑld |
Pri(wk, ϑld) | the priority for the dth component of the lthused product to be processed by the kth workstation |
(1) Modeling of recovery process routings
As stated earlier, the recovery process routing for a particular core is not deterministic but rather contingent on its damage level. When a core goes through inspection center and enter in the buffer place s0, it will be assigned with a specified process routing (i.e., Rh), which is represented as a set of recovery operations that a core should go through sequentially for its recovery.
For the cores with alternative process routings to be recovered, decisions should be made on which "reasonable" process routings to be assigned to them. In the proposed CTPN model, the buffer place s0 operates as a decision agent of choosing optimal recovery process routings for cores, by utilizing a hybrid scheduling algorithm elaborated in Section 3.
When the process routings for cores are determined, cores of different types and stochastic damage conditions require going through various recovery operations. In the CTPN model of Figure 3, different types of core tokens in s0 might go to transitions among t0, 12, t0, 5, t0, 1, t0, 3, t0, 2, t0, 6, t0, 8, t0, 11; tokens in s13 may either go to t13, 3, t13, 10 or t13, 17; tokens in s16 might enters into either t16, 17 or t16, 5. In addition, cores of the same type and the same damage condition might go through different recovery processes. For example, when a spindle is detected with abrasion, its process routing can either be R1 = {t03, t3, 14, t14, 9, t9, 17} or R2 = {t03, t3, 14, t14, 4, t4, 15, t15, 5, t5, 17}. Then in Figure 3, a token in s14 representing a spindle with abrasion might fire transition t14, 9 or t14, 4.
Thus, to make sure where the tokens in a buffer place should go, a unique color is introduced and associated with buffer places to distinguish the cores going through different recovery operations.
Definition 2: The color of a token ϑld in a buffer place si is defined as C(sj, ϑld) = cij if the token goes to tij after being released from si.
Let M(si) denote the number of tokens in place si regardless of token color, and M(si, cij) the number of tokens in place si at M that have the color cij. Therefore, $M({s_i}) = \sum\limits_j {M({s_i}, {c_{ij}})} $.
Based on Definition 2, the color attached to a token in a buffer place changes through transition firings. Such color evolution represents the complex operational stages of a core according to its recovery process routing. For instance, if the recovery process routing of the core ϑld is determined (i.e., rldh is known), its color evolution can then be derived as follows.
$C({{s}_{j}},{{\vartheta }_{ld}})={{c}_{jp}},\ \text{if}\ \left\{ C(si,ϑld)=cijpre(tjp,Rh)=pre(tij,Rh)+1, ∀rldh=1si∈∙tij, sj∈∙tjp \right.$
|
(1) |
(2) Modeling of shared resources
In a remanufacturing job shop, various cores would compete for constrained resource to be recovered. An input buffer is then designated for each workstation in our CTPN model to accommodate all the cores that are waiting for processing. When multiple tokens occur in the input buffer place sk of the kth workstation, decisions should be made on which core to be processed next as soon as the machine resource is ready. In the proposed CTPN model, each input buffer place si (i = 1, 2, ..., 12) is considered as a decision agent for resource dispatching and determines the operation sequences (priority) for the cores to be processed by the workstation.
Definition 3: The priority for the core ϑld to be processed by the kth workstation is defined as Pri(wk, ϑld). The priority is a decision variable for scheduling optimization. The smaller the value is, the higher priority for the core to be processed by workstation wk.
Definition 4: A transition tij in the CTPN developed above is enabled at a marking M to process the core ϑld with a color cij, if and only if:
$M({s_i},{c_{ij}}) \geqslant 1{,^{}}{s_i} \in {}^ \bullet {t_{ij}}$ | (2) |
$M({w_k}) = 1{,^{}}{w_k} \in {}^ \bullet {t_{ij}} \cap t_{ij}^ \bullet $ | (3) |
$Pri({w_k},{\vartheta _{ld}}) = \min (Pri({w_k},{\vartheta _{xy}})) \;{\rm{and}} \;C({s_i},{\vartheta _{xy}}) = {c_{ij}},\forall x{,^{}}y$ | (4) |
Definition 5: An enabled transition tij can fire in a marking M with respect to a color cij yielding a new marking M' denoted as $M[({t_{ij}}, {c_{ij}}) > M'$:
$M'({s_i},{c_{ij}}) = M({s_i},{c_{ij}}) - 1{,^{}}{s_i} \in {}^ \bullet {t_{ij}}$ | (5) |
$M'({w_k}) = M'({w_k}){,^{}}{w_k} \in {}^ \bullet {t_{ij}} \cap t_{ij}^ \bullet $ | (6) |
Definition 6: When a transition tij is fired, the marking M' would transfer to M" according to:
$M''({s_i},{c_{ij}}) = M'({s_i},{c_{ij}}){,^{}}{s_i} \in {}^ \bullet {t_{ij}}$ | (7) |
$M''({w_k}) = M'({w_k}) + 1{,^{}}{w_k} \in {}^ \bullet {t_{ij}} \cap t_{ij}^ \bullet $ | (8) |
$M''({{s}_{j}},{{c}_{jp}})=M'({{s}_{j}},{{c}_{jp}})+1\ \text{and}\ C({{s}_{j}},{{\vartheta }_{ld}})={{c}_{jp}}\ \text{if}\left\{ sj∈t∙ij, sj∈∙tjppre(tjp,Rh)=pre(tij,Rh)+1 \right.$
|
(9) |
According to the above transition enabling and firing rules, the system always dispatch an available workstation wk to the core with the highest priority (i.e., the lowest Pri(wk, ϑld) value) in the queue to maximize the system performance.
(3) Modeling of recovery operation times
When associating time with operation transitions, the CTPN model is able to describe the temporal aspect of recovery operations.
Definition 7: The time needed for a token ϑld to be processed in transition tij is defined as u(tij, ϑld).
The processing times required to perform a necessary recovery operation is highly variable since the quality and composition of returned products/parts varies. It is reported that the processing time data obtained from a remanufacturing facility follows an exponential distribution in order to simulate the large range of possible values [8]. The amount of processing time for a remanufacturing operation is widely modeled as an exponential function of the wear associated with a part [19]. In this section, we models the recovery operation time as the sum of average operation time and extended time, where the latter is a exponential function of the quality condition of the core being processed. To that end, quality testing of a core is conducted before recovery, on which an inspection score, Score(ϑld)∈[0, 1], is assigned to the core based. It is assumed that the better the quality, the higher the score and the shorter the operation time. So the relationship between the quality score and the processing time is modeled as follows.
$u({t_{ij}},{\vartheta _{ld}}) = \frac{{ - \ln (Score({\vartheta _{ld}}))}}{{\beta ({w_k})}} + \lambda ({w_k}){,_{}}{t_{ij}} \in w_k^ \bullet { \cap ^ \bullet }{w_k}$ | (10) |
where β(wk) is a control factor for workstation wk whose value is determined based on statistics of historical data, and λ(wk) is the average operation time of cores in wk. Whenever a component goes into a transition for processing, it must stay in transition tj for more thanu(tj, ϑld) time units and then can be released into another buffer place.
(4) Temporal aspect of recovery operations
In the CTPN model, with the core tokens dynamically entering the buffer places, a set of transitions are then enabled and fired according to the enabling and firing rules. With the dynamic behavior of the CTPN, the remanufacturing operations are subject to the following constraints.
Operation start time requirements: Recovery operations cannot be started until the core has arrived at the buffer sk of a corresponding workstation wk. When the core arrived in the buffer sk, it need waiting until all other cores with higher priorities are processed.
$ ST({w_k},{\vartheta _{ld}}) = {\text{max\{ }}A{\text{T}}({s_i},{\vartheta _{ld}}),Com({w_k},{\vartheta _{ij}}){\text{\} }}{{\text{,}}^{}}\forall Pri({w_k},{\vartheta _{ld}}) = Pri({w_k},{\vartheta _{ij}}) + 1,{s_i} \in {}^ \bullet {t_{ij}},{t_{ij}} \in {}^ \bullet {w_k} \cap w_k^ \bullet $ | (11) |
Processing completion time requirements: When a core goes into a workstation for processing, it must stay in a specific machine for more thanu(ϑld, wk) time units and then can be released into the successor buffer.
$Com({w_k},{\vartheta _{ld}}) = ST({w_k},{\vartheta _{ld}}) + u({t_{ij}},{\vartheta _{ld}}){,^{}}\forall {t_{ij}} \in w_k^ \bullet { \cap ^ \bullet }{w_k}$ | (12) |
Arrival time constraints: When a core is finished processing by a workstation, it can be transported immediately into another buffer of the successor workstation by ignoring the transportation time.
$A{\rm{T}}({s_i},{\vartheta _{ld}}) = Com({w_k},{\vartheta _{ld}}),\;\forall \left\{ rldh=1pre(wv,Rh)=pre(wk,Rh)+1si∈∙tij,tij∈∙wv∩w∙v \right.$
|
(13) |
Using Eqs 11, 12 and 13 recursively, the makespan and tardiness of the component ϑld, i.e., ρ(ϑld) and $\chi ({\vartheta _{ld}})$, can be derived as shown in Eqs 14 and 15. The tardiness of the lth product is then calculated in Eq 16.
$\rho ({\vartheta _{ld}}) = Com({w_k},{\vartheta _{ld}}) - AT(l){,^{}}\forall Last({R_h}) = {t_{ij}}{,^{}}{t_{ij}} \in w_k^ \bullet { \cap ^ \bullet }{w_k}$ | (14) |
$\chi ({\vartheta _{ld}}) = \max \{ 0{,^{}}\rho ({\vartheta _{ld}}) - Due(l)\} $ | (15) |
$\zeta (l) = \mathop {\max }\limits_d \chi ({\vartheta _{ld}})$ | (16) |
Generally speaking, there are two ways to solve a scheduling problem by PN. One is to construct their reachability graph. However, it suffers from the state explosion problem [26]. Since we considered two types of decision variables in the proposed CTPN, using reachability graph for scheduling optimization might not be efficient. The other is to introduce scheduling algorithms into a PN model, which is adopted in this paper. The embedding style is optionally through places or transitions in a PN. This work uses the former mechanism and adopts two types of decision places in the proposed CTPN model. The decisions of choosing optimal recovery process routings for cores are embedded in buffer place s0, while the input buffer place si (I = 1, 2, ..., 12) makes decisions on dispatching machine resource in workstation to perform recovery operations for the cores that are waiting in queue. Considering the two types of scheduling decisions, a hybrid meta-heuristic algorithm using simulated annealing and minimum slack time rule is proposed and embedded in these decision places to search for global optimal process plans and schedules with a quick convergence speed.
The scheduling objective is to minimize both operation cost and tardiness penalty as shown in Eq 17. There are two types of decision variables: (1) recovery process routing for a given core (i.e., rldh), and (2) operation sequences for a given core in a workstation (i.e., Pri(wk, ϑld)).
Minimize:
$
TC = \sum\limits_l {\sum\limits_d {\sum\limits_{} {u({t_{ij}},{\vartheta _{ld}}) \cdot \phi ({w_k})} + \sum\limits_l {\zeta (l) \times \varpi } } } ,\;\forall \left\{ rldh=1tij∈Rhandtij∈w∙k \right.
$
|
(17) |
where φ(wk) is unit operation cost of the kth workstation and ϖ is unit penalty cost for product.
SA is a stochastic gradient method for global optimization that has been applied to a wide variety of sophisticated combinatorial problems [27, 28, 29]. While it conducts local searches, it is capable of exploring the solution space stochastically to prevent from being trapped in a local optimum. Starting from an initial solution g0, SA uses a certain mechanism to generate a neighborhood solution g' with an acceptance probability AP.
$AP = \left\{ 1,ifΔ<0exp(−Δ/Ω),otherwise \right.$
|
(18) |
where Δ = f(g')-f(g0), Ω is called temperature, a global time-varying parameter, and f(g) the optimization objective function. In this paper, SA is used to determine the optimal process routings for cores. At each iteration when a neighbor solution is generated, MST to be elaborated in section 3.2 is then applied to determine the operation sequences of the cores in each workstation. The parameter Ω is reduced by a factor η at each iteration and the chance of choosing an inferior solution decreases as well. The nested SA-MST search process continues until the stopping criterion is met.
In this section, the CTPN model is integrated and embedded with SA algorithm and MST dispatching rules to obtain the optimal remanufacturing routings and schedules. At each iteration of SA algorithm, the feasible recovery routing is first generated by the Initial/Neighborhood Solution Generation process. Then the CTPN model is established based on the arrival time of parts, the predetermined recovery routings and the processing time of each operations. Whenever multiple parts arrived in a same buffer place in the CTPN, MST rules is used for resource dispatching. The CTPN model evolves to a final version until the resource conflicts in all the buffer places are tackled by the SMT. Finally, the operation cost and tardiness penalty of a SA solution at each iteration can be calculated according to the time aspects marked in the CTPN, and the next iteration of SA algorithm goes on until the stopping criterion is met. The flowchart of the CTPN-based hybrid meta-heuristics scheduler is shown in Figure 4.
(1) SA solution representation
In this paper, a 3-dimension matrix R = [rldh]L×D×H is proposed as representation of SA solutions. Each element rldh is a binary variable, one indicating the hth recovery process routing is assigned to the core ϑld and zero otherwise. Given that not all routings are feasible to a specific core, the viability of a randomly generated R is controlled via a logic AND operation in Eq 19:
$ R = \text{ }R\wedge A = \text{ }[{{r}_{ldh}}\wedge {{a}_{ldh}}] $ | (19) |
where A = [aldh] is a L-by-D-by-H mask whose element aldh = 1 indicates the feasibility of the hth routing for the core ϑld.
(2) Initial solution generation
The choice of an initial solution is vital to the performance of the algorithm [30]. To that end, a cost function of a routing (i.e., the hth routing) for a core ϑld is defined in Eq 20. The smaller the value of qldh, the greater chance the hth routing is selected for the core, i.e., rldh = 1.
${q_{ldh}} = \frac{{\sum\limits_j {u({t_{ij}},{\vartheta _{ld}}) \times \phi ({w_k})} }}{{\sum\limits_h {\sum\limits_j {u({t_{ij}},{\vartheta _{ld}}) \times \phi ({w_k})} } }},{t_{ij}} \in {R_h},{r_{ldh}} = 1,{t_{ij}} \in {}^ \bullet {w_k} \;{\rm{I}}\; w_k^ \bullet $ | (20) |
(3) Neighborhood solution generation
Traditional SA randomly generates a neighborhood solution g' from the current solution g by using a predefined move mechanism [31, 32]. In this section, a multiple moves mechanism is used for neighborhood solution generation [33, 34]. That is, for each current solution, randomly selects an element in the matrix R and uses one type of moves (i.e., ζ-opt, ζ∈{1, 2, …, H-h}) to exchange rldh with rld[h+ζ] for a new neighborhood solution.
To improve the convergence of SA, this work opts out the random selection process. Instead, at each annealing step, the proposed SA identifies cores with the potential to improve their routing assignment and to minimize their tardiness. To that end, χ(ϑld) is used to evaluate the urgency of routing reassignment for cores. The probability of a core being selected for routing reassignment is defined as follows.
$ pro{b_{ld}} = \chi ({\vartheta _{ld}})/\sum\limits_l {\sum\limits_d {\chi ({\vartheta _{ld}})} } $ | (21) |
For any identified core, the selection of an alternative yet better routing is determined based on an efficiency index, $\Pi _{ld}^{h, x}$, which calculates the difference of the total average waiting time between the current process routing (i.e., the hth routing) and the alternative one (i.e., xth routing):
$\Pi _{ld}^{h,x} = {{\mathit{\Psi}} _h} - {{\mathit{\Psi}} _x},\forall \left\{ rldh=1x∈{1,2,⋯,H}−{h}rldx=0,aldx=1 \right.$
|
(22) |
${\Psi _h} = \sum\limits_{{t_{ij}} \in {R_h},{w_k} \in {}^ \bullet {t_{ij}}} {W{T_k}} {\Psi _x} = \sum\limits_{{t_{ij}} \in {R_x},{w_k} \in {}^ \bullet {t_{ij}}} {W{T_k}} $
|
(23) |
$W{T_k} = \frac{{\sum\limits_l {\sum\limits_d {(ST({w_k},{\vartheta _{ld}}) - AT({s_i},{\vartheta _{ld}}))} } }}{{{N_k}}}$ | (24) |
where WTk is the average waiting time per core consumed in the kth workstation, Ψh and Ψx are the total average waiting time per core consumed in the hth and xth process routing, respectively, and Nk is the total number of cores being processed by workstation wk. When the core ϑld is switched from the current routing to the other one with a larger $\Pi _{ld}^{h, x}$, it is more likely to relieve resource conflict and accomplish the task with a greatly reduced tardiness. Therefore, the probability of the xth routing being selected to replace the current hth routing for the core is defined as
$v_{ld}^{h,x} = \Pi _{ld}^{h,x}/\sum\limits_{x∈{1,2,⋯,H}−{h}aldx=1 } {\Pi _{ld}^{h,x}} $
|
(25) |
(4) Stopping criterion
In this proposed algorithm, two thresholds are pre-defined: the maximum number of inefficient iterations where the global optimum is not updated Imax, and the maximum number of outer loop iterations olmax. Our SA will stop whenever either of the thresholds is reached.
With a SA solution, each core follows the derived process routing to be recovered step by step. When multiple cores enter a workstation and compete for the same machine resource, a secondary optimization is conducted to determine the operation sequences of cores to be processed by the workstation, aiming to minimize the total tardiness penalty. The dispatching rules have been widely used for operation sequence optimization to address job shop scheduling problems [35]. Minimum Slack Time (MST), as one of typical heuristic sequencing rules, is widely used for the scheduling problems. MST measures the "urgency" of a job by its slack time, which is defined as the difference between its due date and production time. That is, the shorter the slack time, the higher priority to be processed. In the case of MST dispatching rules, the jobs might be processed as soon as possible in order to be finished right before its due date. As a result, the tardiness of all the jobs can be minimized. Recently, MST rule have been widely used for operation sequence optimization and are embedded with some meta-heuristic approaches to address various scheduling problems [36, 37]. In this section, MST is chosen for resource dispatching and is embedded with SA algorithm to search for the optimal schedules in minimizing both the operation cost and the penalty cost with related to tardiness.
For a specific core, the slack time of its recovery operation can be calculated as the temporal difference between the due date, the current time, and the remaining operation times, as formulated in Eq 26. MST sequences jobs in the descending order of slack time. Whenever a workstationwk releases a component ϑuv(∀Pri(wk, ϑuv) = q > 0) and turns back into idle state, it will pick up a core ϑld with the least slack time ($\exists $ slackld = min{slackxy}) from the waiting queue (∀ϑxy, AT(si, ϑxy)-Com(wk, ϑld) ≤ 0), and then immediately process it in the (q + 1)th sequence, as shown in Eq 27.
$slac{k_{xy}} = Due(l) - Com({w_k},{\vartheta _{uv}}) - \sum\limits_{pre({t_{cd}},{R_h}) \geqslant pre({t_{ij}},{R_h})} {u({t_{cd}},{\vartheta _{xy}})} \mathop ,\limits^{} \mathop {}\limits^{} \\\forall {r_{xyh}} = 1{,^{}}{t_{ij}} \in {R_h}{,^{}}{t_{cd}} \in {R_h}{,^{}}{t_{ij}} \in {}^ \bullet {w_k} \cap w_k^ \bullet {,^{}}Pri({w_k},{\vartheta _{uv}}) = q$ | (26) |
$Pri({w_k},{\vartheta _{ld}}) = q + 1,\;if\;\\\left\{ AT(si,ϑxy)−Com(wk,ϑuv)≤0,∀ruvh=1,tij∈Rh,si∈∙tij,tij∈∙wk∩w∙k,Pri(wk,ϑuv)=qslackld=min{slackxy},∀rxyh=1,tij∈Rh \right.$
|
(27) |
The solution obtained by MST is a 3-dimension matrix G = [gldk]L×D×K, where gldk, a non-negative integer, represents the operation sequence of the core ϑld to be performed by workstation wk. gldk = 0 means that the core ϑld is not processed by wk. Once the matrix G is derived, Pri(wk, ϑld) in CTPN are determined and thereby the total cost can be calculated.
With the recovery process routing R and operation sequence matrix G being derived through the proposed hybrid meta-heuristics, a set of transitions are then be enabled and fired as core tokens dynamically enter or release from the buffer places.
To fully understand the above concepts and algorithms, the remanufacturing of a batch of obsolete machine tools in an example system is used to demonstrate the remanufacturing scheduling. The workflows of cores in this remanufacturing shop and its corresponding CTPN are shown in Figs. 2 and 3. In order to verify the efficiency of the proposed method, three cases are considered for simulation. In the baseline case, cores are recovered through a set of fixed process routings. An available workstation takes MST rule for resource dispatching. In the second case, the traditional SA uses a standard neighborhood generation method and is embodied with MST rule for routing assignment and resource dispatching. In the third case, the recovery routing for a core and the resource dispatching for a workstation are guided through the proposed SA/MST by using the proposed neighborhood solution generation method.
All the algorithms are implemented in Matlab 2009. The simulation running duration is set to be 30 days. Everyday's work hours are 24 hours. Data of the first 3 days are thrown off as warm-up consideration. For the simulation, the input data is populated as follows.
(1) Since that the machine resources in the floor shop are fixed and limited, the machine workloads and the intension of resource conflicts increases with the rise of arrival rate, and vice versa. In order to simulated a set of resource conflict scenarios, the random arrival of used machine tools follows a Poisson distribution with an arrival rate per hour π $ \in ${5, 6, 7, 8, 9, 10, 11}. The designed arrival rate can limit the machine workloads (i.e., the average length of waiting queue on the machines) in the floor shop within a satisfactory range [0.75, 3.6].
(2) The due date (in days) for each used machine tool is randomly generated by a uniform distribution, Due(l) ~ U[5, 10].
(3) Each core disassembled from used machine tools is inspected before its recovery and is assigned a quality score Score(ϑld) through an Exponential distribution, Score(ϑld))~ Γ(1, τ) where τ ∈ [0.08, 0.10].
(4) The control factor and average operation time for each workstation is set to β(wk) = 0.2 and λ(wk) = 15.
(5) The operation cost per hour in workstations 7 and 9 (i.e., chromium electroplating and laser cladding) is $100, while that in other workstations is $50.
(6) The penalty cost per day per machine tool is set to be ϖ ∈ {20, 60, 100} in dollars.
(7) The parameters in SA are set toolmax = 5000, ilmax = 100, Imax = 30, Ω = 169340, η = 0.998.
(8) Considering that the total number (L) of machine tools generated in each run of the simulation varies, our comparison focuses on normalized objective values. In particular, the comparison evaluates the total cost per product (tc), operation cost per product (pc), tardiness penalty per product (dc), and the average waiting time per core consumed in each workstation (wt).
Our first set of experiments evaluates how the three methods respond to system demand and various penalty cost rates. In each trial, we run the three methods independently. It should be noted that the baseline case only employs MST rule for resource scheduling, while the proposed SA/MST and the standard one run continuously until they meet the stopping criteria. As the arrival rate of used machine tools changes from 5 to 11, the average total cost tc is obtained and compared among the three methods. This process is repeated with different penalty cost rates (i.e., ϖ = 20, 60, and 100) as shown in Tables 5, 6, and 7, respectively.
Arrival rate | The average total cost per machine tool | Improvement of the standard method over the baseline one tc1–tc2 | Improvement of the proposed method over the standard one tc2–tc3 | ||
Baseline casetc1 | Standard SA/MSTtc2 | Proposed SA/MSTtc3 | |||
π=5 | 186.66 | 117.02 | 117.02 | 69.64 | 0 |
π=6 | 228.37 | 133.48 | 118.21 | 94.89 | 15.27 |
π=7 | 293.05 | 172.45 | 146.89 | 120.6 | 25.56 |
π=8 | 335.87 | 208.06 | 168.69 | 127.81 | 39.37 |
π=9 | 447.52 | 266.47 | 216.25 | 181.05 | 50.22 |
π=10 | 581.63 | 352.28 | 270.91 | 229.35 | 81.37 |
π=11 | 714.29 | 461.86 | 335.77 | 252.43 | 126.09 |
Sample mean | 398.20 | 244.52 | 196.25 | 153.68 | 48.27 |
Sample standard deviation | 193.44 | 125.46 | 82.67 | 68.93 | 43.15 |
Arrival rate | The average total cost per machine tool | Improvement of the standard method over the baseline onetc1–tc2 | Improvement of the proposed method over the standard onetc2–tc3 | ||
Baseline casetc1 | Standard SA/MSTtc2 | Proposed SA/MSTtc3 | |||
π=5 | 215.76 | 117.83 | 117.83 | 97.93 | 0 |
π=6 | 327.61 | 160.31 | 140.12 | 167.3 | 20.19 |
π=7 | 455.9 | 226.47 | 185.02 | 229.43 | 41.45 |
π=8 | 658.09 | 342.57 | 273.22 | 315.52 | 69.35 |
π=9 | 891.23 | 515.96 | 406.38 | 375.27 | 109.58 |
π=10 | 1137.96 | 738.41 | 559.67 | 399.55 | 178.74 |
π=11 | 1530.54 | 986.65 | 775.72 | 543.89 | 210.93 |
Sample mean | 745.30 | 441.17 | 351.14 | 304.13 | 90.03 |
Sample standard deviation | 472.28 | 324.23 | 244.76 | 151.99 | 80.25 |
Arrival rate | The average total cost per machine tool | Improvement of the standard method over the baseline onetc1–tc2 | Improvement of the proposed method over the standard onetc2–tc3 | ||
Baseline casetc1 | Standard SA/MSTtc2 | Proposed SA/MSTtc3 | |||
π=5 | 270.84 | 117.32 | 117.32 | 153.52 | 0 |
π=6 | 463.08 | 224.8 | 186.58 | 238.28 | 38.22 |
π=7 | 687.42 | 416.46 | 275.13 | 270.96 | 141.33 |
π=8 | 1063.8 | 655.68 | 453.47 | 408.12 | 202.21 |
π=9 | 1495.67 | 957.36 | 706.49 | 538.31 | 250.87 |
π=10 | 1917.52 | 1231.56 | 918.76 | 685.96 | 312.8 |
π=11 | 2403.39 | 1483.89 | 1120.77 | 919.5 | 363.12 |
Sample mean | 1185.96 | 726.72 | 539.79 | 459.24 | 186.94 |
Sample standard deviation | 789.17 | 517.36 | 385.07 | 273.81 | 135.61 |
The performance of the standard SA/MST and the baseline one is first evaluated and compared by calculating the cost difference under different arrival rates, as shown in Figure 5. It is clear that the proposed SA/MST outperforms the baseline method in terms of generating less cost, particularly in reacting to the larger arrival rates. This is reasonable since that when a substantial amount of cores are fighting for limited resources for to be recovered, the standard SA/MST operates on routings reassignment of cores to reduce the ever intensified resource conflicts and thus minimize a relatively large amount of tardiness penalty to lower the total cost, while the baseline method is not capable of addressing so by fixing process routings of cores. The results in Figure 5 can be also interpreted as evidence that the hybrid SA/MST is promising for remanufacturing scheduling optimization.
The differences of total cost per product obtained by the two hybrid methods are also calculated and plotted in Figure 6. The following remarks can be made regarding the performance of the proposed SA/MST over the standard one.
(1) When the arrival rate is low (e.g., π = 5), the system has sufficient enough resources to handle remanufacturing demand. Thus the benefit of our proposed SA/MST in comparison to the standard one is minor. As the system demand increases with the rising arrival rate, more and more used machine tools are fighting for the limited resource to be remanufactured. The proposed method then outperforms the standard method through a more targeted annealing process to properly reassign recovery routings of cores and resolve ever intensified resource conflict. Therefore, the advantage of the proposed method over the standard one becomes significant.
(2) In a similar fashion, by comparing the corresponding row in Tables 5, 6 and 7, the relative improvement of the proposed method over the standard one becomes more and more significant with the increasing penalty cost. Using π = 8 as an example, the improvement increases from 11% when ϖ = 20, to 17% when ϖ = 60, and to 30% when ϖ = 100.
To further show the significant difference between the performances of the two hybrid algorithms, a sample mean, a sample standard deviation and confident interval estimation are introduced. A relative value σ = –(tc3–tc2)/tc2 is defined to characterize the improvement of the best solution obtained by the proposed SA/MST over the one obtained by the standard one. A 95% confidence interval of the improvement rate σ is conducted using the data in Tables 5–7. The approximate 100(1–α)% confidence interval for σ is defined as
$ ⌢σ±t1−α/2(n−1)SD√nor ⌢σ−t1−α/2(n−1)SD√n≤σ≤⌢σ+t1−α/2(n−1)SD√n $
|
(28) |
where ${\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{\sigma }}$ is the sample mean of σ based on a sample of size n; SD is the sample standard deviation; ${{t}_{{1-\alpha }/{2}\; }}(n-1)$is the 100(1–α)% percentage point of a t-distributed with n–1 degree of freedom. The 95% confidence intervals for the improvement σ under three scenarios (i.e., ϖ = 20, 60 and 100) are given in Eqs 29, 30 and 31, respectively. It is obvious that the 95% confidence interval for σ lies completely above zero (i.e., $\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{\sigma } > 0$), which provides strong evidence that the proposed SA/MST is better than the standard one in terms of generating less total cost.
$0.0814 \leqslant {\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{\sigma } _1} \leqslant 0.2455$ | (29) |
$0.1042 \leqslant {\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{\sigma } _2} \leqslant 0.3118$ | (30) |
$0.1414 \leqslant {\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{\sigma } _3} \leqslant 0.3911$ | (31) |
The results in Tables 5–7 represents significant enhancement of the proposed methodology in terms of overall total cost per product, especially when the system is over utilized and its responsiveness to fluctuating market demand is important.
In the second set of experiments, the performance of the two hybrid algorithms is further evaluated by calculating the normalized objective values achieved after pre-specified time breaks (Table 8), where the arrival rate and the penalty cost are set as π = 8 and ϖ = 60. The following remarks can be made regarding algorithms' performance.
Computation time breaks | Standard SA/MST | Proposed SA/MST | ||||||
tc1 | pc1 | dc1 | wt1 | tc2 | pc2 | dc2 | wt2 | |
After 0sec | 399.25 | 112.16 | 287.09 | 76.80 | 399.25 | 112.16 | 287.09 | 76.80 |
After 30sec | 380.38 | 116.78 | 263.60 | 72.37 | 371.14 | 114.62 | 256.51 | 55.21 |
After 60sec | 393.70 | 113.71 | 279.99 | 61.76 | 341.42 | 118.56 | 222.86 | 48.34 |
After 90sec | 393.70 | 113.71 | 279.99 | 58.90 | 311.93 | 120.51 | 191.43 | 46.49 |
After 120sec | 386.11 | 115.62 | 270.49 | 58.75 | 292.79 | 121.75 | 171.04 | 44.54 |
After 150sec | 385.56 | 119.96 | 265.60 | 58.42 | 280.06 | 123.28 | 156.78 | 41.52 |
After 180sec | 384.17 | 121.18 | 262.99 | 57.90 | 274.14 | 124.64 | 149.51 | 41.47 |
After 210sec | 383.35 | 122.86 | 260.49 | 56.51 | 273.33 | 126.31 | 147.03 | 38.40 |
After 240sec | 378.22 | 124.65 | 252.57 | 54.73 | 273.22 | 132.79 | 140.42 | 35.67 |
No time limits* | 342.57 | 129.41 | 213.16 | 48.07 | 273.22 | 132.79 | 140.42 | 35.67 |
* "No time limit" means the simulation keeps the algorithm running until it meets the stopping criteria elaborated above. |
(1) As the computation time increases, both algorithms strive to search for a better scheduling solution that maintains a good trade-off between operation cost and tardiness penalty. It should be noted that both algorithms start at the same initial solution (i.e., zero time break). Since the initial solution is generated with the goal of minimizing operation cost only, it presents a relatively larger penalty cost. The annealing step in both methods then begins to rearrange routings for cores that ultimately balances the overall workload of workstations and thus reduces waiting time to lower the tardiness penalty. As shown in Table 8, at the 210-second time break, the optimal solutions generated by both methods have a bit larger pc and a quite smaller dc, resulting in a much lower total cost per product.
(2) The proposed SA/MST method converges much rapidly than the standard one, providing a better solution within a given short time frame. This is intuitively understandable since the proposed SA/MST uses resource conflict and tardiness penalty to guide neighborhood solution generation while the random mechanism in the standard SA fails to address so, resulting in a relatively larger tardiness penalty.
All simulation output analysis verifies the effectiveness of the proposed hybrid SA/MST algorithm for the remanufacturing scheduling.
Remanufacturing systems are faced with a greater degree of uncertainty and complexity than traditional manufacturing systems, leading to the need for planning and control systems designed to deal with the added uncertainty and complexity. Although many new methodologies have been led up to deal with various operation management issues in remanufacturing environments, no study has comprehensively dealt with remanufacturing job shop scheduling in subjecting to alternative recovery operations, random operation times and limited resource conflicts. A CTPN is introduced to model the dynamics of remanufacturing process, such as various process routings, uncertain operations times and resource conflicts. With time and color attributes in PN, two types of decision variables are linked with places in CTPN and the evolution of system dynamics in recovery operations are mathematically analyzed. With the support of the computation model via CTPN, a hybrid meta-heuristic using SA and MST rule is proposed and embedded with CTPN to sample large search space efficiently and search for a good scheduling solution in minimizing total production cost. The performance of the proposed SA/MST algorithm is compared against another two cases: baseline case with fixed recovery process routings and case 2 using standard SA/MST. The comparison results provide strong evidence that the proposed scheduling method is of significant importance in achieving minimum production cost especially when the system is overloaded and its responsiveness to shared resource conflicts is important.
Our research can be also extended in several directions. For instance, the integration of alternative recovery routing selection and resource dispatching is a NP-hard problem. Therefore, it is worth of investigation to take the structure advantage of CTPN for a more efficient optimization heuristics. Another challenge is to take into consideration of unexpected system disruptions (i.e., random machine breakdown) in remanufacturing scheduling. The future work also includes further validation of our methodology using more factory data.
This work was supported in part by the Fundamental Research Funds for the Central Universities (SWU22300503), the National Natural Science Foundation of China (51875480) and the National Natural Science Foundation of China (51475059).
All authors declare that there is no conflict of interests in this paper.
[1] | Grimm NB, Faeth SH, Golubiewski NE, et al. (2008) Global change and the ecology of cities. Science 319: 756-760. |
[2] |
Bonan GB (2000) The microclimates of a suburban Colorado (USA) landscape and implications for planning and design. Landscape urban plan 49: 97-114. doi: 10.1016/S0169-2046(00)00071-2
![]() |
[3] |
Taleb D, Abu-Hijleh B (2013) Urban heat islands: Potential effect of organic and structured urban configurations on temperature variations in Dubai, UAE. Renewable Energy 50: 747-762. doi: 10.1016/j.renene.2012.07.030
![]() |
[4] |
Holderness T, Barr S, Dawson R, et al. (2013) An evaluation of thermal Earth observation for characterizing urban heatwave event dynamics using the urban heat island intensity metric. Int j remote sens 34: 864-884. doi: 10.1080/01431161.2012.714505
![]() |
[5] |
Hansen J, Sato M, Ruedy R (2012) Perception of climate change. Proceedings of the National Academy of Sciences of the United States of America 109: E2415-2423. doi: 10.1073/pnas.1205276109
![]() |
[6] |
Son JY, Lee JT, Brooke Anderson G, et al. (2012) The impact of heat waves on mortality in seven major cities in Korea. Environ health persp 120: 566-571. doi: 10.1289/ehp.1103759
![]() |
[7] | D’Ippoliti D, Michelozzi P, Marino C, et al (2010) The impact of heat waves on mortality in 9 European cities: Results from the EuroHEAT project. Environmental Health 9: 37. |
[8] |
Hajat S, Armstrong B, Baccini M, et al. (2006) Impact of high temperatures on mortality: Is there an added heat wave effect? Epidemiology 17: 632-638. doi: 10.1097/01.ede.0000239688.70829.63
![]() |
[9] |
Conti S, Meli P, Minelli G, et al. (2005) Epidemiologic study of mortality during the Summer 2003 heat wave in Italy. Environmental Research 98: 390-399. doi: 10.1016/j.envres.2004.10.009
![]() |
[10] | Heidt V, Neef M (2008) Benefits of Urban Green Space for Improving Urban Climate. In: Carreiro MM, Song YC, Wu J (eds) Ecology, Planning, and Management of Urban Forests. Springer, New York, 84-96. |
[11] |
Demuzere M, Orru K, Heidrich O, et al. (2014) Mitigating and adapting to climate change: Multi-functional and multi-scale assessment of green urban infrastructure. J Environ Manage 146: 107-115. doi: 10.1016/j.jenvman.2014.07.025
![]() |
[12] |
Escobedo FJ, Adams DC, Timilsina N (2015) Urban forest structure effects on property value. Ecosystem Services 12: 209-217. doi: 10.1016/j.ecoser.2014.05.002
![]() |
[13] |
Li W, Saphores JDM, Gillespie TW (2015) A comparison of the economic benefits of urban green spaces estimated with NDVI and with high-resolution land cover data. Landscape urban plan 133: 105-117. doi: 10.1016/j.landurbplan.2014.09.013
![]() |
[14] |
Vandermeulen V, Verspecht A, Vermeire B, et al. (2011) The use of economic valuation to create public support for green infrastructure investments in urban areas. Landscape urban plan 103: 198-206. doi: 10.1016/j.landurbplan.2011.07.010
![]() |
[15] |
Bertram C, Rehdanz K (2015) Preferences for cultural urban ecosystem services: Comparing attitudes, perception, and use. Ecosystem Services 12: 187-199. doi: 10.1016/j.ecoser.2014.12.011
![]() |
[16] | Andersson E, Tengö M, McPhearson T, et al. (2014) Cultural ecosystem services as a gateway for improving urban sustainability. Ecosystem Services 12: 165-168. |
[17] | Tyrväinen L, Pauleit S, Seeland K, et al. (2005) Benefits and Uses of Urban Forests and Trees. In: Konijnendijk C, Nilsson K, Randrup T, Schipperijn J (eds) Urban Forests and Trees. Springer Berlin Heidelberg, 81-114. |
[18] |
Escobedo FJ, Nowak DJ (2009) Spatial heterogeneity and air pollution removal by an urban forest. Landscape urban plan 90: 102-110. doi: 10.1016/j.landurbplan.2008.10.021
![]() |
[19] |
Escobedo FJ, Kroeger T, Wagner JE (2011) Urban forests and pollution mitigation: analyzing ecosystem services and disservices. Environmental pollution 159: 2078-2087. doi: 10.1016/j.envpol.2011.01.010
![]() |
[20] |
Nowak DJ, Crane DE, Stevens JC (2006) Air pollution removal by urban trees and shrubs in the United States. Urban For Urban Gree 4: 115-123. doi: 10.1016/j.ufug.2006.01.007
![]() |
[21] |
Pugh TAM, MacKenzie AR, Whyatt JD, et al. (2012) Effectiveness of Green Infrastructure for Improvement of Air Quality in Urban Street Canyons. Environ Sci Technol 46: 7692-7699. doi: 10.1021/es300826w
![]() |
[22] |
Strohbach MW, Haase D (2012) Above-ground carbon storage by urban trees in Leipzig, Germany: Analysis of patterns in a European city. Landscape urban plan 104: 95-104. doi: 10.1016/j.landurbplan.2011.10.001
![]() |
[23] |
Nowak DJ, Crane DE (2002) Carbon storage and sequestration by urban trees in the USA. Environmental pollution 116: 381-389. doi: 10.1016/S0269-7491(01)00214-7
![]() |
[24] | Jo H-K, McPherson EG (1995) Carbon Storage and Flux in Urban Residential Greenspace. J Environ Manage 45: 109-133. |
[25] |
Liu C, Li X (2012) Carbon storage and sequestration by urban forests in Shenyang, China. Urban For Urban Gree 11: 121-128. doi: 10.1016/j.ufug.2011.03.002
![]() |
[26] |
Russo A, Escobedo FJ, Timilsina N, et al. (2015) Transportation carbon dioxide emission offsets by public urban trees: A case study in Bolzano, Italy. Urban For Urban Gree 14: 398-403. doi: 10.1016/j.ufug.2015.04.002
![]() |
[27] |
Weissert LF, Salmond JA, Schwendenmann L (2014) A review of the current progress in quantifying the potential of urban forests to mitigate urban CO2 emissions. Urban Climate 8: 100-125. doi: 10.1016/j.uclim.2014.01.002
![]() |
[28] |
Hardin PJ, Jensen RR (2007) The effect of urban leaf area on summertime urban surface kinetic temperatures: A Terre Haute case study. Urban For Urban Gree 6: 63-72. doi: 10.1016/j.ufug.2007.01.005
![]() |
[29] |
Rosenfeld AH, Akbari H, Bretz S, et al. (1995) Mitigation of urban heat islands: materials, utility programs, updates. Energ Buildings 22: 255-265. doi: 10.1016/0378-7788(95)00927-P
![]() |
[30] | Akbari H (2002) Shade trees reduce building energy use and CO2 emissions from power plants. Environmental pollution 116 Suppl: S119-126. |
[31] |
Georgi NJ, Zafiriadis K (2006) The impact of park trees on microclimate in urban areas. Urban Ecosystems 9: 195-209. doi: 10.1007/s11252-006-8590-9
![]() |
[32] | Georgi JN, Dimitriou D (2010) The contribution of urban green spaces to the improvement of environment in cities: Case study of Chania, Greece. Building Environ 45: 1401-1414. |
[33] | Coronel AS, Feldman SR, Jozami E, et al. (2015) Effects of urban green areas on air temperature in a medium-sized Argentinian city. AIMS Environmental Science 2: 803–826 |
[34] | Starke WB, Simonds JO (2013) Landscape Architecture: A Manual of Environmental Planning and Design, Fifth edit. McGraw-Hill Professional. |
[35] | Konijnendijk CC, Annerstedt M, Nielsen AB, et al. (2013) Benefits of Urban Parks—A systematic review. Copenhagen & Alnarp. |
[36] |
Williams K, O’Brien L, Stewart A (2013) Urban health and urban forestry: How can forest management agencies help? Arboricultural Journal 35: 119-133. doi: 10.1080/03071375.2013.852358
![]() |
[37] | Yang W, Omaye ST (2009) Air pollutants, oxidative stress and human health. Mutation Research/Genetic Toxicology and Environmental Mutagenesis 674: 45-54. |
[38] | Sicard P, Lesne O, Alexandre N, et al. (2011) Air quality trends and potential health effects – Development of an aggregate risk index. Atmospheric Environment 45: 1145-1153. |
[39] | Cheng Z, Jiang J, Fajardo O, et al. (2012) Characteristics and health impacts of particulate matter pollution in China (2001-2011). Atmospheric Environment 65: 186-194. |
[40] |
Takano T, Nakamura K, Watanabe M (2002) Urban residential environments and senior citizens’ longevity in megacity areas: the importance of walkable green spaces. J epidemiol commun h 56: 913-918. doi: 10.1136/jech.56.12.913
![]() |
[41] |
Tanaka A, Takano T, Nakamura K, et al. (1996) Health levels influenced by urban residential conditions in a megacity—Tokyo. Urban Studies 33: 879-894. doi: 10.1080/00420989650011645
![]() |
[42] | Tzoulas K, Korpela K, Venn S, et al. (2007) Promoting ecosystem and human health in urban areas using Green Infrastructure: A literature review. Landscape urban plan 81: 167-178. |
[43] | Picot X (2004) Thermal comfort in urban spaces: impact of vegetation growth. Energ Buildings 36: 329-334. |
[44] |
Lafortezza R, Carrus G, Sanesi G, et al. (2009) Benefits and well-being perceived by people visiting green spaces in periods of heat stress. Urban For Urban Gree 8: 97-108. doi: 10.1016/j.ufug.2009.02.003
![]() |
[45] |
Armson D, Stringer P, Ennos AR (2012) The effect of tree shade and grass on surface and globe temperatures in an urban area. Urban For Urban Gree 11: 245-255. doi: 10.1016/j.ufug.2012.05.002
![]() |
[46] |
Maher BA, Ahmed IAM, Davison B, et al. (2013) Impact of roadside tree lines on indoor concentrations of traffic-derived particulate matter. Environ sci technol 47: 13737-13744. doi: 10.1021/es404363m
![]() |
[47] |
Roy S, Byrne J, Pickering C (2012) A systematic quantitative review of urban tree benefits, costs, and assessment methods across cities in different climatic zones. Urban for urban gree 11: 351-363. doi: 10.1016/j.ufug.2012.06.006
![]() |
[48] | Ahern J (2012) Urban landscape sustainability and resilience: the promise and challenges of integrating ecology with urban planning and design. Landscape Ecology 28: 1203-1212. |
[49] | Maes J, Egoh B, Willemen L, et al (2012) Mapping ecosystem services for policy support and decision making in the European Union. Ecosystem Services 1: 31-39. |
[50] |
Kandziora M, Burkhard B, Müller F (2013) Mapping provisioning ecosystem services at the local scale using data of varying spatial and temporal resolution. Ecosystem Services 4: 47-59. doi: 10.1016/j.ecoser.2013.04.001
![]() |
[51] |
Taleghani M, Sailor DJ, Tenpierik M, et al. (2014) Thermal assessment of heat mitigation strategies: The case of Portland State University, Oregon, USA. Building Environ 73: 138-150. doi: 10.1016/j.buildenv.2013.12.006
![]() |
[52] | Nowak DJ, Hoehn RE, Bodine AR, et al. (2013) Urban forest structure, ecosystem services and change in Syracuse, NY. Urban Ecosystems. doi: 10.1007/s11252-013-0326-z |
[53] |
Lovell ST, Taylor JR (2013) Supplying urban ecosystem services through multifunctional green infrastructure in the United States. Landscape Ecology 28: 1447-1463. doi: 10.1007/s10980-013-9912-y
![]() |
[54] | Siena F, Buffoni A (2007) Inquinamento atmosferico e verde urbano. Il modello UFORE, un caso di studio. Sherwood 138: 17-21. |
[55] |
Paoletti E (2009) Ozone and urban forests in Italy. Environmental pollution 157: 1506-1512. doi: 10.1016/j.envpol.2008.09.019
![]() |
[56] |
Manes F, Incerti G, Salvatori E, et al. (2012) Urban ecosystem services: Tree diversity and stability of tropospheric ozone removal. Ecological Applications 22: 349-360. doi: 10.1890/11-0561.1
![]() |
[57] |
Papa S, Bartoli G, Nacca F, et al. (2012) Trace metals, peroxidase activity, PAHs contents and ecophysiological changes in Quercus ilex leaves in the urban area of Caserta (Italy). J environ manage 113: 501-509. doi: 10.1016/j.jenvman.2012.05.032
![]() |
[58] |
Gratani L, Varone L (2007) Plant crown traits and carbon sequestration capability by Platanus hybrida Brot. in Rome. Landscape urban plan 81: 282-286. doi: 10.1016/j.landurbplan.2007.01.006
![]() |
[59] | Baraldi R, Rapparini F, Tosi G, et al. (2010) New aspects on the impact of vegetation in urban environment. Acta Horticulturae 881: 543-546. |
[60] | Russo A, Escobedo FJ, Timilsina N, et al. (2014) Assessing urban tree carbon storage and sequestration in Bolzano, Italy. International Journal of Biodiversity Science, Ecosystem Services & Management 10: 54-70. |
[61] | Sanesi G, Chiarello F (2006) Residents and urban green spaces: The case of Bari. Urban For Urban Gree 4: 125-134. |
[62] | Secco G, Zulian G (2008) Modeling the Social Benefits of Urban Parks for Users. In: Carreiro M, Song Y-C, Wu J (eds) Ecology, Planning, and Management of Urban Forests SE - 20. Springer New York, 312-335. |
[63] |
Paoletti E, Bardelli T, Giovannini G, et al. (2011) Air quality impact of an urban park over time. Procedia Environmental Sciences 4: 10-16. doi: 10.1016/j.proenv.2011.03.002
![]() |
[64] | Gratani L, Varone L (2006) Carbon sequestration by Quercus ilex L. and Quercus pubescens Willd. and their contribution to decreasing air temperature in Rome. Urban Ecosystems 9: 27-37. |
[65] |
Konijnendijk CC, Ricard RM, Kenney A, et al. (2006) Defining urban forestry—A comparative perspective of North America and Europe. Urban For Urban Gree 4: 93-103. doi: 10.1016/j.ufug.2005.11.003
![]() |
[66] | Maes J, Teller A, Erhard M, et al (2013) Mapping and Assessment of Ecosystems and their Services. An analytical framework for ecosystem assessments under action 5 of the EU biodiversity strategy to 2020. Luxembourg: Publications office of the European Union. |
[67] | European Commission (2013) Air Quality Standards. Available from: http://ec.europa.eu/environment/air/quality/standards.htm. |
[68] | Bolzano Statistics Office (2012) Bolzano 2012 City Figures. Available from: http://www.comune.bolzano.it/UploadDocs/11430_Bolzano_2012.pdf |
[69] | Chiesura A, Mirabile M (2012) Il verde urbano. In: Qualità dell’ambiente urbano, 33/2012 ed., Roma: ISPRA, 346-349. |
[70] | Russo A (2013) Quantifying and modeling ecosystem services provided by urban greening in cities of the Southern Alps, N Italy. Dissertation. University of Bologna, Italy. |
[71] | Autonomous Province of Bolzano (2012) Meteorological Service of the Autonomous Province of Bolzano, historical data. Available from: http://www.provincia.bz.it/meteo/dati-storici.asp. |
[72] | Bolzano Provincial Environment Agency (2010) Program for reducing NO2 pollution. Available from: http://www.comune.bolzano.it/ambiente_context02.jsp?ID_LINK=3681&area=68 |
[73] | Natural England (2013) Green Infrastructure—Valuation Tools Assessment. Exeter |
[74] |
Forman RTT (1964) Growth under Controlled Conditions to Explain the Hierarchical Distributions of a Moss, Tetraphis pellucida. Ecological Monographs 34: 1. doi: 10.2307/1948461
![]() |
[75] | O’Neill RV, Deangelis DL, Waide JB, et al. (1986) A Hierarchical Concept of Ecosystems. Princeton University Press, New Jersey. |
[76] | Forman RTT (2008) Urban Regions: Ecology and Planning Beyond the City (Cambridge Studies in Landscape Ecology). Cambridge University Press New York. |
[77] | Park S, Tuller SE, Jo M (2014) Application of Universal Thermal Climate Index (UTCI) for microclimatic analysis in urban thermal environments. Landscape urban plan 125: 146-155. |
[78] |
Baró F, Chaparro L, Gómez-Baggethun E, et al. (2014) Contribution of ecosystem services to air quality and climate change mitigation policies: The case of urban forests in Barcelona, Spain. Ambio 43: 466-479. doi: 10.1007/s13280-014-0507-x
![]() |
[79] | Nowak DJ, Crane DE, Stevens JC, et al. (2008) A ground-based method of assessing urban forest structure and ecosystem services. Arboriculture and Urban Forestry 34: 347-358. |
[80] | Bruse M (2012) ENVI-met. Available from: http://www.envi-met.com/. |
[81] | Wania A, Bruse M, Blond N, et al. (2012) Analysing the influence of different street vegetation on traffic-induced particle dispersion using microscale simulations. J environ manage 94: 91-101. |
[82] | DeFries R, Pagiola S, Adamowicz W, et al. (2005) Analytical Approaches for Assessing Ecosystem Condition and Human Well-being. In: Hassan R, Scholes R, Ash N (eds) Ecosystems and Human Well-being: Current State and Trends, Volume 1. Washington, Covelo, London: Island Press, 37-71. |
[83] | Wälchli G (2012) Ecosystem services as an economic strategy? i-Tree : a tool for the economic assessment of urban trees. Summary. Dissertation. Zürcher Hochschule für Angewandte Wissenschaften. |
[84] | Chaparro L, Terradas J (2009) Ecological Services of Urban Forest in Barcelona. Centre de Recerca Ecològica i Aplicacions Forestals, Universitat Autònoma de Barcelona, Bellaterra, Spain. 96 p. Available from: https://www.itreetools.org/resources/reports/Barcelona%20Ecosystem%20Analysis.pdf |
[85] |
Tallis M, Taylor G, Sinnett D, et al. (2011) Estimating the removal of atmospheric particulate pollution by the urban tree canopy of London, under current and future environments. Landscape urban plan 103: 129-138. doi: 10.1016/j.landurbplan.2011.07.003
![]() |
[86] | Rogers K, Hansford D, Sunderland T, et al. (2011) Measuring the ecosystem services of Torbay’s trees : the Torbay i-Tree Eco pilot project. In: Urban Trees Research Conference. Forestry Commission, Edinburgh, 18-26. |
[87] |
Carnielo E, Zinzi M (2013) Optical and thermal characterisation of cool asphalts to mitigate urban temperatures and building cooling demand. Building Environ 60: 56-65. doi: 10.1016/j.buildenv.2012.11.004
![]() |
[88] | Johansson E, Spangenberg J, Gouvêa ML, et al. (2013) Scale-integrated atmospheric simulations to assess thermal comfort in different urban tissues in the warm humid summer of São Paulo, Brazil. Urban Climate 6: 24-43. |
[89] |
Fahmy M, Sharples S, Yahiya M (2010) LAI based trees selection for mid latitude urban developments: A microclimatic study in Cairo, Egypt. Building Environ 45: 345-357. doi: 10.1016/j.buildenv.2009.06.014
![]() |
[90] | van Hoof J (2008) Forty years of Fanger’s model of thermal comfort: comfort for all? Indoor air 18: 182-201. |
[91] | Honjo T (2009) Thermal comfort in outdoor environment. Global Environmental Research: 43-47. |
[92] |
Chen L, Ng E (2012) Outdoor thermal comfort and outdoor activities: A review of research in the past decade. Cities 29: 118-125. doi: 10.1016/j.cities.2011.08.006
![]() |
[93] |
Berkovic S, Yezioro A, Bitan A (2012) Study of thermal comfort in courtyards in a hot arid climate. Solar Energy 86: 1173-1186. doi: 10.1016/j.solener.2012.01.010
![]() |
[94] |
Hirabayashi S, Kroll CN, Nowak DJ (2011) Component-based development and sensitivity analyses of an air pollutant dry deposition model. Environ Modell Softw 26: 804-816. doi: 10.1016/j.envsoft.2010.11.007
![]() |
[95] | NOAA (2012) NOAA’s National Climatic Data Center (NCDC). Available from: http://gis.ncdc.noaa.gov/map/viewer/#app=cdo. Accessed 30 Dec 2012. |
[96] | Nowak DJ, Crane DE, Stevens JC, et al. (2003) The urban forest effects (UFORE) model: Field data collection manual. Syracuse, NY. |
[97] | Nowak DJ, Crane DE, Stevens JC, et al. (2002) Brooklyn’s urban forest. Gen. Tech. Rep. NE-290. Newtown Square, PA. |
[98] | Brown RD, Gillespie TJ (1995) Microclimatic Landscape Design: Creating Thermal Comfort and Energy Efficiency, 1st ed. Wiley, John & Sons. |
[99] |
Vailshery LS, Jaganmohan M, Nagendra H (2013) Effect of street trees on microclimate and air pollution in a tropical city. Urban For Urban Gree 12: 408-415. doi: 10.1016/j.ufug.2013.03.002
![]() |
[100] |
Bowler DE, Buyung-Ali L, Knight TM, et al. (2010) Urban greening to cool towns and cities: A systematic review of the empirical evidence. Landscape urban plan 97: 147-155. doi: 10.1016/j.landurbplan.2010.05.006
![]() |
[101] |
Ng E, Chen L, Wang Y, et al. (2012) A study on the cooling effects of greening in a high-density city: An experience from Hong Kong. Building Environ 47: 256-271. doi: 10.1016/j.buildenv.2011.07.014
![]() |
[102] |
Johansson E, Emmanuel R (2006) The influence of urban design on outdoor thermal comfort in the hot, humid city of Colombo, Sri Lanka. Int j biometeorol 51: 119-133. doi: 10.1007/s00484-006-0047-6
![]() |
[103] |
Perini K, Magliocco A (2014) Effects of vegetation, urban density, building height, and atmospheric conditions on local temperatures and thermal comfort.Urban For Urban Gree 13: 495-506. doi: 10.1016/j.ufug.2014.03.003
![]() |
[104] | Buffoni A, Toccafondi P, Pinzauti S (2007) A green system project for pollution mitigation. Available from: http://ambiente.comune.forli.fc.it/public/cms_page_media/48/Sintesi%20Relazione%20Verde%20Urbano%20Forl%C3%AC_784_6788.pdf |
[105] |
Jim CY, Chen WY (2008) Assessing the ecosystem service of air pollutant removal by urban trees in Guangzhou (China). J environ manage 88: 665-676. doi: 10.1016/j.jenvman.2007.03.035
![]() |
[106] |
Tiwary A, Sinnett D, Peachey C, et al. (2009) An integrated tool to assess the role of new planting in PM10 capture and the human health benefits: a case study in London. Environmental pollution 157: 2645-2653. doi: 10.1016/j.envpol.2009.05.005
![]() |
[107] |
Benjamin MT, Winer AM (1998) Estimating the ozone-forming potential of urban trees and shrubs. Atmospheric Environment 32: 53-68. doi: 10.1016/S1352-2310(97)00176-3
![]() |
[108] |
Calfapietra C, Fares S, Manes F, et al. (2013) Role of Biogenic Volatile Organic Compounds (BVOC) emitted by urban trees on ozone concentration in cities: a review. Environmental pollution 183: 71-80. doi: 10.1016/j.envpol.2013.03.012
![]() |
[109] |
Skelhorn C, Lindley S, Levermore G (2014) The impact of vegetation types on air and surface temperatures in a temperate city: A fine scale assessment in Manchester, UK. Landscape urban plan 121: 129-140. doi: 10.1016/j.landurbplan.2013.09.012
![]() |
[110] |
Manning W (2008) Plants in urban ecosystems: Essential role of urban forests in urban metabolism and succession toward sustainability. Int J Sust Dev World Ecol 15: 362-370. doi: 10.3843/SusDev.15.4:12
![]() |
[111] | Morani A, Nowak D, Hirabayashi S, et al. (2014) Comparing i-Tree modeled ozone deposition with field measurements in a periurban Mediterranean forest. Environmental pollution 195C: 202-209. |
[112] | Pataki DE, Carreiro MM, Cherrier J, et al. (2011) Coupling biogeochemical cycles in urban environments: ecosystem services, green solutions, and misconceptions. Front Ecol Environ 9: 27-36. |
[113] | Bealey WJ, McDonald G, Nemitz E, et al. (2007) Estimating the reduction of urban PM10 concentrations by trees within an environmental information system for planners. J environ manage 85: 44-58. |
1. | Rudrajeet Pal, Yasaman Samie, Armaghan Chizaryfard, Demystifying process-level scalability challenges in fashion remanufacturing: An interdependence perspective, 2021, 286, 09596526, 125498, 10.1016/j.jclepro.2020.125498 | |
2. | Shuo Zhu, Hua Zhang, Zhigang Jiang, Bernard Hon, A carbon efficiency upgrading method for mechanical machining based on scheduling optimization strategy, 2020, 15, 2095-0233, 338, 10.1007/s11465-019-0572-8 | |
3. | Wenjie Wang, Guangdong Tian, Honghao Zhang, Kangkang Xu, Zheng Miao, Modeling and scheduling for remanufacturing systems with disassembly, reprocessing, and reassembly considering total energy consumption, 2021, 0944-1344, 10.1007/s11356-021-17292-x | |
4. | Guangyuan Zhang, Xiaonan Gao, Zhenfang Zhu, Fengyv Zhou, Dexin Yu, Determination of the location of the needle entry point based on an improved pruning algorithm, 2022, 19, 1551-0018, 7952, 10.3934/mbe.2022372 | |
5. | Xingwang Shen, Shimin Liu, Can Zhang, Jinsong Bao, Intelligent material distribution and optimization in the assembly process of large offshore crane lifting equipment, 2021, 159, 03608352, 107496, 10.1016/j.cie.2021.107496 | |
6. | Yaping Ren, Xinyu Lu, Hongfei Guo, Zhaokang Xie, Haoyang Zhang, Chaoyong Zhang, A Review of Combinatorial Optimization Problems in Reverse Logistics and Remanufacturing for End-of-Life Products, 2023, 11, 2227-7390, 298, 10.3390/math11020298 | |
7. | Wenyu Zhang, Jun Wang, Xiangqi Liu, Shuai Zhang, A new uncertain remanufacturing scheduling model with rework risk using hybrid optimization algorithm, 2023, 1614-7499, 10.1007/s11356-023-26219-7 | |
8. | Jun Guo, Junfeng Zou, Baigang Du, Kaipu Wang, Integrated scheduling for remanufacturing system considering component commonality using improved multi-objective genetic algorithm, 2023, 182, 03608352, 109419, 10.1016/j.cie.2023.109419 | |
9. | Wenyu Zhang, Jiaxuan Shi, Shuai Zhang, Mengjiao Chen, Scenario-Based Robust Remanufacturing Scheduling Problem Using Improved Biogeography-Based Optimization Algorithm, 2023, 53, 2168-2216, 3414, 10.1109/TSMC.2022.3225443 |
Places and transitions in CTPN | Description |
s0 | The output buffer of the inspection center |
si (i=1, 2, ..., 12) | The input buffer of each recovery workstation |
sz (z=13, 14, 15, 16) | The output buffer of each recovery workstation |
s17 | The input buffer of the reassembly center |
wk (k=1, 2, ..., 12) | Workstation places |
ti, j (i, j=1, 2, ..., 12, i≠j) | Recovery operations |
t0, i, ti, z, ti,17 (i=1, 2, ..., 12, z=13, 14, 15, 16) | Transportation transitions |
Index | Description |
L= {1, 2, ..., L} | index set of used products |
D= {1, 2, ..., D} | index set of component types |
K= {1, 2, ..., K} | index set of workstations |
H= {1, 2, ..., H} | index set of recovery process routings |
Parameters | Description |
ϑld | the dth core disassembled from the lth product |
wk | the kth workstation that performs a specific recovery operation |
Rh | the hth recovery process routing designed for worn cores and is represented as a set of recovery operations |
pre(tij, Rh) | the operational stages of recovery operation tij in Rh |
Last(Rh) | the last recovery operation in Rh |
aldh | a binary variable with a value 1 indicates the hth routing for the core ϑld |
u(tij, ϑld) | the time for a core ϑld to be processed in transition tij |
AT(si, ϑld) | the arrival time of the core ϑld at buffer place si |
ST(wk, ϑld) | the start time of the core ϑld being processed by wk |
Com(wk, ϑld) | the completion time of the core ϑld processed by wk |
ρ(ϑld) | the makespan of the component ϑld |
χ(ϑld) | the tardiness of the component ϑld |
$\zeta (l)$ | the tardiness of the lth product |
Probld | the probability of a core ϑld being selected for routing reassignment |
$\Pi _{ld}^{h, x}$ | the difference of the total average waiting time between the hth routing and the xth one for the core ϑld |
WTk | the average waiting time per core consumed in the kth workstation |
h | the total average waiting time per core consumed in the hth routing |
$v_{ld}^{h, x}$ | the probability of the xth routing being selected to replace the current hth routing for the core ϑld |
Slackxy | slack time of a core ϑxy in scheduling horizon |
Decision variables | Description |
rldh | a binary variable with a value 1 indicates that the hth process routing is assigned to a core ϑld |
Pri(wk, ϑld) | the priority for the dth component of the lthused product to be processed by the kth workstation |
Arrival rate | The average total cost per machine tool | Improvement of the standard method over the baseline one tc1–tc2 | Improvement of the proposed method over the standard one tc2–tc3 | ||
Baseline casetc1 | Standard SA/MSTtc2 | Proposed SA/MSTtc3 | |||
π=5 | 186.66 | 117.02 | 117.02 | 69.64 | 0 |
π=6 | 228.37 | 133.48 | 118.21 | 94.89 | 15.27 |
π=7 | 293.05 | 172.45 | 146.89 | 120.6 | 25.56 |
π=8 | 335.87 | 208.06 | 168.69 | 127.81 | 39.37 |
π=9 | 447.52 | 266.47 | 216.25 | 181.05 | 50.22 |
π=10 | 581.63 | 352.28 | 270.91 | 229.35 | 81.37 |
π=11 | 714.29 | 461.86 | 335.77 | 252.43 | 126.09 |
Sample mean | 398.20 | 244.52 | 196.25 | 153.68 | 48.27 |
Sample standard deviation | 193.44 | 125.46 | 82.67 | 68.93 | 43.15 |
Arrival rate | The average total cost per machine tool | Improvement of the standard method over the baseline onetc1–tc2 | Improvement of the proposed method over the standard onetc2–tc3 | ||
Baseline casetc1 | Standard SA/MSTtc2 | Proposed SA/MSTtc3 | |||
π=5 | 215.76 | 117.83 | 117.83 | 97.93 | 0 |
π=6 | 327.61 | 160.31 | 140.12 | 167.3 | 20.19 |
π=7 | 455.9 | 226.47 | 185.02 | 229.43 | 41.45 |
π=8 | 658.09 | 342.57 | 273.22 | 315.52 | 69.35 |
π=9 | 891.23 | 515.96 | 406.38 | 375.27 | 109.58 |
π=10 | 1137.96 | 738.41 | 559.67 | 399.55 | 178.74 |
π=11 | 1530.54 | 986.65 | 775.72 | 543.89 | 210.93 |
Sample mean | 745.30 | 441.17 | 351.14 | 304.13 | 90.03 |
Sample standard deviation | 472.28 | 324.23 | 244.76 | 151.99 | 80.25 |
Arrival rate | The average total cost per machine tool | Improvement of the standard method over the baseline onetc1–tc2 | Improvement of the proposed method over the standard onetc2–tc3 | ||
Baseline casetc1 | Standard SA/MSTtc2 | Proposed SA/MSTtc3 | |||
π=5 | 270.84 | 117.32 | 117.32 | 153.52 | 0 |
π=6 | 463.08 | 224.8 | 186.58 | 238.28 | 38.22 |
π=7 | 687.42 | 416.46 | 275.13 | 270.96 | 141.33 |
π=8 | 1063.8 | 655.68 | 453.47 | 408.12 | 202.21 |
π=9 | 1495.67 | 957.36 | 706.49 | 538.31 | 250.87 |
π=10 | 1917.52 | 1231.56 | 918.76 | 685.96 | 312.8 |
π=11 | 2403.39 | 1483.89 | 1120.77 | 919.5 | 363.12 |
Sample mean | 1185.96 | 726.72 | 539.79 | 459.24 | 186.94 |
Sample standard deviation | 789.17 | 517.36 | 385.07 | 273.81 | 135.61 |
Computation time breaks | Standard SA/MST | Proposed SA/MST | ||||||
tc1 | pc1 | dc1 | wt1 | tc2 | pc2 | dc2 | wt2 | |
After 0sec | 399.25 | 112.16 | 287.09 | 76.80 | 399.25 | 112.16 | 287.09 | 76.80 |
After 30sec | 380.38 | 116.78 | 263.60 | 72.37 | 371.14 | 114.62 | 256.51 | 55.21 |
After 60sec | 393.70 | 113.71 | 279.99 | 61.76 | 341.42 | 118.56 | 222.86 | 48.34 |
After 90sec | 393.70 | 113.71 | 279.99 | 58.90 | 311.93 | 120.51 | 191.43 | 46.49 |
After 120sec | 386.11 | 115.62 | 270.49 | 58.75 | 292.79 | 121.75 | 171.04 | 44.54 |
After 150sec | 385.56 | 119.96 | 265.60 | 58.42 | 280.06 | 123.28 | 156.78 | 41.52 |
After 180sec | 384.17 | 121.18 | 262.99 | 57.90 | 274.14 | 124.64 | 149.51 | 41.47 |
After 210sec | 383.35 | 122.86 | 260.49 | 56.51 | 273.33 | 126.31 | 147.03 | 38.40 |
After 240sec | 378.22 | 124.65 | 252.57 | 54.73 | 273.22 | 132.79 | 140.42 | 35.67 |
No time limits* | 342.57 | 129.41 | 213.16 | 48.07 | 273.22 | 132.79 | 140.42 | 35.67 |
* "No time limit" means the simulation keeps the algorithm running until it meets the stopping criteria elaborated above. |
Places and transitions in CTPN | Description |
s0 | The output buffer of the inspection center |
si (i=1, 2, ..., 12) | The input buffer of each recovery workstation |
sz (z=13, 14, 15, 16) | The output buffer of each recovery workstation |
s17 | The input buffer of the reassembly center |
wk (k=1, 2, ..., 12) | Workstation places |
ti, j (i, j=1, 2, ..., 12, i≠j) | Recovery operations |
t0, i, ti, z, ti,17 (i=1, 2, ..., 12, z=13, 14, 15, 16) | Transportation transitions |
Index | Description |
L= {1, 2, ..., L} | index set of used products |
D= {1, 2, ..., D} | index set of component types |
K= {1, 2, ..., K} | index set of workstations |
H= {1, 2, ..., H} | index set of recovery process routings |
Parameters | Description |
ϑld | the dth core disassembled from the lth product |
wk | the kth workstation that performs a specific recovery operation |
Rh | the hth recovery process routing designed for worn cores and is represented as a set of recovery operations |
pre(tij, Rh) | the operational stages of recovery operation tij in Rh |
Last(Rh) | the last recovery operation in Rh |
aldh | a binary variable with a value 1 indicates the hth routing for the core ϑld |
u(tij, ϑld) | the time for a core ϑld to be processed in transition tij |
AT(si, ϑld) | the arrival time of the core ϑld at buffer place si |
ST(wk, ϑld) | the start time of the core ϑld being processed by wk |
Com(wk, ϑld) | the completion time of the core ϑld processed by wk |
ρ(ϑld) | the makespan of the component ϑld |
χ(ϑld) | the tardiness of the component ϑld |
$\zeta (l)$ | the tardiness of the lth product |
Probld | the probability of a core ϑld being selected for routing reassignment |
$\Pi _{ld}^{h, x}$ | the difference of the total average waiting time between the hth routing and the xth one for the core ϑld |
WTk | the average waiting time per core consumed in the kth workstation |
h | the total average waiting time per core consumed in the hth routing |
$v_{ld}^{h, x}$ | the probability of the xth routing being selected to replace the current hth routing for the core ϑld |
Slackxy | slack time of a core ϑxy in scheduling horizon |
Decision variables | Description |
rldh | a binary variable with a value 1 indicates that the hth process routing is assigned to a core ϑld |
Pri(wk, ϑld) | the priority for the dth component of the lthused product to be processed by the kth workstation |
Arrival rate | The average total cost per machine tool | Improvement of the standard method over the baseline one tc1–tc2 | Improvement of the proposed method over the standard one tc2–tc3 | ||
Baseline casetc1 | Standard SA/MSTtc2 | Proposed SA/MSTtc3 | |||
π=5 | 186.66 | 117.02 | 117.02 | 69.64 | 0 |
π=6 | 228.37 | 133.48 | 118.21 | 94.89 | 15.27 |
π=7 | 293.05 | 172.45 | 146.89 | 120.6 | 25.56 |
π=8 | 335.87 | 208.06 | 168.69 | 127.81 | 39.37 |
π=9 | 447.52 | 266.47 | 216.25 | 181.05 | 50.22 |
π=10 | 581.63 | 352.28 | 270.91 | 229.35 | 81.37 |
π=11 | 714.29 | 461.86 | 335.77 | 252.43 | 126.09 |
Sample mean | 398.20 | 244.52 | 196.25 | 153.68 | 48.27 |
Sample standard deviation | 193.44 | 125.46 | 82.67 | 68.93 | 43.15 |
Arrival rate | The average total cost per machine tool | Improvement of the standard method over the baseline onetc1–tc2 | Improvement of the proposed method over the standard onetc2–tc3 | ||
Baseline casetc1 | Standard SA/MSTtc2 | Proposed SA/MSTtc3 | |||
π=5 | 215.76 | 117.83 | 117.83 | 97.93 | 0 |
π=6 | 327.61 | 160.31 | 140.12 | 167.3 | 20.19 |
π=7 | 455.9 | 226.47 | 185.02 | 229.43 | 41.45 |
π=8 | 658.09 | 342.57 | 273.22 | 315.52 | 69.35 |
π=9 | 891.23 | 515.96 | 406.38 | 375.27 | 109.58 |
π=10 | 1137.96 | 738.41 | 559.67 | 399.55 | 178.74 |
π=11 | 1530.54 | 986.65 | 775.72 | 543.89 | 210.93 |
Sample mean | 745.30 | 441.17 | 351.14 | 304.13 | 90.03 |
Sample standard deviation | 472.28 | 324.23 | 244.76 | 151.99 | 80.25 |
Arrival rate | The average total cost per machine tool | Improvement of the standard method over the baseline onetc1–tc2 | Improvement of the proposed method over the standard onetc2–tc3 | ||
Baseline casetc1 | Standard SA/MSTtc2 | Proposed SA/MSTtc3 | |||
π=5 | 270.84 | 117.32 | 117.32 | 153.52 | 0 |
π=6 | 463.08 | 224.8 | 186.58 | 238.28 | 38.22 |
π=7 | 687.42 | 416.46 | 275.13 | 270.96 | 141.33 |
π=8 | 1063.8 | 655.68 | 453.47 | 408.12 | 202.21 |
π=9 | 1495.67 | 957.36 | 706.49 | 538.31 | 250.87 |
π=10 | 1917.52 | 1231.56 | 918.76 | 685.96 | 312.8 |
π=11 | 2403.39 | 1483.89 | 1120.77 | 919.5 | 363.12 |
Sample mean | 1185.96 | 726.72 | 539.79 | 459.24 | 186.94 |
Sample standard deviation | 789.17 | 517.36 | 385.07 | 273.81 | 135.61 |
Computation time breaks | Standard SA/MST | Proposed SA/MST | ||||||
tc1 | pc1 | dc1 | wt1 | tc2 | pc2 | dc2 | wt2 | |
After 0sec | 399.25 | 112.16 | 287.09 | 76.80 | 399.25 | 112.16 | 287.09 | 76.80 |
After 30sec | 380.38 | 116.78 | 263.60 | 72.37 | 371.14 | 114.62 | 256.51 | 55.21 |
After 60sec | 393.70 | 113.71 | 279.99 | 61.76 | 341.42 | 118.56 | 222.86 | 48.34 |
After 90sec | 393.70 | 113.71 | 279.99 | 58.90 | 311.93 | 120.51 | 191.43 | 46.49 |
After 120sec | 386.11 | 115.62 | 270.49 | 58.75 | 292.79 | 121.75 | 171.04 | 44.54 |
After 150sec | 385.56 | 119.96 | 265.60 | 58.42 | 280.06 | 123.28 | 156.78 | 41.52 |
After 180sec | 384.17 | 121.18 | 262.99 | 57.90 | 274.14 | 124.64 | 149.51 | 41.47 |
After 210sec | 383.35 | 122.86 | 260.49 | 56.51 | 273.33 | 126.31 | 147.03 | 38.40 |
After 240sec | 378.22 | 124.65 | 252.57 | 54.73 | 273.22 | 132.79 | 140.42 | 35.67 |
No time limits* | 342.57 | 129.41 | 213.16 | 48.07 | 273.22 | 132.79 | 140.42 | 35.67 |
* "No time limit" means the simulation keeps the algorithm running until it meets the stopping criteria elaborated above. |