Everyday adaptations to flooding at the micro-levels of low-income communities and macro levels of authorities in the megacity of Lagos, Nigeria

Olasimbo Fayombo; Olasimbo Fayombo

doi:10.3934/urs.2024008

Urban Resilience and Sustainability

2024, Volume 2, Issue 2: 151-184. doi: 10.3934/urs.2024008

Previous Article Next Article

Research article

Everyday adaptations to flooding at the micro-levels of low-income communities and macro levels of authorities in the megacity of Lagos, Nigeria

Olasimbo Fayombo ^,

Department of Geography, The University of Sheffield, Western Bank, S10 2TN

Received: 24 November 2023 Revised: 27 May 2024 Accepted: 05 June 2024 Published: 25 June 2024

The contextual nature of adaptation demands insights into the effects of actors' actions, decisions, and negotiations at different levels in the adaptation process to facilitate harmonizing and targeting actions. However, researchers who examine these activities at the micro level of communities and macro level of authorities in Sub-Saharan Africa are sparse. Consequently, using a qualitative approach and the Asset Adaptation Framework, we explored the everyday adaptations to flooding at the micro-levels of households/communities and the macro levels of governments before, during, and after flooding events in two low-income communities in Lagos, Nigeria. At the macro levels of governments, adaptation strategies centered on social reorganization and welfare, i.e., disaster reduction/management, in the temporal dimensions, situating adaptation in the adjustment/transitional flux. At the micro level, the strategies before flooding problematized the categorization of autonomous adaptation as unplanned. During flooding events, there was a difference in assets mobilized at the two levels, while macro-level actors mobilized financial assets for welfare, micro-level actors focused on social assets. After flooding, the positive psychology of self-conscientiousness in human assets aided the emergence of shadow networks that challenged the status quo and shaped each community's adaptation pathway/outcome. Furthermore, the human assets of faith/fate, place attachment, and autochthony used for building long-term resilience and entitlement claims aided a reposition of responsibility on the people's lifestyle by the authorities and supported a stance on adaptation as persistence/transitional. The stance on persistence/transitional pattern at the macro level notwithstanding, the shadow network in one of the communities utilized invited spaces of negotiation for entitlement claims that shifted the status quo and aided a transformational pattern. The highlighted shift in adaptation underlines the need to understand adaptation activities in the different spheres to guide policies, align actions, and facilitate a harmonized and sustainable adaptation.

Keywords:

Citation: Olasimbo Fayombo. Everyday adaptations to flooding at the micro-levels of low-income communities and macro levels of authorities in the megacity of Lagos, Nigeria[J]. Urban Resilience and Sustainability, 2024, 2(2): 151-184. doi: 10.3934/urs.2024008

Related Papers:

[1]	Jingjie Wang, Xiaoyong Wen, Manwai Yuen . Blowup for regular solutions and $C^{1}$ solutions of the two-phase model in $\mathbb{R}^{N}$ with a free boundary. AIMS Mathematics, 2022, 7(8): 15313-15330. doi: 10.3934/math.2022839
[2]	Zhi Guang Li . Global regularity and blowup for a class of non-Newtonian polytropic variation-inequality problem from investment-consumption problems. AIMS Mathematics, 2023, 8(8): 18174-18184. doi: 10.3934/math.2023923
[3]	Ruonan Liu, Tomás Caraballo . Random dynamics for a stochastic nonlocal reaction-diffusion equation with an energy functional. AIMS Mathematics, 2024, 9(4): 8020-8042. doi: 10.3934/math.2024390
[4]	Changlong Yu, Jing Li, Jufang Wang . Existence and uniqueness criteria for nonlinear quantum difference equations with $p$ -Laplacian. AIMS Mathematics, 2022, 7(6): 10439-10453. doi: 10.3934/math.2022582
[5]	Rutwig Campoamor-Stursberg, Eduardo Fernández-Saiz, Francisco J. Herranz . Generalized Buchdahl equations as Lie–Hamilton systems from the "book" and oscillator algebras: quantum deformations and their general solution. AIMS Mathematics, 2025, 10(3): 6873-6909. doi: 10.3934/math.2025315
[6]	Huafei Di, Yadong Shang, Jiali Yu . Blow-up analysis of a nonlinear pseudo-parabolic equation with memory term. AIMS Mathematics, 2020, 5(4): 3408-3422. doi: 10.3934/math.2020220
[7]	Yongbin Wang, Binhua Feng . Instability of standing waves for the inhomogeneous Gross-Pitaevskii equation. AIMS Mathematics, 2020, 5(5): 4596-4612. doi: 10.3934/math.2020295
[8]	Chaofeng Guan, Ruihu Li, Hao Song, Liangdong Lu, Husheng Li . Ternary quantum codes constructed from extremal self-dual codes and self-orthogonal codes. AIMS Mathematics, 2022, 7(4): 6516-6534. doi: 10.3934/math.2022363
[9]	Manwai Yuen . Blowup for ${{\rm{C}}}^{1}$ solutions of Euler equations in ${{\rm{R}}}^{N}$ with the second inertia functional of reference. AIMS Mathematics, 2023, 8(4): 8162-8170. doi: 10.3934/math.2023412
[10]	Abdelbaki Choucha, Muajebah Hidan, Bahri Cherif, Sahar Ahmed Idris . Growth of solutions with $L^{2(p+2)}$ -norm for a coupled nonlinear viscoelastic Kirchhoff equation with degenerate damping terms. AIMS Mathematics, 2022, 7(1): 371-383. doi: 10.3934/math.2022025

Abstract

1. Introduction

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.

2. A CTPN based remanufacturing process model

2.1. Problem statement

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.

Figure 1. Organizational structure of the remanufacturing facility.

DownLoad: Full-Size Img PowerPoint

In this case, each used product (e.g., the l^th 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.

Figure 2. The remanufacturing process routings of machine tool components.

DownLoad: Full-Size Img PowerPoint

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.

2.2. Definition of CTPN

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 = T^a ∪ T^e, where the finite set of transitions in T^a represent recovery operations, and the ones in T^e stand for transportation.

(3) I: P×T→{0, 1} is the input function that defines the set of ordered pairs (p_i, t_k), where I(p_i, t_k) = 1, if p_i is an input place for t_k (i.e., ∀p_i $\in$ ·t_k), otherwise 0.

(4) O: P×T→{0, 1} is the output function that defines the set of ordered pairs (p_i, t_k), where O(p_i, t_k) = 1, if p_i is an output place for t_k (i.e., ∀p_i $\in$ ·t_k·), otherwise 0.

(5) M: P→{0, 1, 2, …} is a marking vector, where M(p_i) represents the number of tokens in p_i.

(6) U: T^a→Θ is a non-zero time function that assigns to each recovery operation t∈T^a, while U: T^b→Θ 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.

Figure 3. A CTPN for remanufacturing of machine tools in Figure 2.

DownLoad: Full-Size Img PowerPoint

Table 1. The description of places and transitions in CTPN.

Places and transitions in CTPN	Description
s₀	The output buffer of the inspection center
s_i (i=1, 2, ..., 12)	The input buffer of each recovery workstation
s_z (z=13, 14, 15, 16)	The output buffer of each recovery workstation
s₁₇	The input buffer of the reassembly center
w_k (k=1, 2, ..., 12)	Workstation places
t_{i, j} (i, j=1, 2, ..., 12, i≠j)	Recovery operations
t_0, _i, t_{i, z}, t_i,₁₇ (i=1, 2, ..., 12, z=13, 14, 15, 16)	Transportation transitions

| Show Table

DownLoad: CSV

Table 2. The index used in CTPN.

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

| Show Table

DownLoad: CSV

Table 3. The parameters associated with the places and transitions in CTPN.

Parameters	Description
ϑ_ld	the d^th core disassembled from the l^th product
w_k	the k^th workstation that performs a specific recovery operation
R_h	the h^th recovery process routing designed for worn cores and is represented as a set of recovery operations
pre(t_ij, R_h)	the operational stages of recovery operation t_ij in R_h
Last(R_h)	the last recovery operation in R_h
a_ldh	a binary variable with a value 1 indicates the h^th routing for the core ϑ_ld
u(t_ij, ϑ_ld)	the time for a core ϑ_ld to be processed in transition t_ij
AT(s_i, ϑ_ld)	the arrival time of the core ϑ_ld at buffer place s_i
ST(w_k, ϑ_ld)	the start time of the core ϑ_ld being processed by w_k
Com(w_k, ϑ_ld)	the completion time of the core ϑ_ld processed by w_k
ρ(ϑ_ld)	the makespan of the component ϑ_ld
χ(ϑ_ld)	the tardiness of the component ϑ_ld
$\zeta (l)$	the tardiness of the lth product
Prob_ld	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 h^th routing and the x^th one for the core ϑ_ld
WT_k	the average waiting time per core consumed in the k^th workstation
_h	the total average waiting time per core consumed in the h^th routing
$v_{ld}^{h, x}$	the probability of the x^th routing being selected to replace the current h^th routing for the core ϑ_ld
Slack_xy	slack time of a core ϑ_xy in scheduling horizon

| Show Table

DownLoad: CSV

Table 4. The decision variables embedded in the places in CTPN.

Decision variables	Description
r_ldh	a binary variable with a value 1 indicates that the hth process routing is assigned to a core ϑ_ld
Pri(w_k, ϑ_ld)	the priority for the d^th component of the l^thused product to be processed by the k^th workstation

| Show Table

DownLoad: CSV

2.3. Modeling remanufacturing processes with CTPN

(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 s₀, it will be assigned with a specified process routing (i.e., R_h), 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 s₀ 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 s₀ might go to transitions among t_{0, 12}, t_{0, 5}, t_{0, 1}, t_{0, 3}, t_{0, 2}, t_{0, 6}, t_{0, 8}, t_{0, 11}; tokens in s₁₃ may either go to t_{13, 3}, t_{13, 10} or t_{13, 17}; tokens in s₁₆ might enters into either t_{16, 17} or t_{16, 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 R₁ = {t₀₃, t_{3, 14}, t_{14, 9}, t_{9, 17}} or R₂ = {t₀₃, t_{3, 14}, t_{14, 4}, t_{4, 15}, t_{15, 5}, t_{5, 17}}. Then in Figure 3, a token in s₁₄ representing a spindle with abrasion might fire transition t_{14, 9} or t_{14, 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 s_i is defined as C(s_j, ϑ_ld) = c_ij if the token goes to t_ij after being released from s_i.

Let M(s_i) denote the number of tokens in place s_i regardless of token color, and M(s_i, c_ij) the number of tokens in place s_i at M that have the color c_ij. 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., r_ldh is known), its color evolution can then be derived as follows.

$C({{s}_{j}},{{\vartheta }_{ld}})={{c}_{jp}},\ \text{if}\ \left\{ \begin{align} & C({{s}_{i}},{{\vartheta }_{ld}})={{c}_{ij}} \\ & pre({{t}_{jp}},{{R}_{h}})=pre({{t}_{ij}},{{R}_{h}})+1,\ \forall {{r}_{ldh}}=1 \\ & {{s}_{i}}\in {}^{\bullet }{{t}_{ij}},\ {{s}_{j}}\in {}^{\bullet }{{t}_{jp}} \\ \end{align} \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 s_k 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 s_i (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 k^th workstation is defined as Pri(w_k, ϑ_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 w_k.

Definition 4: A transition t_ij in the CTPN developed above is enabled at a marking M to process the core ϑ_ld with a color c_ij, 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 t_ij can fire in a marking M with respect to a color c_ij 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 t_ij 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\{ \begin{align} & {{s}_{j}}\in t_{ij}^{\bullet },\ {{s}_{j}}\in {}^{\bullet }{{t}_{jp}} \\ & pre({{t}_{jp}},{{R}_{h}})=pre({{t}_{ij}},{{R}_{h}})+1 \\ \end{align} \right.$

(9)

According to the above transition enabling and firing rules, the system always dispatch an available workstation w_k to the core with the highest priority (i.e., the lowest Pri(w_k, ϑ_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 t_ij is defined as u(t_ij, ϑ_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 β(w_k) is a control factor for workstation w_k whose value is determined based on statistics of historical data, and λ(w_k) is the average operation time of cores in w_k. Whenever a component goes into a transition for processing, it must stay in transition t_j for more thanu(t_j, ϑ_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 s_k of a corresponding workstation w_k. When the core arrived in the buffer s_k, 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, w_k) 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\{ \begin{array}{l} {r_{ldh}} = 1\\ {\rm{pre}}({w_v},{R_h}) = {\rm{pre}}({w_k},{R_h}) + 1\\ {s_i} \in {}^ \bullet {t_{ij}},\;{t_{ij}} \in {}^ \bullet {w_v} \cap w_v^ \bullet \end{array} \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)

3. CTPN-based hybrid meta-heuristics scheduler

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 s₀, while the input buffer place s_i (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., r_ldh), and (2) operation sequences for a given core in a workstation (i.e., Pri(w_k, ϑ_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\{ \begin{array}{l} {r_{ldh}} = 1\\ {t_{ij}} \in {R_h}\;{\rm{and}}\;{t_{ij}} \in w_k^ \bullet \end{array} \right.$

(17)

where φ(w_k) is unit operation cost of the k^th workstation and ϖ is unit penalty cost for product.

3.1. Simulated annealing for recovery process routing

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 g₀, SA uses a certain mechanism to generate a neighborhood solution g' with an acceptance probability AP.

$AP = \left\{ \begin{array}{l} 1,\;if\;\Delta \lt 0\\ \exp ( - \Delta /\Omega ),\;otherwise \end{array} \right.$

(18)

where Δ = f(g')－f(g₀), Ω 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.

Figure 4. The flowchart of CTPN-based hybrid meta-heuristics scheduler.

DownLoad: Full-Size Img PowerPoint

(1) SA solution representation

In this paper, a 3-dimension matrix R = [r_ldh]_L×D×H is proposed as representation of SA solutions. Each element r_ldh is a binary variable, one indicating the h^th 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 = [a_ldh] is a L-by-D-by-H mask whose element a_ldh = 1 indicates the feasibility of the h^th 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 h^th routing) for a core ϑ_ld is defined in Eq 20. The smaller the value of q_ldh, the greater chance the h^th routing is selected for the core, i.e., r_ldh = 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 r_ldh with r_ld_[_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 h^th routing) and the alternative one (i.e., x^th routing):

$\Pi _{ld}^{h,x} = {{\mathit{\Psi}} _h} - {{\mathit{\Psi}} _x},\forall \left\{ \begin{array}{l} {r_{ldh}} = 1\\ x \in \left\{ {1,2, \cdots ,H} \right\} - \left\{ h \right\}\\ {r_{ldx}} = 0,\;{a_{ldx}} = 1 \end{array} \right.$

(22)

${\Psi _h} = \sum\limits_{{t_{ij}} \in {R_h},{w_k} \in {}^ \bullet {t_{ij}}} {W{T_k}} \begin{array}{*{20}{c}} {}&{} \end{array}{\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 WT_k is the average waiting time per core consumed in the k^th workstation, Ψ_h and Ψ_x are the total average waiting time per core consumed in the h^th and x^th process routing, respectively, and N_k is the total number of cores being processed by workstation w_k. 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 x^th routing being selected to replace the current h^th routing for the core is defined as

$v_{ld}^{h,x} = \Pi _{ld}^{h,x}/\sum\limits_{\begin{array}{*{20}{c}} {x \in \left\{ {1,2, \cdots ,H} \right\} - \left\{ h \right\}}\\ {{a_{ldx}} = 1} \end{array}} {\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 I_max, and the maximum number of outer loop iterations ol_max. Our SA will stop whenever either of the thresholds is reached.

3.2. Remanufacturing resource dispatching based on CTPN

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 workstationw_k releases a component ϑ_uv(∀Pri(w_k, ϑ_uv) = q > 0) and turns back into idle state, it will pick up a core ϑ_ld with the least slack time ( $\exists$ slack_ld = min{slack_xy}) from the waiting queue (∀ϑ_xy, AT(s_i, ϑ_xy)-Com(w_k, ϑ_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\{ \begin{array}{l} AT({s_i},{\vartheta _{xy}}) - Com({w_k},{\vartheta _{uv}}) \le 0,\;\forall {r_{uvh}} = 1,{t_{ij}} \in {R_h},{s_i} \in {}^ \bullet {t_{ij}},\;{t_{ij}} \in {}^ \bullet {w_k} \cap w_k^ \bullet ,\;Pri({w_k},{\vartheta _{uv}}) = q\\ slac{k_{ld}} = \min \left\{ {slac{k_{xy}}} \right\},\forall {r_{xyh}} = 1,{t_{ij}} \in {R_h} \end{array} \right.$

(27)

The solution obtained by MST is a 3-dimension matrix G = [g_ldk]_L×D×K, where g_ldk, a non-negative integer, represents the operation sequence of the core ϑ_ld to be performed by workstation w_k. g_ldk = 0 means that the core ϑ_ld is not processed by w_k. Once the matrix G is derived, Pri(w_k, ϑ_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.

4. Case study

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 β(w_k) = 0.2 and λ(w_k) = 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 tool_max = 5000, il_max = 100, I_max = 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.

Table 5. Comparison of the algorithms performance under different arrival rate (ϖ = 20).

Arrival rate	The average total cost per machine tool			Improvement of the standard method over the baseline one tc₁–tc₂	Improvement of the proposed method over the standard one tc₂–tc₃
Arrival rate	Baseline casetc₁	Standard SA/MSTtc₂	Proposed SA/MSTtc₃
π=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

| Show Table

DownLoad: CSV

Table 6. Comparison of the algorithms performance under different arrival rate (ϖ = 60).

Arrival rate	The average total cost per machine tool			Improvement of the standard method over the baseline onetc₁–tc₂	Improvement of the proposed method over the standard onetc₂–tc₃
Arrival rate	Baseline casetc₁	Standard SA/MSTtc₂	Proposed SA/MSTtc₃
π=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

| Show Table

DownLoad: CSV

Table 7. Comparison of the algorithms performance under different arrival rate (ϖ = 100).

Arrival rate	The average total cost per machine tool			Improvement of the standard method over the baseline onetc₁–tc₂	Improvement of the proposed method over the standard onetc₂–tc₃
Arrival rate	Baseline casetc₁	Standard SA/MSTtc₂	Proposed SA/MSTtc₃
π=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

| Show Table

DownLoad: CSV

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.

Figure 5. The improvement of the standard sa/mst over the baseline case.

DownLoad: Full-Size Img PowerPoint

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.

Figure 6. The improvement of the proposed SA/MST over the standard SA/MST.

DownLoad: Full-Size Img PowerPoint

(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 σ = –(tc₃–tc₂)/tc₂ 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

$\begin{align} & \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{\sigma }\pm {{t}_{{1-\alpha }/{2}\;}}(n-1)\frac{SD}{\sqrt{n}} \\ & or\ \overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{\sigma }-{{t}_{{1-\alpha }/{2}\;}}(n-1)\frac{SD}{\sqrt{n}}\le \sigma \le \overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{\sigma }+{{t}_{{1-\alpha }/{2}\;}}(n-1)\frac{SD}{\sqrt{n}} \\ \end{align}$

(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.

Table 8. Comparison of the algorithm performance over time (π = 8 and ϖ = 60).

Computation time breaks	Standard SA/MST					Proposed SA/MST
Computation time breaks	tc₁	pc₁	dc₁	wt₁	tc₂	pc₂	dc₂	wt₂
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.

| Show Table

DownLoad: CSV

(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.

5. Conclusion

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.

Acknowledgement

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).

Conflict of interest

All authors declare that there is no conflict of interests in this paper.

References

[1]	Satterthwaite D (2013) The political underpinnings of cities' accumulated resilience to climate change. Environ Urban 25: 381–391. https://doi.org/10.1177/0956247813500902 doi: 10.1177/0956247813500902
[2]	IPCC (Intergovernmental Panel on Climate Change) (2014) Fifth assessment report AR5—Urban areas, Chapter 8, IPCC WGII. Available from: https://www.ipcc.ch/assessment-report/ar5/.
[3]	Dow K, Berkhout F, Preston BL, et al. (2013) Limits to adaptation. Nat Clim Chang 3: 305–307. https://doi.org/10.1038/nclimate1847 doi: 10.1038/nclimate1847
[4]	Hardoy J, Pandiella G (2009) Urban poverty and vulnerability to climate change in Latin America. Environ Urban 21: 203–224. https://doi.org/10.1177/0956247809103019 doi: 10.1177/0956247809103019
[5]	Eriksen SEH, Klien RJT, Ulsrud K, et al. (2007) Climate change adaptation and poverty reduction: Key interactions and critical measures. Report prepared for the Norwegian Agency for Development Cooperation (NORAD). GECHS Rep 1–44. Available from: https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=29621d9367d85986362aa32fe06998e5b7049f27.
[6]	Khan MR, Roberts JT (2013) Adaptation and international climate policy. Wiley Interdiscip Rev Clim Change 4: 171–189. https://doi.org/10.1002/wcc.212 doi: 10.1002/wcc.212
[7]	Tol RSJ, Downing TE, Kuik OJ, et al. (2004) Distributional aspects of climate change impacts. Global Environ Change 14: 259–272. https://doi.org/10.1016/j.gloenvcha.2004.04.007 doi: 10.1016/j.gloenvcha.2004.04.007
[8]	Satterthwaite D, Huq S, Reid H, et al. (2009) Adapting to climate change in urban areas: The possibilities and constraints in low and middle-income nations, In: Adapting Cities to Climate Change, Earthscan, UK: Routledge, 3–47.
[9]	Ajibade I, McBean G, Bezner-Kerr R (2013) Urban flooding in Lagos, Nigeria: Patterns of vulnerability and resilience among women. Global Environ Change 23: 1714–1725. https://doi.org/10.1016/j.gloenvcha.2013.08.009 doi: 10.1016/j.gloenvcha.2013.08.009
[10]	Manuel-Navarrete D, Pelling M, Redclift M (2011) Critical adaptation to hurricanes in the Mexican Caribbean: Development visions, governance structures, and coping strategies. Global Environ Change 21: 249–258. https://doi.org/10.1016/j.gloenvcha.2010.09.009 doi: 10.1016/j.gloenvcha.2010.09.009
[11]	Moser CON, Satterthwaite D (2008) Towards pro-poor adaptation to climate change in the urban centres of low-and middle-income countries, In: Human Settlement Development Series: Climate Change and Cities Discussion Paper 3, London: International Institute for Environment and Development (ⅡED).
[12]	Adelekan IO, Simpson NP, Totin E, et al. (2022) IPCC sixth assessment report (AR6)—Impacts, adaptation and vulnerability: Regional factsheet Africa. Available from: https://www.ipcc.ch/report/ar6/wg2/about/factsheets/.
[13]	Huq S, Kovats S, Reid H, et al. (2007) Reducing risks to cities from disasters and climate change. Environ Urban 19: 7–15. https://doi.org/10.1177/0956247807078058 doi: 10.1177/0956247807078058
[14]	IPCC (Intergovernmental Panel on Climate Change) (2007) Fourth assessment report AR4—Summary for policy makers. Available from: https://www.ipcc.ch/report/ar4/wg1/summary-for-policymakers/.
[15]	Chen AS, Djordjević S, Leandro J, et al. (2010) An analysis of the combined consequences of pluvial and fluvial flooding. Water Sci Technol 62: 1491–1498. https://doi.org/10.2166/wst.2010.486 doi: 10.2166/wst.2010.486
[16]	UN-Habitat (2014) The State of African Cities, 2014: Re-imagining Sustainable Urban Transitions. Kenya: UN-Habitat.
[17]	De Sherbinin A, Schiller A, Pulsipher A (2007) The vulnerability of global cities to climate hazards. Environ Urban 19: 39–64. https://doi.org/10.1177/0956247807076725 doi: 10.1177/0956247807076725
[18]	BNRCC (2012) Towards a Lagos State Climate Change Adaptation Strategy (LAS-CCAS). Available from: http://csdevnet.org/wp-content/uploads/Towards-aLagos-Adaptation-Strategy.pdf.
[19]	Sunday OA, Ajewole AI (2006) Implications of the changing pattern of landcover of the Lagos Coastal Area of Nigeria. Am-Eurasian J Sci Res 1: 31–37.
[20]	Lagos State Government-Ministry of the Environment (LASG-MoE) (2012) Lagos State Climate Change Policy 2012–2014.
[21]	Ogunleye M, Alo B (2011) State of the environment report-Lagos, 2010. Ministry of the Environment, Lagos State/Beachland Resources Limited.
[22]	Elias P, Omojola A (2015) Case study: the challenges of climate change for Lagos, Nigeria. Curr Opin Environ Sustain 13: 74–78. https://doi.org/10.1016/j.cosust.2015.02.008 doi: 10.1016/j.cosust.2015.02.008
[23]	Komolafe AA, Adegboyega SAA, Anifowose AYB, et al. (2014) Air pollution and climate change in Lagos, Nigeria: needs for proactive approaches to risk management and adaptation. Am J Environ Sci 10: 412. https://doi.org/10.3844/ajessp.2014.412.423 doi: 10.3844/ajessp.2014.412.423
[24]	Oshaniwa T, Chikwendu C (2013) Climate change mapping in some constituencies in Lagos State. Policy Advocacy Project Partnership on Climate Change (PAPPCC).
[25]	UNIDO (United Nations Industrial Development Organization) (2010) Climate change scenario and coastal risk analysis study of Lagos State of Nigeria.
[26]	Heinemann ASS, Moser C, Norton A, et al. (2010) Pro-poor adaptation to climate change in urban centers: Case studies of vulnerability and resilience in Kenya and Nicaragua. World Bank. Available from: http://documents.worldbank.org/curated/en/2010/06/14829757/pro-poor-adaptation-climate-change-urban-centers-case-studies-vulnerability-resilience-kenya-nicaragua.
[27]	Douglas I, Alam K, Maghenda M, et al. (2008) Unjust waters: climate change, flooding, and the urban poor in Africa. Environ Urban 20: 187–205. https://doi.org/10.1177/0956247808089156 doi: 10.1177/0956247808089156
[28]	Reddy BS, Assenza GB (2009) The great climate debate. Energy Policy 37: 2997–3008. https://doi.org/10.1016/j.enpol.2009.03.064 doi: 10.1016/j.enpol.2009.03.064
[29]	Alam M, Rabbani MDG (2007) Vulnerabilities and responses to climate change for Dhaka. Environ Urban 19: 81–97. https://doi.org/10.1177/0956247807076911 doi: 10.1177/0956247807076911
[30]	Awuor CB, Orindi VA, Ochieng Adwera A (2008) Climate change and coastal cities: the case of Mombasa, Kenya. Environ Urban 20: 231–242. https://doi.org/10.1177/0956247808089158 doi: 10.1177/0956247808089158
[31]	Castán Broto V, Oballa B, Junior P (2013) Governing climate change for a just city: Challenges and lessons from Maputo, Mozambique. Local Environ 18: 678–704. https://doi.org/10.1080/13549839.2013.801573 doi: 10.1080/13549839.2013.801573
[32]	Abam TKS, Ofoegbu CO, Osadebe CC, et al. (2000) Impact of hydrology on the Port-Harcourt–Patani-Warri Road. Environ Geol 40: 153–162. https://doi.org/10.1007/s002540000106 doi: 10.1007/s002540000106
[33]	NEMA (National Emergency Management Agency) (2013) Flood: NEMA urges governments stakeholders collaboration.
[34]	Oladunjoye M (2011) Flooding: Lagos gives relief materials to victims. Available from: http://allafrica.com/stories/201109080792.htmlaccessed23/11/2023.
[35]	Adelekan IO (2010) Vulnerability of poor urban coastal communities to flooding in Lagos, Nigeria. Environ Urban 22: 433–451. https://doi.org/10.1177/0956247810380141 doi: 10.1177/0956247810380141
[36]	Moser C (2011) A conceptual and operational framework for pro-poor asset adaptation to urban climate change, In: Cities and Climate Change, 2011: 225–254.
[37]	Thomas DSG, Twyman C (2005) Equity and justice in climate change adaptation amongst natural-resource-dependent societies. Global Environ Change 15: 115–124. https://doi.org/10.1016/j.gloenvcha.2004.10.001 doi: 10.1016/j.gloenvcha.2004.10.001
[38]	Hoornweg D, Sugar L, Trejos Gomez CL (2011) Cities and greenhouse gas emissions: moving forward. Environ Urban 23: 207–227. https://doi.org/10.1177/0956247810392270 doi: 10.1177/0956247810392270
[39]	Kates RW, Travis WR, Wilbanks TJ (2012) Transformational adaptation when incremental adaptations to climate change are insufficient. Proc Natl Acad Sci 109: 7156–7161. https://doi.org/10.1073/pnas.1115521109 doi: 10.1073/pnas.1115521109
[40]	Kates RW (2000) Cautionary tales: adaptation and the global poor. Clim Change 45: 5–17. https://doi.org/10.1023/A:1005672413880 doi: 10.1023/A:1005672413880
[41]	Lemos MC, Agrawal A, Eakin H, et al. (2013) Building adaptive capacity to climate change in less developed countries, In: Asrar, G., Hurrell, J. Author, Climate Science for Serving Society, Dordrecht: Springer, 437–457. https://doi.org/10.1007/978-94-007-6692-1-16
[42]	While A, Whitehead M (2013) Cities, urbanisation, and climate change. Urban Stud 50: 1325–1331. https://doi.org/10.1177/0042098013480963 doi: 10.1177/0042098013480963
[43]	Barrett S (2012) The necessity of a multi-scalar analysis of climate justice. Prog Hum Geogr 37: 215–233. https://doi.org/10.1177/0309132512448270 doi: 10.1177/0309132512448270
[44]	Kelly PM, Adger WN (2000) Theory and practice in assessing vulnerability to climate change and facilitating adaptation. Clim Change 47: 325–352. https://doi.org/10.1023/A:1005627828199 doi: 10.1023/A:1005627828199
[45]	Adger WN, Huq S, Brown K, et al. (2003) Adaptation to climate change in the developing world. Prog Dev Stud 3: 179–195. https://doi.org/10.1191/1464993403ps060oa doi: 10.1191/1464993403ps060oa
[46]	Huq S, Reid H (2004) Mainstreaming adaptation in development. IDS Bull 35: 15–21. Available from: https://opendocs.ids.ac.uk/opendocs/bitstream/handle/20.500.12413/8546/IDSB-35-3-10.1111-j.1759-5436.2004.tb00129.x.pdf?sequence=1.
[47]	Prowse M, Scott L (2008) Assets and adaptation: an emerging debate. IDS Bull 39: 42–52. Available from: https://opendocs.ids.ac.uk/opendocs/bitstream/handle/20.500.12413/8197/IDSB-39-4-10.1111-j.1759-5436.2008.tb00475.x.pdf?sequence=1.
[48]	Moser CON, Satterthwaite D (2011) Towards a pro poor adaptation in the urban centres of low and middle-income countries. Available from: https://hummedia.manchester.ac.uk/institutes/mui/gurg/working-papers/GURC-wp1.pdf.
[49]	Tanner T, Mitchell T (2008) Entrenchment or enhancement: could climate change adaptation help reduce chronic poverty?. Chron Poverty Res Cent Work Pap. doi: https://dx.doi.org/10.2139/ssrn.1629175. doi: 10.2139/ssrn.1629175
[50]	Moser CON (1998) The asset vulnerability framework: reassessing urban poverty reduction strategies. World Dev 26: 1–19. https://doi.org/10.1016/S0305-750X(97)10015-8 doi: 10.1016/S0305-750X(97)10015-8
[51]	Moser CON (2017) Gender transformation in a new global urban agenda: challenges for Habitat Ⅲ and beyond. Environ Urban 29: 221–236. https://doi.org/10.1177/0956247816662573 doi: 10.1177/0956247816662573
[52]	Ribot JC, Peluso NL (2003) A theory of access. Rural Sociol 68: 153–181. https://doi.org/10.1111/j.1549-0831.2003.tb00133.x doi: 10.1111/j.1549-0831.2003.tb00133.x
[53]	Mitlin D (2003) Addressing urban poverty through strengthening assets. Habitat Int 27: 393–406. https://doi.org/10.1016/S0197-3975(02)00066-8 doi: 10.1016/S0197-3975(02)00066-8
[54]	Rakodi C (2006) Relationships of power and place: the social construction of African cities. Geoforum 37: 312–317. https://doi.org/10.1016/j.geoforum.2005.10.001 doi: 10.1016/j.geoforum.2005.10.001
[55]	Bebbington A (1999) Capitals and capabilities: a framework for analysing peasant viability, rural livelihoods, and poverty. World Dev 27: 2021–2044. https://doi.org/10.1016/S0305-750X(99)00104-7 doi: 10.1016/S0305-750X(99)00104-7
[56]	Parnell S, Simon D, Vogel C (2007) Global Environmental Change: Conceptualising the growing challenge for cities in poor countries. Area 39: 357–369. https://doi.org/10.1111/j.1475-4762.2007.00760.x doi: 10.1111/j.1475-4762.2007.00760.x
[57]	UN-Habitat (2011) Global report on human settlements 2011: cities and climate change. Kenya: United Nations Human Settlements Programme. Available from: https://unhabitat.org/global-report-on-human-settlements-2011-cities-and-climate-change.
[58]	Friend R, Moench M (2013) What is the purpose of urban climate resilience? Implications for addressing poverty and vulnerability. Urban Clim 6: 98–113. https://doi.org/10.1016/j.uclim.2013.09.002 doi: 10.1016/j.uclim.2013.09.002
[59]	Bulkeley H, Tuts R (2013) Understanding urban vulnerability, adaptation, and resilience in the context of climate change. Local Environ 18: 646–662. https://doi.org/10.1080/13549839.2013.788479 doi: 10.1080/13549839.2013.788479
[60]	Moser C, Stein A (2011) Implementing urban participatory climate change adaptation appraisals: a methodological guideline. Environ Urban 23: 463–485. https://doi.org/10.1177/0956247811418739 doi: 10.1177/0956247811418739
[61]	Füssel HM, Klein RJ (2006) Climate change vulnerability assessments: an evolution of conceptual thinking. Clim Change 75: 301–329. https://doi.org/10.1007/s10584-006-0329-3 doi: 10.1007/s10584-006-0329-3
[62]	Luers AL (2005) The surface of vulnerability: An analytical framework for examining environmental change. Global Environ Change 15: 214–223. https://doi.org/10.1016/j.gloenvcha.2005.04.003 doi: 10.1016/j.gloenvcha.2005.04.003
[63]	Yamin F, Rahman A, Huq S (2005) Vulnerability, adaptation and climate disasters: A conceptual overview. IDS Bull 36: 1–14.
[64]	Cannon T, Müller-Mahn D (2010) Vulnerability, resilience, and development discourses in context of climate change. Nat Hazard 55: 621–635. https://doi.org/10.1007/s11069-010-9499-4 doi: 10.1007/s11069-010-9499-4
[65]	Field CB, Barros V, Stocker T, et al. (2012) Managing the Risks of Extreme Events and Disasters to Advance Climate Change Adaptation: Special Report of the Intergovernmental Panel on Climate Change, Cambridge: Cambridge University Press, 30: 7575–7613. https://doi.org/10.1017/CBO9781139177245
[66]	Pelling M (2011) Adaptation to Climate Change from Resilience to Transformation. London: Taylor and Francis Books. https://doi.org/10.4324/9780203889046
[67]	Leichenko R (2011) Climate change and urban resilience. Curr Opin Environ Sustain 3: 164–168. https://doi.org/10.1016/j.cosust.2010.12.014 doi: 10.1016/j.cosust.2010.12.014
[68]	Mitchell T, Harris K (2012) Resilience: A risk management approach. ODI Backgr Note 2012: 1–7.
[69]	Nelson DR, Adger WN, Brown K (2007) Adaptation to environmental change: contributions of a resilience framework. Annu Rev Environ Resour 32: 395–419. https://doi.org/10.1146/annurev.energy.32.051807.090348 doi: 10.1146/annurev.energy.32.051807.090348
[70]	Harris LM, Chu EK, Ziervogel G (2018) Negotiated resilience. Resilience 6: 196–214. https://doi.org/10.1080/21693293.2017.1353196 doi: 10.1080/21693293.2017.1353196
[71]	Béné C, Newsham A, Davies M, et al. (2014) Resilience, poverty, and development. J Int Dev 26: 598–623. https://doi.org/10.1002/jid.2992 doi: 10.1002/jid.2992
[72]	Pelling M, Dill K (2010) Disaster politics: tipping points for change in the adaptation of sociopolitical regimes. Prog Hum Geogr 34: 21–37. https://doi.org/10.1177/0309132509105004 doi: 10.1177/0309132509105004
[73]	Adger WN, Quinn T, Lorenzoni I, et al. (2013) Changing social contracts in climate-change adaptation. Nat Clim Chang 3: 330–333. https://doi.org/10.1038/nclimate1751 doi: 10.1038/nclimate1751
[74]	Eriksen SH, Nightingale AJ, Eakin H (2015) Reframing adaptation: the political nature of climate change adaptation. Glob Environ Change 35: 523–533. https://doi.org/10.1016/j.gloenvcha.2015.09.014 doi: 10.1016/j.gloenvcha.2015.09.014
[75]	Manuel‐Navarrete D (2010) Power, realism, and the ideal of human emancipation in a climate of change. Wiley Interdiscip Rev Clim Change 1: 781–785. https://doi.org/10.1002/wcc.87 doi: 10.1002/wcc.87
[76]	Revi A, Satterthwaite D, Aragón-Durand F, et al. (2014) Towards transformative adaptation in cities: the IPCC's Fifth Assessment. Environ Urban 26: 11–28. https://doi.org/10.1177/0956247814523539 doi: 10.1177/0956247814523539
[77]	Ribot J (2011) Vulnerability before adaptation: Toward transformative climate action. Glob Environ Change 21: 1160–1162. http://doi.org/10.1016/j.gloenvcha.2011.07.008 doi: 10.1016/j.gloenvcha.2011.07.008
[78]	Strengers Y (2010) Conceptualising everyday practices: composition, reproduction, and change. Carbon Neutral Communities Centre for Design, RMIT University.
[79]	Heinrichs D, Krellenberg K, Fragkias M (2013) Urban responses to climate change: theories and governance practice in cities of the global south. Int J Urban Reg Res 37: 1865–1878. https://doi.org/10.1111/1468-2427.12031 doi: 10.1111/1468-2427.12031
[80]	O'Brien K (2012) Global environmental change Ⅱ: from adaptation to deliberate transformation. Prog Hum Geogr 36: 667–676. https://doi.org/10.1177/0309132511425767 doi: 10.1177/0309132511425767
[81]	Woolcock M, Narayan D (2000) Social capital: Implications for development theory, research, and policy. World Bank Res Obs 15: 225–249. https://doi.org/10.1093/wbro/15.2.225 doi: 10.1093/wbro/15.2.225
[82]	Adger WN (2003) Social capital, collective action, and adaptation to climate change. Econ Geogr 79: 387–404. https://doi.org/10.1007/978-3-531-92258-4-19 doi: 10.1007/978-3-531-92258-4-19
[83]	Pelling M, High C (2005) Understanding adaptation: what can social capital offer assessments of adaptive capacity? Glob Environ Change 15: 308–319. https://doi.org/10.1016/j.gloenvcha.2005.02.001 doi: 10.1016/j.gloenvcha.2005.02.001
[84]	Bebbington A, Perreault T (1999) Social capital, development, and access to resources in highland Ecuador. Econ Geogr 75: 395–418. https://doi.org/10.1111/j.1944-8287.1999.tb00127.x doi: 10.1111/j.1944-8287.1999.tb00127.x
[85]	Luthans F, Luthans KW, Luthans BC (2004) Positive psychological capital: Beyond human and social capital. Bus Horiz 47: 45–50. https://doi.org/10.1016/j.bushor.2003.11.007 doi: 10.1016/j.bushor.2003.11.007
[86]	Becker GS (1994) Human capital revisited, In: Human Capital: A Theoretical and Empirical Analysis with Special Reference to Education, the University of Chicago Press.
[87]	Moser C (2008) Assets and livelihoods: a framework for asset-based social policy, In: Dani, A.A., Moser, C. Author, Assets, Livelihoods, and Social Policy, Washington DC: World Bank, 43–82.
[88]	Bassett TJ, Fogelman C (2013) Déjà vu or something new? The adaptation concept in the climate change literature. Geoforum 48: 42–53. https://doi.org/10.1016/j.geoforum.2013.04.010 doi: 10.1016/j.geoforum.2013.04.010
[89]	Creswell JW (2014) A Concise Introduction to Mixed Methods Research. Sage Publications.
[90]	Bryman A (2012) Social Research Methods. Oxford: Oxford University Press.
[91]	Desai V, Potter RB (2006) Doing Development Research. London: Sage. https://doi.org/10.4135/9781849208925
[92]	Olorunnimbe RO, Oni SI, Ege E, et al. (2022) Analysis of effects of prolonged travel delay on public bus operators' profit margin in metropolitan Lagos, Nigeria. J Sustain Dev Transp Logist 7: 112–126. https://doi.org/10.14254/jsdtl.2022.7-1.10 doi: 10.14254/jsdtl.2022.7-1.10
[93]	Lagos State Urban Renewal Authority (LASURA) (2013) Slum identification Handbook: A compendium of Nine (9) Major Slums in Lagos Metropolis. Lagos State Government Ministry of Physical Planning and Urban Development. Document obtained from LASURA office, Lagos Nigeria.
[94]	Sanchez-Rodriguez R (2009) Learning to adapt to climate change in urban areas. A review of recent contributions. Curr Opin Environ Sustain 1: 201–206. https://doi.org/10.1016/j.cosust.2009.10.005 doi: 10.1016/j.cosust.2009.10.005
[95]	Valentine G (2013) Tell me about … using interviews as a research methodology, In: Fowerdew, R., Martin, D. Author, Methods in Human Geograph, London: Routledge, 110–127.
[96]	Valentine G (1999) Being seen and heard? The ethical complexities of working with children and young people at home and at school. Ethics Place Environ 2: 141–155. https://doi.org/10.1080/1366879X.1999.11644243 doi: 10.1080/1366879X.1999.11644243
[97]	Berrang-Ford L, Ford JD, Paterson J (2011) Are we adapting to climate change? Glob Environ Change 21: 25–33. https://doi.org/10.1016/j.gloenvcha.2010.09.012 doi: 10.1016/j.gloenvcha.2010.09.012
[98]	Twum KO, Abubakari M (2019) Cities and floods: A pragmatic insight into the determinants of households' coping strategies to floods in informal Accra, Ghana. Jàmbá: J Disaster Risk Stud 11: 1–14. https://hdl.handle.net/10520/EJC-13b8ce4b99
[99]	Sakijege T, Lupala J, Sheuya S (2012) Flooding, flood risks and coping strategies in urban informal residential areas: The case of Keko Machungwa, Dar es Salaam, Tanzania. Jàmbá: J Disaster Risk Stud 4: 1–10. https://hdl.handle.net/10520/EJC125636
[100]	Chatterjee M (2010) Slum dwellers response to flooding events in the megacities of India. Mitigation Adapt Strategies Global Change 15: 337–353. https://doi.org/10.1007/s11027-010-9221-6 doi: 10.1007/s11027-010-9221-6
[101]	Wamsler C, Brink E (2014) Moving beyond short-term coping and adaptation. Environ Urban 26: 86–111. https://doi.org/10.1177/0956247813516061 doi: 10.1177/0956247813516061
[102]	Haque AN, Dodman D, Hossain MM (2014) Individual, communal, and institutional responses to climate change by low-income households in Khulna, Bangladesh. Environ Urban 26: 112–129. https://doi.org/10.1177/0956247813518681 doi: 10.1177/0956247813518681
[103]	Jooste BS, Dokken JV, Van Niekerk D, et al. (2018) Challenges to belief systems in the context of climate change adaptation. Jàmbá: J Disaster Risk Stud 10: 1–10. https://hdl.handle.net/10520/EJC-110b8aa4c0
[104]	Gaillard JC, Texier P (2010) Religions, natural hazards, and disasters: An introduction. Religion 40: 81–84. https://doi.org/10.1016/j.religion.2009.12.001 doi: 10.1016/j.religion.2009.12.001
[105]	Schuman S, Dokken JV, Van Niekerk D, et al. (2018) Religious beliefs and climate change adaptation: A study of three rural South African communities. Jàmbá: J Disaster Risk Stud 10: 1–12. https://hdl.handle.net/10520/EJC-122cafb0c5
[106]	Mitchell JT (2003) Prayer in disaster: Case study of Christian clergy. Nat Hazards Rev 4: 20–26. https://doi.org/10.1061/(ASCE)1527-6988(2003)4:1(20) doi: 10.1061/(ASCE)1527-6988(2003)4:1(20)
[107]	Sachdeva S (2016) Religious identity, beliefs, and views about climate change, In: Oxford Research Encyclopedia of Climate Science, Oxford University Press. https://doi.org/10.1093/acrefore/9780190228620.013.335
[108]	Billig M (2006) Is my home my castle? Place attachment, risk perception, and religious faith. Environ Behav 38: 248–265. https://doi.org/10.1177/0013916505277608 doi: 10.1177/0013916505277608
[109]	Scannell L, Gifford R (2013) Personally relevant climate change: The role of place attachment and local versus global message framing in engagement. Environ Behav 45: 60–85. https://doi.org/10.1177/0013916511421196 doi: 10.1177/0013916511421196
[110]	Ribot JC, Chhatre A, Lankina T (2008) Introduction: institutional choice and recognition in the formation and consolidation of local democracy. Conserv Soc 6: 1–11.
[111]	Omolara O (2022) An empirical analysis of the influence of values, worldview, and culture on the psychological processes in transformational adaptation. London J Res Humanit Soc Sci 22: 1–24.
[112]	O'Brien K, Hayward B, Berkes F (2009) Rethinking social contracts: building resilience in a changing climate. Ecol Soc 14: 12. https://www.jstor.org/stable/26268331
[113]	Shackleton S, Ziervogel G, Sallu S, et al. (2015) Why is socially‐just climate change adaptation in sub‐Saharan Africa so challenging? A review of barriers identified from empirical cases. Wiley Interdiscip Rev Clim Change 6: 321–344. https://doi.org/10.1002/wcc.335 doi: 10.1002/wcc.335
[114]	Cornwall A (2002) Locating citizen participation. IDS Bull 33: i–x. Available from: https://opendocs.ids.ac.uk/opendocs/bitstream/handle/20.500.12413/8659/IDSB_33_2_10.1111-j.1759-5436.2002.tb00016.x.pdf?sequence=1accessed24/11/2023.
[115]	Federal Ministry of Environment (2004) National erosion and flood control policy. Available from: https://searchworks.stanford.edu/view/7884006.
[116]	Lagos State Government Ministry of the Environment (2012) Ministerial press briefing. LASG-Ministry of the Environmnet (MoE).
[117]	Lagos State Government (2001) Environmental sanitation law 2000, supplement to the Lagos State of Nigeria official gazette extraordinary. Obtained from Agboyi Ketu Local Council Development Authority.
[118]	Oshodi L (2013) Flood management and governance structure in Lagos, Nigeria. Reg Mag 292: 22–24. https://doi.org/10.1080/13673882.2013.10815622 doi: 10.1080/13673882.2013.10815622
[119]	Soneye A (2014) An overview of humanitarian relief supply chains for victims of perennial flood disasters in Lagos, Nigeria (2010–2012). J Humanit Logist Supply Chain Manag 4: 179–197. https://doi.org/10.1108/JHLSCM-01-2014-0004 doi: 10.1108/JHLSCM-01-2014-0004
[120]	Nkwunonwo UC, Whiteworth M, Bailey B (2015) Review article: a review and critical analysis of the efforts towards urban flood reduction in the Lagos region of Nigeria. Nat Hazard Earth Syst Sci Discuss 3: 667–676. https://doi.org/10.5194/nhess-16-349-2016 doi: 10.5194/nhess-16-349-2016
[121]	Federal Ministry of Environment (2005) Technical guidelines on erosion and flood control and coastal zone management. Available from: https://environment.gov.ng/.
[122]	Fatti CE, Patel Z (2013) Perceptions and responses to urban flood risk: Implications for climate governance in the South. Appl Geogr 36: 13–22. https://doi.org/10.1016/j.apgeog.2012.06.011 doi: 10.1016/j.apgeog.2012.06.011
[123]	Adger WN, Dessai S, Goulden M, et al. (2009) Are there social limits to adaptation to climate change? Clim Change 93: 335–354. https://doi.org/10.1007/s10584-008-9520-z doi: 10.1007/s10584-008-9520-z
[124]	Harvatt J, Petts J, Chilvers J (2011) Understanding householder responses to natural hazards: flooding and sea‐level rise comparisons. J Risk Res 14: 63–83. https://doi.org/10.1080/13669877.2010.503935 doi: 10.1080/13669877.2010.503935
[125]	Graham S, Barnett J, Fincher R, et al. (2013) The social values at risk from sea-level rise. Environ Impact Assess Rev 41: 45–52. https://doi.org/10.1016/j.eiar.2013.02.002 doi: 10.1016/j.eiar.2013.02.002
[126]	Cheshire L (2015) 'Know your neighbours': disaster resilience and the normative practices of neighbouring in an urban context. Environ Plan A 47: 1081–1099. https://doi.org/10.1177/0308518X15592310 doi: 10.1177/0308518X15592310
[127]	Pelling M, O'Brien K, Matyas D (2015) Adaptation and transformation. Clim Change 133: 113–127. https://doi.org/10.1007/s10584-014-1303-0 doi: 10.1007/s10584-014-1303-0
[128]	Painter J, Jeffrey A (2012) Political Geography: An Introduction to Space and Power. London: Sage.
[129]	Carmen E, Fazey I, Ross H, et al. (2022) Building community resilience in a context of climate change: The role of social capital. Ambio 51: 1371–1387. https://doi.org/10.1007/s13280-021-01678-9 doi: 10.1007/s13280-021-01678-9
[130]	Fazey I, Carmen E, Ross H, et al. (2021) Social dynamics of community resilience building in the face of climate change: The case of three Scottish communities. Sustain Sci 16: 1731–1747. https://doi.org/10.1007/s11625-021-00950-x doi: 10.1007/s11625-021-00950-x
[131]	Olsson P, Gunderson LH, Carpenter SR, et al. (2006) Shooting the rapids: navigating transitions to adaptive governance of social-ecological systems. Ecol Soc 11. https://www.jstor.org/stable/26267806
[132]	Leck H, Roberts D (2015) What lies beneath: understanding the invisible aspects of municipal climate change governance. Curr Opin Environ Sustain 13: 61–67. https://doi.org/10.1016/j.cosust.2015.02.004 doi: 10.1016/j.cosust.2015.02.004
[133]	Ellis E (2006) Citizenship and property rights: A new look at social contract theory. J Polit 68: 544–555. https://doi.org/10.1111/j.1468-2508.2006.00444.x doi: 10.1111/j.1468-2508.2006.00444.x
[134]	Mishra S, Mazumdar S, Suar D (2010) Place attachment and flood preparedness. J Environ Psychol 30: 187–197. https://doi.org/10.1016/j.jenvp.2009.11.005 doi: 10.1016/j.jenvp.2009.11.005
[135]	Adger WN, Barnett J, Brown K, et al. (2013) Cultural dimensions of climate change impacts and adaptation. Nat Clim Change 3: 112–117. https://doi.org/10.1038/nclimate1666 doi: 10.1038/nclimate1666
[136]	Geschiere P, Jackson S (2006) Autochthony and the crisis of citizenship: democratization, decentralization, and the politics of belonging. Afr Stud Rev 49: 1–8. https://doi.10.1353/arw.2006.0104 doi: 10.1353/arw.2006.0104
[137]	Dunn KC (2009) 'Sons of the Soil' and Contemporary State Making: autochthony, uncertainty, and political violence in Africa, In: Third World Quarterly, London: Routledge, 30: 113–127.
[138]	Kraxberger B (2005) Strangers, indigenes, and settlers: contested geographies of citizenship in Nigeria. Space Polity 9: 9–27. https://doi.org/10.1080/13562570500078576 doi: 10.1080/13562570500078576
[139]	Adebanwi W (2009) Terror, territoriality and the struggle for indigeneity and citizenship in northern Nigeria. Citiz Stud 13: 349–363. https://doi.org/10.1080/13621020903011096 doi: 10.1080/13621020903011096
[140]	Cannon T (2008) Vulnerability, "innocent" disasters and the imperative of cultural understanding. Disaster Prev Manag 17: 350–357. https://doi.org/10.1108/09653560810887275 doi: 10.1108/09653560810887275
[141]	Shove E (2010) Beyond the ABC: Climate change policy and theories of social change. Environ Plan A 42: 1273–1285. https://doi.org/10.1068/a42282 doi: 10.1068/a42282
[142]	Kaika M (2017) 'Don't call me resilient again!' the New Urban Agenda as immunology… or… what happens when communities refuse to be vaccinated with 'smart cities' and indicators. Environ Urban 29: 89–102. https://doi.org/10.1177/0956247816684763 doi: 10.1177/0956247816684763
[143]	Pelling M (1998) Participation, social capital, and vulnerability to urban flooding in Guyana. J Int Dev 10: 469–486. https://doi.org/10.1002/(SICI)1099-1328(199806)10:4<469::AID-JID539>3.0.CO;2-4 doi: 10.1002/(SICI)1099-1328(199806)10:4<469::AID-JID539>3.0.CO;2-4
[144]	Fayombo OO (2021) Discursive constructions underlie and exacerbate the vulnerability of informal urban communities to the impacts of climate change. Clim Dev 13: 293–305. https://doi.org/10.1080/17565529.2020.1765133 doi: 10.1080/17565529.2020.1765133
[145]	Gasper R, Blohm A, Ruth M (2011) Social and economic impacts of climate change on the urban environment. Curr Opin Environ Sustain 3: 150–157. https://doi.org/10.1016/j.cosust.2010.12.009 doi: 10.1016/j.cosust.2010.12.009

urs-02-02-008-s001.pdf

This article has been cited by:

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

Reader Comments

Your name:*

Email:*
© 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)