Loading [MathJax]/jax/output/SVG/jax.js
Review

Physical role of nuclear and cytoskeletal confinements in cell migration mode selection and switching

  • There exists a large complexity and high plasticity in migration modes dependent on cell type, cell condition such physiological or pathological stages, microenvironmental conditions such as dimensionality, structural architecture, composition and adhesiveness, as well as cellular mechanical and tissue mechanical properties. The current knowledge on the plasticity in migration modes is limited and not yet fully understood. Many descriptions are fully based on biological and biochemical observations or instead focus entirely on biophysical parameters without integrating biological knowledge. Here, the biological approaches are compared with the biophysical approaches to understand and predict migration modes as well as their switching conditions in order to reveal the mechanical properties. The mechanical properties such as the stiffness can regulate the invasiveness and hence subsequently serve as a biomarker for invasiveness. However, the impact of the nuclear deformability on cellular motility and the impact of the cytoskeletal deformability are controversially discussed. In more detail, there are two different opinions: on the one hand it is stated that the nuclear deformability predicts solely cell migration independent of the cytoskeletal deformability and on the other hand it is stated that the cellular deformability regulates the nuclear deformability to facilitate cellular motility. In this review, it is pointed out and discussed what impact the nuclear confinement and the cytoskeletal confinement have on the selection of the individual migration mode and on how a switch between the migration modes is performed. Moreover, it is discussed whether the nuclear confinement is regulated by the cytoskeletal confinement such as an apical actin filament based capping structure over the entire nucleus. Finally, mechanical parameters such as the nuclear or cytoskeletal deformability may serve as a biomarker for cell migration and invasion in healthy, physiological and pathological processes such as cancer.

    Citation: Claudia Tanja Mierke. Physical role of nuclear and cytoskeletal confinements in cell migration mode selection and switching[J]. AIMS Biophysics, 2017, 4(4): 615-658. doi: 10.3934/biophy.2017.4.615

    Related Papers:

    [1] Guohui Zhang, Jinghe Sun, Xing Liu, Guodong Wang, Yangyang Yang . Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm. Mathematical Biosciences and Engineering, 2019, 16(3): 1334-1347. doi: 10.3934/mbe.2019065
    [2] Kongfu Hu, Lei Wang, Jingcao Cai, Long Cheng . An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem. Mathematical Biosciences and Engineering, 2023, 20(9): 17407-17427. doi: 10.3934/mbe.2023774
    [3] Jianguo Duan, Mengting Wang, Qinglei Zhang, Jiyun Qin . Distributed shop scheduling: A comprehensive review on classifications, models and algorithms. Mathematical Biosciences and Engineering, 2023, 20(8): 15265-15308. doi: 10.3934/mbe.2023683
    [4] Cong Zhao, Na Deng . An actor-critic framework based on deep reinforcement learning for addressing flexible job shop scheduling problems. Mathematical Biosciences and Engineering, 2024, 21(1): 1445-1471. doi: 10.3934/mbe.2024062
    [5] Zilong Zhuang, Zhiyao Lu, Zizhao Huang, Chengliang Liu, Wei Qin . A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates. Mathematical Biosciences and Engineering, 2019, 16(5): 4491-4505. doi: 10.3934/mbe.2019224
    [6] Yifan Gu, Hua Xu, Jinfeng Yang, Rui Li . An improved memetic algorithm to solve the energy-efficient distributed flexible job shop scheduling problem with transportation and start-stop constraints. Mathematical Biosciences and Engineering, 2023, 20(12): 21467-21498. doi: 10.3934/mbe.2023950
    [7] Shaofeng Yan, Guohui Zhang, Jinghe Sun, Wenqiang Zhang . An improved ant colony optimization for solving the flexible job shop scheduling problem with multiple time constraints. Mathematical Biosciences and Engineering, 2023, 20(4): 7519-7547. doi: 10.3934/mbe.2023325
    [8] Wenqiang Zhang, Chen Li, Mitsuo Gen, Weidong Yang, Zhongwei Zhang, Guohui Zhang . Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem. Mathematical Biosciences and Engineering, 2022, 19(9): 8833-8865. doi: 10.3934/mbe.2022410
    [9] Xuyin Wang, Weiguo Liu, Lu Li, Peizhen Zhao, Ruifeng Zhang . Resource dependent scheduling with truncated learning effects. Mathematical Biosciences and Engineering, 2022, 19(6): 5957-5967. doi: 10.3934/mbe.2022278
    [10] Yufan Zheng, Rafiq Ahmad . Feature extraction and process planning of integrated hybrid additive-subtractive system for remanufacturing. Mathematical Biosciences and Engineering, 2020, 17(6): 7274-7301. doi: 10.3934/mbe.2020373
  • There exists a large complexity and high plasticity in migration modes dependent on cell type, cell condition such physiological or pathological stages, microenvironmental conditions such as dimensionality, structural architecture, composition and adhesiveness, as well as cellular mechanical and tissue mechanical properties. The current knowledge on the plasticity in migration modes is limited and not yet fully understood. Many descriptions are fully based on biological and biochemical observations or instead focus entirely on biophysical parameters without integrating biological knowledge. Here, the biological approaches are compared with the biophysical approaches to understand and predict migration modes as well as their switching conditions in order to reveal the mechanical properties. The mechanical properties such as the stiffness can regulate the invasiveness and hence subsequently serve as a biomarker for invasiveness. However, the impact of the nuclear deformability on cellular motility and the impact of the cytoskeletal deformability are controversially discussed. In more detail, there are two different opinions: on the one hand it is stated that the nuclear deformability predicts solely cell migration independent of the cytoskeletal deformability and on the other hand it is stated that the cellular deformability regulates the nuclear deformability to facilitate cellular motility. In this review, it is pointed out and discussed what impact the nuclear confinement and the cytoskeletal confinement have on the selection of the individual migration mode and on how a switch between the migration modes is performed. Moreover, it is discussed whether the nuclear confinement is regulated by the cytoskeletal confinement such as an apical actin filament based capping structure over the entire nucleus. Finally, mechanical parameters such as the nuclear or cytoskeletal deformability may serve as a biomarker for cell migration and invasion in healthy, physiological and pathological processes such as cancer.


    Remanufacturing, as an industrial process of restoring discarded products/components back to their useful lives, is of growing importance due to the emerging pressure of legislation and increasing awareness of environmental conservation. As an ultimate form of recycling, remanufacturing maintains much of the value added from original material and reprocessing conservation, leading to lower production costs and improved profits [1]. A recent wall street journal revealed that large scale remanufacturing in the United States employs more than 500, 000 people and contributes to approximately $100 billion of goods sold each year [2]. More successful industry applications can be seen in automobile remanufacturing, aerospace remanufacturing and electronic remanufacturing [3, 4, 5].

    Compared to manufacturing, remanufacturing is more complicated in the way that (1) the supply of returned products is unpredictable in timing and quantities; (2) the quality and composition of returned products varies; and (3) the process routings are not necessarily fixed but rather adapt to the actual conditions of products/components [6]. Such characteristics have led many new methodologies to deal with various operation management issues in remanufacturing as summarized in the survey literature [7]. One of the challenges, which is the focus of this paper, is remanufacturing job shop scheduling. With the high level of uncertainty and resource limitation, it becomes extremely difficult to carry out various remanufacturing tasks for different products and still achieve maximal system performance.

    Guide and his colleagues are the first group of researchers that looked into the remanufacturing scheduling. Through simulation, they examined the performance of several static dispatching rules in a repair shop. They assumed the system has stochastic arrivals, exponentially distributed process times and probabilistic process routings [8]. Extended from this work, an analytical model was further developed to explore the impact of those rules on system performance in terms of weighted average sojourn time [9]. While the pursued simulation and model analysis provided insights to practicing managers in a repair shop, much of work is needed for complex job shop settings where various products/parts with uncertain remanufacturing routings compete for constrained resources.

    A second line of work has focused on economic lot scheduling with random returns. For instance, Tang and Teunter considered a hybrid system where (re)manufacturing operations of multiple products are performed on the same production line [10]. The work formulated the problem as a mixed integer linear program to determine the optimal cycle time and production starting times for (re)manufacturing. The research was further extended to relax the constraint of common cycle time and a single (re)manufacturing lot per item per cycle [11]. By dividing the returns into different quality grades, Sun et al. investigated a lot scheduling problem where the remanufacturing rate increases as the quality grade increases and holding costs for serviceable products are higher than returns [12]. The objective is to minimize the average total cost by optimizing the acquisition lot size and scheduling the remanufacturing sequence. However, the deterministic nature of the assumptions (i.e., constant demand and returns, and constant remanufacturing rate) made in those works failed to address the uncertainty inherent in remanufacturing. Moreover, the authors considered remanufacturing as a single-stage process. Given that refurbishing used products up to like-new condition tends to involve a sequence of recovery operations, such single-stage scheduling methods present practical limitation.

    A third line of researches have tackled the multi-stage and multi-product remanufacturing scheduling problem. For instance, Kim et al. considered a remanufacturing system with a single disassembly workstation, parallel flow-shop-type reprocessing lines, and a single reassembly workstation [13]. A hybrid scheduling heuristic is proposed to determine the sequences of products to be disassembled, to be reprocessed at each reprocessing lines and to be reassembled. The authors, however, treated the problem deterministic and static. Luh et al. presented another work that considered a similar remanufacturing system but tried to address the underlying uncertainty [14]. The main novelty of the research is that it considered stochastic asset arrival time and part repair time to model the dynamics of rotable inventory for optimization. Nevertheless, the authors presumed that each asset goes through a fixed series of overhaul operations. Giglio et al. studied a production system which produces multi-class single-level products through both manufacturing of raw materials and remanufacturing of return products [15]. A mixed-integer programming formulation is proposed to obtain the optimal lot size and job shop schedules with minimum total cost. This work presented the same limitation that the recovery process routings of returns are deterministic. By considering the alternatives of remanufacturing process routes for worn cores, Zhang et al. proposed a simulation based genetic algorithm approach for remanufacturing process planning and scheduling, where the processing time of each alternative routes are assume to be known a priori [16].

    Summarizing the findings of the above discussion, no study has comprehensively dealt with remanufacturing job shop scheduling in subjecting to alternative recovery operations, random operation times and limited resource conflicts. In a practical remanufacturing system, the quality of returned products/cores varies, ranging from slightly used with minor blemishes to significantly damaged and requiring extensive repair. Such differences in the condition of products/cores strongly affect the set of recovery operations necessary to bring them up to a quality standard. In addition, the time that each recovery operation takes varies as well with respect to different damages of the cores. Those stochastic natures in remanufacturing triggers the potential conflicts of limited machine resources to a noticeable extend. Such characteristics have led a number of studies to investigate the operation management issues in remanufacturing environment by using different modeling methods, i.e., through analytic model [8, 9, 11, 12, 17], through Mixed Integer Programming model [10, 13, 15, 16], through Lagrangian Relaxation [14] and through Petri nets model [18, 19]. While our previous work [17] and [20] investigated the remanufacturing processes of worn cores with uncertain failure conditions and proposed an analytical model to study such dynamics in recovery process routings through probabilistic measures, how to incorporate those dynamic measures into remanufacturing scheduling has yet to be undertaken.

    The colored timed Petri nets (CTPN) is an extension of ordinary Petri nets where the time and color are introduced to describe the logic structure and dynamic behavior of complex systems [21]. By taking advantage of both the well-formed formalism of CTPN and the robustness of Simulated Annealing (SA) for global optimization, the paper tackles this challenge and makes the following contributions. First, a colored timed Petri net is designed to explicitly model the dynamic of remanufacturing processes, such as various process routings, different uncertain operation times for cores, and real-time machine resource conflicts. With the color attributes in Petri nets, two types of decision points, recovery routing selection and resource dispatching, are introduced and embedded in places of CTPN model. With time attributes in Petri nets, the temporal aspect of recovery operations for cores as well as the evolution dynamics in cores' operational stages is mathematically analyzed. Second, a hybrid meta-heuristic algorithm embedded scheduling strategy over CTPN is proposed to search for the optimal recovery routings for worn cores and their recovery operation sequences on workstations, in minimizing the total production cost.

    The rest of the paper is organized as follows. Section 2 presents the CTPN model. Section 3 describes the hybrid meta-heuristics based on SA and minimum slack time (MST) dispatching rule. A case study is conducted in Section 4, followed by the conclusion and future research in Section 5.

    This paper considers a typical remanufacturing job shop where its clients drop their used products with an expectation to get them fully recovered within a fixed time frame. The remanufacturing processes are traditionally complicated including disassembly that disassembles a worn product into components/cores, cores' recovery operations and assembly that assembles recovered cores back into the product. Figure 1 gives an organizational structure of the remanufacturing job shop.

    Figure 1.  Organizational structure of the remanufacturing facility.

    In this case, each used product (e.g., the lth used product) arrives at the job shop with an arrival time AT(l) and a due date Due(l). The used product is first disassembled into what so called "cores" that are disassembled subassemblies or components. The cores are then classified into "reusable", "repairable", and "disposal" through the inspection process as depicted in Figure 1. This paper focuses on the recovery activities only. The challenge arises when dealing with the repairable cores with different levels of damage that need to go through a set of recovery operations to restore their size and property.

    In a remanufacturing job shop, the quality of repairable cores commonly ranges from slightly used with minor blemishes to significantly damaged and requiring extensive recovery. Such quality variations strongly affect the set of recovery operations necessary to bring them up to a quality standard. As exemplified in Figure 2, there are several process routings for the remanufacturing of used machine tool cores of different types and various damage conditions. For instance, the lathe spindles can be inspected and classified into either "abrasion", "corrosion", or "micro-cracks", on which a set of specific recovery operations are designated for their remanufacturing.

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

    With a wide variety of recovery technologies being applied into remanufacturing industry, some recovery process routings for cores with a certain type of damage can be alternative. For instance, if a spindle is detected with severe abrasion, two typical process routings would be "grinding → chromium electroplating" or "grinding → cold welding → fine grind" to regain the surface accuracy. Each alternative process routing consists of a set of predesigned recovery operations, with each operation being performed by a certain kind of machine equipment in a workstation, resulting in a specified recovery quality and unit processing cost [22, 23]. As an upper level of process planning, different combinations of recovery process routings for cores would lead to much variation in remanufacturing cost and real-time machine workload in remanufacturing job shop.

    With the recovery routings determined in the upper level, the core then travels to and is processed by a set of recovery workstations sequentially according to the designed process flow. However, the recovery operation time for a particular core in a given workstation is not fixed but rather dependent on the actual condition of the core. While different routings might demand operation times on the same workstation, various cores would compete for constrained machine resource to be recovered.

    Our objective is to consider such variation for efficient resource utilization in fulfilling the demand with the minimum cost (i.e., operation cost and tardiness penalty). The remanufacturing job shop scheduling problem is strongly NP-hard due to: a) assignment decisions of reparable cores to recovery process routings and b) sequencing decisions of recovery operations of cores in each workstation. For that purpose, the paper makes the following assumptions:

    (1) Each workstation has only one machine and each machine can process at most one task at a time.

    (2) Each task is non-preemptive, requiring one and only one machine at a time.

    (3) The transportation time between buffers is negligible.

    (4) Penalty is charged if the system does not meet the due date of a product.

    The ordinary of Petri nets (PN) does not include time and color, which limits its capability to describe the logic structure and behavior of modeled systems, but not its evolution over time and color [24, 25]. In view of the specific characteristics of remanufacturing system to be modeled, this section introduces time and color attributes to a Petri net and proposes a CTPN. The model considers not only recovery process routings and stochastic operation times, but also integrates recovery routing assignments and efficient resource dispatching.

    Definition 1: A colored timed Petri net (CTPN) is defined as 7-tuple: CTPN = (P, T, I, O, M, U, C).

    (1) P = SW, where the set of places in S represents buffers, the set of places in W stands for workstations.

    (2) T = TaTe, where the finite set of transitions in Ta represent recovery operations, and the ones in Te stand for transportation.

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

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

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

    (6) U: Ta→Θ is a non-zero time function that assigns to each recovery operation tTa, while U: Tb→Θ is a zero time function such that the transportation time between buffers is negligible.

    (7) C: P→Σ is a color function that assigns to each place pSW 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.
    Table 1.  The description of places and transitions in CTPN.
    Places and transitions in CTPN Description
    s0 The output buffer of the inspection center
    si (i=1, 2, ..., 12) The input buffer of each recovery workstation
    sz (z=13, 14, 15, 16) The output buffer of each recovery workstation
    s17 The input buffer of the reassembly center
    wk (k=1, 2, ..., 12) Workstation places
    ti, j (i, j=1, 2, ..., 12, ij) Recovery operations
    t0, i, ti, z, ti,17 (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 dth core disassembled from the lth product
    wk the kth workstation that performs a specific recovery operation
    Rh the hth recovery process routing designed for worn cores and is represented as a set of recovery operations
    pre(tij, Rh) the operational stages of recovery operation tij in Rh
    Last(Rh) the last recovery operation in Rh
    aldh a binary variable with a value 1 indicates the hth routing for the core ϑld
    u(tij, ϑld) the time for a core ϑld to be processed in transition tij
    AT(si, ϑld) the arrival time of the core ϑld at buffer place si
    ST(wk, ϑld) the start time of the core ϑld being processed by wk
    Com(wk, ϑld) the completion time of the core ϑld processed by wk
    ρ(ϑld) the makespan of the component ϑld
    χ(ϑld) the tardiness of the component ϑld
    ζ(l) the tardiness of the lth product
    Probld the probability of a core ϑld being selected for routing reassignment
    Πh,xld the difference of the total average waiting time between the hth routing and the xth one for the core ϑld
    WTk the average waiting time per core consumed in the kth workstation
    h the total average waiting time per core consumed in the hth routing
    vh,xld the probability of the xth routing being selected to replace the current hth routing for the core ϑld
    Slackxy slack time of a core ϑxy in scheduling horizon

     | Show Table
    DownLoad: CSV
    Table 4.  The decision variables embedded in the places in CTPN.
    Decision variables Description
    rldh a binary variable with a value 1 indicates that the hth process routing is assigned to a core ϑld
    Pri(wk, ϑld) the priority for the dth component of the lthused product to be processed by the kth workstation

     | Show Table
    DownLoad: CSV

    (1) Modeling of recovery process routings

    As stated earlier, the recovery process routing for a particular core is not deterministic but rather contingent on its damage level. When a core goes through inspection center and enter in the buffer place s0, it will be assigned with a specified process routing (i.e., Rh), which is represented as a set of recovery operations that a core should go through sequentially for its recovery.

    For the cores with alternative process routings to be recovered, decisions should be made on which "reasonable" process routings to be assigned to them. In the proposed CTPN model, the buffer place s0 operates as a decision agent of choosing optimal recovery process routings for cores, by utilizing a hybrid scheduling algorithm elaborated in Section 3.

    When the process routings for cores are determined, cores of different types and stochastic damage conditions require going through various recovery operations. In the CTPN model of Figure 3, different types of core tokens in s0 might go to transitions among t0, 12, t0, 5, t0, 1, t0, 3, t0, 2, t0, 6, t0, 8, t0, 11; tokens in s13 may either go to t13, 3, t13, 10 or t13, 17; tokens in s16 might enters into either t16, 17 or t16, 5. In addition, cores of the same type and the same damage condition might go through different recovery processes. For example, when a spindle is detected with abrasion, its process routing can either be R1 = {t03, t3, 14, t14, 9, t9, 17} or R2 = {t03, t3, 14, t14, 4, t4, 15, t15, 5, t5, 17}. Then in Figure 3, a token in s14 representing a spindle with abrasion might fire transition t14, 9 or t14, 4.

    Thus, to make sure where the tokens in a buffer place should go, a unique color is introduced and associated with buffer places to distinguish the cores going through different recovery operations.

    Definition 2: The color of a token ϑld in a buffer place si is defined as C(sj, ϑld) = cij if the token goes to tij after being released from si.

    Let M(si) denote the number of tokens in place si regardless of token color, and M(si, cij) the number of tokens in place si at M that have the color cij. Therefore, M(si)=jM(si,cij).

    Based on Definition 2, the color attached to a token in a buffer place changes through transition firings. Such color evolution represents the complex operational stages of a core according to its recovery process routing. For instance, if the recovery process routing of the core ϑld is determined (i.e., rldh is known), its color evolution can then be derived as follows.

    C(sj,ϑld)=cjp, if {C(si,ϑld)=cijpre(tjp,Rh)=pre(tij,Rh)+1, rldh=1sitij, sjtjp (1)

    (2) Modeling of shared resources

    In a remanufacturing job shop, various cores would compete for constrained resource to be recovered. An input buffer is then designated for each workstation in our CTPN model to accommodate all the cores that are waiting for processing. When multiple tokens occur in the input buffer place sk of the kth workstation, decisions should be made on which core to be processed next as soon as the machine resource is ready. In the proposed CTPN model, each input buffer place si (i = 1, 2, ..., 12) is considered as a decision agent for resource dispatching and determines the operation sequences (priority) for the cores to be processed by the workstation.

    Definition 3: The priority for the core ϑld to be processed by the kth workstation is defined as Pri(wk, ϑld). The priority is a decision variable for scheduling optimization. The smaller the value is, the higher priority for the core to be processed by workstation wk.

    Definition 4: A transition tij in the CTPN developed above is enabled at a marking M to process the core ϑld with a color cij, if and only if:

    M(si,cij)1,sitij (2)
    M(wk)=1,wktijtij (3)
    Pri(wk,ϑld)=min(Pri(wk,ϑxy))andC(si,ϑxy)=cij,x,y (4)

    Definition 5: An enabled transition tij can fire in a marking M with respect to a color cij yielding a new marking M' denoted as M[(tij,cij)>M:

    M(si,cij)=M(si,cij)1,sitij (5)
    M(wk)=M(wk),wktijtij (6)

    Definition 6: When a transition tij is fired, the marking M' would transfer to M" according to:

    M(si,cij)=M(si,cij),sitij (7)
    M(wk)=M(wk)+1,wktijtij (8)
    M(sj,cjp)=M(sj,cjp)+1 and C(sj,ϑld)=cjp if{sjtij, sjtjppre(tjp,Rh)=pre(tij,Rh)+1 (9)

    According to the above transition enabling and firing rules, the system always dispatch an available workstation wk to the core with the highest priority (i.e., the lowest Pri(wk, ϑld) value) in the queue to maximize the system performance.

    (3) Modeling of recovery operation times

    When associating time with operation transitions, the CTPN model is able to describe the temporal aspect of recovery operations.

    Definition 7: The time needed for a token ϑld to be processed in transition tij is defined as u(tij, ϑld).

    The processing times required to perform a necessary recovery operation is highly variable since the quality and composition of returned products/parts varies. It is reported that the processing time data obtained from a remanufacturing facility follows an exponential distribution in order to simulate the large range of possible values [8]. The amount of processing time for a remanufacturing operation is widely modeled as an exponential function of the wear associated with a part [19]. In this section, we models the recovery operation time as the sum of average operation time and extended time, where the latter is a exponential function of the quality condition of the core being processed. To that end, quality testing of a core is conducted before recovery, on which an inspection score, Score(ϑld)∈[0, 1], is assigned to the core based. It is assumed that the better the quality, the higher the score and the shorter the operation time. So the relationship between the quality score and the processing time is modeled as follows.

    u(tij,ϑld)=ln(Score(ϑld))β(wk)+λ(wk),tijwkwk (10)

    where β(wk) is a control factor for workstation wk whose value is determined based on statistics of historical data, and λ(wk) is the average operation time of cores in wk. Whenever a component goes into a transition for processing, it must stay in transition tj for more thanu(tj, ϑld) time units and then can be released into another buffer place.

    (4) Temporal aspect of recovery operations

    In the CTPN model, with the core tokens dynamically entering the buffer places, a set of transitions are then enabled and fired according to the enabling and firing rules. With the dynamic behavior of the CTPN, the remanufacturing operations are subject to the following constraints.

    Operation start time requirements: Recovery operations cannot be started until the core has arrived at the buffer sk of a corresponding workstation wk. When the core arrived in the buffer sk, it need waiting until all other cores with higher priorities are processed.

    ST(wk,ϑld)=max{ AT(si,ϑld),Com(wk,ϑij),Pri(wk,ϑld)=Pri(wk,ϑij)+1,sitij,tijwkwk (11)

    Processing completion time requirements: When a core goes into a workstation for processing, it must stay in a specific machine for more thanu(ϑld, wk) time units and then can be released into the successor buffer.

    Com(wk,ϑld)=ST(wk,ϑld)+u(tij,ϑld),tijwkwk (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.

    AT(si,ϑld)=Com(wk,ϑld),{rldh=1pre(wv,Rh)=pre(wk,Rh)+1sitij,tijwvwv (13)

    Using Eqs 11, 12 and 13 recursively, the makespan and tardiness of the component ϑld, i.e., ρ(ϑld) and χ(ϑld), can be derived as shown in Eqs 14 and 15. The tardiness of the lth product is then calculated in Eq 16.

    ρ(ϑld)=Com(wk,ϑld)AT(l),Last(Rh)=tij,tijwkwk (14)
    χ(ϑld)=max{0,ρ(ϑld)Due(l)} (15)
    ζ(l)=maxdχ(ϑld) (16)

    Generally speaking, there are two ways to solve a scheduling problem by PN. One is to construct their reachability graph. However, it suffers from the state explosion problem [26]. Since we considered two types of decision variables in the proposed CTPN, using reachability graph for scheduling optimization might not be efficient. The other is to introduce scheduling algorithms into a PN model, which is adopted in this paper. The embedding style is optionally through places or transitions in a PN. This work uses the former mechanism and adopts two types of decision places in the proposed CTPN model. The decisions of choosing optimal recovery process routings for cores are embedded in buffer place s0, while the input buffer place si (I = 1, 2, ..., 12) makes decisions on dispatching machine resource in workstation to perform recovery operations for the cores that are waiting in queue. Considering the two types of scheduling decisions, a hybrid meta-heuristic algorithm using simulated annealing and minimum slack time rule is proposed and embedded in these decision places to search for global optimal process plans and schedules with a quick convergence speed.

    The scheduling objective is to minimize both operation cost and tardiness penalty as shown in Eq 17. There are two types of decision variables: (1) recovery process routing for a given core (i.e., rldh), and (2) operation sequences for a given core in a workstation (i.e., Pri(wk, ϑld)).

    Minimize:

    TC=ldu(tij,ϑld)ϕ(wk)+lζ(l)×ϖ,{rldh=1tijRhandtijwk (17)

    where φ(wk) is unit operation cost of the kth workstation and ϖ is unit penalty cost for product.

    SA is a stochastic gradient method for global optimization that has been applied to a wide variety of sophisticated combinatorial problems [27, 28, 29]. While it conducts local searches, it is capable of exploring the solution space stochastically to prevent from being trapped in a local optimum. Starting from an initial solution g0, SA uses a certain mechanism to generate a neighborhood solution g' with an acceptance probability AP.

    AP={1,ifΔ<0exp(Δ/Ω),otherwise (18)

    where Δ = f(g')-f(g0), Ω is called temperature, a global time-varying parameter, and f(g) the optimization objective function. In this paper, SA is used to determine the optimal process routings for cores. At each iteration when a neighbor solution is generated, MST to be elaborated in section 3.2 is then applied to determine the operation sequences of the cores in each workstation. The parameter Ω is reduced by a factor η at each iteration and the chance of choosing an inferior solution decreases as well. The nested SA-MST search process continues until the stopping criterion is met.

    In this section, the CTPN model is integrated and embedded with SA algorithm and MST dispatching rules to obtain the optimal remanufacturing routings and schedules. At each iteration of SA algorithm, the feasible recovery routing is first generated by the Initial/Neighborhood Solution Generation process. Then the CTPN model is established based on the arrival time of parts, the predetermined recovery routings and the processing time of each operations. Whenever multiple parts arrived in a same buffer place in the CTPN, MST rules is used for resource dispatching. The CTPN model evolves to a final version until the resource conflicts in all the buffer places are tackled by the SMT. Finally, the operation cost and tardiness penalty of a SA solution at each iteration can be calculated according to the time aspects marked in the CTPN, and the next iteration of SA algorithm goes on until the stopping criterion is met. The flowchart of the CTPN-based hybrid meta-heuristics scheduler is shown in Figure 4.

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

    (1) SA solution representation

    In this paper, a 3-dimension matrix R = [rldh]L×D×H is proposed as representation of SA solutions. Each element rldh is a binary variable, one indicating the hth recovery process routing is assigned to the core ϑld and zero otherwise. Given that not all routings are feasible to a specific core, the viability of a randomly generated R is controlled via a logic AND operation in Eq 19:

    R= RA= [rldhaldh] (19)

    where A = [aldh] is a L-by-D-by-H mask whose element aldh = 1 indicates the feasibility of the hth routing for the core ϑld.

    (2) Initial solution generation

    The choice of an initial solution is vital to the performance of the algorithm [30]. To that end, a cost function of a routing (i.e., the hth routing) for a core ϑld is defined in Eq 20. The smaller the value of qldh, the greater chance the hth routing is selected for the core, i.e., rldh = 1.

    qldh=ju(tij,ϑld)×ϕ(wk)hju(tij,ϑld)×ϕ(wk),tijRh,rldh=1,tijwkIwk (20)

    (3) Neighborhood solution generation

    Traditional SA randomly generates a neighborhood solution g' from the current solution g by using a predefined move mechanism [31, 32]. In this section, a multiple moves mechanism is used for neighborhood solution generation [33, 34]. That is, for each current solution, randomly selects an element in the matrix R and uses one type of moves (i.e., ζ-opt, ζ∈{1, 2, …, H-h}) to exchange rldh with rld[h+ζ] for a new neighborhood solution.

    To improve the convergence of SA, this work opts out the random selection process. Instead, at each annealing step, the proposed SA identifies cores with the potential to improve their routing assignment and to minimize their tardiness. To that end, χ(ϑld) is used to evaluate the urgency of routing reassignment for cores. The probability of a core being selected for routing reassignment is defined as follows.

    probld=χ(ϑld)/ldχ(ϑld) (21)

    For any identified core, the selection of an alternative yet better routing is determined based on an efficiency index, Πh,xld, which calculates the difference of the total average waiting time between the current process routing (i.e., the hth routing) and the alternative one (i.e., xth routing):

    Πh,xld=ΨhΨx,{rldh=1x{1,2,,H}{h}rldx=0,aldx=1 (22)
    Ψh=tijRh,wktijWTkΨx=tijRx,wktijWTk (23)
    WTk=ld(ST(wk,ϑld)AT(si,ϑld))Nk (24)

    where WTk is the average waiting time per core consumed in the kth workstation, Ψh and Ψx are the total average waiting time per core consumed in the hth and xth process routing, respectively, and Nk is the total number of cores being processed by workstation wk. When the core ϑld is switched from the current routing to the other one with a larger Πh,xld, it is more likely to relieve resource conflict and accomplish the task with a greatly reduced tardiness. Therefore, the probability of the xth routing being selected to replace the current hth routing for the core is defined as

    vh,xld=Πh,xld/x{1,2,,H}{h}aldx=1Πh,xld (25)

    (4) Stopping criterion

    In this proposed algorithm, two thresholds are pre-defined: the maximum number of inefficient iterations where the global optimum is not updated Imax, and the maximum number of outer loop iterations olmax. Our SA will stop whenever either of the thresholds is reached.

    With a SA solution, each core follows the derived process routing to be recovered step by step. When multiple cores enter a workstation and compete for the same machine resource, a secondary optimization is conducted to determine the operation sequences of cores to be processed by the workstation, aiming to minimize the total tardiness penalty. The dispatching rules have been widely used for operation sequence optimization to address job shop scheduling problems [35]. Minimum Slack Time (MST), as one of typical heuristic sequencing rules, is widely used for the scheduling problems. MST measures the "urgency" of a job by its slack time, which is defined as the difference between its due date and production time. That is, the shorter the slack time, the higher priority to be processed. In the case of MST dispatching rules, the jobs might be processed as soon as possible in order to be finished right before its due date. As a result, the tardiness of all the jobs can be minimized. Recently, MST rule have been widely used for operation sequence optimization and are embedded with some meta-heuristic approaches to address various scheduling problems [36, 37]. In this section, MST is chosen for resource dispatching and is embedded with SA algorithm to search for the optimal schedules in minimizing both the operation cost and the penalty cost with related to tardiness.

    For a specific core, the slack time of its recovery operation can be calculated as the temporal difference between the due date, the current time, and the remaining operation times, as formulated in Eq 26. MST sequences jobs in the descending order of slack time. Whenever a workstationwk releases a component ϑuv(∀Pri(wk, ϑuv) = q > 0) and turns back into idle state, it will pick up a core ϑld with the least slack time ( slackld = min{slackxy}) from the waiting queue (∀ϑxy, AT(si, ϑxy)-Com(wk, ϑld) ≤ 0), and then immediately process it in the (q + 1)th sequence, as shown in Eq 27.

    slackxy=Due(l)Com(wk,ϑuv)pre(tcd,Rh)pre(tij,Rh)u(tcd,ϑxy),rxyh=1,tijRh,tcdRh,tijwkwk,Pri(wk,ϑuv)=q (26)
    Pri(wk,ϑld)=q+1,if{AT(si,ϑxy)Com(wk,ϑuv)0,ruvh=1,tijRh,sitij,tijwkwk,Pri(wk,ϑuv)=qslackld=min{slackxy},rxyh=1,tijRh (27)

    The solution obtained by MST is a 3-dimension matrix G = [gldk]L×D×K, where gldk, a non-negative integer, represents the operation sequence of the core ϑld to be performed by workstation wk. gldk = 0 means that the core ϑld is not processed by wk. Once the matrix G is derived, Pri(wk, ϑld) in CTPN are determined and thereby the total cost can be calculated.

    With the recovery process routing R and operation sequence matrix G being derived through the proposed hybrid meta-heuristics, a set of transitions are then be enabled and fired as core tokens dynamically enter or release from the buffer places.

    To fully understand the above concepts and algorithms, the remanufacturing of a batch of obsolete machine tools in an example system is used to demonstrate the remanufacturing scheduling. The workflows of cores in this remanufacturing shop and its corresponding CTPN are shown in Figs. 2 and 3. In order to verify the efficiency of the proposed method, three cases are considered for simulation. In the baseline case, cores are recovered through a set of fixed process routings. An available workstation takes MST rule for resource dispatching. In the second case, the traditional SA uses a standard neighborhood generation method and is embodied with MST rule for routing assignment and resource dispatching. In the third case, the recovery routing for a core and the resource dispatching for a workstation are guided through the proposed SA/MST by using the proposed neighborhood solution generation method.

    All the algorithms are implemented in Matlab 2009. The simulation running duration is set to be 30 days. Everyday's work hours are 24 hours. Data of the first 3 days are thrown off as warm-up consideration. For the simulation, the input data is populated as follows.

    (1) Since that the machine resources in the floor shop are fixed and limited, the machine workloads and the intension of resource conflicts increases with the rise of arrival rate, and vice versa. In order to simulated a set of resource conflict scenarios, the random arrival of used machine tools follows a Poisson distribution with an arrival rate per hour π {5, 6, 7, 8, 9, 10, 11}. The designed arrival rate can limit the machine workloads (i.e., the average length of waiting queue on the machines) in the floor shop within a satisfactory range [0.75, 3.6].

    (2) The due date (in days) for each used machine tool is randomly generated by a uniform distribution, Due(l) ~ U[5, 10].

    (3) Each core disassembled from used machine tools is inspected before its recovery and is assigned a quality score Score(ϑld) through an Exponential distribution, Score(ϑld))~ Γ(1, τ) where τ ∈ [0.08, 0.10].

    (4) The control factor and average operation time for each workstation is set to β(wk) = 0.2 and λ(wk) = 15.

    (5) The operation cost per hour in workstations 7 and 9 (i.e., chromium electroplating and laser cladding) is $100, while that in other workstations is $50.

    (6) The penalty cost per day per machine tool is set to be ϖ ∈ {20, 60, 100} in dollars.

    (7) The parameters in SA are set toolmax = 5000, ilmax = 100, Imax = 30, Ω = 169340, η = 0.998.

    (8) Considering that the total number (L) of machine tools generated in each run of the simulation varies, our comparison focuses on normalized objective values. In particular, the comparison evaluates the total cost per product (tc), operation cost per product (pc), tardiness penalty per product (dc), and the average waiting time per core consumed in each workstation (wt).

    Our first set of experiments evaluates how the three methods respond to system demand and various penalty cost rates. In each trial, we run the three methods independently. It should be noted that the baseline case only employs MST rule for resource scheduling, while the proposed SA/MST and the standard one run continuously until they meet the stopping criteria. As the arrival rate of used machine tools changes from 5 to 11, the average total cost tc is obtained and compared among the three methods. This process is repeated with different penalty cost rates (i.e., ϖ = 20, 60, and 100) as shown in Tables 5, 6, and 7, respectively.

    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 tc1tc2 Improvement of the proposed method over the standard one tc2tc3
    Baseline casetc1 Standard SA/MSTtc2 Proposed SA/MSTtc3
    π=5 186.66 117.02 117.02 69.64 0
    π=6 228.37 133.48 118.21 94.89 15.27
    π=7 293.05 172.45 146.89 120.6 25.56
    π=8 335.87 208.06 168.69 127.81 39.37
    π=9 447.52 266.47 216.25 181.05 50.22
    π=10 581.63 352.28 270.91 229.35 81.37
    π=11 714.29 461.86 335.77 252.43 126.09
    Sample mean 398.20 244.52 196.25 153.68 48.27
    Sample standard deviation 193.44 125.46 82.67 68.93 43.15

     | 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 onetc1tc2 Improvement of the proposed method over the standard onetc2tc3
    Baseline casetc1 Standard SA/MSTtc2 Proposed SA/MSTtc3
    π=5 215.76 117.83 117.83 97.93 0
    π=6 327.61 160.31 140.12 167.3 20.19
    π=7 455.9 226.47 185.02 229.43 41.45
    π=8 658.09 342.57 273.22 315.52 69.35
    π=9 891.23 515.96 406.38 375.27 109.58
    π=10 1137.96 738.41 559.67 399.55 178.74
    π=11 1530.54 986.65 775.72 543.89 210.93
    Sample mean 745.30 441.17 351.14 304.13 90.03
    Sample standard deviation 472.28 324.23 244.76 151.99 80.25

     | 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 onetc1tc2 Improvement of the proposed method over the standard onetc2tc3
    Baseline casetc1 Standard SA/MSTtc2 Proposed SA/MSTtc3
    π=5 270.84 117.32 117.32 153.52 0
    π=6 463.08 224.8 186.58 238.28 38.22
    π=7 687.42 416.46 275.13 270.96 141.33
    π=8 1063.8 655.68 453.47 408.12 202.21
    π=9 1495.67 957.36 706.49 538.31 250.87
    π=10 1917.52 1231.56 918.76 685.96 312.8
    π=11 2403.39 1483.89 1120.77 919.5 363.12
    Sample mean 1185.96 726.72 539.79 459.24 186.94
    Sample standard deviation 789.17 517.36 385.07 273.81 135.61

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

    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.

    (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 σ = –(tc3tc2)/tc2 is defined to characterize the improvement of the best solution obtained by the proposed SA/MST over the one obtained by the standard one. A 95% confidence interval of the improvement rate σ is conducted using the data in Tables 5–7. The approximate 100(1–α)% confidence interval for σ is defined as

                            σ±t1α/2(n1)SDnor σt1α/2(n1)SDnσσ+t1α/2(n1)SDn (28)

    where σ is the sample mean of σ based on a sample of size n; SD is the sample standard deviation; t1α/2(n1)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., σ>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σ10.2455 (29)
    0.1042σ20.3118 (30)
    0.1414σ30.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
    tc1 pc1 dc1 wt1 tc2 pc2 dc2 wt2
    After 0sec 399.25 112.16 287.09 76.80 399.25 112.16 287.09 76.80
    After 30sec 380.38 116.78 263.60 72.37 371.14 114.62 256.51 55.21
    After 60sec 393.70 113.71 279.99 61.76 341.42 118.56 222.86 48.34
    After 90sec 393.70 113.71 279.99 58.90 311.93 120.51 191.43 46.49
    After 120sec 386.11 115.62 270.49 58.75 292.79 121.75 171.04 44.54
    After 150sec 385.56 119.96 265.60 58.42 280.06 123.28 156.78 41.52
    After 180sec 384.17 121.18 262.99 57.90 274.14 124.64 149.51 41.47
    After 210sec 383.35 122.86 260.49 56.51 273.33 126.31 147.03 38.40
    After 240sec 378.22 124.65 252.57 54.73 273.22 132.79 140.42 35.67
    No time limits* 342.57 129.41 213.16 48.07 273.22 132.79 140.42 35.67
    * "No time limit" means the simulation keeps the algorithm running until it meets the stopping criteria elaborated above.

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

    Remanufacturing systems are faced with a greater degree of uncertainty and complexity than traditional manufacturing systems, leading to the need for planning and control systems designed to deal with the added uncertainty and complexity. Although many new methodologies have been led up to deal with various operation management issues in remanufacturing environments, no study has comprehensively dealt with remanufacturing job shop scheduling in subjecting to alternative recovery operations, random operation times and limited resource conflicts. A CTPN is introduced to model the dynamics of remanufacturing process, such as various process routings, uncertain operations times and resource conflicts. With time and color attributes in PN, two types of decision variables are linked with places in CTPN and the evolution of system dynamics in recovery operations are mathematically analyzed. With the support of the computation model via CTPN, a hybrid meta-heuristic using SA and MST rule is proposed and embedded with CTPN to sample large search space efficiently and search for a good scheduling solution in minimizing total production cost. The performance of the proposed SA/MST algorithm is compared against another two cases: baseline case with fixed recovery process routings and case 2 using standard SA/MST. The comparison results provide strong evidence that the proposed scheduling method is of significant importance in achieving minimum production cost especially when the system is overloaded and its responsiveness to shared resource conflicts is important.

    Our research can be also extended in several directions. For instance, the integration of alternative recovery routing selection and resource dispatching is a NP-hard problem. Therefore, it is worth of investigation to take the structure advantage of CTPN for a more efficient optimization heuristics. Another challenge is to take into consideration of unexpected system disruptions (i.e., random machine breakdown) in remanufacturing scheduling. The future work also includes further validation of our methodology using more factory data.

    This work was supported in part by the Fundamental Research Funds for the Central Universities (SWU22300503), the National Natural Science Foundation of China (51875480) and the National Natural Science Foundation of China (51475059).

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

    [1] Albanese A, Tang PS, Chan WCW (2012) Size, shape, and surface chemistry on biological systems. Annu Rev Biomed Eng 14: 1–16. doi: 10.1146/annurev-bioeng-071811-150124
    [2] Egeblad M, Nakasone ES, Werb Z (2010) Tumors as organs: complex tissues that interface with the entire organism. Dev Cell 18: 884–901. doi: 10.1016/j.devcel.2010.05.012
    [3] Mierke CT (2014) The fundamental role of mechanical properties in the progression of cancer disease and inflammation. Rep Prog Phys 77: 076602. doi: 10.1088/0034-4885/77/7/076602
    [4] Piktel E, Niemirowicz K, Wątek M, et al. (2016) Recent insights in nanotechnology-based drugs and formulations designed for effective anti-cancer therapy. J Nanobiotechnol 14: 39. doi: 10.1186/s12951-016-0193-x
    [5] Braun J, Tzschätzsch H, Körting C, et al. (2017) A compact 0.5 T MR elastography device and its application for studying viscoelasticity changes in biological tissues during progressive formalin fixation. Magn Reson Med. In press.
    [6] Sigrist RMS, Liau J, Kaffas AE, et al. (2017) Ultrasound elastography: review of techniques and clinical applications. Theranostics 7: 1301–1329.
    [7] Mierke CT, Fischer T, Puder S, et al. (2017) Focal adhesion kinase activity is required for actomyosin contractility-based invasion of cells into dense 3D matrices. Sci Rep 7: 42780. doi: 10.1038/srep42780
    [8] Jolly MK, Boareto M, Huang B, et al. (2015) Implications of the hybrid epithelial/mesenchymal phenotype in metastasis. Front Oncol 5: 00155.
    [9] Jolly MK, Tripathi SC, Jia D, et al. (2016) Stability of the hybrid epithelial/mesenchymal phenotype. Oncotarget 7: 27067–27084. doi: 10.18632/oncotarget.8166
    [10] Jolly MK, Ware KE, Gilja S, et al. (2017) EMT and MET: necessary or permissive for metastasis? Mol Oncol 11: 755–769. doi: 10.1002/1878-0261.12083
    [11] Thiery JP (2002) Epithelial-mesenchymal transitions in tumour progression. Nat Rev Cancer 2: 442–454. doi: 10.1038/nrc822
    [12] Wolf K, Friedl P (2003) Tumour-cell invasion and migration: diversity and escape mechanisms. Nat Rev Cancer 3: 362–374. doi: 10.1038/nrc1075
    [13] Friedl P, Gilmour D (2009) Collective cell migration in morphogenesis, regeneration and cancer. Nat Rev Mol Cell Bio 10: 445–457. doi: 10.1038/nrm2720
    [14] Friedl P, Wolf K (2003) Tumour-cell invasion and migration: diversity and escape mechanisms. Nat Rev Cancer 3: 362–374. doi: 10.1038/nrc1075
    [15] Driscoll MK, Danuser G (2015) Quantifying modes of 3D cell migration. Trends Cell Biol 25: 749–759. doi: 10.1016/j.tcb.2015.09.010
    [16] Abercrombie M, Heaysman JEM, Pegrum SM (1971) The locomotion of fibroblasts in culture. IV Electron microscopy of the leading lamella. Exp Cell Res 67: 359–367.
    [17] Ridley AJ, Schwartz MA, Burridge K, et al. (2003) Cell migration: integrating signals from front to back. Science 302: 1704–1709. doi: 10.1126/science.1092053
    [18] Lauffenburger DA, Horwitz AF (1996) Cell migration: a physically integrated molecular process. Cell 84: 359–369. doi: 10.1016/S0092-8674(00)81280-5
    [19] Huttenlocher A, Sandborg RR, Horwitz AF (1995) Adhesion in cell migration. Curr Opin Cell Biol 7: 697–706. doi: 10.1016/0955-0674(95)80112-X
    [20] Geiger B, Spatz JP, Bershadsky AD (2009) Environmental sensing through focal adhesions. Nat Rev Mol Cell Biol 10: 21–33. doi: 10.1038/nrm2593
    [21] Wilson CA, Tsuchida MA, Allen GM, et al. (2010) Myosin II contributes to cell-scale actin network treadmilling through network disassembly. Nature 465: 373–377. doi: 10.1038/nature08994
    [22] Reymann AC, Boujemaa-Paterski R, Martiel JL, et al. (2012) Actin network architecture can determine myosin motor activity. Science 336: 1310–1314. doi: 10.1126/science.1221708
    [23] Petrie RJ, Yamada KM (2015) Fibroblasts lead the way: a unified view of three-dimensional cell motility. Trends Cell Biol 25: 666–674. doi: 10.1016/j.tcb.2015.07.013
    [24] Tozluoğlu M, Tournier AL, Jenkins RP, et al. (2013) Matrix geometry determines optimal cancer cell migration strategy and modulates response to interventions. Nat Cell Biol 15: 751–764. doi: 10.1038/ncb2775
    [25] Mierke CT, Rösel D, Fabry B, et al. (2008) Contractile forces in tumor cell migration. Eur J Cell Biol 87: 669–676. doi: 10.1016/j.ejcb.2008.01.002
    [26] Wolf K, Mazo I, Leung H, et al. (2003) Compensation mechanism in tumor cell migration: mesenchymal-amoeboid transition after blocking of pericellular proteolysis. J Cell Biol 160: 267–277. doi: 10.1083/jcb.200209006
    [27] Sahai E, Marshall CJ (2003) Differing modes of tumour cell invasion have distinct requirements for Rho/ROCK signalling and extracellular proteolysis. Nat Cell Biol 5: 711–719. doi: 10.1038/ncb1019
    [28] Sanz-Moreno V, Gadea G, Ahn J, et al. (2008) Rac activation and inactivation control plasticity of tumor cell movement. Cell 135: 510–523. doi: 10.1016/j.cell.2008.09.043
    [29] Neilson MP, Veltman DM, van Haastert PJ, et al. (2011) Chemotaxis: a feedback-based computational model robustly predicts multiple aspects of real cell behaviour. PLoS Biol 9: e1000618. doi: 10.1371/journal.pbio.1000618
    [30] Bagorda A, Parent CA (2008) Eukaryotic chemotaxis at a glance. J Cell Sci 121: 2621–2624. doi: 10.1242/jcs.018077
    [31] Rorth P (2011) Whence directionality: guidance mechanisms in solitary and collective cell migration. Dev Cell 20: 9–18. doi: 10.1016/j.devcel.2010.12.014
    [32] Mierke CT, Frey B, Fellner M, et al. (2011) Integrin α5β1 facilitates cancer cell invasion through enhanced contractile forces. J Cell Sci 124: 369–383. doi: 10.1242/jcs.071985
    [33] Huttenlocher A, Horwitz AR (2011) Integrins in cell migration. CSH Perspect Biol 3: a005074.
    [34] Hung WC, Chen SH, Paul CD, et al. (2013) Distinct signaling mechanisms regulate migration in unconfined versus confined spaces. J Cell Biol 202: 807–824. doi: 10.1083/jcb.201302132
    [35] Hung WC, Yang JR, Yankaskas CL, et al. (2016) Confinement sensing and signal optimization via Piezo1/PKA and Myosin II pathways. Cell Rep 15: 1430–1441. doi: 10.1016/j.celrep.2016.04.035
    [36] Liu YJ, Le BM, Lautenschlaeger F, et al. (2015) Confinement and low adhesion induce fast amoeboid migration of slow mesenchymal cells. Cell 160: 659–672. doi: 10.1016/j.cell.2015.01.007
    [37] Beadle C, Assanah MC, Monzo P, et al. (2008) The role of myosin II in glioma invasion of the brain. Mol Biol Cell 19: 3357–3368. doi: 10.1091/mbc.E08-03-0319
    [38] Jacobelli J, Friedman RS, Conti MA, et al. (2010) Confinement-optimized three-dimensional T cell amoeboid motility is modulated via myosin IIA-regulated adhesions. Nat Immunol 11: 953–961. doi: 10.1038/ni.1936
    [39] Han J, Rose DM, Woodside DG, et al. (2003) Integrin alpha 4 beta 1-dependent T cell migration requires both phosphorylation of the alpha 4 cytoplasmic domain to regulate the reversible binding to paxillin. J Biol Chem 278: 34845–34853. doi: 10.1074/jbc.M304691200
    [40] Charras G, Sahai E (2014) Physical influences of the extracellular environment on cell migration. Nat Rev Mol Cell Biol 15: 813–824. doi: 10.1038/nrm3897
    [41] Bergert M, Erzberger A, Desai RA, et al. (2015) Force transmission during adhesion-independent migration. Nat Cell Biol 17: 524–529. doi: 10.1038/ncb3134
    [42] Raman PS, Paul CD, Stroka KM (2013) Probing cll traction forces in confined microenvironments. Lab Chip 13: 4599–4607. doi: 10.1039/c3lc50802a
    [43] Wolenski RS (1995) Regulation of calmodulin-binding myosins. Trends Cell Biol 5: 310–316. doi: 10.1016/S0962-8924(00)89053-4
    [44] Somlyo AP, Somlyo AV (2003) Ca2+ sensitivity of smooth muscle and nonmuscle myosin II: Modulate by G proteins, kinases, and myosin phosphate. Physiol Rev 83: 1325–1358. doi: 10.1152/physrev.00023.2003
    [45] Abercrombie M, Heaysman JEM, Pegrum SM (1970) The locomotion of fibroblasts in culture: I. Movements of the leading edge. Exp Cell Res 59: 393–398.
    [46] Bard JB, Hay ED (1975) The behavior of fibroblasts from the developing avian cornea. Morphology and movement in situ and in vitro. J Cell Biol 67: 400–418.
    [47] Weiger MC, Wang CC, Krajcovic M, et al. (2009) Spontaneous phosphoinositide 3-kinase signaling dynamics drive spreading and random migration of fibroblasts. J Cell Sci 122: 313–323. doi: 10.1242/jcs.037564
    [48] Kraynov VS, Chamberlain C, Bokoch GM, et al. (2000) Localized Rac activation dynamics visualized in living cells. Science 290: 333–337. doi: 10.1126/science.290.5490.333
    [49] Nalbant P, Hodgson L, Kraynov V, et al. (2004) Activation of endogenous Cdc42 visualized in living cells. Science 305: 1615–1619. doi: 10.1126/science.1100367
    [50] Svitkina TM, Borisy GG (1999) Arp2/3 complex and actin depolymerizing factor/cofilin in dendritic organization and treadmilling of actin filament array in lamellipodia. J Cell Biol 145: 1009–1026. doi: 10.1083/jcb.145.5.1009
    [51] Small JV (1981) Organization of actin in the leading edge of cultured cells: influence of osmium tetroxide and dehydration on the ultrastructure of actin meshworks. J Cell Biol 91: 695–705. doi: 10.1083/jcb.91.3.695
    [52] Zaidel-Bar R, Ballestrem C, Kam Z, et al. (2003) Early molecular events in the assembly of matrix adhesions at the leading edge of migrating cells. J Cell Sci 116: 4605–4613. doi: 10.1242/jcs.00792
    [53] Chrzanowska-Wodnicka M, Burridge K (1996) Rho-stimulated contractility drives the formation of stress fibers and focal adhesions. J Cell Biol 133: 1403–1415. doi: 10.1083/jcb.133.6.1403
    [54] Gupton SL, Eisenmann K, Alberts AS, et al. (2007) mDia2 regulates actin and focal adhesion dynamics and organization in the lamella for efficient epithelial cell migration. J Cell Sci 120: 3475–3487. doi: 10.1242/jcs.006049
    [55] Chen WT (1981) Mechanism of retraction of the trailing edge during fibroblast movement. J Cell Biol 90: 187–200. doi: 10.1083/jcb.90.1.187
    [56] Vicente-Manzanares M, Koach MA, Whitmore L, et al. (2008) Segregation and activation of myosin IIB creates a rear in migrating cells. J Cell Biol 183: 543–554. doi: 10.1083/jcb.200806030
    [57] Bergmann JE, Kupfer A, Singer SJ (1983) Membrane insertion at the leading-edge of motile fibroblasts. Proc Natl Acad Sci USA 80: 1367–1371. doi: 10.1073/pnas.80.5.1367
    [58] Osmani N, Peglion F, Chavrier P, et al. (2010) Cdc42 localization and cell polarity depend on membrane traffic. J Cell Biol 191: 1261–1269. doi: 10.1083/jcb.201003091
    [59] Gomes ER, Jani S, Gundersen GG (2005) Nuclear movement regulated by Cdc42, MRCK, myosin, and actin flow establishes MTOC polarization in migrating cells. Cell 121: 451–463. doi: 10.1016/j.cell.2005.02.022
    [60] Petrie RJ, Yamada KM (2012) At the leading edge of three-dimensional cell migration. J Cell Sci 125: 5917–5926. doi: 10.1242/jcs.093732
    [61] Petrie RJ, Gavara N, Chadwick RS, et al. (2012) Nonpolarized signaling reveals two distinct modes of 3D cell migration. J Cell Biol 197: 439–455. doi: 10.1083/jcb.201201124
    [62] Charras G, Paluch E (2008) Blebs lead the way: how to migrate without lamellipodia. Nat Rev Mol Cell Biol 9: 730–736.
    [63] Lämmermann T, Bader BL, Monkley SJ, et al. (2008) Rapid leukocyte migration by integrin-independent flowing and squeezing. Nature 453: 51–55. doi: 10.1038/nature06887
    [64] Sanchez T, Chen DT, DeCamp SJ, et al. (2012) Spontaneous motion in hierarchically assembled active matter. Nature 491: 431–434. doi: 10.1038/nature11591
    [65] Ruprecht V, Wieser S, Callan-Jones A, et al. (2015) Cortical contractility triggers a stochastic switch to fast amoeboid cell motility. Cell 160: 673–685. doi: 10.1016/j.cell.2015.01.008
    [66] Davidson PM, Denais C, Bakshi MC, et al. (2014) Nuclear deformability constitutes a rate-limiting step during cell migration in 3-D environments. Cell Mol Bioeng 7: 293–306. doi: 10.1007/s12195-014-0342-y
    [67] Harada T, Swift J, Irianto J, et al. (2014) Nuclear lamin stiffness is a barrier to 3D migration, but softness can limit survival. J Cell Biol 204: 669–682. doi: 10.1083/jcb.201308029
    [68] Wolf K, Lindert MT, Krause M, et al. (2013) Physical limits of cell migration: control by ECM space and nuclear deformation and tuning by proteolysis and traction force. J Cell Biol 201: 1069–1084. doi: 10.1083/jcb.201210152
    [69] Bernards R, Weinberg RA (2002) Metastasis genes: A progression puzzle. Nature 418: 823. doi: 10.1038/418823a
    [70] Heasman SJ, Ridley AJ (2008) Mammalian Rho GTPases: new insights into their functions from in vivo studies. Nat Rev Mol Cell Biol 9: 690–701. doi: 10.1038/nrm2476
    [71] Ladwein M, Rottner K (2008) On the Rho'd: the regulation of membrane protrusions by Rho-GTPases. FEBS Lett 582: 2066–2074. doi: 10.1016/j.febslet.2008.04.033
    [72] Aspenström P, Fransson A, Saras J (2004) Rho GTPases have diverse effects on the organization of the actin filament system. Biochem J 377: 327–337. doi: 10.1042/bj20031041
    [73] Ridley AJ, Paterson HF, Johnston CL, et al. (1992) The small GTP-binding protein rac regulates growth factor-induced membrane ruffling. Cell 70: 401–410. doi: 10.1016/0092-8674(92)90164-8
    [74] Nobes CD, Hall A (1995) Rho, rac, and cdc42 GTPases regulate the assembly of multimolecular focal complexes associated with actin stress fibers, lamellipodia, and filopodia. Cell 81: 53–62. doi: 10.1016/0092-8674(95)90370-4
    [75] Monypenny J, Zicha D, Higashida C, et al. (2009) Cdc42 and Rac family GTPases regulate mode and speed but not direction of primary fibroblast migration during platelet-derived growth factor-dependent chemotaxis. Mol Cell Biol 29: 2730–2747. doi: 10.1128/MCB.01285-08
    [76] Krugmann S, Jordens I, Gevaert K, et al. (2001) Cdc42 induces filopodia by promoting the formation of an IRSp53: Mena complex. Curr Biol 11: 1645–1655. doi: 10.1016/S0960-9822(01)00506-1
    [77] Jaffe AB, Hall A (2002) Rho GTPases in transformation and metastasis. Adv Cancer Res 84: 57–80. doi: 10.1016/S0065-230X(02)84003-9
    [78] Hall A (1998) Rho GTPases and the actin cytoskeleton. Science 279: 509–514. doi: 10.1126/science.279.5350.509
    [79] Allen WE, Zicha D, Ridley AJ, et al. (1998) A role for Cdc42 in macrophage chemotaxis. J Cell Biol 141: 1147–1157. doi: 10.1083/jcb.141.5.1147
    [80] Nobes CD, Hall A (1999) Rho GTPases control polarity, protrusion, and adhesion during cell movement. J Cell Biol 144: 1235–1244. doi: 10.1083/jcb.144.6.1235
    [81] Amano M, Chihara K, Kimura K, et al. (1997) Formation of actin stress fibers and focal adhesions enhanced by Rho-kinase. Science 275: 1308–1311. doi: 10.1126/science.275.5304.1308
    [82] Watanabe N, Kato T, Fujita A, et al. (1999) Cooperation between mDia1 and ROCK in Rho-induced actin reorganization. Nat Cell Biol 1: 136–143. doi: 10.1038/11056
    [83] Cox EA, Sastry SK, Huttenlocher A (2001) Integrin-mediated adhesion regulates cell polarity and membrane protrusion through the Rho family of GTPases. Mol Biol Cell 12: 265–277. doi: 10.1091/mbc.12.2.265
    [84] Fukata M, Kaibuchi K (2001) Rho-family GTPases in Cadherin-mediated cell-cell adhesion. Nat Rev Mol Cell Bio 2: 887–897. doi: 10.1038/35103068
    [85] Doyle AD, Wang FW, Matsumoto K, et al. (2009) One-dimensional topography underlies three-dimensional fibrillar cell migration. J Cell Biol 184: 481–490. doi: 10.1083/jcb.200810041
    [86] Even-Ram S, Doyle AD, Conti MA, et al. (2007) Myosin IIA regulates cell motility and actomyosin-microtubule crosstalk. Nat Cell Biol 9: 299–309. doi: 10.1038/ncb1540
    [87] Zhong C, Chrzanowska-Wodnicka M, Brown J, et al. (1998) Rho-mediated contractility exposes a cryptic site in fibronectin and induces fibronectin matrix assembly. J Cell Biol 141: 539–551. doi: 10.1083/jcb.141.2.539
    [88] Arthur WT, Burridge K (2001) RhoA inactivation by p190RhoGAP regulates cell spreading and migration by promoting membrane protrusion and polarity. Mol Biol Cell 12: 2711–2720. doi: 10.1091/mbc.12.9.2711
    [89] Chrzanowska-Wodnicka M, Burridge K (1994) Tyrosine phosphorylation is involved in reorganization of the actin cytoskeleton in response to serum or LPA stimulation. J Cell Sci 107: 3643–3654.
    [90] Provenzano PP, Inman DR, Eliceiri KW, et al. (2008) Contact guidance mediated three-dimensional cell migration is regulated by Rho/ROCK-dependent matrix reorganization. Biophys J 95: 5374–5384. doi: 10.1529/biophysj.108.133116
    [91] Riching KM, Cox BL, Salick MR, et al. (2014) 3D collagen alignment limits protrusions to enhance breast cancer cell persistence. Biophys J 107: 2546–2558. doi: 10.1016/j.bpj.2014.10.035
    [92] Thomas DG, Yenepalli A, Denais CM, et al. (2015) Non-muscle myosin IIB is critical for nuclear translocation during 3D invasion. J Cell Biol 210: 583–594. doi: 10.1083/jcb.201502039
    [93] Paul CD, Mistriotis P, Konstantopoulos K (2017) Cancer cell motility: lessons from migration in confined spaces. Nat Rev Cancer 17: 131–140.
    [94] Lombardi ML, Jaalouk DE, Shanahan CM, et al. (2011) The interaction between nesprins and sun proteins at the nuclear envelope is critical for force transmission between the nucleus and cytoskeleton. J Biol Chem 286: 26743–26753. doi: 10.1074/jbc.M111.233700
    [95] Mierke CT, Zitterbart DP, Kollmannsberger P, et al. (2008) Breakdown of the endothelial barrier function in tumor cell transmigration. Biophys J 94: 2832–2846. doi: 10.1529/biophysj.107.113613
    [96] Eddy RJ, Pierini LM, Matsumura F, et al. (2000) Ca2+-dependent myosin II activation is required for uropod retraction during neutrophil migration. J Cell Sci 113: 1287–1298.
    [97] Poincloux R, Collin O, Lizárraga F, et al. (2011) Contractility of the cell rear drives invasion of breast tumor cells in 3D Matrigel. Proc Natl Acad Sci USA 108: 1943–1948. doi: 10.1073/pnas.1010396108
    [98] Olins AL, Hoang TV, Zwerger M, et al. (2009) The LINC-less granulocyte nucleus. Eur J Cell Biol 88: 203–214. doi: 10.1016/j.ejcb.2008.10.001
    [99] Machacek M, Hodgson L, Welch C, et al. (2009) Coordination of Rho GTPase activities during cell protrusion. Nature 461: 99–103. doi: 10.1038/nature08242
    [100] Das T, Safferling K, Rausch S, et al. (2015) A molecular mechanotransduction pathway regulates collective migration of epithelial cells. Nat Cell Biol 17: 276–287. doi: 10.1038/ncb3115
    [101] Yi CL, Troutman S, Fera D, et al. (2011) A tight junction-associated merlin-angiomotin complex mediates Merlin's regulation of mitogenic signaling and tumor suppressive functions. Cancer Cell 19: 527–540. doi: 10.1016/j.ccr.2011.02.017
    [102] Ramel D, Wang XB, Laflamme C, et al. (2013) Rab11 regulates cell-cell communication during collective cell movements. Nat Cell Biol 15: 317–324. doi: 10.1038/ncb2681
    [103] Gaggioli C, Hooper S, Hidalgo-Carcedo C, et al. (2007) Fibroblast-led collective invasion of carcinoma cells with differing roles for RhoGTPases in leading and following cells. Nat Cell Biol 9: 1392–1400. doi: 10.1038/ncb1658
    [104] Wang XB, He L, Wu YI, et al. (2010) Light-mediated activation reveals a key role for Rac in collective guidance of cell movement in vivo. Nat Cell Biol 12: 591–597. doi: 10.1038/ncb2061
    [105] Hidalgo-Carcedo C, Hooper S, Chaudhry SI, et al. (2011) Collective cell migration requires suppression of actomyosin at cell-cell contacts mediated by DDR1 and the cell polarity regulators Par3 and Par6. Nat Cell Biol 13: 49–58. doi: 10.1038/ncb2133
    [106] Ng MR, Besser A, Danuser G, et al. (2012) Substrate stiffness regulates cadherin-dependent colle cadherin-dependent collective migration through myosin-II contractility. J Cell Biol 199: 545–563. doi: 10.1083/jcb.201207148
    [107] Reffay M, Parrini MC, Cochet-Escartin O, et al. (2014) Interplay of RhoA and mechanical forces in collective cell migration driven by leader cells. Nat Cell Biol 16: 217–223. doi: 10.1038/ncb2917
    [108] Peglion F, Llense F, Etienne-Manneville S (2014) Adherens junction treadmilling during collective migration. Nat Cell Biol 16: 639–651. doi: 10.1038/ncb2985
    [109] Raupach C, Zitterbart DP, Mierke CT, et al. (2007) Stress fluctuations and motion of cytoskeletal-bound markers. Phys Rev E 76: 011918. doi: 10.1103/PhysRevE.76.011918
    [110] Tambe DT, Hardin CC, Angelini TE, et al. (2011) Collective cell guidance by cooperative intercellular forces. Nat Mater 10: 469–475. doi: 10.1038/nmat3025
    [111] Trepat X, Wasserman MR, Angelini TE, et al. (2009) Physical forces during collective cell migration. Nat Phys 5: 426–430. doi: 10.1038/nphys1269
    [112] Jaffe AB, Hall A (2005) Rho GTPases: biochemistry and biology. Annu Rev Cell Dev Biol 21: 247–269. doi: 10.1146/annurev.cellbio.21.020604.150721
    [113] Schmidt A, Hall A (2002) Guanine nucleotide exchange factors for Rho GTPases: turning on the switch. Gene Dev 16: 1587–1609. doi: 10.1101/gad.1003302
    [114] Otani T, Ichii T, Aono S, et al. (2006) Cdc42 GEF Tuba regulates the junctional configuration of simple epithelial cells. J Cell Biol 175: 135–146. doi: 10.1083/jcb.200605012
    [115] Harris KP, Tepass U (2010) Cdc42 and vesicle trafficking in polarized cells. Traffic 11: 1272–1279. doi: 10.1111/j.1600-0854.2010.01102.x
    [116] Citi S, Spadaro D, Schneider Y, et al. (2011) Regulation of small GTPases at epithelial cell-cell junctions. Mol Membr Biol 28: 427–444. doi: 10.3109/09687688.2011.603101
    [117] Rohatgi R, Ho HY, Kirschner MW (2000) Mechanism of N-WASP activation by CDC42 and phosphatidylinositol 4, 5-bisphosphate. J Cell Biol 150: 117–120. doi: 10.1083/jcb.150.6.F117
    [118] Hall A (2005) Rho GTPases and the control of cell behaviour. Biochem Soc Trans 33: 891–895. doi: 10.1042/BST0330891
    [119] Aspenström P, Richnau N, Johansson AS (2006) The diaphanous-related formin DAAM1 collaborates with the Rho GTPases RhoA and Cdc42, CIP4 and Src in regulating cell morphogenesis and actin dynamics. Exp Cell Res 312: 2180–2194. doi: 10.1016/j.yexcr.2006.03.013
    [120] Aspenstrom P (1997) A Cdc42 target protein with homology to the non-kinase domain of FER has a potential role in regulating the actin cytoskeleton. Curr Biol 7: 479–487. doi: 10.1016/S0960-9822(06)00219-3
    [121] Tian L, Nelson DL, Stewart DM (2000) Cdc42-interacting protein 4 mediates binding of the Wiskott-Aldrich syndrome protein to microtubules. J Biol Chem 275: 7854–7861. doi: 10.1074/jbc.275.11.7854
    [122] Yanai M, Kenyon CM, Butler JP, et al. (1996) Intracellular pressure is a motive force for cell motion in Amoeba proteus. Cell Motil Cytoskel 33: 22–29. doi: 10.1002/(SICI)1097-0169(1996)33:1<22::AID-CM3>3.0.CO;2-K
    [123] Petrie RJ, Koo H (2014) Direct measurement of intracellular pressure. Curr Protoc Cell Biol 63: 12–19.
    [124] Petrie RJ, Koo H, Yamada KM (2014) Generation of compartmentalized pressure by a nuclear piston governs cell motility in a 3D matrix. Science 345: 1062–1065. doi: 10.1126/science.1256965
    [125] Stroka KM, Jiang H, Chen SH, et al. (2014) Water permeation drives tumor cell migration in confined microenvironments. Cell 157: 611–623. doi: 10.1016/j.cell.2014.02.052
    [126] Chartier L, Rankin LL, Allen RE, et al. (1991) Calyculin-A increases the level of protein phosphorylation and changes the shape of 3T3 fibroblasts. Cell Motil Cytoskel 18: 26–40. doi: 10.1002/cm.970180104
    [127] Goldman R, Goldman A, Green K, et al. (1985) Intermediate filaments: possible functions as cytoskeletal connecting links between the nucleus and the cell surface. Ann NY Acad Sci 455: 1–17. doi: 10.1111/j.1749-6632.1985.tb50400.x
    [128] Lehto VP, Virtanen I, Kurki P (1978) Intermediate filaments anchor the nuclei in nuclear monolayers of cultured human fibroblasts. Nature 272: 175–177. doi: 10.1038/272175a0
    [129] Janmey PA, Euteneuer U, Traub P, et al. (1991) Viscoelastic properties of vimentin compared with other filamentous biopolymer networks. J Cell Biol 113: 155–160. doi: 10.1083/jcb.113.1.155
    [130] Deguchi S, Ohashi T, Sato M (2006) Tensile properties of single stress fibers isolated from cultured vascular smooth muscle cells. J Biomech 39: 2603–2610. doi: 10.1016/j.jbiomech.2005.08.026
    [131] Dupin I, Sakamoto Y, Etienne-Manneville S (2011) Cytoplasmic intermediate filaments mediate actin-driven positioning of the nucleus. J Cell Sci 124: 865–872. doi: 10.1242/jcs.076356
    [132] Petrie RJ, Harlin HM, Korsak LIT, et al. (2017) Activating the nuclear piston mechanism of 3D migration in tumor cells. J Cell Biol 216: 93–100. doi: 10.1083/jcb.201605097
    [133] Sung BH, Ketova T, Hoshino D, et al. (2004) Directional cell movement through tissues is controlled by exosome secretion. Nat Commun 6: 7164.
    [134] Gundersen GG, Bulinski JC (1988) Selective stabilization of microtubules oriented toward the direction of cell migration. Proc Natl Acad Sci USA 85: 5946–5950. doi: 10.1073/pnas.85.16.5946
    [135] Kupfer A, Louvard D, Singer SJ (1982) Polarization of the Golgi apparatus and the microtubule-organizing center in cultured fibroblasts at the edge of an experimental wound. Proc Natl Acad Sci USA 79: 2603–2607. doi: 10.1073/pnas.79.8.2603
    [136] Vasiliev JM, Gelfand IM, Domnina LV, et al. (1970) Effect of colcemid on the locomotory behaviour of fibroblasts. J Embryol Exp Morphol 24: 625–640.
    [137] Wu C, Asokan SB, Berginski ME, et al. (2012) Arp2/3 is critical for lamellipodia and response to extracellular matrix cues but is dispensable for chemotaxis. Cell 148: 973–987.
    [138] Wu YI, Frey D, Lungu OI, et al. (2009) A genetically encoded photoactivatable Rac controls the motility of living cells. Nature 461: 104–108. doi: 10.1038/nature08241
    [139] Welf ES, Ahmed S, Johnson HE, et al. (2012) Migrating fibroblasts reorient directionality by a metastable, PI3K-dependent mechanism. J Cell Biol 197: 105–114. doi: 10.1083/jcb.201108152
    [140] Giannone G, Dubin-Thaler BJ, Döbereiner HG, et al. (2004) Periodic lamellipodial contractions correlate with rearward actin waves. Cell 116: 431–443. doi: 10.1016/S0092-8674(04)00058-3
    [141] Ponti A, Machacek M, Gupton SL, et al. (2004) Two distinct actin networks drive the protrusion of migrating cells. Science 305: 1782–1786. doi: 10.1126/science.1100533
    [142] Friedl P, Wolf K (2009) Proteolytic interstitial cell migration: a five-step process. Cancer Metastasis Rev 28: 129–135. doi: 10.1007/s10555-008-9174-3
    [143] Danen EH, van Rheenen J, Franken W, et al. (2005) Integrins control motile strategy through a Rho-cofilin pathway. J Cell Biol 169: 515–526. doi: 10.1083/jcb.200412081
    [144] Doyle AD, Kutys ML, Conti MA, et al. (2012) Micro-environmental control of cell migration-myosin IIA is required for efficient migration in fibrillar environments through control of cell adhesion dynamics. J Cell Sci 125: 2244–2256. doi: 10.1242/jcs.098806
    [145] Lämmermann T, Sixt M (2009) Mechanical modes of 'amoeboid' cell migration. Curr Opin Cell Biol 21: 636–644. doi: 10.1016/j.ceb.2009.05.003
    [146] Renkawitz J, Schumann K, Weber M, et al. (2009) Adaptive force transmission in amoeboid cell migration. Nat Cell Biol 11: 1438–1443. doi: 10.1038/ncb1992
    [147] Charras GT, Yarrow JC, Horton MA, et al. (2005) Non-equilibration of hydrostatic pressure in blebbing cells. Nature 435: 365–369. doi: 10.1038/nature03550
    [148] Bergert M, Chandradoss SD, Desai RA, et al. (2012) Cell mechanics control rapid transitions between blebs and lamellipodia during migration. Proc Natl Acad Sci USA 109: 14434–14439. doi: 10.1073/pnas.1207968109
    [149] Petrie RJ, Yamada KM (2016) Multiple mechanisms of 3D migration: The origins of plasticity. Curr Opin Cell Biol 42: 7–12. doi: 10.1016/j.ceb.2016.03.025
    [150] Doyle AD, Carvajal N, Jin A, et al. (2015) Local 3D matrix microenvironment regulates cell migration through spatiotemporal dynamics of contractility-dependent adhesions. Nat Commun 6: 8720. doi: 10.1038/ncomms9720
    [151] Ray U, Roy SS, Chowdhury SR (2017) Lysophosphatidic acid promotes epithelial to mesenchymal transition in ovarian cancer cells by repressing SIRT1. Cell Physiol Biochem 41: 795–805. doi: 10.1159/000458744
    [152] Vincent T, Neve EP, Johnson JR, et al. (2009) A SNAIL1-SMAD3/4 transcriptional repressor complex promotes TGF-beta mediated epithelial-mesenchymal transition. Nat Cell Biol 11: 943–950. doi: 10.1038/ncb1905
    [153] Huang YL, Tung CK, Zheng A, et al. (2015) Interstitial flows promote amoeboid over mesenchymal motility of breast cancer cells revealed by a three dimensional microfluidic model. Integr Biol 7: 1402–1411. doi: 10.1039/C5IB00115C
    [154] Laurent VM, Fodil R, Cañadas P, et al. (2003) Partitioning of cortical and deep cytoskeleton responses from transient magnetic bead twisting. Ann Biomed Eng 31: 1263–1278. doi: 10.1114/1.1616932
    [155] Laevsky G, Knecht DA (2003) Cross-linking of actin filaments by myosin II is a major contributor to cortical integrity and cell motility in restrictive environments. J Cell Sci 116: 3761–3770. doi: 10.1242/jcs.00684
    [156] Small JV, Rottner K, Kaverina I, et al. (1998) Assembling an actin cytoskeleton for cell attachment and movement. Biochim Biophys Acta 1404: 271–281. doi: 10.1016/S0167-4889(98)00080-9
    [157] Tojkander S, Gateva G, Lappalainen P (2012) Actin stress fibers-assembly, dynamics and biological roles. J Cell Sci 125: 1855–1864. doi: 10.1242/jcs.098087
    [158] Vallenius T (2013) Actin stress fibre subtypes in mesenchymal-migrating cells. Open Biol 3: 130001. doi: 10.1098/rsob.130001
    [159] Kassianidou E, Kumar S (2015) A biomechanical perspective on stress fiber structure and function. Biochim Biophys Acta 1853: 3065–3074. doi: 10.1016/j.bbamcr.2015.04.006
    [160] Klimova Z, Braborec V, Maninova M, et al. (2016) Symmetry breaking in spreading RAT2 fibroblasts requires the MAPK/ERK pathway scaffold RACK1 that integrates FAK, p190A- RhoGAP and ERK2 signaling. Biochim Biophys Acta 1863: 2189–2200. doi: 10.1016/j.bbamcr.2016.05.013
    [161] Vicente-Manzanares M, Newell-Litwa K, Bachir AI, et al. (2011) Myosin IIA/IIB restrict adhesive and protrusive signaling to generate front-back polarity in migrating cells. J Cell Biol 193: 381–396. doi: 10.1083/jcb.201012159
    [162] Prager-Khoutorsky M, Lichtenstein A, Krishnan R, et al. (2011) Fibroblast polarization is a matrix-rigidity-dependent process controlled by focal adhesion mechanosensing. Nat Cell Biol 13: 1457–1465. doi: 10.1038/ncb2370
    [163] Iwanicki MP, Vomastek T, Tilghman RW, et al. (2008) FAK, PDZ-RhoGEF and ROCKII cooperate to regulate adhesion movement and trailing-edge retraction in fibroblasts. J Cell Sci 121: 895–905. doi: 10.1242/jcs.020941
    [164] Kumar S, Maxwell IZ, Heisterkamp A, et al. (2006) Viscoelastic retraction of single living stress fibers and its impact on cell shape, cytoskeletal organization, and extracellular matrix mechanics. Biophys J 90: 3762– 3773. doi: 10.1529/biophysj.105.071506
    [165] Pellegrin S, Mellor H (2007) Actin stress fibres. J Cell Sci 120: 3491–3499. doi: 10.1242/jcs.018473
    [166] Mierke CT, Sauer F, Grosser S, et al. (2017) The two faces of enhanced stroma: Stroma acts as a tumor promoter and a steric obstacle. NMR Biomed. In press.
    [167] Fischer T, Wilharm N, Hayn A, et al. (2017) Matrix and cellular mechanical properties are the driving factors for facilitating human cancer cell motility into 3D engineered matrices. Converg Sci Phys Oncol 3: 044003. doi: 10.1088/2057-1739/aa8bbb
    [168] Oakes PW, Beckham Y, Stricker J, et al. (2012) Tension is required but not sufficient for focal adhesion maturation without a stress fiber template. J Cell Biol 196: 363–374. doi: 10.1083/jcb.201107042
    [169] Kovac B, Teo JL, Makela TP, et al. (2013) Assembly of non-contractile dorsal stress fibers requires alpha-actinin-1 and Rac1 in migrating and spreading cells. J Cell Sci 126: 263–273. doi: 10.1242/jcs.115063
    [170] Feng Y, Ngu H, Alford SK, et al. (2013) Alpha-actinin1 and 4 tyrosine phosphorylation is critical for stress fiber establishment, maintenance and focal adhesion maturation. Exp Cell Res 319: 1124–1135. doi: 10.1016/j.yexcr.2013.02.009
    [171] Hotulainen P, Lappalainen P (2006) Stress fibers are generated by two distinct actin assembly mechanisms in motile cells. J Cell Biol 173: 383–394. doi: 10.1083/jcb.200511093
    [172] Burnette DT, Shao L, Ott C, et al. (2014) A contractile and counterbalancing adhesion system controls the 3D shape of crawling cells. J Cell Biol 205: 83–96. doi: 10.1083/jcb.201311104
    [173] Tojkander S, Gateva G, Schevzov G, et al. (2011) A molecular pathway for myosin II recruitment to stress fibers. Curr Biol 21: 539–550. doi: 10.1016/j.cub.2011.03.007
    [174] Gunning PW, Hardeman EC, Lappalainen P, et al. (2015) Tropomyosin-master regulator of actin filament function in the cytoskeleton. J Cell Sci 128: 2965–2974. doi: 10.1242/jcs.172502
    [175] Blanchoin L, Boujemaa-Paterski R, Sykes C, et al. (2014) Actin dynamics, architecture, and mechanics in cell motility. Physiol Rev 94: 235–263. doi: 10.1152/physrev.00018.2013
    [176] Khatau SB, Hale CM, Stewart-Hutchinson PJ, et al. (2009) A perinuclear actin cap regulates nuclear shape. Proc Natl Acad Sci USA 106: 19017–19022. doi: 10.1073/pnas.0908686106
    [177] Krause M, te Riet J, Wolf K (2013) Probing the compressibility of tumor cell nuclei by combined atomic force-confocal microscopy. Phys Biol 10: 065002. doi: 10.1088/1478-3975/10/6/065002
    [178] Thiam HR, Vargas P, Carpi N, et al. (2016) Perinuclear Arp2/3-driven actin polymerization enables nuclear deformation to facilitate cell migration through complex environments. Nat Commun 7: 10997. doi: 10.1038/ncomms10997
    [179] Kim DH, Cho S, Wirtz D (2014) Tight coupling between nucleus and cell migration through the perinuclear actin cap. J Cell Sci 127: 2528–2541. doi: 10.1242/jcs.144345
    [180] Gundersen GG, Worman HJ (2013) Nuclear positioning. Cell 152: 1376–1389. doi: 10.1016/j.cell.2013.02.031
    [181] Maninova M, Vomastek T (2016) Dorsal stress fibers, transverse actin arcs, and perinuclear actin fibers form an interconnected network that induces nuclear movement in polarizing fibroblasts. FEBS J 283: 3676–3693. doi: 10.1111/febs.13836
    [182] Luxton GWG, Gundersen GG (2011) Orientation and function of the nuclear-centrosomal axis during cell migration. Curr Opin Cell Biol 23: 579–588. doi: 10.1016/j.ceb.2011.08.001
    [183] Dupin I, Etienne-Manneville S (2011) Nuclear positioning: mechanisms and functions. Int J Biochem Cell Biol 43: 1698–707. doi: 10.1016/j.biocel.2011.09.004
    [184] Isermann P, Lammerding J (2013) Nuclear mechanics and mechanotransduction in health and disease. Curr Biol 23: R1113–R1121. doi: 10.1016/j.cub.2013.11.009
    [185] Luxton GW, Gomes ER, Folker ES, et al. (2010) Linear arrays of nuclear envelope proteins harness retrograde actin flow for nuclear movement. Science 329: 956–959. doi: 10.1126/science.1189072
    [186] Steinbock FA, Wiche G (1999) Plectin: a cytolinker by design. Biol Chem 380: 151–158.
    [187] Mierke CT, Kollmannsberger P, Zitterbart DP, et al. (2008) Mechano-coupling and regulation of contractility by the vinculin tail domain. Biophys J 94: 661–670. doi: 10.1529/biophysj.107.108472
    [188] Mierke CT (2013) Phagocytized beads reduce the α5β1 integrin facilitated invasiveness of cancer cells by regulating cellular stiffness. Cell Biochem Biophys 66: 599–622. doi: 10.1007/s12013-012-9506-3
    [189] Maniotis AJ, Chen CS, Ingber DE (1997) Demonstration of mechanical connections between integrins, cytoskeletal filaments, and nucleoplasm that stabilize nuclear structure. Proc Natl Acad Sci USA 94: 849–854. doi: 10.1073/pnas.94.3.849
    [190] Brosig M, Ferralli J, Gelman L, et al. (2010) Interfering with the connection between the nucleus and the cytoskeleton affects nuclear rotation, mechanotransduction and myogenesis. Int J Biochem Cell Biol 42: 1717–1728. doi: 10.1016/j.biocel.2010.07.001
    [191] Levy JR, Holzbaur ELF (2008) Dynein drives nuclear rotation during forward progression of motile fibroblasts. J Cell Sci 121: 3187–3195. doi: 10.1242/jcs.033878
    [192] Vicente-Manzanares M, Zareno J, Whitmore L, et al. (2007) Regulation of protrusion, adhesion dynamics, and polarity by myosins IIA and IIB in migrating cells. J Cell Biol 176: 573–580. doi: 10.1083/jcb.200612043
    [193] Kim DH, Chambliss AB, Wirtz D (2013) The multi-faceted role of the actin cap in cellular mechanosensation and mechanotransduction. Soft Matter 9: 5516–5523. doi: 10.1039/c3sm50798j
    [194] Kim DH, Khatau SB, Feng YF, et al. (2012) Actin cap associated focal adhesions and their distinct role in cellular mechanosensing. Sci Rep 2: 555. doi: 10.1038/srep00555
    [195] Chaffer CL, Weinberg RA (2011) A perspective on cancer cell metastasis. Science 331: 1559–1564. doi: 10.1126/science.1203543
    [196] Gupta GP, Massague J (2006) Cancer metastasis: building a framework. Cell 127: 679–695. doi: 10.1016/j.cell.2006.11.001
    [197] Thiery JP, Acloque H, Huang RY, et al. (2009) Epithelial-mesenchymal transitions in development and disease. Cell 139: 871–890. doi: 10.1016/j.cell.2009.11.007
    [198] Wirtz D, Konstantopoulos K, Searson PC (2011) The physics of cancer: the role of physical interactions and mechanical forces in metastasis. Nat Rev Cancer 11: 512–522. doi: 10.1038/nrc3080
    [199] Starr DA, Fridolfsson HN (2010) Interactions between nuclei and the cytoskeleton are mediated by SUN-KASH nuclear-envelope bridges. Annu Rev Cell Dev Biol 26: 421–444. doi: 10.1146/annurev-cellbio-100109-104037
    [200] Nagayama K, Yamazaki S, Yahiro Y, et al. (2014) Estimation of the mechanical connection between apical stress fibers and the nucleus in vascular smooth muscle cells cultured on a substrate. J Biomech 47: 1422–1429. doi: 10.1016/j.jbiomech.2014.01.042
    [201] Vishavkarma R, Raghavan S, Kuyyamudi C, et al. (2014) Role of actin filaments in correlating nuclear shape and cell spreading. PLoS One 9: e107895. doi: 10.1371/journal.pone.0107895
    [202] Chambliss AB, Khatau SB, Erdenberger N, et al. (2013) The LINC-anchored actin cap connects the extracellular milieu to the nucleus for ultrafast mechanotransduction. Sci Rep 3: 1087. doi: 10.1038/srep01087
    [203] Lin HH, Lin HK, Lin IH, et al. (2015) Mechanical phenotype of cancer cells: cell softening and loss of stiffness sensing. Oncotarget 6: 20946–20958. doi: 10.18632/oncotarget.4173
    [204] Tamiello C, Bouten CV, Baaijens FP (2015) Competition between cap and basal actin fiber orientation in cells subjected to contact guidance and cyclic strain. Sci Rep 5: 8752. doi: 10.1038/srep08752
    [205] Berg HC (1993) Random Walks in Biology, Princeton: Princeton University Press.
    [206] Köppen M, Fernandez BG, Carvalho L, et al. (2006) Coordinated cell-shape changes control epithelial movement in zebrafish and Drosophila. Development 133: 2671–2681. doi: 10.1242/dev.02439
    [207] Bretscher MS (2008) On the shape of migrating cells-a 'front-to-back' model. J Cell Sci 121: 2625–2628. doi: 10.1242/jcs.031120
    [208] Horwitz R, Webb D (2003) Cell migration. Curr Biol 13: R756–R759. doi: 10.1016/j.cub.2003.09.014
    [209] Morris NR (2000) Nuclear migration. From fungi to the mammalian brain. J Cell Biol 148: 1097–1102.
    [210] Petrie R, Doyle AD, Yamada KM (2009) Random versus directionally persistent cell migration. Nat Rev Mol Cell Biol 10: 538–549. doi: 10.1038/nrm2729
    [211] Cadot B, Gache V, Vasyutina E, et al. (2012) Nuclear movement during myotube formation is microtubule and dynein dependent and is regulated by Cdc42, Par6 and Par3. EMBO Rep 13: 741–749. doi: 10.1038/embor.2012.89
    [212] Lee JSH, Chang MI, Tseng Y, et al. (2005) Cdc42 mediates nucleus movement and MTOC polarization in Swiss 3T3 fibroblasts under mechanical shear stress. Mol Biol Cell 16: 871–880.
    [213] Umeshima H, Hirano T, Kengaku M (2007) Microtubule-based nuclear movement occurs independently of centrosome positioning in migrating neurons. Proc Natl Acad Sci USA 104: 16182–16187. doi: 10.1073/pnas.0708047104
    [214] Wilson MH, Holzbaur EL (2012) Opposing microtubule motors drive robust nuclear dynamics in developing muscle cells. J Cell Sci 125: 4158–4169. doi: 10.1242/jcs.108688
    [215] Li R, Gundersen GG (2008) Beyond polymer polarity: how the cytoskeleton builds a polarized cell. Nat Rev Mol Cell Biol 9: 860–873. doi: 10.1038/nrm2522
    [216] Ostlund C, Folker ES, Choi JC, et al. (2009) Dynamics and molecular interactions of linker of nucleoskeleton and cytoskeleton (LINC) complex proteins. J Cell Sci 122: 4099–4108. doi: 10.1242/jcs.057075
    [217] Khatau SB, Bloom RJ, Bajpai S, et al. (2012) The distinct roles of the nucleus and nucleus-cytoskeleton connections in three-dimensional cell migration. Sci Rep 2: 488. doi: 10.1038/srep00488
    [218] Maninova M, Caslavsky J, Vomastek T (2017) The assembly and function of perinuclear actin cap in migrating cells. Protoplasma 254: 1207–1218. doi: 10.1007/s00709-017-1077-0
    [219] Gay O, Gilquin B, Nakamura F, et al. (2011) RefilinB (FAM101B) targets FilaminA to organize perinuclear actin networks and regulates nuclear shape. Proc Natl Acad Sci USA 108: 11464–11469. doi: 10.1073/pnas.1104211108
    [220] Capell BC, Collins FS (2006) Human laminopathies: nuclei gone genetically awry. Nat Rev Genet 7: 940–952. doi: 10.1038/nrg1906
    [221] Khatau SB, Kim DH, Hale CM, et al. (2010) The perinuclear actin cap in health and disease. Nucleus 1: 337–342. doi: 10.4161/nucl.1.4.12331
    [222] Mogilner A, Keren K (2009) The shape of motile cells. Curr Biol 19: R762–R771. doi: 10.1016/j.cub.2009.06.053
    [223] Maninova M, Iwanicki MP, Vomastek T (2014) Emerging role for nuclear rotation and orientation in cell migration. Cell Adh Migr 8: 42–48. doi: 10.4161/cam.27761
    [224] Watanabe N, Sekine T, Takagi M, et al. (2005) Deficiency in chromosome congression by the inhibition of Plk1 polo box domain-dependent recognition. J Biol Chem 284: 2344–2353.
    [225] Chung CY, Lee S, Briscoe C, et al. (2000) Role of Rac in controlling the actin cytoskeleton and chemotaxis in motile cells. Proc Natl Acad Sci USA 97: 5225–5230. doi: 10.1073/pnas.97.10.5225
    [226] Danowski BA, Khodjakov A, Wadsworth P (2001) Centrosome behavior in motile HGF-treated PtK2 cells expressing GFP-gamma tubulin. Cell Motil Cytoskel 50: 59–68. doi: 10.1002/cm.1041
    [227] Desai RA, Gopal SB, Chen S, et al. (2013) Contact inhibition of locomotion probabilities drive solitary versus collective cell migration. J R Soc Interface 10: 20130717. doi: 10.1098/rsif.2013.0717
    [228] Niu MY, Mills JC, Nachmias VT (1997) Development of polarity in human erythroleukemia cells: roles of membrane ruffling and the centrosome. Cell Motil Cytoskel 36: 203–215. doi: 10.1002/(SICI)1097-0169(1997)36:3<203::AID-CM1>3.0.CO;2-8
    [229] Pouthas F, Girard P, Lecaudey V, et al. (2008) In migrating cells, the Golgi complex and the position of the centrosome depend on geometrical constraints of the substratum. J Cell Sci 121: 2406–2414. doi: 10.1242/jcs.026849
    [230] Ueda M, Gräf R, MacWilliams HK, et al. (1997) Centrosome positioning and directionality of cell movements. Proc Natl Acad Sci USA 94: 9674–9678. doi: 10.1073/pnas.94.18.9674
    [231] Yvon AM, Walker JW, Danowski B, et al. (2002) Centrosome reorientation in wound-edge cells is cell type specific. Mol Biol Cell 13: 1871–1880. doi: 10.1091/mbc.01-11-0539
    [232] Jiang X, Bruzewicz DA, Wong AP, et al. (2005) Directing cell migration with asymmetric micropatterns. Proc Natl Acad Sci USA 102: 975–978. doi: 10.1073/pnas.0408954102
    [233] Hale CM, Chen WC, Khatau SB, et al. (2011) SMRT analysis of MTOC and nuclear positioning reveals the role of EB1 and LIC1 in single-cell polarization. J Cell Sci 124: 4267–4285. doi: 10.1242/jcs.091231
    [234] Denais CM, Gilbert RM, Isermann P, et al. (2016) Nuclear envelope rupture and repair during cancer cell migration. Science 352: 353–358. doi: 10.1126/science.aad7297
    [235] Raab M, Gentili M, de Belly H, et al. (2016) ESCRT III repairs nuclear envelope ruptures during cell migration to limit DNA damage and cell death. Science 352: 359–362. doi: 10.1126/science.aad7611
    [236] Irianto J, Xia Y, Pfeifer CR, et al. (2017) DNA damage follows repair factor depletion and portends genome variation in cancer cells after pore migration. Curr Biol 27: 210–223. doi: 10.1016/j.cub.2016.11.049
    [237] LeBerre M, Aubertin J, Piel M (2012) Fine control of nuclear confinement identifies a threshold deformation leading to lamina rupture and induction of specific genes. Integr Biol 4: 1406–1414. doi: 10.1039/c2ib20056b
    [238] Hatch EM, Hetzer MW (2016) Nuclear envelope rupture is induced by actin-based nucleus confinement. J Cell Biol 215: 27–36. doi: 10.1083/jcb.201603053
    [239] Skau CT, Fischer RS, Gurel P, et al. (2016) FMN2 makes perinuclear actin to protect nuclei during confined migration and promote metastasis. Cell 167: 1571–1585. doi: 10.1016/j.cell.2016.10.023
  • 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
  • © 2017 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)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(13230) PDF downloads(3049) Cited by(6)

Figures and Tables

Figures(8)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog