Next Article in Journal
Review on Melt Electrowriting Modelling and Applications
Previous Article in Journal
Magnetic Measurements of a Stator Core Under Manufacturing Influences and the Impacts on the Design Process of a Reluctance Synchronous Machine
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Review

Scheduling in Remanufacturing Systems: A Bibliometric and Systematic Review

1
Key Laboratory of Expressway Construction Machinery of Shaanxi Province, Chang’an University, Xi’an 710064, China
2
School of Intelligent Manufacturing Ecosystem, Xi’an Jiaotong-Liverpool University, Suzhou 215123, China
3
College of Engineering, Anhui Agricultural University, Hefei 230036, China
4
School of Engineering, University of Liverpool, Liverpool L69 7ZX, UK
5
Smart & Sustainable Manufacturing Systems Laboratory (SMART LAB), Department of Mechanical Engineering, University of Alberta, Edmonton, AB T6G 1H9, Canada
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Machines 2025, 13(9), 762; https://doi.org/10.3390/machines13090762
Submission received: 6 July 2025 / Revised: 13 August 2025 / Accepted: 20 August 2025 / Published: 25 August 2025

Abstract

Global ambitions for net-zero emissions and resource circularity are propelling industry from linear “make-use-dispose”models toward closed-loop value creation. Remanufacturing, which aims to restore end-of-life products to a “like-new” condition, plays a central role in this transition. However, its stochastic inputs and complex, multi-stage processes pose significant challenges to traditional production planning methods. This study delivers an integrated overview of remanufacturing scheduling by combining a systematic bibliometric review of 190 publications (2005–2025) with a critical synthesis of modelling approaches and enabling technologies. The bibliometric results reveal five thematic clusters and a 14% annual growth rate, highlighting a shift from deterministic, shop-floor-focused models to uncertainty-aware, sustainability-oriented frameworks. The scheduling problems are formalised to capture features arising from variable core quality, multi-phase precedence, and carbon reduction goals, in both centralised and cloud-based systems. Advances in human–robot disassembly, vision-based inspection, hybrid repair, and digital testing demonstrate feedback-rich environments that increasingly integrate planning and execution. A comparative analysis shows that, while mixed-integer programming and metaheuristics perform well in small static settings, dynamic and large-scale contexts benefit from reinforcement learning and hybrid decomposition models. Finally, future directions for dynamic, collaborative, carbon-conscious, and digital-twin-driven scheduling are outlined and investigated.

1. Introduction

Global commitments to carbon-neutral growth, coupled with tightening resource constraints, are accelerating the transition from linear “make-use-dispose” production to closed-loop value creation. As a strategy for restoring end-of-life (EOL) products to their original performance, remanufacturing plays a pivotal role in this transition. It preserves the embodied energy of initial manufacture, reduces raw-material demand by up to 85%, and can shrink life-cycle greenhouse-gas emissions by 50% or more [1]. Market projections show the European remanufacturing sector alone surpassing €100 billion by 2030 [2], and the Chinese government has outlined a target to reach a remanufacturing industry output value of 200 billion RMB during the 14th Five-Year Plan period [3]. Therefore, governments have increasingly considered remanufacturing as a lever for high-quality employment and industrial resilience. To fully exploit these benefits, sophisticated planning systems are essential to effectively address the variability, uncertainty, and multi-stage characteristics of remanufacturing processes.
A typical remanufacturing chain comprises five tightly coupled stages: disassembly, inspection, reprocessing, reassembly, and final testing [4,5]. Unlike conventional manufacturing, each returned core may follow a bespoke route, driven by its unique quality state and customer requirements. Scheduling, therefore, becomes the “control centre” of the remanufacturing shop: it must allocate heterogeneous resources, synchronise serial and parallel flows, respect precedence constraints, and react to stochastic arrivals and machine disruptions, under cost-, energy-, and carbon-reduction targets. In distributed or cloud-based ecosystems, the challenge intensifies: tasks, resources, and data can be geographically dispersed and virtually orchestrated, demanding new optimisation paradigms [6].
Although academic output has grown steadily, with more than 190 publications between 2005 and 2025, the knowledge base remains fragmented. Prior reviews focus on isolated topics and seldom contrast centralised versus distributed architectures [7,8,9]. Energy- and carbon-aware objectives, quality uncertainty, and large-scale industrial instances are under-explored, while no study has combined bibliometric mapping with an in-depth methodological synthesis. To close these gaps, the contributions of this study are listed as follows:
  • Map the intellectual landscape by analysing 20 years of publications, unveiling thematic clusters and temporal trends;
  • Formalise the scheduling problem and highlight how stochastic core quality, multi-phase precedence, and sustainability targets differentiate it from conventional manufacturing;
  • Link processes and technologies to the constraints they impose on scheduling;
  • Compare modelling and solution methods for both centralised shop-floor systems and emerging cloud-based, distributed ecosystems;
  • Identify unresolved challenges in dynamic, collaborative, large-scale, carbon-aware, and digital-twin-driven scheduling, outlining a future research agenda.
The rest of the paper is structured as follows. Section 2 presents the bibliometric landscape of remanufacturing scheduling. Section 3 formalises the scheduling problem and distinguishes key system features. Section 4 reviews enabling processes and technologies that shape scheduling constraints. Section 5 and Section 6 synthesise modelling frameworks and algorithms for centralised and decentralised remanufacturing systems, respectively. Section 7 synthesises research gaps and future directions, and Section 8 concludes the study.

2. Bibliometric Landscape of Remanufacturing Scheduling

The motivation of this paper is to provide an up-to-date review of the development of remanufacturing scheduling. A combined-review method was employed, covering data acquisition, bibliometric analysis, and a systematic review. The overview of the proposed research method is shown in Figure 1. Scopus is applied to collect data, complemented with a manual screening of the literature to ensure the inclusion of high-quality and pertinent documents. The bibliometric analysis is then conducted using a software tool, VOSviewer, to show the publication analysis, keyword co-occurrence analysis, and overlay visualisation analysis. These analyses provide insights into the research topics, future trends, application areas, and knowledge domains within the field of remanufacturing scheduling, thereby offering a comprehensive overview of the current state and potential directions of research in remanufacturing scheduling.

2.1. Data Collection and Search Protocol

A comprehensive bibliometric search was carried out in Scopus on 15 February 2025. For this review, the Scopus database was selected as the literature database; comparative studies show Scopus indexes a broader range of engineering and operations-management journals than Web of Science (WoS) [10]. Many breakthrough algorithms in remanufacturing scheduling first appear in conference series such as Procedia CIRP and IEEE ICIT, which are comprehensively covered by Scopus but only partially by WoS. The Boolean expression (“remanufactur*”) AND (“schedul*”) was applied to titles, abstracts, and indexed keywords from 2005 to 2025, returning 298 records. And the full format of querying keywords was selected as (“remanufacturing” or “end-of-life” or “life cycle”) and (“scheduling” or “optimization”). The screening process is shown in Figure 2: During the initial screening phase, two independent investigators screened the retrieved records and used the “Remove Duplicates” function of Excel to remove duplicate records. During the content screening phase, the two investigators continued to independently evaluate the title and abstract of each record to determine whether it met the inclusion criteria, excluding those that involved maintenance or logistics without an explicit scheduling component. For records with disagreements, consensus was reached through discussion, and a third expert was consulted when necessary. After the above steps, 190 publications (145 journal articles and 45 conference papers) remained for analysis. The data were processed with VOSviewer 1.6.20. Co-occurrence networks were generated on the basis of keywords, using full counting and a minimum threshold of four occurrences; link strength was measured as the total number of shared occurrences between keyword pairs. In this process, duplicate keywords or keywords with the same meaning were further checked and removed by two independent investigators before the data were imported into VOSviewer to ensure the accuracy of the analysis.

2.2. Publication Output and Source Profile

Figure 3 shows a marked upward trajectory in annual output: from only two papers in 2005, the field expanded to 22 papers in 2024, corresponding to an average annual growth rate of approximately 10.5%. The citation count shows a steady upward trajectory, accelerating markedly after 2015 and peaking in 2020. Research is concentrated in a small group of operations management and sustainability journals. The Journal of Cleaner Production, the International Journal of Production Research, and Computers & Industrial Engineering each published nine articles across the period, while a further 20 journals, including the European Journal of Operational Research, the Journal of Manufacturing Systems, and Resources, Conservation and Recycling, which account for the next 60% of journal publications (Table 1). The presence of 45 conference papers, most of them in IEEE or ASME proceedings, indicates a growing interest in the cyber–physical implementation of scheduling models.

2.3. Thematic Structure of the Field

The co-occurrence map in Figure 4 organises 48 high-frequency co-occurring keywords into five colour-coded clusters. The clustering resolution is set to 1.0, and the minimum-occurrence threshold is set to 4. These settings ensure that only keywords appearing at least 4 times in the dataset are included in the analysis, revealing the intellectual architecture of remanufacturing scheduling research over the past two decades. Serving as the main topic of the network, a dense red cluster anchors the field, it is dominated by the terms remanufacturing, scheduling, remanufacturing system, multi-objective optimization, and process planning, and it is linked by the highest cumulative link strength. Publications in this core strand concentrate on formulating shop-floor scheduling models, typically mixed-integer programmes or classical meta-heuristics, that integrate disassembly, reprocessing, and reassembly within a single facility and frequently pursue multi-objective optimisation of makespan, cost, and, to a lesser extent, energy. The red cluster also contains reinforcement learning, particle swarm optimisation, genetic algorithms, uncertainty, and remanufacturing scheduling. Its composition signals an emergent line of inquiry that blends data-driven or nature-inspired search techniques with stochastic modelling to cope with the quality variability and real-time disturbances characteristic of remanufacturing operations.
Radiating from remanufacturing scheduling are four more specialised clusters. To the upper right, a yellow cluster connects inventory control, recycling, stochastic systems, and life cycle. This cluster emphasises the importance of inventory control and recycling processes in the decision-making and scheduling of remanufacturing. Directly upon the red cluster lies a compact green cluster built around flexible job-shop scheduling and fuzzy processing time. Studies here address low-volume, high-variety contexts in which operations may be routed through alternative machines and processing times are imprecise; the cluster’s relative isolation underlines the methodological specificity of flexible job-shop research.
On the right-hand side, a purple cluster connects reverse logistics, numerical methods, operation research, returns, and costs. This strand shifts the analytical lens beyond the factory gate, embedding scheduling decisions within wider closed-loop supply chain considerations such as take-back systems, inventory positioning, and transport lead times. Finally, a blue cluster occupies the map centre, linking circular economy, production control, sustainable development, and supply chains. Although less densely connected, its presence indicates a growing tendency to situate scheduling research within broader sustainability and stakeholder-value narratives.
A visual inspection of the network shows several thematic groups that are clearly distinct yet still interconnected. At the main research topic, the red cluster functions as the methodological hub, while the surrounding clusters contribute algorithmic innovations, broaden the application contexts, and introduce sustainability motivations. Overall, the pattern depicts a field that is moving beyond deterministic, shop-floor-focused models toward intelligent, uncertainty-aware scheduling frameworks that integrate supply chain logistics and are evaluated against circular-economy goals.

2.4. Temporal Evolution of Research Topics

The network of keyword-age overlay visualization is shown in Figure 5, derived from the average publication year of every term in the co-occurrence network, which reveals a four-stage trajectory for remanufacturing scheduling scholarship over the period of 2005–2025.

2.4.1. Stage 1: Foundational Modelling (2005–2013)

Early research concentrated on translating classical flow-shop and job-shop formulations to remanufacturing environments, solved via exact methods [12], while treating reverse logistics as an exogenous, static supply source whose uncertain returns were reduced to fixed average rates through deterministic integer programming, turning them into predictable inputs, rather than stochastic variables coupled with real-time shop-floor decisions. Key terms (e.g., integer programming, makespan, and production control) reflect a deterministic, single-objective approach, with no explicit consideration of sustainability or digitalisation.

2.4.2. Stage 2: Heuristic Enrichment and First Sustainability Signals (2014–2018)

From 2013 onward, metaheuristic search [13] enters the scene: genetic algorithms and simulated annealing become common approaches, and the first scattered mentions of sustainable development appear. This phase thus marks a methodological broadening, away from pure integer models, while simultaneously planting the seeds of an environmental agenda.

2.4.3. Stage 3: Flexibility and Multi-Objective Optimisation (2018–2022)

Driven by Industry 4.0, researchers begin to redefine the shop floor as a flexible job-shop with alternative routings and competing criteria. Terms such as flexible job-shop scheduling [14], multi-objective optimisation [15], and energy utilisation [16] move toward the semantic core of the field; publication counts accelerate sharply, confirming that these years constitute a quantitative and thematic inflexion point.

2.4.4. Stage 4: Data-Driven, Uncertainty-Aware Decision Making (2022–2025)

The most recent literature emphasises uncertainty, process planning, energy consumption, and reinforcement learning. Their late average dates (2022–2023) and rapidly rising link strengths indicate a decisive shift toward real-time, dynamic optimisation. The spotlight on uncertainty reflects the recognition that core quality, disassembly yields, and machine availability fluctuate stochastically and must, therefore, be modelled explicitly to ensure schedule robustness [17]. The growing prominence of integrated process planning suggests an effort to collapse off-line route design and on-line dispatching into a single integrated problem, improving resource utilisation and responsiveness [4]. Finally, the arrival of reinforcement learning signals the adoption of algorithms that learn optimal scheduling policies through continuous interaction with the production environment; recent studies report significant gains in large-scale or flexible job-shop contexts [18,19].
In summary, the bibliometric analysis reveals a clear shift of remanufacturing scheduling from deterministic, shop-centric optimisation to a research agenda focused on stochastic modelling, AI-driven control, and sustainability metrics. This evolution provides the foundation for the methodological reviews discussed in the remainder of this paper. Specifically, the meta-heuristics reported in Figure 4, such as particle swarm optimisation (PSO) and genetic algorithm (GA), are well-established population-based techniques belonging to computational intelligence (CI), a recognised subfield of artificial intelligence (AI). In addition, the emerging trend of reinforcement learning (RL) is explicitly rooted in machine learning (ML) and, therefore, firmly situated within the broader AI domain. With respect to “stochastic”, the keyword cluster encompasses stochastic systems and fuzzy processing times, reflecting the growing interest in handling uncertainty and variability in remanufacturing scheduling environment. Regarding “carbon”, the term denotes carbon-emission consumption as an optimisation objective. This indicator is typically integrated with other criteria such as makespan and total energy consumption to construct multi-objective optimisation problems in remanufacturing scheduling for sustainable development. The bibliometric analysis has unveiled the evolving landscape of remanufacturing scheduling, highlighting the increasing integration of advanced techniques and sustainability considerations. This sets the foundation for a detailed exploration of the problem definition and distinctive scheduling features that characterise this complex field.

3. Problem Definition and Distinctive Scheduling Features

Remanufacturing scheduling is defined as the allocation of heterogeneous resources to the sequence of tasks required to restore EoL products to a “like-new” condition. The problem differs fundamentally from its conventional manufacturing in three respects: (i) the quality and quantity of incoming cores are stochastic, rather than deterministic; (ii) a full product may traverse disassembly, inspection, reprocessing, reassembly, and final testing, yielding multi-level precedence relations; and (iii) value is created not only via throughput and cost reduction but also through material recovery and carbon abatement. To formalise subsequent discussions, this study first distinguished two system archetypes and then outlined the prevailing constraints and objective functions, concluding with a comparison to traditional manufacturing scheduling.

3.1. System Typology

In a centralised setting, all macroscopic phases are co-located within a single facility. A typical centralised remanufacturing system consists of three stages: a disassembly shop, a reprocessing shop, and a reassembly shop [20]. Disassembly, reprocessing, and reassembly operations share common physical resources; transportation delays between stages are, therefore, negligible, yet resource contention is acute. A crucial principle to adhere to is that the remanufacturing tasks across these three stages must be executed in a prioritised sequence [21,22]. Given the heterogeneity of reprocessing requirements, centralised remanufacturing systems fall into two configurations: (i) flow-shop remanufacturing systems suited to high-volume, low-variety returns, and (ii) job-shop remanufacturing systems designed for low-volume, high-variety returns [14]. Uncertainty manifests primarily as variable processing times, stochastic machine failures, and the heterogeneous quality of incoming cores, which influences route selection and processing requirements [23].
Distributed or cloud-enabled systems virtualise remanufacturing resources across geographically dispersed service providers. Tasks (or task fragments) are published to a cloud platform that orchestrates service composition, resource reservation, and data exchange. Figure 6 illustrates a typical cloud-remanufacturing architecture [6], where physical capacities owned by multiple companies or individuals are virtualised and exposed as services through a central platform. Customers submit repair or refurbishment requests, which are matched by the cloud service broker to suitable providers according to platform policies, current market demand, and negotiated service-level agreements. The broker then decomposes each request into elementary activities, reserves the required resources, and coordinates data exchange until results are returned to the customer.
Within this setting, scheduling is a two-dimensional problem. In addition to establishing the temporal sequence of disassembly, reprocessing, and reassembly operations, the scheduler must select an optimal spatial allocation across geographically dispersed providers. Traditional precedence and component-matching constraints remain in force, but new considerations emerge: inter-site transit times, heterogeneous pricing schemes, contractual quality clauses, and network latency for real-time data transfer [24,25,26]. Because provider capabilities and inspection standards vary widely, quality uncertainty propagates through the system, making dynamic, quality-aware task reassignment an essential feature of any practical scheduling algorithm.

3.2. Typical Constraints and Objective Functions

Across both archetypes, four classes of constraints can be identified. (i) Precedence constraints enforce the overall sequence of disassembly, inspection, reprocessing, reassembly, and testing, along with the technological order of sub-operations within each phase. (ii) Component-matching constraints ensure that reassembly begins only when every required part has cleared inspection or reprocessing [14]. (iii) Resource-capacity constraints stipulate that a machine or service can process at most one task at a time (or, in the distributed case, up to its declared capacity). (iv) Quality-conformance constraints require that each component’s post-processing quality exceeds a target level before it can move to the next phase [27].
Across the 190-paper corpus, objective functions coalesce into four broad themes (as shown in Table 2). Time-performance metrics, including makespan, total flow time, or aggregate tardiness, appear in 78 studies, making them the single most frequent criterion, especially in early work that adapted classic flow-shop and job-shop formulations to remanufacturing settings. Economic objectives are addressed in 56 papers; these models minimise a composite cost that typically spans disassembly, re-processing, transportation and inventory holding. Beginning in 2017, a surge of interest in sustainability introduced energy and carbon indicators, now present in 43 papers that quantify electricity use or carbon emissions at the machine or system level. Finally, 22 papers incorporate service-quality terms, including due-date compliance, customer satisfaction, or the reliability of the remanufactured product, reflecting the industry’s shift toward service contracts and cloud brokerage. Since 2017, authors have increasingly combined these metrics in multi-objective formulations that search for Pareto-optimal trade-offs among time, cost, and energy; 65 papers (34% of the corpus) adopt such an approach. The trend confirms that contemporary research views remanufacturing scheduling as a multi-criteria decision problem, rather than a single-target optimisation task.

3.3. Comprehensive Analysis Method

In this systematic review, due to the lack of unified benchmarks and datasets in the field of remanufacturing scheduling, the data formats and contents reported in the studies varied greatly. This resulted in the inability to effectively perform data transformation or impute missing summary statistics, which limited the ability to conduct quantitative synthesis. Therefore, a qualitative synthesis approach was adopted to summarise the research results through descriptive analysis and explore the trade-offs between different methods in single or multiple optimisation objectives (such as makespan, cost, and energy consumption). In addition, due to the differences in data formats, data transformation or imputation of missing summary statistics was not possible, which further limited the ability to conduct a quantitative synthesis. Nevertheless, by recording the intervention characteristics and outcomes of each study in detail, the transparency and traceability of the research results were ensured to minimise the risk of bias.

3.4. Key Differences from Traditional Manufacturing Scheduling

Relative to new-product manufacturing, remanufacturing scheduling introduces three additional layers of complexity. First, input variability is inherent [17,23,38]: the processing route and time for each task depend on the inspected condition of its core and, hence, must be decided concurrently with scheduling, rather than assumed upfront. Second, reverse-flow coupling links forward production activities to reverse-logistics and disassembly outputs, generating a many-to-one mapping between tasks and final assemblies that is absent in virgin production lines [46]. Third, sustainability objectives elevate energy consumption, material recovery, and carbon footprint to first-class optimisation criteria, alongside the classic measures of throughput and cost [42,47]. These distinctive features necessitate integrated models that combine process planning, quality assessment, and real-time control.

4. Remanufacturing Processes and Enabling Technologies

Remanufacturing restores an EOL product to at least its original performance by guiding it through five tightly linked macroscopic phases: disassembly, inspection, reprocessing, reassembly and final testing. Each phase introduces unique constraints, decision variables, and feedback signals to the scheduling layer. Figure 7 summarises their bilateral interactions: schedules determine the temporal order and resource allocation of phase-level tasks, while the data generated inside each phase recursively reshape subsequent schedules.

4.1. Disassembly Technologies

The disassembly shop separates the returned core into modules or individual parts, aiming to recover as much residual value as possible. Manual operations dominated early lines, but today, hybrid human-robot cells equipped with force-torque sensors and vision guidance are increasingly common [48]. Related research focuses on automatic fixture recognition [49], collision-free path planning [48], and a real-time balance of multi-station disassembly lines [50]. The problem is, therefore, a miniature scheduling task in its own right, often cast as a disassembly sequencing or line-balancing optimisation [51,52]. If the global scheduler overlooks the internal sequencing logic, it may result in downstream bottlenecks due to part mixes that violate component-matching rules or due-date requirements.
Contemporary research on disassembly line balancing incorporates multiple objectives beyond cycle time, including tooling cost, ergonomic risk, and hazardous material exposure. As illustrated in Figure 8a, Meng et al. [51] studied the disassembly line balance problem for remanufacturing systems with the consideration of several different types of failures and material hazards, and they adopted the multi-objective non-dominated sorting genetic algorithm (NSGA) II to obtain the optimised disassembly task sequences. According to Figure 8b, Xu et al. also [53] proposed a discrete bees algorithm for disassembly sequence planning in the remanufacturing environment, which considers human–robot collaboration. Errington et al. [54] developed an economic model to support the decision-making processes in the robotic disassembly tasks. Different recovery options, including reuse, remanufacturing, recycling, and disposal, can be reasonably selected according to the calculated economic outputs.

4.2. Inspection and Quality Assessment

Immediately after disassembly, each component is classified into reuse, repair, or discard categories. Traditional template matching and statistical sampling are being replaced with high-resolution X-ray CT, laser profilometry, and hyperspectral imaging linked to machine learning classifiers [55]. For example, Imam et al. [56] devised a vision-based robotic laser-cladding repair cell that integrates deep learning damage localisation with 3D scanning, enabling the autonomous restoration of fixed bends and reducing repair time by more than 63%. Hao et al. [57] developed an adaptive failure-feature identification and mixed case-based reasoning/rule-based reasoning process-planning framework that couples hybrid additive-subtractive tool-path generation, allowing multi-defect turbine blades to be remanufactured efficiently and cost-effectively. Saiz et al. [58] designed an automated inspection and classification system (Figure 9) for remanufacturing automotive components, utilising the deep learning model which combined DeepLabV3+ and YOLOv5. Through the ensemble learning of the combined model, it achieves the efficient detection and classification of surface wear on automotive parts, achieving an accuracy of 93.33% and significantly improving inspection performance.

4.3. Reprocessing Technologies

Reprocessing is a series of remanufacturing processes that can restore the appearance, reliability, and service performance of the disassembled components with various types of defects. In this section, the research progress of three representative reprocessing processes will be presented: (a) cleaning; (b) additive/subtractive repair; and (c) surface modification.

4.3.1. Cleaning

Cleaning is a critical first step in reprocessing because residual oil, grease, corrosion products, and particulates can compromise every downstream operation. Li et al. [59] demonstrated an environmentally benign route in which super-critical carbon dioxide (SCCO2) dissolves lubricant films on returned aluminium engine parts, achieving equivalent cleanliness to alkaline baths without solvent disposal (Figure 10a). Using life-cycle assessment, Peng et al. [60] compared SCCO2 and liquid-blasting against two conventional options—high-temperature pyrolysis and shot-blasting (Figure 10b). Their results place high-temperature decomposition as the most polluting option, followed by SCCO2, with shot-blasting and liquid-blasting showing the lowest overall impacts. Taken together, these studies indicate that advanced, low-solvent cleaning technologies can substantially reduce the environmental footprint of remanufacturing while delivering the required surface quality.

4.3.2. Additive/Subtractive Repair

Additive manufacturing (AM) has moved beyond rapid prototyping and is now the principal advanced route for restoring high-value cores. Kanishka and Acherjee [61] reported that laser direct energy deposition (LDED) processes account for almost half (49%) of all AM-based remanufacturing studies; the next most common routes are wire-arc additive manufacturing and additive-subtract hybrid manufacturing. Within LDED, laser cladding is used most frequently because it delivers fast cycle times, low material consumption, reduced labour input, and superior mechanical, as well as corrosion, performance. Liu et al. [62] evaluated the environmental effects of remanufacturing cast iron cylinder head blocks processed via laser cladding, demonstrating that laser cladding can obviously reduce a negative environmental impact, as shown in Figure 11a. Zhu et al. [63] carried out research on remanufacturing methods based on a laser cladding technique for 45 steel gear, and the test results indicate that the remanufactured tooth can essentially regain its look before breaking. As shown in Figure 11b, Kanazawa et al. [64] proposed a laser hardening process based on a laser cladding technique to remanufacture carburised steels, and they found that the proposed method can restore the surface performance of the damaged gears effectively. Li et al. [65] repaired ductile cast iron by filling simulated defects with a Ni-Cu alloy via laser cladding. Among the groove geometries studied, a circular groove combined with cross-hatch cladding produced the lowest residual stresses; the rebuilt zone achieved an ultimate tensile strength of 502 MPa, matching that of the virgin substrate.
Recent research has increasingly turned to hybrid additive–subtractive systems for remanufacturing, as they harness the unique strengths of each technique while compensating for their individual limitations. In practice, machining and grinding already support additive repair in pre- and post-processing; what distinguishes hybrid technology is the integration of both processes on a single, multi-axis platform. This one-setup arrangement eliminates refixturing, preserves geometric references, and shortens the overall lead time, making it particularly attractive for high-precision remanufacturing applications. Jone et al. [66] demonstrated a hybrid manufacturing cell that fuses laser cladding, five-axis machining, and in-process 3-D scanning, enabling the agile, low-waste refurbishment of turbine blades. To localise repair zones automatically, Li et al. [67] generalised the workflow by integrating scanning, model reconstruction, fine registration, and adaptive process selection for arbitrary worn components. Hascoët et al. [68] partially automated the repair loop: defects were first milled into controlled cavities and then refilled via laser metal deposition under optical feedback. Expanding the concept, Newman et al. [69] and Zhu et al. [70] coupled fused-filament fabrication, CNC machining and on-board inspection to transform obsolete or recycled parts into redesigned components with enhanced features. Le et al. [71] introduced feature-based hybrid manufacturing process-planning algorithms and later showed that the hybrid strategy outperforms recycling, casting, and standalone machining in life-cycle impact assessments. Liu et al. [72] proposed a level-set-driven design-for-remanufacturing method that upgrades broken parts through topology-aware hybrid AM-SM operations.
While hybrid additive-subtractive technology greatly enhances remanufacturing flexibility, it also recasts scheduling as a coupled add-cut sequencing problem. Decisions about where to deposit material and when to switch to machining must respect thermal dwell times, tool-change windows, and shared-spindle constraints–dependencies. While standard flow-shop or job-shop models with their assumption of independent stations cannot capture these features. Addressing this gap, Zheng et al. [32] reformulated hybrid process planning as a precedence-constrained sequencing optimisation, embedding a detailed cost model into a branch-and-bound framework. Their cost-driven scheduler simultaneously selects additive and subtractive features, orders them to satisfy geometric and thermal precedence, and outputs a global plan that minimises total remanufacturing cost while meeting accuracy requirements.

4.4. Reassembly Technologies

Reassembly is the final gate in the remanufacturing chain, governing both the utilisation rate of recovered components and the total cost of the operation. Wang et al. [41] modelled reassembly as a component-oriented Markov decision process (MDP); when applied to diesel-engine cores, their policy raised overall system throughput by 40%. Extending the concept, Oh and Behdad [73] formulated a graph-based optimisation that links reassembly with just-in-time procurement. The model introduces two actionable parameters—disposal point and reassembly threshold—allowing managers to decide whether to scrap, reorder, or rebuild a component on the fly (Figure 12). Collectively, these studies show that embedding stochastic control and inventory logic into the reassembly stage can convert what was once a deterministic “bolt-up” step into a dynamic lever for cost and capacity optimisation in remanufacturing scheduling.

4.5. Final Testing Technologies

Final-stage testing is indispensable for ensuring that remanufactured products achieve OEM-level performance. Kernbaum et al. [74] evaluated multiple diagnostic techniques for electronic equipment—most notably signature analysis—and proposed an initial virtual testing platform for printed-circuit boards. Zhang et al. [75] presented a comprehensive review of metal magnetic memory (MMM) testing, demonstrating its international use in predicting the remaining life of remanufacturing cores and detecting fatigue cracks. They further called for a deeper investigation into the micro-physical mechanisms of MMM to sharpen manufacturability assessments for remanufacturing cores.

5. Centralised Remanufacturing Systems

5.1. Process Planning for Centralised Remanufacturing Systems

Remanufacturing process planning involves formulating the process route and scheduling parameters, which directly impact the carbon emissions, makespan, and cost of remanufacturing. Therefore, developing efficient and high-quality process planning is crucial for enhancing the economic and environmental benefits of the remanufacturing industry. Unlike mass-production planning, remanufacturing must contend with the variable quality of end-of-life (EOL) products. This variability introduces significant challenges in production planning and control activities, including the uncertain quality and quantity of the recycled components and the uncertain damage degree of the disassembled components.
To address these uncertainty challenges, researchers have developed various process planning methods for remanufacturing. The first type of process planning method is based on the reliability and failure rate. For instance, Jiang et al. [5] connected remanufactured product reliability with end-of-life failure-rate distributions, while Wang et al. [76] combined damage-characterisation models with an improved genetic–neural hybrid (IGA-ANN) to guide process planning (Figure 13a). These methods aim to ensure that the remanufactured products meet the required reliability standards and reduce the risk of future failures in the long term.
The second type of process planning method is based on knowledge reuse; case-based reasoning (CBR) is a common technique applied in this type. Li et al. [77] proposed an integrated remanufacturing process planning method based on blockchain and CBR, enabling the rapid acquisition of suitable process plans. Wu and Liu [78] proposed an innovative method for fine-grained process retrieval and reuse based on the component models, which enhances the efficiency of the assembly stage in remanufacturing. Jiang et al. [79] developed a hybrid method combining rough sets and CBR for remanufacturing process planning, which improved the efficiency of generating process plans. He et al. [80] further refined this approach using an ontological framework to encode and reuse prior planning knowledge (Figure 13b). Hu et al. [81] extracted and organised remanufacturing disassembly process knowledge from historical data resources and combined it with rule-based reasoning to automatically generate optimal disassembly sequences and solutions. These methods leverage existing knowledge and experience to reduce the time and effort required for process planning in remanufacturing.
The third type of process planning method is based on feature extraction. Le et al. [71] manually derived and applied remanufacturing-specific rules to extract features from hybrid additive-subtractive sequence CAD models (Figure 13c). They also proposed an automatic level-set function method, which was experimentally verified. Zheng and Ahmad [82] developed a cost-driven process planning method for hybrid additive–subtractive remanufacturing. They introduced an automated feature extraction method for additive and subtractive features, transforming the process planning task into a cost-optimisation problem. These methods focus on accurately extracting features from product models to guide process planning and improve the efficiency of remanufacturing.
In summary, the existing research on process planning in remanufacturing has explored various approaches, including reliability and failure rate-based methods, knowledge reuse-based methods, and feature extraction-based methods. Each type of method has its own advantages and contributes to improving the efficiency, quality, and sustainability of remanufacturing processes.
Figure 13. Process planning for remanufacturing: (a) optimisation framework considering fault feature for remanufacturing process planning [76]; (b) integrated remanufacturing process planning generation system [80]; and (c) process planning designing framework of incorporating for additive and subtractive manufacturing technologies [71].
Figure 13. Process planning for remanufacturing: (a) optimisation framework considering fault feature for remanufacturing process planning [76]; (b) integrated remanufacturing process planning generation system [80]; and (c) process planning designing framework of incorporating for additive and subtractive manufacturing technologies [71].
Machines 13 00762 g013

5.2. Shop Floor Scheduling for Centralised Remanufacturing Systems

Regarding remanufacturing scheduling, prior studies classify systems by reprocessing-shop configuration into two types: flow-shop-based RMS (FSRMS) and job-shop-based RMS (JSRMS). In high-volume/low-variety (HVLV) environments, EOL products follow a single, standardised process route, making a flow-shop layout most appropriate [83]. Conversely, in low-volume/high-variety (LVHV) settings, fewer EOL products demand multiple, diverse routing options; here, a job-shop configuration better accommodates the flexibility required to handle complex process paths [84,85].
The FSRMS has attracted significant attention due to its relatively simple structure and high efficiency. Kim et al. [86] developed an integer-programming model for an RMS with parallel flow reprocessing shops and proposed heuristics to minimise total flow time. Building on this, Shi et al. [87] applied a flower-pollination algorithm to a multi-objective RMS scheduling problem—comprising parallel disassembly shops, flow-shop reprocessing lines, and parallel reassembly shops (Figure 14a). More recently, Wang et al. [20] introduced an invasive-weed-optimisation algorithm to simultaneously reduce makespan and energy consumption in a similar FSRMS configuration (Figure 14b). By contrast, early work on job-shop-based RMS (JSRMS) was conducted by Guide et al., who first proposed a drum-buffer-rope scheduling method for remanufacturing [88] and subsequently enhanced it with priority dispatching rules [89]. In 2018, Yu and Lee [14] became the first to optimise the complete RMS scheduling problem, which includes parallel disassembly/reassembly shops and a job-shop reprocessing shop, their study showed that an integrated algorithm outperformed decomposed approaches.
With the shift towards green manufacturing, the importance of energy efficiency in remanufacturing scheduling is becoming increasingly prominent. Optimised production schedules must balance throughput and energy conservation to deliver both economic and social benefits. To improve scheduling efficiency and curb energy use, many researchers have addressed multi-objective problems using exact algorithms. For example, Wei et al. [90] devised an integrated energy-aware approach for FJSP that optimises makespan and energy cost by varying machining speeds. Rakovitis et al. [91] formulated a novel mixed-integer programme with an event-based time representation to minimise energy expenses in FJSP. However, exact methods struggle as the problem size grows. To tackle larger instances, Mokhtari and Hasani [15] employed a variable meta-heuristic algorithm, effectively solving the multi-objective FJSP. Ebrahimi et al. [28] combined ant colony optimisation with simulated annealing to jointly reduce energy costs and total tardiness. Recently, energy-efficient scheduling in remanufacturing has attracted growing academic interest. Zhao et al. [39] cut energy consumption in engine remanufacturing by modelling a fuzzy job-shop schedule and adapting a basic genetic algorithm. Giglio et al. [35] addressed a hybrid energy-aware lot-sizing and scheduling problem for manufacturing/remanufacturing systems using an effective heuristic. More recently, Zhang et al. [42] examined energy-efficient remanufacturing scheduling with a flexible job-shop reprocessing shop, proposing an improved grey wolf optimiser, which guided by a global criterion to minimise both total energy use and completion time.

5.3. Dynamic Scheduling for Centralised Remanufacturing Systems

In dynamic environments, remanufacturing scheduling needs to be able to respond in real time to various uncertain factors. Many studies are dedicated to developing remanufacturing scheduling methods that can cope with uncertainties. For example, Wen et al. [92] addressed uncertainty by optimising a remanufacturing scheduling system model constrained by two random variables. Gao et al. [93] used an empirical strategy to solve the scheduling problem of remanufacturing systems with uncertain reprocessing time. Fu et al. [43] used a stochastic simulation model to address the uncertainty in the remanufacturing scheduling systems. Guo et al. [45] proposed multi-objective scheduling of remanufacturing systems considering time window constraints and outsourcing options. In order to more effectively handle uncertainty, some studies have adopted fuzzy theory to provide more intuitive solutions. Shi et al. [94] characterised and solved the dual uncertainty in the remanufacturing scheduling problem using dual fuzzy variables. Wang et al. [95] developed a multi-objective linear fuzzy function to address the uncertainty of demand and recycling in remanufacturing scheduling.
At present, there is relatively little research on solving dynamic scheduling in remanufacturing, and only a few studies have truly achieved the dynamic adjustment of scheduling plans. For example, Zheng et al. [96] proposed a self-adaptive rescheduling strategy based on a Conditional Generative Adversarial Network (CGAN) and Improved Reaction Framework (IRF) for aircraft component remanufacturing systems in dynamic environments (Figure 15). This method can respond in real time to dynamic changes such as equipment failures, demand fluctuations, etc. and improve the robustness and flexibility of the system by adaptively adjusting the scheduling plan. The dynamic scheduling problem incorporates dynamic factors or unexpected events such as machine breakdown and new order arrival in the production environment. For the dynamic flexible job-shop scheduling problem, different reinforcement-learning-based solutions have been proposed. Wu et al. [97] developed a DRL method based on proximal policy optimisation (PPO) and hybrid prioritised experience replay. Using a feasible solution matrix as state representation, paired priority dispatching rules as the action space, and a reward function based on machine idle time, this method can significantly reduce rescheduling time in a dynamic environment with uncertain processing time and improve learning efficiency and policy convergence. Wan et al. [98] introduced a diffusion based transformer (DIFFormer) for encoding operations and machine nodes to capture complex node dependencies. By applying a heterogeneous graph for state space, using operation-machine pairs as the action space, and training with the Twin Delayed Deep Deterministic policy gradient (TD3) algorithm, their method achieved better optimisation quality and efficiency than traditional dispatching rules on dynamic instances. More recently, Yazdanparast et al. [99] proposed a novel framework for remanufacturing scheduling in collaborative customisation, addressing the challenges of dynamic scheduling and inter-department coordination through a multi-agent deep Q-network approach. This method aims to enhance real-time decision-making and improve the alignment between the delivered product and the customised product by establishing communication between the assembly, cleaning-repair, and assembly departments.

5.4. Integrated Process Planning and Scheduling for Centralised Remanufacturing Systems

The integrated process planning and scheduling (IPPS) problem in remanufacturing simultaneously determines process routes and workstation allocation. This problem is inherently more complex than the classical job-shop scheduling problem (JSP). Zhang et al. [13] were the first to address IPPS in remanufacturing, developing a simulation-based, multi-objective genetic-algorithm framework. More recently, Gong et al. [30] proposed a mathematical model for IPPS in RMSs and solved it via a multi-layer evolutionary algorithm. However, neither study incorporated disassembly or reassembly stages, limiting their applicability in real-world settings. To bridge this gap, Zhang et al. [4] formulated a single-objective IPPS model for an RMS featuring parallel disassembly/reassembly workstations and a flexible job-shop reprocessing shop, and they tackled it using a modified artificial bee colony algorithm. Building on this, Zhang et al. [100] extended the approach to a multi-objective, energy-efficient IPPS framework (Figure 16), aiming to minimise both total energy consumption (TEC) and the total completion time (TCT) by optimising three key decision variables.

6. Decentralised Remanufacturing Systems

6.1. Development of Decentralised Remanufacturing Systems

Over the past decade, the Fourth Industrial Revolution has entered a phase of rapid acceleration, with IoT and cloud computing introduced to enhance the intelligence and sustainability of manufacturing enterprises. In remanufacturing, scholars have begun exploring these technologies with notable efforts. Ullah and Sarkar [101] proposed an IoT-enabled return channel to improve recycling rates, while Zhang et al. [102] implemented IoT for rapid production scheduling of remanufactured automobile engines, employing intelligent identification and the end-to-end monitoring of disassembly components. Pan and Lin [103] further advanced risk management by integrating IoT data with neural-network-based risk assessment models.
In cloud computing, Wang et al. were the first to conceptualise a cloud-based remanufacturing system [40] and subsequently designed a cloud production platform to address data exchange and resource-management challenges in remanufacturing environments [104]. Du et al. developed a method for dynamically discovering and fulfilling remanufacturing service demands [105]. Although early work on combining RMS with IoT and cloud computing exists, the field of cloud remanufacturing remains in its infancy. Caterino et al. [6] introduced the concept of cloud remanufacturing, delineating its platform characteristics, its associated technologies, and a corresponding mathematical model (see Figure 17).

6.2. Scheduling for Decentralised Remanufacturing Systems

In the cloud manufacturing/remanufacturing system, the linked suppliers and customers can provide their core competencies as remanufacturing resources and capabilities and obtain services according to requested criteria, respectively. However, as a growing number of service suppliers and customers are involved in the cloud manufacturing/remanufacturing platform, the complexity of resource allocation and task arrangement increases significantly.
For cloud-based systems, a robust management mechanism must coordinate service composition and decomposition, discovery, matching, and, crucially, resource scheduling—with the latter enabling shared manufacturing resources across geographically distributed edges. Resource scheduling lies at the heart of this paradigm. For example, Liu et al. [106] showed that prioritising workloads when assigning tasks can significantly enhance platform performance (Figure 18). Li et al. [107] developed a two-level scheduling model to tackle heterogeneous task allocation, while Hu et al. [108] applied a chaos-optimisation algorithm to examine the impacts of workload, efficiency, resource availability, and IoT coordination on scheduling. Recognising user needs, these approaches also integrate service-related metrics, such as service efficiency and capacity, into the scheduling criteria. Wan et al. [109] further validated a hierarchical scheduling framework through extensive case studies. Although cloud manufacturing has advanced rapidly, analogous research on cloud remanufacturing scheduling remains limited, owing to the intrinsic complexity of remanufacturing systems.
Early work in cloud remanufacturing scheduling was initiated by Caterino et al. [6], who applied Tabu Search and the Bees algorithm to the problem. Zhang et al. [25] then formulated a mixed-integer model for a cloud-based remanufacturing system, where EoL components of discrete quality grades are reused, reprocessed on alternative lines, or replaced—and introduced a Nonlinear Grey Wolf Optimiser with a crisscross update strategy to minimise makespan and cost, achieving superior convergence on real-world data. Building on this, Zhang et al. [26] proposed an integrated, multi-phase framework (Figure 19) covering inspection, disassembly, reprocessing, reassembly, and final testing. They solved the resulting large-scale, bi-objective problem using Improved Whale Optimisation algorithm, enhanced with self-adaptive weighting and quadratic interpolation, outperforming traditional heuristics in both convergence speed and solution accuracy.

7. Discussion and Future Trends

Scheduling remains the primary lever for boosting both production efficiency and managerial effectiveness in RMSs. Accordingly, a substantial body of work has explored scheduling problems in both centralised and decentralised contexts. Despite this progress, several pressing challenges endure, pointing to fertile directions for future research. These challenges and the resulting research opportunities are discussed in the subsections that follow.
In the field of remanufacturing scheduling, existing optimisation methods are divided into four categories: mixed-integer linear programming (MILP), the heuristics method, the meta-heuristics method, and the deep reinforcement learning method. These four types of methods exhibit different characteristics in terms of solution quality, robustness to uncertainty, and computational expense. Although MILP can provide high-quality solutions by exploring all potential solutions to achieve global optimality, it requires a large amount of computational expense and leads difficulty in optimising large-scale or highly dynamic problems. The heuristic method quickly provides solutions by reducing the search space through empirical rules, making it suitable for real-time applications; however, it may sacrifice the quality of the solution and produce suboptimal results. The meta-heuristics method achieves balance by combining heuristic elements with more systematic searching strategies, improving the solution quality while maintaining reasonable computational efficiency, and it is particularly effective in dealing with complex multi-objective problems. DRL, serving as an emerging method that utilises machine learning to adapt to a dynamic remanufacturing scheduling environment and uncertainties, has shown promise in improving robustness and computational efficiency, although the quality of solutions may vary, depending on the specific training and problem situation.

7.1. Ongoing Challenges and Future Directions

7.1.1. Dynamic Scheduling

Dynamic scheduling faces many challenges in remanufacturing systems. Compared with traditional manufacturing systems, centralised and distributed remanufacturing scheduling systems are more flexible, complex, and uncertain. This leads to the emergence of various random dynamic events, such as the insertion and cancellation of remanufacturing tasks, service failures, and uncertain reprocessing time and cost [110,111,112,113,114,115]. The emergence of these events makes the solution of the dynamic remanufacturing scheduling problem particularly important, and it has attracted many researchers to develop new meta-heuristic algorithms to address this challenge. In addition to meta-heuristic algorithms, deep reinforcement learning technology has also been proven to handle these complexities and uncertainties by learning optimal policies through interaction with the environment. Meanwhile, the responsive capability of DRL gives the potential to solve dynamic remanufacturing scheduling problems [116,117,118,119,120,121,122,123,124]. However, although deep reinforcement learning has shown great potential in this field, it still faces some challenges in practical applications. For example, how to achieve effective learning and decision-making under complex constraints, and how to maintain the stability and efficiency of the algorithm in a large-scale dynamic environment are issues that need further research.

7.1.2. Collaborative Scheduling

Collaborative scheduling is the difficulty for scheduling in cloud remanufacturing systems, consisting of both the coordination of cloud and local tasks, as well as the integrated management of cloud computing and remanufacturing resources [125,126,127,128,129,130]. The collaborative scheduling of these tasks and resources needs to revolve around dynamic resource occupancy, and the uncertainty of tasks, such as task arrival patterns, task cancellations, emergency orders, etc., can lead to frequent changes in collaborative schedules. Effective scheduling methods are required to handle this situation, involving movement-based dynamic adjustment methods, methods for analysing the influence chain between tasks, and methods for assessing the tolerance for dynamic disruptions. Another difficulty with the cloud remanufacturing platform is the collaborative scheduling of the production and computer resources.

7.1.3. Large-Scale Scheduling

Large-scale scheduling is also significant for remanufacturing scheduling in terms of efficiency [131,132,133,134,135,136]. Highly efficient algorithms and procedures are needed to increase efficiency. Different heuristic and meta-heuristic techniques are now being used to optimise the efficiency problem. In a real remanufacturing environment, extensive remanufacturing jobs, tasks, and services may be involved. However, in existed research, the number of jobs, tasks, and services is often in the tens or hundreds. Because of this, the majority of the current algorithms would fall short in handling large-scale problems. In this situation, new methodologies and algorithms must be created. For example, it is necessary to use parallel methods. In addition to improving the optimisation algorithms, new strategies such as service categorisation and filtering also need to be taken into account. In actuality, improving scheduling efficiency may be achieved through preparatory service screening and filtering, in accordance with service needs.

7.1.4. Carbon Tracking and Sustainable Scheduling

With increasing environmental regulations and corporate sustainability goals, carbon tracking and sustainable scheduling have become important in remanufacturing systems. Integrating carbon footprint calculations into scheduling models can help optimise energy consumption and reduce emissions [137,138,139,140]. This requires the development of new methods that can balance production efficiency with environmental impact, such as the application of machine learning to predict and mitigate carbon emissions in real time. Machine learning techniques can be used to track and model the carbon footprint by automatically analysing data on greenhouse gas emissions and energy consumption. This includes automatic data collection, an analysis of large volumes of data, modelling and forecasting, and the optimisation of processes to reduce greenhouse gas emissions. This integration of carbon tracking and scheduling models is crucial, as it allows for a more holistic approach to managing the environmental impact of remanufacturing processes.

7.1.5. Digital-Twins Driven Scheduling

Digital twins (DTs) technology offers a promising approach to enhancing scheduling accuracy and efficiency in remanufacturing systems [141,142,143,144,145]. By creating virtual replicas of physical systems, DTs can provide real-time data and predictive analytics to support dynamic scheduling decisions. However, several challenges remain. For example, DTs rely heavily on high-quality input data to accurately replicate physical systems and processes. Poor data quality can lead to inaccurate models and predictions, and they might compromise the effectiveness of DTs technology in real-time applications. Integrating DTs with existing manufacturing systems and processes can be complex and resource-intensive, often requiring significant investment in advanced technologies, software, and expertise to ensure seamless operation. Scalability remains a major concern, particularly when using low-cost sensors and other budget-friendly technologies. Ensuring that these solutions can scale to accommodate larger and more complex systems without performance degradation is a critical challenge. Klein and Furmans [146] proposed a flexible, digital-twin driven object transfer system implemented in a remanufacturing demonstration environment to address the high uncertainty in remanufacturing processes, demonstrating its effectiveness through an extensive experimental study involving calibration, large-scale virtual experiments, and final validation on 37 unique starter motor cores. Techniques such as AR and adaptive online simulation models require significant computational power, which can hinder their deployment in resource-constrained environments. Future research should focus on developing robust data acquisition and processing techniques, as well as scalable and efficient computational frameworks, to fully leverage the potential of DTs in remanufacturing scheduling.

8. Conclusions

This review has consolidated two decades of remanufacturing scheduling research into a coherent narrative. Annual output has risen by roughly 14% since 2005, while the intellectual centre of gravity has moved from deterministic, single-plant optimisation toward data-rich, uncertainty-aware frameworks that blend shop-floor control with closed-loop supply chain and sustainability objectives. By formalising the problem, we showed how stochastic core quality, multi-phase precedence, and carbon-reduction targets create distinctive precedence, capacity, and quality-conformance constraints in both centralised and cloud-enabled systems. A scan of enabling technologies (human-machine disassembly, machine vision inspection, hybrid addition and subtraction repair, and digital final testing) is narrowing the gap between execution and planning with increasingly refined data. Classic mixed-integer and meta-heuristic methods still suffice for small, static settings, but large-scale, dynamic environments favour reinforcement learning, decomposition hybrids, and integrated process planning and scheduling models, underscoring the strategic importance of advanced, sustainability-oriented schedulers for realising the economic and environmental promise of remanufacturing.
In this systematic review, due to the lack of unified benchmarks and datasets in the field of remanufacturing scheduling, the data formats and contents reported in the studies varied greatly. This resulted in the inability to effectively perform data transformation or impute missing summary statistics, which limited the ability to conduct quantitative synthesis. In addition, this systematic analysis is also limited by its exclusive focus on peer-reviewed journal articles, deliberately omitting conference proceedings that often contain early-stage innovations and practitioner-led case studies. This narrow perspective may underestimate the advancement of cutting-edge algorithms and emerging application areas that have not yet matured into journal formats. Therefore, future research should expand the evidence base, including conference papers, industry whitepapers, and standard documents, establish quantitative benchmarks, stress test algorithms on real-world, large-scale instances, and explore blockchain secure data sharing, digital twin architecture, and reinforcement learning agents capable of real-time adaptive control. Bridging the current divide between scholarly models and shop-floor realities will be vital for delivering truly dynamic, collaborative, and carbon-aware scheduling in the next generation of remanufacturing systems.

Author Contributions

Y.Z.: methodology, software, investigation, funding acquisition, and writing—review and editing. W.Z.: methodology, investigation, and writing—original draft. R.W.: software, investigation, and writing—review and editing. R.A.: conceptualisation, supervision, and writing—review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This research work is supported by the Fundamental Research Funds for the Central Universities, CHD (300102254501-202413), the Natural Science Foundation of Jiangsu Province (BK20240453), and the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (23KJB460032).

Data Availability Statement

Data will be made available upon request.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
RMSRemanufacturing System
AMAdditive Manufacturing
ANNArtificial Neural Network
ARAugmented Reality
DRLDeep Reinforcement Learning
DTDigital Twin
EOLEnd-of-Life
FJSPFlexible Job-Shop Scheduling Problem
FSRMSFlow-Shop Remanufacturing System
JSRMSJob-Shop Remanufacturing System
HVLVHigh-Volume, Low-Variety
LVHVLow-Volume, High-Variety
IPPSIntegrated Process Planning and Scheduling
MDPMarkov Decision Process
MIPMixed-Integer Programming
TECTotal Energy Consumption
TCTTotal Completion Time

References

  1. Zhang, X.; Xu, L.; Zhang, H.; Jiang, Z.; Cai, W. Emergy based intelligent decision-making model for remanufacturing process scheme integrating economic and environmental factors. J. Clean. Prod. 2021, 291, 125247. [Google Scholar] [CrossRef]
  2. San-Francisco, A.; Sopelana, N.; Fernandez, J.M.; Otegi, J.R.; Minguez, R. Analysis about the incorporation of remanufacturing concept into life cycle assessment theories. J. Remanuf. 2020, 10, 127–139. [Google Scholar] [CrossRef]
  3. Luo, L.; Shan, R.; Xiang, J. The government intervention effectiveness in promoting remanufacturing: Subsidy or remanufacturing target? Socio-Econ. Plan. Sci. 2024, 92, 101829. [Google Scholar] [CrossRef]
  4. Zhang, W.; Zheng, Y.; Ahmad, R. The integrated process planning and scheduling of flexible job-shop-type remanufacturing systems using improved artificial bee colony algorithm. J. Intell. Manuf. 2023, 34, 2963–2988. [Google Scholar] [CrossRef]
  5. Jiang, Z.; Zhou, T.; Zhang, H.; Wang, Y.; Cao, H.; Tian, G. Reliability and cost optimization for remanufacturing process planning. J. Clean. Prod. 2016, 135, 1602–1610. [Google Scholar] [CrossRef]
  6. Caterino, M.; Fera, M.; Macchiaroli, R.; Pham, D.T. Cloud remanufacturing: Remanufacturing enhanced through cloud technologies. J. Manuf. Syst. 2022, 64, 133–148. [Google Scholar] [CrossRef]
  7. Lee, C.M.; Woo, W.S.; Roh, Y.H. Remanufacturing: Trends and issues. Int. J. Precis. Eng. Manuf.-Green Technol. 2017, 4, 113–125. [Google Scholar] [CrossRef]
  8. Rizova, M.I.; Wong, T.; Ijomah, W. A systematic review of decision-making in remanufacturing. Comput. Ind. Eng. 2020, 147, 106681. [Google Scholar] [CrossRef]
  9. Gao, K.; Cao, Z.; Zhang, L.; Chen, Z.; Han, Y.; Pan, Q. A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE/CAA J. Autom. Sin. 2019, 6, 904–916. [Google Scholar] [CrossRef]
  10. Mongeon, P.; Paul-Hus, A. The journal coverage of Web of Science and Scopus: A comparative analysis. Scientometrics 2016, 106, 213–228. [Google Scholar] [CrossRef]
  11. Page, M.J.; McKenzie, J.E.; Bossuyt, P.M.; Boutron, I.; Hoffmann, T.C.; Mulrow, C.D.; Shamseer, L.; Tetzlaff, J.M.; Akl, E.A.; Brennan, S.E.; et al. The PRISMA 2020 statement: An updated guideline for reporting systematic reviews. BMJ 2021, 372, n71. [Google Scholar] [CrossRef]
  12. Teunter, R.; Kaparis, K.; Tang, O. Multi-product economic lot scheduling problem with separate production lines for manufacturing and remanufacturing. Eur. J. Oper. Res. 2008, 191, 1241–1253. [Google Scholar] [CrossRef]
  13. Zhang, R.; Ong, S.; Nee, A. A simulation-based genetic algorithm approach for remanufacturing process planning and scheduling. Appl. Soft Comput. 2015, 37, 521–532. [Google Scholar] [CrossRef]
  14. Yu, J.M.; Lee, D.H. Scheduling algorithms for job-shop-type remanufacturing systems with component matching requirement. Comput. Ind. Eng. 2018, 120, 266–278. [Google Scholar] [CrossRef]
  15. Mokhtari, H.; Hasani, A. An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Comput. Chem. Eng. 2017, 104, 339–352. [Google Scholar] [CrossRef]
  16. Peng, S.; Li, T.; Zhao, J.; Guo, Y.; Lv, S.; Tan, G.Z.; Zhang, H. Petri net-based scheduling strategy and energy modeling for the cylinder block remanufacturing under uncertainty. Robot. Comput.-Integr. Manuf. 2019, 58, 208–219. [Google Scholar] [CrossRef]
  17. Liao, H.; Zhang, Q.; Shen, N.; Li, L. Stochastic analysis of quality uncertainty and optimal acquisition strategies for engine remanufacturing. J. Clean. Prod. 2020, 261, 121088. [Google Scholar] [CrossRef]
  18. Arulkumaran, K.; Deisenroth, M.P.; Brundage, M.; Bharath, A.A. Deep reinforcement learning: A brief survey. IEEE Signal Process. Mag. 2017, 34, 26–38. [Google Scholar] [CrossRef]
  19. Lei, K.; Guo, P.; Zhao, W.; Wang, Y.; Qian, L.; Meng, X.; Tang, L. A multi-action deep reinforcement learning framework for flexible Job-shop scheduling problem. Expert Syst. Appl. 2022, 205, 117796. [Google Scholar] [CrossRef]
  20. Wang, W.; Tian, G.; Yuan, G.; Pham, D.T. Energy-time tradeoffs for remanufacturing system scheduling using an invasive weed optimization algorithm. J. Intell. Manuf. 2023, 34, 1065–1083. [Google Scholar] [CrossRef]
  21. Wang, W.; Tian, G.; Zhang, T.; Jabarullah, N.H.; Li, F.; Fathollahi-Fard, A.M.; Wang, D.; Li, Z. Scheme selection of design for disassembly (DFD) based on sustainability: A novel hybrid of interval 2-tuple linguistic intuitionistic fuzzy numbers and regret theory. J. Clean. Prod. 2021, 281, 124724. [Google Scholar] [CrossRef]
  22. Yuan, G.; Yang, Y.; Tian, G.; Zhuang, Q. Comprehensive evaluation of disassembly performance based on the ultimate cross-efficiency and extension-gray correlation degree. J. Clean. Prod. 2020, 245, 118800. [Google Scholar] [CrossRef]
  23. Galbreth, M.R.; Blackburn, J.D. Optimal acquisition quantities in remanufacturing with condition uncertainty. Prod. Oper. Manag. 2010, 19, 61–69. [Google Scholar] [CrossRef]
  24. Guo, L.; Xu, Y.; He, W.; Cheng, Y. Optimization of complex part-machining services based on feature decomposition in cloud manufacturing. Int. J. Comput. Integr. Manuf. 2020, 33, 1227–1244. [Google Scholar] [CrossRef]
  25. Zhang, W.; Zheng, Y.; Ma, W.; Ahmad, R. Multi-task scheduling in cloud remanufacturing system integrating reuse, reprocessing, and replacement under quality uncertainty. J. Manuf. Syst. 2023, 68, 176–195. [Google Scholar] [CrossRef]
  26. Zhang, W.; Zheng, Y.; Ma, Y.; Ahmad, R. A multi-phase integrated scheduling method for cloud remanufacturing systems. Adv. Eng. Inform. 2024, 62, 102802. [Google Scholar] [CrossRef]
  27. Cai, X.; Lai, M.; Li, X.; Li, Y.; Wu, X. Optimal acquisition and production policy in a hybrid manufacturing/remanufacturing system with core acquisition at different quality levels. Eur. J. Oper. Res. 2014, 233, 374–382. [Google Scholar] [CrossRef]
  28. Ebrahimi, A.; Jeon, H.W.; Lee, S.; Wang, C. Minimizing total energy cost and tardiness penalty for a scheduling-layout problem in a flexible job shop system: A comparison of four metaheuristic algorithms. Comput. Ind. Eng. 2020, 141, 106295. [Google Scholar] [CrossRef]
  29. Beynaghi, A.; Moztarzadeh, F.; Shahmardan, A.; Alizadeh, R.; Salimi, J.; Mozafari, M. Makespan minimization for batching work and rework process on a single facility with an aging effect: A hybrid meta-heuristic algorithm for sustainable production management. J. Intell. Manuf. 2019, 30, 33–45. [Google Scholar] [CrossRef]
  30. Gong, G.; Deng, Q.; Chiong, R.; Gong, X.; Huang, H.; Han, W. Remanufacturing-oriented process planning and scheduling: Mathematical modelling and evolutionary optimisation. Int. J. Prod. Res. 2020, 58, 3781–3799. [Google Scholar] [CrossRef]
  31. Zhang, W.; Shi, J.; Zhang, S.; Chen, M. Scenario-based robust remanufacturing scheduling problem using improved biogeography-based optimization algorithm. IEEE Trans. Syst. Man Cybern. Syst. 2022, 53, 3414–3427. [Google Scholar] [CrossRef]
  32. Zheng, Y.; Liu, J.; Ahmad, R. A cost-driven process planning method for hybrid additive-subtractive remanufacturing. J. Manuf. Syst. 2020, 55, 248–263. [Google Scholar] [CrossRef]
  33. Luglietti, R.; Magalini, F.; Taisch, M.; Cassina, J. Environmental Impact and Cost Evaluation in Remanufacturing Business Decision Support. In IFIP Advances in Information and Communication Technology; Springer: Berlin/Heidelberg, Germany, 2014; Volume 439, pp. 415–422. [Google Scholar] [CrossRef]
  34. Wang, W.; Mo, D.Y.; Wang, Y.; Tseng, M.M. Assessing the cost structure of component reuse in a product family for remanufacturing. J. Intell. Manuf. 2019, 30, 575–587. [Google Scholar] [CrossRef]
  35. Giglio, D.; Paolucci, M.; Roshani, A. Integrated lot sizing and energy-efficient job shop scheduling problem in manufacturing/remanufacturing systems. J. Clean. Prod. 2017, 148, 624–641. [Google Scholar] [CrossRef]
  36. Wang, W.; Tian, G.; Zhang, H.; Li, Z.; Zhang, L. A hybrid genetic algorithm with multiple decoding methods for energy-aware remanufacturing system scheduling problem. Robot. Comput.-Integr. Manuf. 2023, 81, 102509. [Google Scholar] [CrossRef]
  37. Zhang, C.; Liu, C.; Mao, H.; Tian, G.; Jiang, Z.; Cai, W.; Wang, W. Integration of lean production and low-carbon optimization in remanufacturing assembly. Adv. Eng. Inform. 2024, 62, 102789. [Google Scholar] [CrossRef]
  38. Zhou, J.; Deng, Q.; Li, T. Optimal acquisition and remanufacturing policies considering the effect of quality uncertainty on carbon emissions. J. Clean. Prod. 2018, 186, 180–190. [Google Scholar] [CrossRef]
  39. Zhao, J.; Peng, S.; Li, T.; Lv, S.; Li, M.; Zhang, H. Energy-aware fuzzy job-shop scheduling for engine remanufacturing at the multi-machine level. Front. Mech. Eng. 2019, 14, 474–488. [Google Scholar] [CrossRef]
  40. Wang, X.V.; Wang, L. From Cloud manufacturing to Cloud remanufacturing: A Cloud-based approach for WEEE recovery. Manuf. Lett. 2014, 2, 91–95. [Google Scholar] [CrossRef]
  41. Wang, Y.; Mendis, G.P.; Peng, S.; Sutherland, J.W. Component-Oriented Reassembly in Remanufacturing Systems: Managing Uncertainty and Satisfying Customer Needs. J. Manuf. Sci. Eng. Trans. ASME 2019, 141, 021005. [Google Scholar] [CrossRef]
  42. Zhang, W.; Zheng, Y.; Ahmad, R. An energy-efficient multi-objective scheduling for flexible job-shop-type remanufacturing system. J. Manuf. Syst. 2023, 66, 211–232. [Google Scholar] [CrossRef]
  43. Fu, Y.; Zhou, M.; Guo, X.; Qi, L. Stochastic multi-objective integrated disassembly-reprocessing-reassembly scheduling via fruit fly optimization algorithm. J. Clean. Prod. 2021, 278, 123364. [Google Scholar] [CrossRef]
  44. Guo, J.; Zou, J.; Du, B.; Wang, K. Integrated scheduling for remanufacturing system considering component commonality using improved multi-objective genetic algorithm. Comput. Ind. Eng. 2023, 182, 109419. [Google Scholar] [CrossRef]
  45. Guo, J.; Guo, W.; Du, B.; Zou, J.; Wang, K. A multi-objective integrated scheduling of remanufacturing system considering time window constrained outsourcing option. J. Clean. Prod. 2024, 468, 142916. [Google Scholar] [CrossRef]
  46. Shafiee Roudbari, E.; Fatemi Ghomi, S.M.T.; Sajadieh, M.S. Reverse logistics network design for product reuse, remanufacturing, recycling and refurbishing under uncertainty. J. Manuf. Syst. 2021, 60, 473–486. [Google Scholar] [CrossRef]
  47. Sharma, D.; Venkataraman, S.V. Strategic control of carbon emissions through taxation in a remanufacturing system. Comput. Ind. Eng. 2022, 174, 108797. [Google Scholar] [CrossRef]
  48. Hjorth, S.; Chrysostomou, D. Human–robot collaboration in industrial environments: A literature review on non-destructive disassembly. Robot. Comput.-Integr. Manuf. 2022, 73, 102208. [Google Scholar] [CrossRef]
  49. Mangold, S.; Steiner, C.; Friedmann, M.; Fleischer, J. Vision-based screw head detection for automated disassembly for remanufacturing. Procedia CIRP 2022, 105, 1–6. [Google Scholar] [CrossRef]
  50. Ong, S.K.; Chang, M.M.L.; Nee, A.Y. Product disassembly sequence planning: State-of-the-art, challenges, opportunities and future directions. Int. J. Prod. Res. 2021, 59, 3493–3508. [Google Scholar] [CrossRef]
  51. Meng, W.; Zhang, X. Optimization of remanufacturing disassembly line balance considering multiple failures and material hazards. Sustainability 2020, 12, 7318. [Google Scholar] [CrossRef]
  52. Tseng, Y.J.; Kao, H.T.; Huang, F.Y. Integrated assembly and disassembly sequence planning using a GA approach. Int. J. Prod. Res. 2010, 48, 5991–6013. [Google Scholar] [CrossRef]
  53. Xu, W.; Tang, Q.; Liu, J.; Liu, Z.; Zhou, Z.; Pham, D.T. Disassembly sequence planning using discrete Bees algorithm for human-robot collaboration in remanufacturing. Robot. Comput.-Integr. Manuf. 2020, 62, 101860. [Google Scholar] [CrossRef]
  54. Errington, M.; Childe, S.J. A business process model of inspection in remanufacturing. J. Remanuf. 2013, 3, 7. [Google Scholar] [CrossRef]
  55. Khan, A.; Mineo, C.; Dobie, G.; Macleod, C.; Pierce, G. Vision guided robotic inspection for parts in manufacturing and remanufacturing industry. J. Remanuf. 2021, 11, 49–70. [Google Scholar] [CrossRef]
  56. Imam, H.Z.; Al-Musaibeli, H.; Zheng, Y.; Martinez, P.; Ahmad, R. Vision-based spatial damage localization method for autonomous robotic laser cladding repair processes. Robot. Comput.-Integr. Manuf. 2023, 80, 102452. [Google Scholar] [CrossRef]
  57. Hao, C.; He, Y.; Li, Y.; Wang, Y.; Wang, Y.; Ma, W. An integrated restoration methodology based on adaptive failure feature identification. Robot. Comput.-Integr. Manuf. 2023, 81, 102512. [Google Scholar] [CrossRef]
  58. Saiz, F.A.; Alfaro, G.; Barandiaran, I. An inspection and classification system for automotive component remanufacturing industry based on ensemble learning. Information 2021, 12, 489. [Google Scholar] [CrossRef]
  59. Li, M.; Liu, W.; Short, T.; Qing, X.; Dong, Y.; He, Y.; Zhang, H.C. Pre-treatment of remanufacturing cleaning by use of supercritical CO2 in comparison with thermal cleaning. Clean Technol. Environ. Policy 2015, 17, 1563–1572. [Google Scholar] [CrossRef]
  60. Peng, S.; Li, T.; Tang, Z.; Shi, J.; Zhang, H. Comparative life cycle assessment of remanufacturing cleaning technologies. J. Clean. Prod. 2016, 137, 475–489. [Google Scholar] [CrossRef]
  61. Kanishka, K.; Acherjee, B. A systematic review of additive manufacturing-based remanufacturing techniques for component repair and restoration. J. Manuf. Processes 2023, 89, 220–283. [Google Scholar] [CrossRef]
  62. Liu, Z.; Jiang, Q.; Li, T.; Dong, S.; Yan, S.; Zhang, H.; Xu, B. Environmental benefits of remanufacturing: A case study of cylinder heads remanufactured through laser cladding. J. Clean. Prod. 2016, 133, 1027–1033. [Google Scholar] [CrossRef]
  63. Zhu, L.; Wang, S.; Pan, H.; Yuan, C.; Chen, X. Research on remanufacturing strategy for 45 steel gear using H13 steel powder based on laser cladding technology. J. Manuf. Processes 2020, 49, 344–354. [Google Scholar] [CrossRef]
  64. Kanazawa, T.; Hayakawa, M.; Vinas, D.; Tahara, Y.; Hata, N.; Yoshimoto, M. Sustainable technology for remanufacturing of carburized steels by laser hardening. J. Mater. Res. Technol. 2023, 24, 39–48. [Google Scholar] [CrossRef]
  65. Li, Y.; Dong, S.; Yan, S.; Liu, X.; He, P.; Xu, B. Surface remanufacturing of ductile cast iron by laser cladding Ni-Cu alloy coatings. Surf. Coatings Technol. 2018, 347, 20–28. [Google Scholar] [CrossRef]
  66. Jones, J.; McNutt, P.; Tosi, R.; Perry, C.; Wimpenny, D. Remanufacture of turbine blades by laser cladding, machining and in-process scanning in a single machine. In Proceedings of the 2012 International Solid Freeform Fabrication Symposium, Austin, TX, USA, 6–8 August 2012. [Google Scholar] [CrossRef]
  67. Li, L.; Li, C.; Tang, Y.; Du, Y. An integrated approach of reverse engineering aided remanufacturing process for worn components. Robot. Comput.-Integr. Manuf. 2017, 48, 39–50. [Google Scholar] [CrossRef]
  68. Hascoët, J.Y.; Touzé, S.; Rauch, M. Automated identification of defect geometry for metallic part repair by an additive manufacturing process. Weld. World 2018, 62, 229–241. [Google Scholar] [CrossRef]
  69. Newman, S.T.; Zhu, Z.; Dhokia, V.; Shokrani, A. Process planning for additive and subtractive manufacturing technologies. CIRP Ann. 2015, 64, 467–470. [Google Scholar] [CrossRef]
  70. Zhu, Z.; Dhokia, V.; Newman, S.T. A novel decision-making logic for hybrid manufacture of prismatic components based on existing parts. J. Intell. Manuf. 2017, 28, 131–148. [Google Scholar] [CrossRef]
  71. Le, V.T.; Paris, H.; Mandil, G. Process planning for combined additive and subtractive manufacturing technologies in a remanufacturing context. J. Manuf. Syst. 2017, 44, 243–254. [Google Scholar] [CrossRef]
  72. Liu, J.; Zheng, Y.; Ma, Y.; Qureshi, A.; Ahmad, R. A Topology Optimization Method for Hybrid Subtractive-Additive Remanufacturing. Int. J. Precis. Eng. Manuf.-Green Technol. 2020, 7, 939–953. [Google Scholar] [CrossRef]
  73. Oh, Y.; Behdad, S. Simultaneous reassembly and procurement planning in assemble-to-order remanufacturing systems. Int. J. Prod. Econ. 2017, 184, 168–178. [Google Scholar] [CrossRef]
  74. Kernbaum, S.; Franke, C.; Seliger, G. Flat screen monitor disassembly and testing for remanufacturing. Int. J. Sustain. Manuf. 2009, 1, 347–360. [Google Scholar] [CrossRef]
  75. Zhang, Y.; Zhou, D.; Jiang, P.; Zhang, H. The state-of-the-art surveys for application of metal magnetic memory testing in remanufacturing. Adv. Mater. Res. 2011, 301–303, 366–372. [Google Scholar] [CrossRef]
  76. Wang, H.; Jiang, Z.; Zhang, X.; Wang, Y.; Wang, Y. A fault feature characterization based method for remanufacturing process planning optimization. J. Clean. Prod. 2017, 161, 708–719. [Google Scholar] [CrossRef]
  77. Li, S.; Zhang, H.; Yan, W.; Jiang, Z. A hybrid method of blockchain and case-based reasoning for remanufacturing process planning. J. Intell. Manuf. 2021, 32, 1389–1399. [Google Scholar] [CrossRef]
  78. Wu, Z.; Liu, W. A study on the reuse of remanufacturing assembly processes through the integration of multiple sources of information. J. Clean. Prod. 2023, 423, 138660. [Google Scholar] [CrossRef]
  79. Jiang, Z.; Jiang, Y.; Wang, Y.; Zhang, H.; Cao, H.; Tian, G. A hybrid approach of rough set and case-based reasoning to remanufacturing process planning. J. Intell. Manuf. 2019, 30, 19–32. [Google Scholar] [CrossRef]
  80. He, Y.; Hao, C.; Wang, Y.; Li, Y.; Wang, Y.; Huang, L.; Tian, X. An ontology-based method of knowledge modelling for remanufacturing process planning. J. Clean. Prod. 2020, 258, 120952. [Google Scholar] [CrossRef]
  81. Hu, Y.; Liu, C.; Zhang, M.; Lu, Y.; Jia, Y.; Xu, Y. An ontology and rule-based method for human–robot collaborative disassembly planning in smart remanufacturing. Robot. Comput.-Integr. Manuf. 2024, 89, 102766. [Google Scholar] [CrossRef]
  82. Zheng, Y.; Ahmad, R. Feature extraction and process planning of integrated hybrid additive-subtractive system for remanufacturing. Math. Biosci. Eng. 2020, 17, 7274–7301. [Google Scholar] [CrossRef]
  83. Lee, C.Y.; Lin, C.S.; Uzsoy, R.; Wong, C.C. Implementation of a demand-pull system in a job shop environment. Int. J. Prod. Res. 1994, 32, 2915–2927. [Google Scholar] [CrossRef]
  84. Portioli-Staudacher, A.; Tantardini, M. A lean-based ORR system for non-repetitive manufacturing. Int. J. Prod. Res. 2012, 50, 3257–3273. [Google Scholar] [CrossRef]
  85. Slomp, J.; Bokhorst, J.A.C.; Germs, R. A lean production control system for high-variety/low-volume environments: A case study implementation. Prod. Plan. Control 2009, 20, 586–595. [Google Scholar] [CrossRef]
  86. Kim, M.G.; Yu, J.M.; Lee, D.H. Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines. Int. J. Prod. Res. 2015, 53, 1819–1831. [Google Scholar] [CrossRef]
  87. Shi, J.; Zhang, W.; Zhang, S.; Wang, W.; Lin, J.; Feng, R. A new environment-aware scheduling method for remanufacturing system with non-dedicated reprocessing lines using improved flower pollination algorithm. J. Manuf. Syst. 2020, 57, 94–108. [Google Scholar] [CrossRef]
  88. Guide, V.D.R. Scheduling using drum-buffer-rope in a remanufacturing environment. Int. J. Prod. Res. 1996, 34, 1081–1091. [Google Scholar] [CrossRef]
  89. Daniel, V.; Guide Jr, R. Scheduling with priority dispatching rules and drum-buffer-rope in a recoverable manufacturing system. Int. J. Prod. Econ. 1997, 53, 101–116. [Google Scholar] [CrossRef]
  90. Wei, Z.; Liao, W.; Zhang, L. Hybrid energy-efficient scheduling measures for flexible job-shop problem with variable machining speeds. Expert Syst. Appl. 2022, 197, 116785. [Google Scholar] [CrossRef]
  91. Rakovitis, N.; Li, D.; Zhang, N.; Li, J.; Zhang, L.; Xiao, X. Novel approach to energy-efficient flexible job-shop scheduling problems. Energy 2022, 238, 121773. [Google Scholar] [CrossRef]
  92. Wen, H.; Hou, S.; Liu, Z.; Liu, Y. An optimization algorithm for integrated remanufacturing production planning and scheduling system. Chaos Solitons Fractals 2017, 105, 69–76. [Google Scholar] [CrossRef]
  93. Gao, K.; Wang, L.; Luo, J.; Jiang, H.; Sadollah, A.; Pan, Q. Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: A case study. Eng. Optim. 2018, 50, 965–981. [Google Scholar] [CrossRef]
  94. Shi, J.; Zhang, W.; Zhang, S.; Chen, J. A new bifuzzy optimization method for remanufacturing scheduling using extended discrete particle swarm optimization algorithm. Comput. Ind. Eng. 2021, 156, 107219. [Google Scholar] [CrossRef]
  95. Wang, Z.; Ye, C.; Guo, J. Robust optimization of multi-objective multi-cycle remanufacturing supply chain network considering incentive compatibility theory under improved algorithm. Comput. Ind. Eng. 2024, 187, 109777. [Google Scholar] [CrossRef]
  96. Zheng, P.; Wang, J.; Zhang, J.; Yang, C.; Jin, Y. An adaptive CGAN/IRF-based rescheduling strategy for aircraft parts remanufacturing system under dynamic environment. Robot. Comput.-Integr. Manuf. 2019, 58, 230–238. [Google Scholar] [CrossRef]
  97. Wu, X.; Yan, X.; Guan, D.; Wei, M. A deep reinforcement learning model for dynamic job-shop scheduling problem with uncertain processing time. Eng. Appl. Artif. Intell. 2024, 131, 107790. [Google Scholar] [CrossRef]
  98. Wan, L.; Cui, X.; Zhao, H.; Fu, L.; Li, C. A novel method for solving dynamic flexible job-shop scheduling problem via DIFFormer and deep reinforcement learning. Comput. Ind. Eng. 2024, 198, 110688. [Google Scholar] [CrossRef]
  99. Yazdanparast, S.A.; Zegordi, S.H.; Khatibi, T. Proposing a model based on deep reinforcement learning for real-time scheduling of collaborative customization remanufacturing. Robot. Comput.-Integr. Manuf. 2025, 94, 102980. [Google Scholar] [CrossRef]
  100. Zhang, W.; Zheng, Y.; Ahmad, R. An energy-efficient multi-objective integrated process planning and scheduling for a flexible job-shop-type remanufacturing system. Adv. Eng. Inform. 2023, 56, 102010. [Google Scholar] [CrossRef]
  101. Ullah, M.; Sarkar, B. Recovery-channel selection in a hybrid manufacturing-remanufacturing production model with RFID and product quality. Int. J. Prod. Econ. 2020, 219, 360–374. [Google Scholar] [CrossRef]
  102. Zhang, Y.; Liu, S.; Liu, Y.; Yang, H.; Li, M.; Huisingh, D.; Wang, L. The ‘Internet of Things’ enabled real-time scheduling for remanufacturing of automobile engines. J. Clean. Prod. 2018, 185, 562–575. [Google Scholar] [CrossRef]
  103. Pan, W.; Miao, L. Dynamics and risk assessment of a remanufacturing closed-loop supply chain system using the internet of things and neural network approach. J. Supercomput. 2023, 79, 3878–3901. [Google Scholar] [CrossRef]
  104. Wang, X.V.; Wang, L. A cloud-based production system for information and service integration: An internet of things case study on waste electronics. Enterp. Inf. Syst. 2017, 11, 952–968. [Google Scholar] [CrossRef]
  105. Du, X.D.; Li, L.Y.; Liu, G.F.; Shen, J.; Zhou, D. Dissolution of tungsten carbide in remanufacturing coating by plasma spray welding. Adv. Mater. Res. 2014, 852, 121–126. [Google Scholar] [CrossRef]
  106. Liu, Y.; Xu, X.; Zhang, L.; Wang, L.; Zhong, R.Y. Workload-based multi-task scheduling in cloud manufacturing. Robot. Comput.-Integr. Manuf. 2017, 45, 3–20. [Google Scholar] [CrossRef]
  107. Li, F.; Liao, T.W.; Zhang, L. Two-level multi-task scheduling in a cloud manufacturing environment. Robot. Comput.-Integr. Manuf. 2019, 56, 127–139. [Google Scholar] [CrossRef]
  108. Hu, Y.; Zhu, F.; Zhang, L.; Lui, Y.; Wang, Z. Scheduling of manufacturers based on chaos optimization algorithm in cloud manufacturing. Robot. Comput.-Integr. Manuf. 2019, 58, 13–20. [Google Scholar] [CrossRef]
  109. Wan, C.; Zheng, H.; Guo, L.; Liu, Y. Hierarchical scheduling for multi-composite tasks in cloud manufacturing. Int. J. Prod. Res. 2023, 61, 1039–1057. [Google Scholar] [CrossRef]
  110. Bouazza, W.; Sallez, Y.; Trentesaux, D. Dynamic scheduling of manufacturing systems: A product-driven approach using hyper-heuristics. Int. J. Comput. Integr. Manuf. 2021, 34, 641–665. [Google Scholar] [CrossRef]
  111. Figueiredo, M.; Gomide, F. Regular policies and stability of dynamic scheduling for manufacturing systems. Comput. Oper. Res. 1996, 23, 963–979. [Google Scholar] [CrossRef]
  112. Hu, L.; Liu, Z.; Hu, W.; Wang, Y.; Tan, J.; Wu, F. Petri-net-based dynamic scheduling of flexible manufacturing system via deep reinforcement learning with graph convolutional network. J. Manuf. Syst. 2020, 55, 1–14. [Google Scholar] [CrossRef]
  113. Leng, J.; Jiang, P. Dynamic scheduling in RFID-driven discrete manufacturing system by using multi-layer network metrics as heuristic information. J. Intell. Manuf. 2019, 30, 979–994. [Google Scholar] [CrossRef]
  114. Rokhforoz, P.; Fink, O. Distributed joint dynamic maintenance and production scheduling in manufacturing systems: Framework based on model predictive control and Benders decomposition. J. Manuf. Syst. 2021, 59, 596–606. [Google Scholar] [CrossRef]
  115. Shaw, M.J. Dynamic scheduling in cellular manufacturing systems: A framework for networked decision making. J. Manuf. Syst. 1988, 7, 83–94. [Google Scholar] [CrossRef]
  116. Alqahtani, M.; Hu, M. Dynamic energy scheduling and routing of multiple electric vehicles using deep reinforcement learning. Energy 2022, 244, 122626. [Google Scholar] [CrossRef]
  117. Gui, Y.; Tang, D.; Zhu, H.; Zhang, Y.; Zhang, Z. Dynamic scheduling for flexible job shop using a deep reinforcement learning approach. Comput. Ind. Eng. 2023, 180, 109255. [Google Scholar] [CrossRef]
  118. Liu, C.L.; Chang, C.C.; Tseng, C.J. Actor-critic deep reinforcement learning for solving job shop scheduling problems. IEEE Access 2020, 8, 71752–71762. [Google Scholar] [CrossRef]
  119. Qin, Z.; Johnson, D.; Lu, Y. Dynamic production scheduling towards self-organizing mass personalization: A multi-agent dueling deep reinforcement learning approach. J. Manuf. Syst. 2023, 68, 242–257. [Google Scholar] [CrossRef]
  120. Wang, H.; Cheng, J.; Liu, C.; Zhang, Y.; Hu, S.; Chen, L. Multi-objective reinforcement learning framework for dynamic flexible job shop scheduling problem with uncertain events. Appl. Soft Comput. 2022, 131, 109717. [Google Scholar] [CrossRef]
  121. Wang, H.; Wu, Y.; Min, G.; Xu, J.; Tang, P. Data-driven dynamic resource scheduling for network slicing: A Deep reinforcement learning approach. Inf. Sci. 2019, 498, 106–116. [Google Scholar] [CrossRef]
  122. Wang, L.; Hu, X.; Wang, Y.; Xu, S.; Ma, S.; Yang, K.; Liu, Z.; Wang, W. Dynamic job-shop scheduling in smart manufacturing using deep reinforcement learning. Comput. Netw. 2021, 190, 107969. [Google Scholar] [CrossRef]
  123. Yang, S.; Wang, J.; Xu, Z. Real-time scheduling for distributed permutation flowshops with dynamic job arrivals using deep reinforcement learning. Adv. Eng. Inform. 2022, 54, 101776. [Google Scholar] [CrossRef]
  124. Zhu, H.; Li, M.; Tang, Y.; Sun, Y. A Deep-Reinforcement-Learning-Based Optimization Approach for Real-Time Scheduling in Cloud Manufacturing. IEEE Access 2020, 8, 9987–9997. [Google Scholar] [CrossRef]
  125. Bo, H.; Han, P.; Lu, B.; Zhao, C.; Wang, X. Online monitoring and collaborative scheduling method for wheelset cyber-physical production system: A wheelset manufacturing system case study from a Chinese high-speed train enterprise. Adv. Eng. Inform. 2021, 47, 101210. [Google Scholar] [CrossRef]
  126. Gui, L.; Fu, L.; Li, X.; Zhou, W.; Gao, L.; Xiang, Z.; Zhu, W. Optimisation framework and method for solving the serial dual-shop collaborative scheduling problem. Int. J. Prod. Res. 2023, 61, 4341–4357. [Google Scholar] [CrossRef]
  127. Lu, C.; Gao, R.; Yin, L.; Zhang, B. Human-Robot Collaborative Scheduling in Energy-efficient Welding Shop. IEEE Trans. Ind. Inform. 2023, 20, 963–971. [Google Scholar] [CrossRef]
  128. Ma, J.; Zhou, H.; Liu, C.; Mingcheng, E.; Jiang, Z.; Wang, Q. Study on Edge-Cloud Collaborative Production Scheduling Based on Enterprises with Multi-Factory. IEEE Access 2020, 8, 30069–30080. [Google Scholar] [CrossRef]
  129. Sang, Y.; Tan, J. Intelligent factory many-objective distributed flexible job shop collaborative scheduling method. Comput. Ind. Eng. 2022, 164, 107884. [Google Scholar] [CrossRef]
  130. Tang, L.; Han, H.; Tan, Z.; Jing, K. Centralized collaborative production scheduling with evaluation of a practical order-merging strategy. Int. J. Prod. Res. 2023, 61, 282–301. [Google Scholar] [CrossRef]
  131. Chen, Y.; Ding, J.; Chai, T. A Knowledge Transfer Based Scheduling Algorithm for Large-Scale Refinery Production. IEEE Trans. Ind. Inform. 2022, 18, 869–879. [Google Scholar] [CrossRef]
  132. Hong, S.; Banerjee, A. A large-scale distributed decision-making procedure for a single-machine scheduling problem. Int. J. Prod. Res. 2012, 50, 5795–5808. [Google Scholar] [CrossRef]
  133. Kopanos, G.M.; Méndez, C.A.; Puigjaner, L. MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: A benchmark scheduling problem of the pharmaceutical industry. Eur. J. Oper. Res. 2010, 207, 644–655. [Google Scholar] [CrossRef]
  134. Li, L.; Fu, X.; Zhen, H.L.; Yuan, M.; Wang, J.; Lu, J.; Tong, X.; Zeng, J.; Schnieders, D. Bilevel learning for large-scale flexible flow shop scheduling. Comput. Ind. Eng. 2022, 168, 108140. [Google Scholar] [CrossRef]
  135. Shen, X.; Guo, Y.; Li, A. Cooperative coevolution with an improved resource allocation for large-scale multi-objective software project scheduling. Appl. Soft Comput. J. 2020, 88, 106059. [Google Scholar] [CrossRef]
  136. Sun, L.; Lin, L.; Li, H.; Gen, M. Large scale flexible scheduling optimization by a distributed evolutionary algorithm. Comput. Ind. Eng. 2019, 128, 894–904. [Google Scholar] [CrossRef]
  137. Xia, X.; Lu, M.; Wang, W. Emission reduction and outsourcing remanufacturing: A comparative study under carbon trading. Expert Syst. Appl. 2023, 227, 120317. [Google Scholar] [CrossRef]
  138. Zhang, H.; Lv, Y.; Zhang, J.Z. Remanufacturing Strategy of Closed-Loop Supply Chain Under the Constraint of Recycling and Remanufacturing Target: Integrating Carbon Footprint and Social Welfare. IEEE Trans. Eng. Manag. 2024, 71, 14258–14270. [Google Scholar] [CrossRef]
  139. Ke, C.; Pan, X.; Wan, P.; Jiang, Z.; Zhao, J. An integrated design method for used product remanufacturing scheme considering carbon emission. Sustain. Prod. Consum. 2023, 41, 348–361. [Google Scholar] [CrossRef]
  140. Tsao, Y.C.; Linh, V.T.; Lu, J.C.; Yu, V. A supply chain network with product remanufacturing and carbon emission considerations: A two-phase design. J. Intell. Manuf. 2018, 29, 693–705. [Google Scholar] [CrossRef]
  141. Chen, Z.; Huang, L. Digital twins for information-sharing in remanufacturing supply chain: A review. Energy 2021, 220, 119712. [Google Scholar] [CrossRef]
  142. Wang, X.V.; Wang, L. Digital twin-based WEEE recycling, recovery and remanufacturing in the background of Industry 4.0. Int. J. Prod. Res. 2019, 57, 3892–3902. [Google Scholar] [CrossRef]
  143. Wang, Y.; Wang, S.; Yang, B.; Zhu, L.; Liu, F. Big data driven Hierarchical Digital Twin Predictive Remanufacturing paradigm: Architecture, control mechanism, application scenario and benefits. J. Clean. Prod. 2020, 248, 119299. [Google Scholar] [CrossRef]
  144. Kerin, M.; Hartono, N.; Pham, D. Optimising remanufacturing decision-making using the bees algorithm in product digital twins. Sci. Rep. 2023, 13, 701. [Google Scholar] [CrossRef] [PubMed]
  145. Ghorbani, H.; Khameneifar, F. Construction of damage-free digital twin of damaged aero-engine blades for repair volume generation in remanufacturing. Robot. Comput.-Integr. Manuf. 2022, 77, 102335. [Google Scholar] [CrossRef]
  146. Klein, J.F.; Furmans, K. A study on the predictive capabilities of digital twins for object transfers in a remanufacturing demonstration environment. Robot. Comput.-Integr. Manuf. 2026, 97, 103063. [Google Scholar] [CrossRef]
Figure 1. Overview of the proposed research method.
Figure 1. Overview of the proposed research method.
Machines 13 00762 g001
Figure 2. PRISMA flow diagram [11] demonstrating included and excluded studies and the reasons for exclusion in the systematic review of scheduling in remanufacturing systems.
Figure 2. PRISMA flow diagram [11] demonstrating included and excluded studies and the reasons for exclusion in the systematic review of scheduling in remanufacturing systems.
Machines 13 00762 g002
Figure 3. Count of publications, count of citations each year, and growth rate of publications in the area of remanufacturing scheduling (2005–2025).
Figure 3. Count of publications, count of citations each year, and growth rate of publications in the area of remanufacturing scheduling (2005–2025).
Machines 13 00762 g003
Figure 4. Network of co-occurring keywords related to remanufacturing scheduling (2005–2025).
Figure 4. Network of co-occurring keywords related to remanufacturing scheduling (2005–2025).
Machines 13 00762 g004
Figure 5. Keyword-age overlay visualization network related to remanufacturing scheduling (2005–2025).
Figure 5. Keyword-age overlay visualization network related to remanufacturing scheduling (2005–2025).
Machines 13 00762 g005
Figure 6. A typical cloud-remanufacturing architecture [6].
Figure 6. A typical cloud-remanufacturing architecture [6].
Machines 13 00762 g006
Figure 7. Bilateral interactions of remanufacturing processes, digital enablers, and central scheduler of RMS.
Figure 7. Bilateral interactions of remanufacturing processes, digital enablers, and central scheduler of RMS.
Machines 13 00762 g007
Figure 8. Disassembly for remanufacturing systems: (a) optimisation method of disassembly line balance with variable remanufacturing damages and material hazards [51] and (b) workflow of the disassembly sequence planning for human–robot collaboration [53].
Figure 8. Disassembly for remanufacturing systems: (a) optimisation method of disassembly line balance with variable remanufacturing damages and material hazards [51] and (b) workflow of the disassembly sequence planning for human–robot collaboration [53].
Machines 13 00762 g008
Figure 9. Automated inspection and classification system for remanufacturing [58]: (a) inspection and evaluation pipeline steps; and (b) image acquisition method.
Figure 9. Automated inspection and classification system for remanufacturing [58]: (a) inspection and evaluation pipeline steps; and (b) image acquisition method.
Machines 13 00762 g009
Figure 10. Remanufacturing cleaning: (a) SCCO2 cleaning apparatus [59]; (b) cleaning processes indicating the system boundary of four remanufacturing cleaning methods, including SCCO2 cleaning, liquid blasting cleaning, high temperature decomposition and shot blasting [60].
Figure 10. Remanufacturing cleaning: (a) SCCO2 cleaning apparatus [59]; (b) cleaning processes indicating the system boundary of four remanufacturing cleaning methods, including SCCO2 cleaning, liquid blasting cleaning, high temperature decomposition and shot blasting [60].
Machines 13 00762 g010
Figure 11. Laser cladding for remanufacturing: (a) cylinder head laser cladding remanufacturing [62]; and (b) setup for laser hardening process based on laser cladding [64].
Figure 11. Laser cladding for remanufacturing: (a) cylinder head laser cladding remanufacturing [62]; and (b) setup for laser hardening process based on laser cladding [64].
Machines 13 00762 g011
Figure 12. Reassembly process for remanufacturing: an example of the network flow model for reassembly [73].
Figure 12. Reassembly process for remanufacturing: an example of the network flow model for reassembly [73].
Machines 13 00762 g012
Figure 14. Scheduling for FSRMS: (a) RMS containing parallel disassembly shops, non-dedicated flow-shop-type reprocessing lines, and parallel reassembly shops [87]; and (b) RMS with the parallel disassembly/reassembly and flow-shop-type reprocessing shops [20].
Figure 14. Scheduling for FSRMS: (a) RMS containing parallel disassembly shops, non-dedicated flow-shop-type reprocessing lines, and parallel reassembly shops [87]; and (b) RMS with the parallel disassembly/reassembly and flow-shop-type reprocessing shops [20].
Machines 13 00762 g014
Figure 15. Flowchart of dynamic remanufacturing scheduling with uncertainty disturbances [96].
Figure 15. Flowchart of dynamic remanufacturing scheduling with uncertainty disturbances [96].
Machines 13 00762 g015
Figure 16. The framework of the multi-objective IPPS problem for remanufacturing [100].
Figure 16. The framework of the multi-objective IPPS problem for remanufacturing [100].
Machines 13 00762 g016
Figure 17. The framework of the cloud remanufacturing system [6].
Figure 17. The framework of the cloud remanufacturing system [6].
Machines 13 00762 g017
Figure 18. Scheduling framework for cloud manufacturing [106].
Figure 18. Scheduling framework for cloud manufacturing [106].
Machines 13 00762 g018
Figure 19. Framework of multi-phase scheduling framework in cloud remanufacturing context [26].
Figure 19. Framework of multi-phase scheduling framework in cloud remanufacturing context [26].
Machines 13 00762 g019
Table 1. Distribution of publications across journals (2005–2025).
Table 1. Distribution of publications across journals (2005–2025).
Journal TitleArticles% of Corpus
Journal of Cleaner Production96.21%
International Journal of Production Research96.21%
Computers and Industrial Engineering96.21%
Journal of Manufacturing Systems74.83%
European Journal of Operational Research64.14%
Expert Systems with Applications53.45%
Robotics and Computer-Integrated Manufacturing42.76%
Journal of Remanufacturing32.07%
International Journal of Production Economics32.07%
IEEE Access32.07%
Environmental Science and Pollution Research32.07%
Engineering Optimization32.07%
Resources, Conservation and Recycling21.38%
Journal of Intelligent Manufacturing21.38%
International Transactions in Operational Research21.38%
International Journal of Simulation Modelling21.38%
International Journal of Advanced Manufacturing Technology21.38%
IEEE Transactions on Engineering Management21.38%
Engineering Applications of Artificial Intelligence21.38%
Concurrent Engineering Research and Applications21.38%
Communications in Computer and Information Science21.38%
Applied Sciences21.38%
Advanced Engineering Informatics21.38%
Table 2. Objective functions addressed in remanufacturing-scheduling studies (2005–2025).
Table 2. Objective functions addressed in remanufacturing-scheduling studies (2005–2025).
Objective FamilyTypical IndicatorsRepresentative PapersPapers (%)
Time performanceMakespan, total flow time, total tardiness[4,28,29,30,31]78 (41%)
Economic costDisassembly, processing, transport, inventory cost; economic lot size[5,32,33,34,35]56 (29%)
SustainabilityElectricity consumption, CO2 footprint, energy-dependent set-ups[20,36,37,38,39]43 (23%)
Service qualityDue-date compliance, customersatisfaction, product reliability[5,6,25,26,40,41]22 (12%)
Multi-objective aPareto optimisation of two or morecriteria (time, cost, energy)[30,42,43,44,45]65 (34%)
a Multi-objective studies may also be counted in one or more single-objective rows; totals, therefore, exceed the corpus size ( n = 190 ).
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zheng, Y.; Zhang, W.; Wang, R.; Ahmad, R. Scheduling in Remanufacturing Systems: A Bibliometric and Systematic Review. Machines 2025, 13, 762. https://doi.org/10.3390/machines13090762

AMA Style

Zheng Y, Zhang W, Wang R, Ahmad R. Scheduling in Remanufacturing Systems: A Bibliometric and Systematic Review. Machines. 2025; 13(9):762. https://doi.org/10.3390/machines13090762

Chicago/Turabian Style

Zheng, Yufan, Wenkang Zhang, Runjing Wang, and Rafiq Ahmad. 2025. "Scheduling in Remanufacturing Systems: A Bibliometric and Systematic Review" Machines 13, no. 9: 762. https://doi.org/10.3390/machines13090762

APA Style

Zheng, Y., Zhang, W., Wang, R., & Ahmad, R. (2025). Scheduling in Remanufacturing Systems: A Bibliometric and Systematic Review. Machines, 13(9), 762. https://doi.org/10.3390/machines13090762

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop