Scheduling and Controlling Production in an Internet of Things Environment for Industry 4.0: An Analysis and Systematic Review of Scientific Metrological Data

Abstract

To review the present scenario of the research on the scheduling and control of the production process in the manufacturing industry, this comprehensive article has extensively examined this field’s hotspots, boundaries, and overall evolutionary trajectory. This paper’s primary goal is to visualize and conduct an organized review of 5052 papers and reviews that were published between 2002 and 2022. To reveal the “social, conceptual, and conceptual framework” of the production area, identify key factors and research areas, highlight major specialties and emerging trends, and conduct research, countries, institutions, literature keywords, etc., are all used. Additionally, research methodologies are always being improved. The aim of this work is to explore more references for research implementation by analyzing and classifying the present research status, research hotspots, and potential future trends in this field of research.

1. Introduction

1.1. Background Information

“Industry 4.0 and smart manufacturing” are terms that play a major role in the “digitization”, “process automation”, and “the growing use of information and communications technology (ICT)” [1]. The term “Industry 4.0” means “Information and communication technology” is evolving quickly, and many disrupting tools have emerged, which influence the manufacturing industry through the use of “cyber-physical systems”, at a time when market complexity and competition, as well as pressure to reduce costs and environmental impact, are all rising quickly. The industry is willing to look for more integrated solutions to realize the full economic potential of the entire production chain, while functioning sustainably and in accordance with environmental standards as a result of this driving force.

However, due to the increasing size of workshop production and increasingly fierce competition, managing the process production and integrated decision-making to achieve energy-savings, output maximization, and cost-efficient production is becoming a hot research topic. From the theoretical level, scheduling in job shop production [2] is a significant “decision-making process”. For example, in a job shop method, the production rate must be well-decided to ensure the required tools, supplies, resources, workers, etc., are accessible when needed for the timely completion of the job. So, the scheduling goal is to assign a few resources to activities throughout time in the most effective way possible, ensuring that needs are satisfied and operations are successful. Scheduling problems can be modeled using the constraints and characteristics of the process, and several objective functions (such as profit maximization or makespan minimization) can be provided [3,4].

It is thus possible to determine the best task sequencing and resource allocation.

The “Job Shop Scheduling Problem (JSP)” is an optimization tool [5], having aims to find the best order of jobs to be performed on a group of machines, each of which is specially equipped to carry out a particular operation. The goal is often to reduce factors such as makespan, maximum tardiness, etc. The JSP considers that jobs may have diverse machine sequences, leading to an exponential number of possible schedules, in contrast to its specific instance. The “Flow Shop Scheduling Problem (FSP)” process control is also a type of decision-making that modifies the operating parameters of a process to regulate the qualitative characteristics of work streams. Maintaining constant quality parameters or monitoring time-varying set points for these metrics presents a challenge that may require modifying inputs and process variables. All large firms recognize the importance of advanced control techniques for energy conservation, throughput maximization, and cost-effective production as they continue to gain momentum across all industries. Additionally, because the two theories were developed independently, there is still a study gap in smoothing integration in job shop production, despite the recent focus of an increasing number of academics on the assimilation of “scheduling and control”. The number of theoretical and empirical works on SC-related subjects has significantly increased. A sizeable corpus of research literature has been amassed on this topic since the first papers were published in the late 1970s. However, these assessments concentrated on specific viewpoints. In this paper, we attempt a thorough analysis of articles that were published between 2002 and 2022. Additionally, this review has been updated. This article is categorized into the following sections. “Section 2” of this document describes the data gathering techniques. The main body of this article’s third section contains the data analysis results and graphs. It will be interpreted (analyzed mostly for co-occurrence and co-citation) from CiteSpace. This section summarizes information about the country, institution, author, and keywords, with keywords serving as the most important part of the research frontier analysis for planning and management. The existing study on job shop scheduling and control (JSSC) in manufacturing will be presented in Section 4, before the conclusions, limits, and recommendations for future work are discussed. The hot topics and future trends are covered in Section 5. The conclusion, which is the last section, will provide certain restrictions on the current research.

The assistance of the current study is explained as: First, we describe the interactions of collaboration, and highlight the lack of coordination and collaboration in the scheduling and control fields. Second, we explore the ideas and “research hotspots” of the “scheduling and control area”. Furthermore, we can determine the future research frontier based on the spike in keyword searches and the time zone map. Third, we analyze the literature and build an author co-citation network to detect developing trends, significant turning points, top researchers, and the growth and evolution of the scheduling and control (SC) area.

1.2. Research Objectives

This field has advanced quickly since the original work shop scheduling and control problem was posed. It is an “NP-hard problem”, and substantial research has been conducted to address its many classes and complexities.

However, few papers thoroughly examine the many methods created by earlier academics, and even fewer can summarize and assess it at the macro level. Therefore, this article aims to explore the most recent JSSCP literature to apply it to Industry 4.0 deployment. In this regard, this study has addressed the following points:

• Existing research status of JSSC.

• Hotspots and frontiers of research in the JSSC field.

• Research gaps in the JSSC field.

CiteSpace is the main instrument used in this study’s scientometric literature review (SLR), which provides a systematic review and discussion of hotspots and frontiers that have emerged since 2002. CiteSpace software can help researchers quickly focus on the most important material and a specific knowledge area. We believe that this publication will offer researchers and professionals a thorough insight. We examined the records from the previous 20 years to make this analysis more trustworthy and impartial.

2. Research Method

Academic publications in the field were identified to meet this paper’s research goals. The Scopus database was used to obtain the list of publications. A delineation of the research boundary is frequently required because it is challenging to search every related article [3]. Each publication’s main points will be based on its research contents. We conducted a systematic literature review using the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analyses) 2009 guidelines to ensure the inclusion of all relevant studies.

2.1. Bibliometric Analysis

Due to the fact that it establishes the scientific papers from which any conclusions will be formed, the collection of data from the current literature is crucial to this study. Therefore, care is taken in selecting the database and searching strategy. Scopus was selected as the literature resource for this study because, in contrast to other databases, it has a broad coverage of construction-related research [4]. The Scopus database is best suitable for interdisciplinary research since it contains a larger range of journal publications than the databases previously indicated.

The existing literature on job shop scheduling and control in this database was then found by searching for terms such as “manufacturing”, “flow shop”, “plant factory”, “production system”, and “scheduling”, as well as “control”, “scheduling”, and “retrieval”. The selected articles were from 2002 to 2022, in light of JSSC’s development history within construction-related research. Only articles from peer-reviewed English document proceedings were taken into account for the review process.

The titles and abstracts of the sources were checked as part of a further review procedure to remove irrelevant articles. The bibliometric analysis was applied to those that survived the screening process. More than 8000 documents were found during the initial search, but only 5052 remained after the manual screening. The widespread appropriation of the term “scheduling and control” in other contexts and scientific disciplines can be used to explain why so many irrelevant papers had to be removed.

2.2. Scientometric Analysis

Mulchenko [5] initially offered the definition of scientometrics as “a quantitative analysis of the research on the growth of science”. On the basis of sizable academic datasets, it can be viewed as a strategy that “maps the current state of knowledge and its evolution in a field and analyses the influence and citation processes of research”. It is unlikely that the discipline of computer vision in construction can be comprehensively described. A full overview of the study area is provided by manual review, but this method is still vulnerable to bias and has little room for individual interpretation [6]. The current work provides a thorough examination of “computer vision” inside “construction-related activities” [7] using the “scientometric technique” in order to facilitate the visualization, which is used to trace the structure and evolution of various themes [8]. It is based on the use of an extensive academic database to assess the intellectual environment through modeling and visualization.

It is necessary to use keywords to identify groups having an impact on research areas. In order to preserve the authors’ opinions as much as possible, the literature on scheduling and control for the manufacturing industry was examined. To identify research trends, the following methodologies were used: “country co-occurrence, literature co-citation, and co-occurrence analysis, abstract term cluster analysis, co-occurrence analysis and clustering, co-author analysis, and burst detection”. The abstract term clustering, and various specific research themes tied to the conceptual framework of the study, highlight the detailed research trends within the subject. These techniques have been recommended in past research of a similar nature [6,9].

3. Results and Discussion

All results and discussions will follow the process flow of the figure below. Figure 1 is an illustration of the systematic review process that includes searches of databases and registers. The diagram is designed to provide transparency and clarity in reporting the selection of studies for inclusion in this systematic review as exhibited the same in the PRISMA checklist in Supplementary Material.

The flow diagram begins with the identification of studies through database and register searches. This initial search results in a pool of potentially relevant studies, which are then screened based on their titles and abstracts. Studies that are clearly irrelevant are excluded at this stage. Afterwards, the remaining studies will be reviewed in full text. An analysis of a systematic review involves only studies that meet the inclusion criteria, whereas studies that do not meet these criteria are excluded from the analysis. The reasons for exclusion are documented and reported. The final step is to synthesize the research results from the relevant selected investigations, and report the findings of the systematic review. The PRISMA flow diagram serves as a useful tool for researchers to follow when conducting a systematic review, and provides a clear and concise visual representation of the study selection process as exhibited the same in the PRISMA checklist in Supplementary Material.

All results and discussions will follow the figure below to develop. The Figure 1 is a Illustrations of the systematic review process that includes searches of databases and registers. The diagram is designed to provide transparency and clarity in reporting the selection of studies for inclusion in a systematic review.

Figure 2 is a detailed overview of the systematic review process that covers searches exhibiting the analysis of information resources (datasets, records, archives), directories (documents), and related information sources. The diagram is designed to enhance the transparency and completeness of reporting the selection of studies for inclusion in this systematic review. The process flow diagram starts with the discovery of studies through a search of conference proceedings and reference lists. After being screened based on their titles and abstracts, the studies that emerged from this initial search are a pool of potential relevancy. It is at this point that studies that are obviously irrelevant are discarded. The remaining studies will then be read in full following that. Studies that don’t fit the criteria are excluded, and the systematic review is only of studies that do. Documented and disclosed are the exclusionary factors. The systematic review’s findings are reported after the information research outputs from the reviewed investigations have been synthesized. The PRISMA flow diagram offers a clear and concise visual representation of the study selection process, which is a useful tool for researchers to use when conducting a systematic review, which comprises analysis of databank information records, registries, and additional archives as exhibited the same in the PRISMA checklist in Supplementary Material. The use of the PRISMA flow diagram helps ensure that the systematic analysis is rigorous and transparent, thereby increasing the confidence and validity of the study findings. Figure 3 illustrates the overall research methodology to execute the critical review.

3.1. Data Acquisition

In order to obtain suitable articles, the keyword search methodology explained in Section 2.1 was used. These findings are summarized. Most scholarly works on JSSC can be found in journals that cover both fields, such as production research, advanced manufacturing technology, computers, and industrial engineering, “IFIP Advances in Information and Communication Technology”, “Procedia CIRP, and Computers and Operations Research”. Figure 4 illustrates the “annual variation in the number of publications on the study issue” under consideration. Research on production scheduling and control has been maintaining a slow upward trend since 2002; from 2012 to 2021, the number of research articles has been increasing gradually, the research field has been expanding, and the research content has been deepening, indicating that the field has attracted the attention of many scholars. While this trend may be influenced by some uncertain factors, the number of articles published during this period had a large decrease in 2013–2015, and after that, it has been rapidly and continuously increasing. In 2021, the number reaches the peak; this stage is the explosive period of production scheduling and control research. The overall trend indicates that the academic community has paid increasing attention to the production schedule as time changes. This field is still a hot topic for the future, and the number of annual publications may continue to increase.

3.2. Keyword Co-Occurrence Analysis

As high-level descriptions of a document’s information, keywords can help researchers identify the crux and substance of the investigation [10]. High-frequency and central terms can indicate the research discipline’s key ideas. The hue of the keyword’s links indicates the first occurrence of two keywords in a document. Brighter linking colors match the “initial year of co-occurrence” closest. CiteSpace provides keyword counts and importance. Thus, co-keyword analysis reveals the scheduling and control domain conceptual frameworks. The CreateSpace analysis settings: top 25 annually (2002–2022), LRF = 3, LBY = 5, and e = 1. Pathfinder pruned the sliced networks and co-occurrence network map. The 109-link, 97-node network is shown in Figure 5. In addition to frequency or count, the network centrality of a keyword can indicate its importance. Figure 6 shows the top five keywords with high counts or centrality.

From Figure 6, scheduling, production control, and manufacturing occupy the highest frequency and largest nodes, covering the entire research period; however, this paper used “manufacturing”, “scheduling”, and “production” for the initial search, thus, these three keywords occupy the highest frequency and largest nodes. After removing these words, the top five keywords were chosen and ranked by frequency and centrality (Figure 6): “Optimization”, “production scheduling”, “planning”, “genetic algorithm”, “decision making”, etc. High-frequency keywords cannot conduct, but they are central. The keyword graph’s inflection point is centrality ≥ 0.1, which may represent this field’s research hotspots. From the centrality, the top 1 is “genetic algorithm” with 0.68; a combination conclusion, with frequency, scheduling, and control hotspots, is focused on using the algorithm to optimize production.

Even though the “JSS problem is NP-hard”, these strategies can help get us closer to an ideal outcome. Meanwhile, from the centrality rank (Figure 6), we can conclude that controlling the whole job shop production process is important and attracts a lot of attention; many researchers are trying to optimize the source planning and scheduling [11]. Satake et al. [12] utilized a new method to decrease the production period. Thus, from all of these keywords, which are related to improving production and at the same time decreasing energy consumption, it is reasonable to provide a conclusion that, although many scholars are focused on the flexible job shop problem, little attention is given to the factors of energy and environment, which means that sustainability and green energy might be the next frontier and hotspot. Thus, we can know that in job shop production scheduling and control, many researchers are focused on different algorithms; researchers are not only focused on minimizing the production time, but the production energy as well. Moreover, we can find that production is changing from energy-consuming to green and sustainable production, and this change can reflect and support the innovation of Industry 4.0 [13,14,15,16].

3.3. Keywords Timeline

Keyword co-occurrence networks statically represent the research area. CiteSpace uses time zones to show JSSC keyword evolution [17,18,19,20,21,22,23,24,25]. Below is a Figure 7. showing the year that keywords first occurred. This graph shows keywords over time, as well as SC research trends. The key point is 2016. Industry 4.0 followed lean construction from 2002 to 2015. In this period, AI technology and big data were widely used in the whole working production process (design, fabrication, construction, and delivery) [26,27,28,29,30,31,32,33,34]. Morariu O. et al. [17] offer a “machine learning approach for reality awareness and optimisation in the cloud”, and Waschneck B. et al. [18] said that “AI-based methods will replace mathematical models”. Production problems were initially stochastic, not dynamic. Scholars then solve working process and inventory problems dynamically, closer to the actual production [35,36,37,38,39,40]. This transformation allows the entire production process to quickly adapt to market information changes, improving service levels [41,42,43,44,45,46,47,48,49].

In terms of the technologies used in Industry 4.0, the goal is to connect all objects in a factory through communication technology, and is varied depending on the four working processes [23,24,25,26,27,28,29]. For example, in the design period, BIM, AR, and VR are widely used in manufacturing [19,20,21,22,50,51,52,53]; during manufacturing, smart sensors and robots will provide great help [23,24,25,26,54,55,56,57]; in the construction stage, real-time location services, smart cranes, and virtual construction scheduling are widely used [27]; in the final delivery stage, BIM-based defect management (BIMDM) systems and building management systems (BMSs) are needed [28,29,30,31]. Generally speaking, in Industry 4.0 and smart construction since 2016, technologies such as “big data, AI, blockchain, E-business, and cloud computing”, which are based on computer science, were widely utilized in job shop production and construction. From the supply chain perspective, the powerful calculation power of these technologies enabled the making, planning, and achieving of dynamic production muti-optimization [32] and working process integration [33]. Furthermore, with this powerful technology, modern job shop production can be reasonably regarded as smart mass customization, which means it can not only meet the industry’s production needs, but can also meet the preferences of different customers [34].

3.4. Keyword Burst Analysis

The burst index can detect high-frequency keyword changes to determine research field frontier content, which will be chosen in CiteSpace to identify scheduling and control research hotspots [35]. Figure 8 shows 40 burst keywords; in chronological order, the burst keywords have been changing over the years from 2002 to 2022.

Manufacturing research has explored topics such as computer-aided manufacturing (2002–2006), heuristic methods (2002–2009), inventory control (2002–2007), optimal control systems (2002–2006), and intelligent manufacturing. Recent research hotspots include machine learning, deep learning, integer programming, and stochastic systems (2014–2022). Inventory control (65.56) is the strongest research topic, followed by Industry 4.0 (2017–2022), computer-aided manufacturing (25.61), multiobjective optimization (22.09), learning systems (21.01), and stochastic systems (20.02).

In 322 documents in our database, this keyword appeared 50 times in 2018, 87 times in 2019, and 126 times in 2020. Overall, we contend that studies of the circular economy and game theory are the current hot topics for SSCM research. Using CiteSpace [35], we explored “keyword burst detection” to find “research hotspots in the SSCM domain”. Figure 9 displays 40 keywords with at least two-year peaks. From 2007 to 2021, these have been evolving in chronological order.

3.5. Author Co-Occurrence Analysis

By using the bibliographic records, which contain information regarding the article’s authors, it is possible to map both the collaborations between researchers and the identification of the top researchers in a given field. Afterward, a network of co-authors can be created. First, the five most prolific authors were identified. According to Figure 10, L WANG, J WANG, and Y ZAHNG held the third position. CiteSpace is capable of visualizing and analyzing scientific knowledge [35]. Consequently, networks of co-authorship can be generated in Figure 8. Such a strategy has been identified as an effective technique for uncovering the concealed propositioning of a large dataset. By methodically producing numerous accessible graphs, CiteSpace excels at mapping different knowledge domains [35]. To create abstract clustering, it was also used to generate and analyze the networks of co-authors, countries, and co-occurrences as unveiled in the Figure 8 and Figure 11 respectively. CiteSpace’s burst detection is built upon the Kleinberg algorithm [36]. The factors were determined as when the “co-authorship network” was generated: top N (N = 15), LRF = 3, LBY = 5, and e = 1 for the years 2002 through 2022. The pathfinder technique was used to prune sliced and combined networks, producing the 187 nodes and 154 linkages shown in Figure 11. The number of citations a scholar has is indicated by the size of each node; the later the time of appearance, the deeper the node color. The core author will be selected from Price’s law. In this law “N is the total number of authors; M is the number of articles written by all authors; x_max is the number of articles written by the most prolific author in the selected group; m is the threshold of the prolific group, i.e., the number of articles written by the least prolific author in the group; y is the number of authors who wrote x articles”. From Price’s inference:

$[\sum _{x=m}^{x_{max}}{y}_x·x]/[\sum _{x=1}^{x_{max}}{y}_x·x]=1/2$

The above formula indicates that the group of highly productive authors wrote half of all the papers.

$\sum _{x=m}^{x_{max}}{y}_x\times x=[\sum _{x=1}^{x_{max}}{y}_x\times x{]}^{0.5}$

In this formula, the left part is M.

M is exactly the starting point for 50% of the total number of papers with highly productive authors; the value of m is obtained by inference (process omitted):

$m=0.749(x_{max}{)}^{0.5}$

From the above formula (m = 0.749 × √Ncmax), the minimum number of publications for the core author in this article is five, and there are 48 productive authors. We are focusing on the top five authors (Figure 8) in the following analysis.

The density of cooperative relationships in the network is 0.0089, and there are no scholars for which the centrality is more than 0.1 in the field of “production scheduling and control research”, which means that the coordination is weak between different authors. In addition, these top five authors constitute their respective author groups. There are also some small collaborative teams with only one link between two nodes, and their networks do not unfold; thus, they are limited to two-person collaboration and their collaborative power is weak.

The top 10 nations (out of 150) that published papers in the scheduling and control area are shown in Figure 12 in terms of publications, total papers, and centrality. Figure 12 shows the visualization maps of the research nations that have produced literature; as can be seen, these nations constitute a loosely connected network of relationships [54]. Therefore, the more publications a nation has in common with other nations, the more central it is. A total of 5052 papers on this topic were obtained for the years 2002 through 2022 after using CiteSpace’s “remove duplicates” function [37]. The visualization map for nations where ES research has taken place was created using the pruning option (pruning based on Pathfinder/Pruning sliced networks). Following software execution, the network gained 150 nodes, 164 linkages, and a density of 0.0147. Figure 13 lists the top ten producing nations.

Institutional contributions were also identified. Figure 12 shows that there are 50 nodes, 31 connected lines, and a density of 0.0253. The number of publications is indicated by the node size, with larger nodes indicating larger issuance, and vice versa. Centrality reflects the level of importance, with higher centrality indicating higher importance. The visualization results, from the 5052 documents selected for this study, allow identification of the main institutions in the field. The first ranking is Shanghai Jiao Tong University, with 71 articles on IoT-based manufacturing, resources management [38], job shop scheduling [39], etc. The next is Tongji University, with 64 articles focusing on the scheduling of semiconductor manufacturing [40], deadlock-free genetic scheduling algorithms [41], and real-time scheduling [42]. The number of publications from these two institutions accounts for approximately 25% of the top ten institutions, and has a high impact.

3.6. Author Co-Citation Network

Making an “author co-citation network” has the aim of identifying academics whose works are related to the SSCM research area. Whenever two academics are referenced in the same work, this is referred to as co-citation. As analytic objects, we used references from 9151 peer-reviewed papers. The CiteSpace configurations were: LRF = 3, LBY = 5, e = 1 (2002–2022), and top N (N = 50). The pathfinder algorithm pruned the sliced and merged networks, leaving 531 nodes and 848 links. More citations mean bigger nodes. The first author label is applied to nodes with more than 150 citations. Purple circles cover nodes with centralities above 0.1. From Figure 14 and Figure 15, we can identify highly cited and/or central researchers.

Figure 15 shows the top five most co-cited authors: Michael Pinedo (282 citations), Lihui Wang (210), Rubén Ruiz (180), Michael R. Garey (154), and Weiming Shen. Figure 16 shows the top five authors’ citation distribution. Between 2002 and 2022, these five scholars’ overall citations increased. Professor Michael R. Garey is cited the most every year, except 2021. Lihui Wang, who works on digital twins, smart manufacturing, human–robot collaboration, and more at Sweden’s KTH Royal Institute of Technology, was first cited in 2003. In 2021, his citations surpassed Michael R. Garey’s, putting him in first place. Professor Rubén Ruiz (Universitat Politècnica de València) studies scheduling, routing, optimization, and metaheuristics, and is cited increasingly. New York University professor Michael Pinedo specializes in financial services planning and scheduling. Weiming Shen, a National Research Council Canada and University of Western Ontario professor, has citation trends similar to Michael Pinedo.

There are six scholars whose centralities are greater than 0.2, implying that they are more influential than others, and have a substantial effect on the growth of scheduling and control research. These authors include GOLDBERG DE (centrality: 0.3), DAI M (centrality: 0.28), PRABHU VV (centrality: 0.26), HE Y (centrality: 0.25), ZHANG R (centrality: 0.25), and OGBU FA (centrality: 0.22). “When authors have a high number of citations and centrality, they can be considered influential or leading scholars” [43,44]. Lihui Wang, Rubén Ruiz, and Shiqiang Wang are regarded as leading researchers based on their citation counts and centralities, which exceed 500 and 0.1, respectively.

3.7. Document Co-Citation Network and Clustering

Document co-citation analysis shows a research field’s intellectual structures by revealing the quantity and authority of references cited in publications. Citation relationships are represented by document co-citations. The literature’s co-citation network was created by extracting references from the top 50 cited papers from each 1-year time slice between 2002 and 2022. Integrating and clustering co-citation networks produced 6580 nodes with modularity Q = 0.9656. The large number of isolated clusters lowered the mean value to 0.3647. Papers are the nodes in the network diagram, and the connecting lines show co-citation relationships, with colors indicating when they were established. Early SC research appears in the top right corner. Figure 12 illustrates the study’s color distribution evolution. Co-citation network analysis shows clustering related to #1 cooperative manufacturing management framework, #3 future requirement, #4 research theme, #6 event-driven control architecture, and #7 power consumption uncertainty; #1, #3, and #6 have similar content. On the left side of the network as illustrated in the Figure 17, recent research papers include #0 flexible manufacturing systems, #2 manufacturing operation scheduling, and #5 service supply chain. Flexible manufacturing systems and manufacturing operation scheduling dominate the production scheduling research. Production scheduling and control research is also found in these clusters. Early SC research papers, on the right side of the co-citation network, focus on schedule and control job shop production; this is the co-citation network’s trend and frontier. Mutations are dark-filled nodes in the co-citation network, according to Kleinberg’s burst detection [36]. These burst event segments demonstrate the academic community’s interest in the paper’s research at the time, demonstrating changes in the paper’s importance to related research. The network analysis reveals the emerging research areas and representative literature, as shown in Figure 11. Moreover, #0 and #1 are the largest clusters; combined with the color consideration, cluster 1 becomes grey, indicating it experiences a relatively long time from the statistical period, while cluster 2 is brightly colored, indicating that this cluster is the current popular research area. Thus, this article focuses on clusters #0 and #2 for the analysis: cluster #0 (flexible manufacturing system) indicates that a large number of studies refer to flexible manufacturing, and cluster #2 (manufacturing operation scheduling) indicates that a large number of studies refer to manufacturing operation scheduling. Figure 18 and Figure 19 have exhibited the myriads of investigators/authors refer who have conducted studies on flexible manufacturing system (cluster #0), and manufacturing operation scheduling (cluster #2).

4. Current Research

Since the first papers were published in this field in the late 1970s, a sizable body of research literature has accumulated. These reviews, however, emphasized particular viewpoints, such as analytical models or scheduling issues. In this paper, we attempted to review articles with broader methodological perspectives. This review has also been more recently updated. We examined the literature from a variety of angles: 1. model classification; 2. algorithms; 3. industry problems; 4. advantages and disadvantages. Moreover, the main scheduling and control methods are subdivided and categorized into several parts, the details for which are shown in Figure 20.

Exact methods, also known as optimization methods, can guarantee the global optimal solution, but these can only be used to solve “small-scale problems”.

4.1. Exact Method

The precise methods are primarily based on operational research. Although the exact method can theoretically find the optimal solution, its practical application is limited.

4.1.1. Lagrange Relaxation

Lagrangian relaxation is an approach for finding the best answers to challenging optimization issues. This approach aims to optimally resolve complex problems in polynomial time by loosening some constraints in the problem and incorporating them into the “objective function” using “Lagrangian multipliers”, followed by iteratively updating the multipliers using the gradient method to continuously raise the lower bound and lower the upper bound. Tang and Xuan [45] applied the “Lagrangian relaxation algorithm to the mixed flow job shop scheduling problem to minimize the total weighted completion time”. Tang et al. [46] developed a “mixed integer programming model for the steel production scheduling problem and proposed a Lagrangian relaxation algorithm to solve it efficiently”. Tang et al. [47] combined the “Lagrangian relaxation algorithm with the column generation algorithm for the optimization of the co-located batch decision-making in the steel industry”.

4.1.2. Branch-and-Bound Method

This algorithm solves integer programming problems by partitioning feasible solution spaces, relaxing integer variables, and calculating upper and lower bounds, called bounding. Pruning deletes the worse solutions in order to reduce the search range until the upper bound equals the lower bound, resulting in an optimal solution. This approach reduces computational complexity by avoiding unnecessary searches. However, the algorithm requires large memory space to store root node information throughout the search process. In order to discover the best solution to the scheduling problem for up to 50 workpieces, Pots and Van Wassenhove [48] devised a branch delimitation algorithm for the single-machine production scheduling problem, and integrated it with the Lagrangian algorithm. Abdul-Razaq et al. [49] examined “branch-and-bound and dynamic programming” techniques and contrasted them using 50 workpiece instances. According to the experimental findings, this method can immediately identify the best solution to a small-scale problem, but it is impossible to quickly identify the best solution to a large-scale problem. This approach was utilized in a mixed-flow shop by Zhang W. [50] to reduce the overall drag time. In order to enhance performance, Néron E. et al. [51] integrated the ideas of inference (energetic reasoning) and global operations into the branch.

4.2. Approximate Method

The exact method is suitable for “small-scale problems”. The production scheduling problems in manufacturing are usually complex and large-scale; moreover, the speed of solving problems is often demanding and important, so it is difficult to apply the above-mentioned exact algorithms to the actual production problems. Due to these limitations, approximation algorithms have received a lot of attention from both academics and industries. They have advantages such as simple structure, fast solution speed, and the ability to give an approximate optimal solution.

4.2.1. Intelligent Optimization Algorithm

Intelligent optimization algorithms are the most common methods because they do not seek to obtain the optimal solution, but obtain a satisfactory solution, which is more suitable for solving complex production problems. Additionally, intelligent optimization algorithms generally simulate a phenomenon or group behavior in the natural world, making them highly self-organizing, self-learning, and self-adaptive in the search process. They are easy to parallelize, which makes them different from the exact methods. In addition, this method can be subdivided into individual inspiration methods (tabu search algorithm, a simulated annealing algorithm, genetic algorithm, etc.) and population-based inspiration algorithms (ant colony algorithms, artificial bee colony, particle swarm optimization, differential evolutionary algorithm, etc.)

“Simulated Annealing Algorithm” (Individual Inspiration)

This algorithm was first suggested by “Metropolis”, and its optimization approach alludes to the “physical annealing” procedure. “Job shop scheduling is a challenge that Matsuo [52] and Van Laarhoven [53] have addressed using the simulated annealing method. With the optimization goals of minimizing the completion time and the number of jobs with delayed completion, Chakraborty [54], Suresh [55], and others used the simulated annealing algorithm to solve the flow shop scheduling problem. The algorithm’s effectiveness was shown by contrasting the algorithm’s performance to the previous results. The fast simulated annealing process and quenching hybrid algorithm were used by Akram [56] and colleagues in 2016 to locate the global best solution and avoid falling victim to local optimizations. The job shop scheduling problem was optimized with the goal of minimizing completion time and compared against 88 benchmark cases; the ideal answer was 45 within a tolerable amount of time. Finally, it is shown that the algorithm can successfully identify the job shop scheduling problem’s optimal solution”. This approach can reach the global optimal value, since it needs a high beginning temperature and a slow cooling rate.

Tabu Search (Individual Inspiration)

The tabu search algorithm finds approximate optimal combinatorial solutions. Glover and Hansen proposed it in 1986, and Glover perfected it. It can solve some scheduling problems optimally. Tabu can solve many scheduling issues. The original solution, neighborhood structure, search approach, and table length are only a few of the issues with tabu search. Taillard used tabu search to schedule jobs for shops. “A critical path and block structure-based tabu search algorithm was presented by Nowicki et al. [57] to solve JSP. An N7 neighborhood-based tabu search technique was put forth by Zhang [98] in 2007. To overcome JSP difficulties, Sonawane et al. [99] combined the Genetic algorithm and the tabu search algorithm in 2014. For larger and more complicated scheduling issues, the tabu search method can achieve a faster average completion time. The tabu search algorithm is better. The tabu search algorithm has issues with the initial solution, the neighborhood structure, the search method, and the length of the tabu table”. These issues can be resolved to benefit the tabu search algorithm.

Genetic Algorithm (Population-Based Algorithm)

The genetic algorithm, an intelligent optimization algorithm that simulates nature’s evolutionary process, can search globally. Biogenetics selects fit individuals, crosses and mutates them to create new ones, and then replaces parents with better ones. Thus, everyone’s fitness improves. Genetic algorithms self-organize and learn. Tabu search and annealing algorithms repeat one solution. Genetic algorithms are used in production scheduling, group optimization, machine learning, pattern recognition, optimal control, and other fields. Huang and Süer [100] examined an allocation rule-based hybrid multiobjective “genetic algorithm”. Yang et al. [101] proposed a hybrid genetic algorithm for mixed-batch scheduling and planning. Goncalves [102] suggested incorporating local search into a hybrid genetic algorithm for production scheduling. “ Figleska [103] investigated a special scheduling problem with multiple parallel machines in the first stage and one single machine in the second stage, and external resources are only available at a specific time”. Muthiah and Rajkumar [104] proposed a genetic algorithm and an artificial bee colony algorithm for the job shop scheduling problem. The artificial bee colony algorithm performed better due to its local search ability. In practical production scheduling problems, Wong et al. [105] studied an integrated optimization problem of mould maintenance and production scheduling, taking into account maintenance cost, and proposed an effective legacy algorithm. Maimon and Braha [106] proposed a better genetic algorithm for single-machine circuit board production scheduling.

Ant Colony Optimization (ACO) Algorithm (Population-Based Algorithm)

Italian scholar Dorigo [107] proposed the ACO algorithm in 1991 to simulate ants’ food-finding behavior. Ants leave “stigmergy” or “pheromone” as they search for food, which later, ants in the same colony can use to influence their behavior. Colorin et al. solved the workshop scheduling problem with the ACO algorithm, and many Chinese scholars have studied it. Despite slow convergence, the ACO algorithm solves complex combinatorial optimization better, such as robustness”. Liao and Juan [108] used the “ant colony optimization algorithm” to reduce work time. Lin et al. [109] improved the flow shop scheduling ant colony algorithm. Yagmahan and Yenisey [110] proposed a multiobjective “ant colony optimization algorithm” for flow shop scheduling under multiobjective conditions, and tested it with standard problems. Cheng et al. proposed an efficient “ant colony algorithm” [99]. Mohammad et al. [111] improved the ant colony algorithm for automated car scheduling. Neto and Filho [112] reviewed the use of the ant colony algorithms in production scheduling, and suggested improvements.

Particle Swarm Optimization (PSO)

The PSO algorithm, proposed by “Kennedy and Eberhart” [113], simulates birds’ self-organization, self-learning, and self-adaptation. In this algorithm, each particle represents a solution, and records its best solution so far (personal best solution). The population’s best solution is the global best solution. Thus, the particle’s next flight direction depends on three factors: the particle’s original speed, which indicates search inertia; the individually best solution; and the population’s best solution. In this way, the grains will keep their original direction while learning from both their individual best solution and the global best solution, improving search efficiency. It also has a fast convergence rate, but it tends to fall into local optimality. “JJ BAI et al. [114] proposed a method based on a particle swarm algorithm to solve MOFJSP batch scheduling, which introduces preference information to guide the particles to approach the Pareto front. G. Moslehi et al. [115], Liu et al. [116], Mostaghim et al. [117], and Tripathi et al. [118] used local search techniques, collaborative optimization techniques, the sigma method, and important parameter adaptive techniques to enhance the local optimization of the particle swarm algorithm to avoid local convergence. Shao et al. [119] proposed a hybrid algorithm based on discretized particle swarm and simulated annealing, which theoretically improved the application of the particle swarm algorithm in the field of MOFJSP discretization. The methods proposed in [114,115,116,118,119,120] all use the particle swarm algorithm based on the Pareto optimization technique. In general, the particle swarm algorithm has fast convergence and computational simplicity, but it easily falls into local optimum”.

Differential Evolution Algorithm (Population-Based Algorithm)

This algorithm uses GA-like variation, crossover, and selection. From a randomly generated population, it uses the different vectors of two randomly selected individuals as one of the evolutionary directions for the third individual, and sums them according to certain rules to create a new variant. “The target is crossed with the new variant to create a new test. Selection takes place when the new one is better”. The differential evolution algorithm uses these three processes because the selection operation keeps better solutions, and eliminates inferior ones to evolve the population towards the optimal solution. This algorithm solves group optimization problems, such as production scheduling, because it avoids local optimization and has strong global convergence. Deng and Gu [121] proposed a discrete differential evolution algorithm for the problem of the replacement flow shop scheduling without idleness, in which variation, crossover, and selection operations under discrete conditions are defined. For the same problem, Tasgetiren [122] combined a variable iterative greedy algorithm with a differential evolutionary algorithm to propose a highly efficient hybrid differential evolutionary algorithm. Liu [123] proposed a sequential differential evolutionary algorithm for the traditional flow shop scheduling problem, and used a rule to transform a continuous solution into a discrete scheduling solution.

Some of the approaches used to solve the scheduling problem are: ANN, multiagent system, Petri net, cultural algorithm, DNA algorithm, memetic algorithm, scatter search, and others. See Figure 12 for details. Each algorithm has pros and cons, so how to combine them is a hot topic. The following Table 1 summarizes and frequencies some common algorithms found in the 5052 documents selected for this research.

4.3. Production Control

Production control (PC) is the managerial responsibility for organizing, directing, and overseeing the procurement of raw materials and their processing within an organization. Based on the selected 5052 papers, we summarized them and classified them as the framework: 1. Regulated by orders; 2. Regulated by Inventory; 3. Flow-scheduled systems; 4. Hybrid control systems.

4.3.1. Regulated by Orders

Contract-Controlled System

The system essentially splits up large, complex contracts into many smaller orders for individual items. Additionally, the system establishes deadlines for each item’s delivery or completion. The contract must be finished within the specified finishing date, so the work must be performed accordingly. As a result, it helps manage complicated project systems. Contrary to the majority of other SCO types, this system typically focuses on controlling production from the early stages of design.

4.3.2. Regulated by Inventory

CONWIP (Constant Work-in-Progress)-SLC System (Pull-Based)

Spearman et al. proposed the “CONWIP system” (1990). The quantity of cards sets a limit on the total amount of work being performed. The logic behind how this system operates is as follows: in order to authorize a job to enter the production line, a card that is available must be present. Numerous researchers, such as Papadopoulou et al. [172], Yang [173], and Krishnamurthy [174], have suggested that the CONWIP-SLC is suitable for a “flow shop repetitive environment”. According to Li [175], this system allows for a greater variety of products than Kanban systems. Ryan [176] explained the procedure of using CONWIP in a job shop with multiple products. Slomp’s recent study [177] demonstrates a practical application of CONWIP-SLC. According to Stevenson et al., a variation of the CONWIP system, known as “m-CONWIP”, can be used in a setting with a greater variety of products. For every shop floor routing scenario, there are m (multiple)-CONWIP loops in this system.

Kanban-SLC System

This approach was defined as “Kanban variations that follow the PPC department’s pull production from stock without central scheduling. The most common Kanban types are production (P-Kanban) and transportation (T-Kanban)”. When both types are used, it is called dual-card Kanban. When only one type is used, it is called single-card. Arbulu’s construction material procurement process uses Kanban [178]. Kumar and Panneerselvam [179] noted that supply chain management, CONWIP, and Kanban can help JIT initiatives succeed. The Kanban system reduces inventory by producing just-in-time to meet demand at each stage [179,180]. N. Singh and Kwok Hung Shek [180] used the general purpose simulation system to study the “Kanban system” in an assembly area. For repetitive flow shop systems, Snyder [181] recommends the “Kanban system”. “The development of the Kanban system at a local manufacturing company in Malaysia” is presented by Naufal et al. [182]. This system is also a “key operations management tool” in “Lean manufacturing” [183].

Periodic-Review System

In this system, the inventory level (I) is checked at fixed intervals, called review periods. The quantity needed to make the inventory reach a predetermined level S is the size of the order. Two examples of studies discussing this system in the literature are the works by Maddah et al. [184] and Li Z. et al. [185]. Consider a periodic-review inventory system with erratic supply and demand. A periodic review inventory system with two resupply modes, a normal mode and an emergency mode [186], also creates processes to deal with the inventory issue in these two modes.

4.3.3. Flow-Scheduled Systems (FS)

There are several systems are based on flow scheduling, such as the PBC (period batch control) system, the MRP (material requirements planning) system, and the OPT (optimized production technology) system. Each of them has its own features and applications. For instance, the inventory between each production and demand stage is constrained in the base-stock system. In PBC, it is a cyclical process, which means that all of the needed components are to be prepared in the previous stage. Companies can determine when, how many, and what products to produce and purchase by using the MRP system. It runs on a preset cycle in which the components needed for a later period in the following stage are produced (Benders and Riezebos [187]). As a result, the previous stage of production is scheduled to include building and constructing the products in one session, which is based on the definition of final product production (semifinished products, components, and raw materials).

PBC System

In or around 1926, Mr. R. J. Gigli developed the PBC system. It is a cyclical system that runs on a fixed cycle or periods, during which, the components needed for a later period in the following stage are produced (Benders and Riezebos [187]). As a result, the previous stage of production is scheduled to include the building of all the components needed to construct the products in one session. According to Maccarthy and Fernandes [188], the repetitive and semirepetitive production systems are a good fit for the application of PBC. Tesic et al. [189] developed a new model to implement the “PBC system into a virtual manufacturing environment, to better integrate the production planning with the applications of group cells”. Moreover, it is important to remember that Benders [187] thought the PBC system was a classic, and not out-of-date system. Stevanov B. et al. [190] used this system, combined with computational methods, to deal with the railway brake services [191].

MRP System

Since the 1970s, large corporations around the world have used MRP, a sophisticated SCO. MRP helps companies decide what, when, and how much to make and buy. It can handle complex situations, such as many products with a BOM, according to Velasco [192] and Arnold [193]. “Non-repetitive production systems” can use MRP [188,194]. Gupta and Snyder argue that MRP can be used with other SCOs due to its adaptability [181].

OPT System

Eliyahu Goldratt created the OPT (optimized production technology) system in the 1970s. The OPT system is made of two basic components: software, and a philosophy that is embodied in the well-known 10 OPT [195,196]. The BUILDNET module receives input data as part of OPT software’s fundamental operation. The SERVE module then determines a resource’s average utilization and load profile. “The SPLIT module divides the network into critical and noncritical resource areas” based on this capacity calculation. Additionally, time buffers are allotted where necessary. Finally, the OPT module creates a realistic master production schedule using a good heuristic. There is OPT parameterization in the work of Croci and Pozzetti [197].

4.3.4. Hybrid Systems

Apart from the above system, there also burst some new control systems which combined some of the former ones, and the typical example is the “POLCA (paired-cell overlapping loops of cards with authorization) system”. In this system, POLCA cards are the name for production control cards. This process, which releases authorizations through a “high-level centralized material requirements planning system (HL/MRP)”, controls the flow of orders through the various cells. Because of its operational logic, POLCA is a hybrid system. Regarding the field of application, according to Krishnamurthy et al. [198] and Suri [199], POLCA is a quick-response manufacturing strategy designed to address material control. “Lödding et al. [200] suggest POLCA for environments with a high number of variants and complexity of materials flow. Optimization of the POLCA system is found in Fernandes Braglia [201] and Santos et al. [202]. Chinet [203] gives an overview of POLCA research, as well as a relevant case study”.

4.4. Integrated Scheduling and Control System

This system is the best solution to respond to the dynamic environment. Scheduling policy solving and control command computation are used as virtual objects, and automation devices as physical objects. One of the classic systems, such as parallel Petri nets [204], provides a feasible solution to achieve the interactive co-integration of the physical and information worlds [205]. In addition, digital twins can be applied to different layers of the production process, such as the equipment layer, the production line layer, and the factory layer, and achieve the interconnection of shop floor information and physical space. Research on integrated scheduling and control in industry is currently focused on power grids [206], railroads [207], and elevators [208]. Baldea and Harjunkoski [209] systematically reviewed the theory of “integrated production scheduling and process control”, and summarized the integrated model into the following types: top-down integration approaches, bottom-up approaches, and state-space scheduling.

4.4.1. Top-Down Approaches

Top-down approaches are scheduling frameworks with dynamics and control components such as time scale-bridging. Dynamic optimization can create good scheduling and control options using all relevant dynamic and economic data. They use open-loop control, but lack a feedback structure to ensure process stability and performance outside of the rated operating conditions (Mitra et al. [210]; Zhuge and Ierapetritou [211]). It has no explicit feedback structure for stability and performance, and is subject to scheduling and control disturbances (e.g., fluctuations in feed quality). Zhuge and Ierapetritou [211] proposed a scheduling mechanism that recomputes the plan and control actions for the remaining cycle time after a disturbance, building on Flores-Tlacuahuac and Grossmann [212]. “(Based on crossing a threshold between target and actual process states). Terrazas-Moreno et al. [213] discuss workload-reducing decomposition methods”. Numerous cases [214,215,216,217] have shown that process system input–output dynamic behavior is slow, emerges over a time scale relevant to scheduling computation, and can be described by a low-dimensional model.

4.4.2. Bottom-Up Approaches

This strategy involves including “economic considerations in the design of the plant’s overall control framework”. Skogestad [218] suggested this consideration at the “level of the distributed control system”, while Kadam and Marquardt [219] and Engell [220] recommended it as part of the supervisory controller. Reaidy [221] proposed integrating bottom-up and IoT to enhance the flexibility of warehouses in a dynamic environment.

4.4.3. State-Space Scheduling

The growth of state spaces has attracted the attention of researchers. This includes the existence of perturbations, and the necessity of updating control procedures and schedules in the event of perturbations. In the report by Gallestey et al. [222], for instance, hybrid MPC is applied to scheduling issues, and multiple authors have discussed multiparameter scheduling solutions. Several authors have talked about this approach [223,224,225,226,227,228].

5. Discussion and Future Trends

5.1. Overview

In order to review the body of knowledge on job shop production scheduling and control, this study uses scientometric analysis. The study of classical scheduling theory in the workshop started in the 1950s, and the first study was published in 1959. There were not more than 100 articles a year until the late 1980s. A general upward trend in publications over the past 20 years, with a peak in 2021, confirms the growing interest in the study of shop floor scheduling control issues. The articles, however, are primarily focused on the areas of engineering and computers, with 36.9% and 25.0%, respectively. This highlights the close relationship between product development and computers in modern engineering [229,230,231].

This network analysis study examined the relationships between research countries, key researchers, and published documents. The “co-citation network mapping” results presented in Section 3.4, Section 3.5 and Section 3.6 highlight global and homogeneous researcher interactions. First, China leads in research influence, along with the U.S.A. China keeps links with other countries in Figure 9, but Italy, the U.K., and France are weak. Most researchers co-cite influential JSSC scholars (Figure 8). This agrees with the observations in Section 3.2 and Section 3.7 that scholars in this field, and in different national regions, do not communicate enough.

Overall, “the publication bottleneck in which manufacturing-related research is published on JSSC is more complicated [232,233,234]. A journal’s value as a source of knowledge can be measured by the number of studies it publishes in its particular field [235,236,237]. In this regard, the International Journal of Production Research has published the most articles on the topic under review, a total of 279. In addition, it contains a greater number of citations than Computers and Industrial Engineering and the International Journal of Advanced Manufacturing Technology [238,239,240]. In summary, the International Journal of Production Research appears to be the leading journal in its field” [241,242,243]. Thus, based upon existing studies, this study has explored the research implementation by analyzing and classifying the present research status, research hotspots, and potential future trends in this field of “Lean Construction”, “job shop scheduling and control (JSSC)”, and “Information and Communication Technology” [244,245]. As organizations recognize the importance of scheduling control, an increasing number of them are adopting it as a means to attain social, environmental, and economic advantages [246].

5.2. Future Scope

Even though the knowledge appears to concentrate on all of the key themes in manufacturing, including “operational and management issues, resource optimization, better production scheduling, and activity tracking, it is possible to identify emerging issues in the field, and potential partnerships between research clusters. Some following topics, such as “smart manufacturing”, “decision-making system” and “Integration of scheduling and control” are proposed to be added to the current research agenda in the field of scheduling and control in manufacturing” in this section. For example, smart manufacturing can benefit from real-time machine visibility, thanks to the application of augmented reality technology. The AR interface can reflect the status of a machine and its processing behavior through a visualized model in real-time using data from smart machines. Users can view projected machine data on a real machining scenes with AR-enabled real-time visibility [224]. In decision-making systems, cloud technology and big data will be used, which enable end users to conveniently pay as they go for services when they are needed [225], and could be set up on a cloud platform for easy end-user download and use in daily decision-making. Last, is the “Integration of scheduling and control”, which is currently a new area of research interest. Because the two theories were created independently for a long time, there are numerous modeling, numerical, and organizational hurdles to their smooth integration. When combining their needs, the first thing to take into account is their various temporal horizons [226]. The synchronization of calculation and decision-making, on several time scales, is difficult because scheduling takes hours or days, and control takes minutes or seconds [227]. The scheduling model is usually static and must be upgraded to dynamic, while the control model is usually linear and must be upgraded to nonlinear [228]. Thus, integrated intelligent scheduling control requires fast dynamic and nonlinear model real-time computations. Thus, future research will continue to create a great integrated system.

6. Conclusions

Scheduling and control in production, particularly in uncertain environments, have garnered the attention of researchers. Acknowledging the significance of scheduling control, more and more companies are implementing it to achieve social, environmental, and economic benefits for their organizations. Similarly, recognizing the importance of lean construction, companies are increasingly adopting scheduling practices to achieve their organizational social, environmental, and economic goals. The increasing number of empirical and conceptual papers on job shop scheduling and control (JSSC) indicates that research in this area is gaining academic attention. However, a limited literature review on JSSC does not provide a better understanding and overview of developments in this field. To address this, the main objective of this study is to provide a visual and systematic scientometric review of 5052 articles and reviews published from 2002 to 2022. Research methods include co-authorship analysis, co-keyword analysis, and co-citation analysis. This study aims to answer the following questions: What are the unique technologies in the scheduling control (SC) field? What are the development processes in the SC field? What are the future trends in the SC field? By focusing on key nodes with high frequency, centrality, and burst intensity, and the articles contained behind them, this report sheds light on key emerging trends that are of value to the reader. We find that there are some limitations regarding databases, search terms, methodology, and citation manipulation. Future research could retrieve data from other databases, cover papers with a wider variety of language, combine scientometric review with the conventional systematic review method, and focus on tracing and addressing issues with citation manipulation. Overall, this study aims to help researchers and practitioners better understand the developments in the field of job shop scheduling and control.

Author Contributions

Conceptualization, L.T., T.L.K., Z.Z. and S.S.; methodology, L.T., T.L.K., Z.Z. and S.S.; formal analysis, L.T., T.L.K., Z.Z., A.S.M.M. and S.S.; investigation, L.T., T.L.K., Z.Z., A.S.M.M., S.S. and D.Z.; writing—original draft preparation, L.T., T.L.K., Z.Z. and S.S.; writing—review and editing, A.S.M.M., S.S., K.P.S., S.M.E. and D.Z.; supervision, S.S., K.P.S., S.M.E. and D.Z.; project administration, S.S. and S.M.E.; funding acquisition, A.S.M.M., S.S., S.M.E. and D.Z. All authors have read and agreed to the published version of the manuscript.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

No data were used to support this study.

Conflicts of Interest

The authors declare no conflict of interest.

Footnotes

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.

Figures and Table

Figure 1. PRISMA 2020 flow diagram which included searches of databases and registers. * refers to the filter potions or key inclusive and exclusive criteria for systematic review.

Figure 2. PRISMA 2020 flow diagram which included searches of databases, registers, and other sources. * refers to the filter potions or key inclusive and exclusive criteria for systematic review.

Figure 3. Overview of the research methodology.

Figure 4. “Historical trend of published studies” in JSSC for manufacturing (period 2002–2022).

Figure 5. Network of “co-occurring keywords related to JSSC” in manufacturing (period 2002–2022).

Figure 6. Two lists of keywords.

Figure 7. Keywords of the timeline related to JSSC in manufacturing.

Figure 8. Network of co-authorship for JSSC-related manufacturing publications.

Figure 9. Keyword burst in the 2002–2022 period exhibiting with diverse colours.

Figure 10. The top five most prolific authors from 2002 to 2022.

Figure 11. Network of countries.

Figure 12. Top 10 most productive institutions in the 2002–2022 period.

Figure 13. List of the top ten most productive countries between 2002 and 2022.

Figure 14. Network of author co-citation for publications related to JSSC in manufacturing.

Figure 15. Top five most co-cited authors.

Figure 16. Citation distribution of the top five most cited authors.

Figure 17. Document network of co-citation.

Figure 18. Top 10 most cited authors in cluster #0 [58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77].

Figure 19. Top 10 most cited authors in cluster #2 [78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97].

Figure 20. The main scheduling and control methods.

Table 1

Common job shop scheduling and control algorithm classification and statistics table.

Category	Name of Methods	Exact or Approximate	Feature	Advantage	Disadvantage	Application	References	Quantity of Methods (%)
Enumerative methods	Decomposition method	Exact	The optimization problem transformed into a mathematical planning problem	Obtain the exact solution when the problem size is small	The solution time grows exponentially when the problem is an NP-Hard problem	Scheduling problem	[45,46,47]	1.13%
	Lagrangian relaxation method	Exact						14.29%
	Mixed integer linear program	Exact						0.40%
	Integer linear program	Exact						0.49%
	Branch and bound	Exact	Subdividing a problem into several subproblems and cutting out meaningless branches	Obtain the optimal solution and fast average solution speed	Takes up a lot of memory space	Integer planning problems, production schedule problems, site selection	[48,49,50,51]	0.20%
Local search	Greed algorithm	Approximate	The global optimal solution can be obtained by local optimal selection	Small code size, high operational efficiency, low space complexity	Cannot guarantee that the final solution obtained is optimal, cannot be used to solve maximum or minimum problems	Combinatorial optimization problems	[124,125,126,127,128]	2.24%
	Clone selection algorithm	Approximate	Distributed, adaptive learning, and parallel computation	Fast convergence and algorithmic diversity	Premature convergence and lack of cross-operation problems	Constrained optimization, dynamic optimization, time uncertainty scheduling problem	[129,130,131,132,133,134,135]	0.08%
	Variable neighborhood	Approximate	Changing the neighborhood structure	Versatility, robustness, few parameters	Long solution times for complex problems	Scheduling issues, vehicle path issues, color quantification, continuous optimization problems	[136,137,138,139,140,141]	3.48%
	Tabu search	Approximate	Avoid loops in the search process, only advancing and not retreat	Easy to obtain excellent solutions	Initial value sensitive	Displacement issues, scheduling issues	[57,98,99]	9.76%
	Simulated annealing	Approximate	Multiobjective optimization	Flexible, wide application, high operating efficiency	Longer optimization process	Neural networks, image processing, VLSI (very large-scale integrated circuit) optimal design, production scheduling	[52,53,54,55,56]	4.33%
	Differential evolution algorithm	Approximate	Group difference-based, heuristic, randomized search algorithm	Fewer undefined parameters, less likely to fall into local optimum, fast convergence	Search stagnates when the population is small	Data mining, pattern recognition, digital filter design, artificial neural networks	[121,122,123]	2.85%
Artificial intelligence	Genetic algorithm	Approximate	Simulating natural evolution to search for optimal solutions	Fast random search capability, scalability	Poor local search capability, easy to fall into “premature”	Combinatorial optimization, data mining, image processing, production scheduling	[100,101,102,103,104,105,106]	28.70%
	Ant colony algorithm	Approximate	Self-organization, positive feedback, global optimization	Excellent computing power and operational efficiency	Slow initial convergence	Multiobjective optimization, data classification, data clustering, pattern recognition	[107,108,109,110,111,112]	1.46%
	Particle swarm optimization	Approximate	Swarm intelligence, random search	Highly versatile algorithm, adjust few parameters, simple principle, easy to implement, fast convergence speed	Not enough search accuracy	Neural network training, image processing field, electric power system field, the field of mechanical design	[113,114,115,116,117,118,119,120]	9.36%
	Immune algorithm	Approximate	Swarm intelligence search algorithm, global convergence	Ensures population diversity, overcomes the ‘early maturity’ problem, and allows for a globally optimal solution	Easy to fall into local search, bad group diversity	Nonlinear optimization, combinatorial optimization, control engineering, robotics, fault diagnosis, image processing	[142,143,144,145,146,147]	1.80%
	Chaotic algorithm	Approximate	Randomness, traversal, regularity	High efficiency, confidentiality, and ease of use	Uneven traversal, high search density at boundaries, long search time	Image data encryption, secure communications, control systems, and optimization	[148,149,150,151]	1.23%
	Multiagent system	Approximate	Autonomy, interaction with other agents and people, time continuity, self-adaptability, mobility	Scalability and design flexibility and simplicity, reduces system complexity	Gossip problem, delay in information exchange	Large-scale complex problems	[152,153,154,155,156,157,158,159]	5.13%
	Expert system	Approximate	The combination of “knowledge base” and “inference machine”	High efficiency, flexibility, transparency	Narrow field of knowledge and possible disparity of opinion	Speech understanding, image analysis, system monitoring, chemical structure analysis, signal interpretation, etc.	[160,161,162]	1.68%
	Neural network	Approximate	Massively parallel processing, distributed storage, elastic topology, highly redundant and nonlinear operations	Self-learning, self-organizing, fast-solving speed, robustness	Requires large amounts of data, black box	Pattern recognition, intelligent control, combinatorial optimization, prediction	[163,164,165,166,167,168,169,170,171]	6.85%

Supplementary Materials

The following supporting information can be downloaded at: https://www.mdpi.com/article/10.3390/su15097600/s1. PRISMA checklist [247].

References

1. Peraković, D.; Periša, M.; Zorić, P. Challenges and Issues of ICT in Industry 4.0. Design, Simulation, Manufacturing: The Innovation Exchange; Springer: Berlin, Germany, 2019; pp. 259-269.

2. Graves, S.C. A Review of Production Scheduling. Oper. Res.; 1981; 29, pp. 646-675. [DOI: https://dx.doi.org/10.1287/opre.29.4.646]

3. van Eck, N.J.; Waltman, L. CitNetExplorer: A new software tool for analyzing and visualizing citation networks. J. Inf.; 2014; 8, pp. 802-823. [DOI: https://dx.doi.org/10.1016/j.joi.2014.07.006]

4. Bakhmat, N.; Kolosiva, O.; Demchenko, O.; Ivashchenko, I.; Strelchuk, V. Application of international scientometric databases in the process of training competitive research and teaching staff: Opportunities of Web of Science (WoS), Scopus, Google Scholar. J. Theor. Appl. Inf. Technol.; 2022; 100, pp. 4914-4924.

5. Yalcinkaya, M.; Singh, V. Patterns and trends in Building Information Modeling (BIM) research: A Latent Semantic Analysis. Autom. Constr.; 2015; 59, pp. 68-80. [DOI: https://dx.doi.org/10.1016/j.autcon.2015.07.012]

6. Zhong, B.; Wu, H.; Li, H.; Sepasgozar, S.; Luo, H.; He, L. A scientometric analysis and critical review of construction related ontology research. Autom. Constr.; 2019; 101, pp. 17-31. [DOI: https://dx.doi.org/10.1016/j.autcon.2018.12.013]

7. Martinez, P.; Al-Hussein, M.; Ahmad, R. A scientometric analysis and critical review of computer vision applications for construction. Autom. Constr.; 2019; 107, 102947. [DOI: https://dx.doi.org/10.1016/j.autcon.2019.102947]

8. Zhang, Y.; Li, C.; Ji, X.; Yun, C.; Wang, M.; Luo, X. The knowledge domain and emerging trends in phytoremediation: A scientometric analysis with CiteSpace. Environ. Sci. Pollut. Res.; 2020; 27, pp. 15515-15536. [DOI: https://dx.doi.org/10.1007/s11356-020-07646-2]

9. Fang, Y. Visualizing the structure and the evolving of digital medicine: A scientometrics review. Scientometrics; 2015; 105, pp. 5-21. [DOI: https://dx.doi.org/10.1007/s11192-015-1696-1]

10. Wang, W.; Lu, C. Visualization analysis of big data research based on Citespace. Soft Comput.; 2019; 24, pp. 8173-8186. [DOI: https://dx.doi.org/10.1007/s00500-019-04384-7]

11. Caldeira, R.H.; Gnanavelbabu, A.; Vaidyanathan, T. An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption. Comput. Ind. Eng.; 2020; 149, 106863. [DOI: https://dx.doi.org/10.1016/j.cie.2020.106863]

12. Satake, T.; Morikawa, K.; Nakamura, N. Neural network approach for minimizing the makespan of the general job-shop. Int. J. Prod. Econ.; 1994; 33, pp. 67-74. [DOI: https://dx.doi.org/10.1016/0925-5273(94)90119-8]

13. Liu, B.; De Giovanni, P. Green process innovation through Industry 4.0 technologies and supply chain coordination. Annals of Operations Research; Springer: Berlin, Germany, 2019; pp. 1-36.

14. Vrchota, J.; Pech, M.; Rolínek, L.; Bednář, J. Sustainability outcomes of green processes in relation to industry 4.0 in manufacturing: Systematic review. Sustainability; 2020; 12, 5968. [DOI: https://dx.doi.org/10.3390/su12155968]

15. De Giovanni, P.; Cariola, A. Process innovation through industry 4.0 technologies, lean practices and green supply chains. Res. Transp. Econ.; 2021; 90, 100869. [DOI: https://dx.doi.org/10.1016/j.retrec.2020.100869]

16. Mubarak, M.F.; Tiwari, S.; Petraite, M.; Mubarik, M.; Rasi, R.Z.R.M. How Industry 4.0 technologies and open innovation can improve green innovation performance?. Manag. Environ. Qual. Int. J.; 2021; 32, pp. 1007-1022. [DOI: https://dx.doi.org/10.1108/MEQ-11-2020-0266]

17. Morariu, O.; Morariu, C.; Borangiu, T. Shop-floor resource virtualization layer with private cloud support. J. Intell. Manuf.; 2014; 27, pp. 447-462. [DOI: https://dx.doi.org/10.1007/s10845-014-0878-7]

18. Waschneck, B.; Reichstaller, A.; Belzner, L.; Altenmüller, T.; Bauernhansl, T.; Knapp, A.; Kyek, A. Optimization of global production scheduling with deep reinforcement learning. Procedia CIRP; 2018; 72, pp. 1264-1269. [DOI: https://dx.doi.org/10.1016/j.procir.2018.03.212]

19. Masoni, R.; Ferrise, F.; Bordegoni, M.; Gattullo, M.; Uva, A.E.; Fiorentino, M.; Carrabba, E.; Di Donato, M. Supporting remote maintenance in industry 4.0 through augmented reality. Procedia Manuf.; 2017; 11, pp. 1296-1302. [DOI: https://dx.doi.org/10.1016/j.promfg.2017.07.257]

20. Ghobakhloo, M. Industry 4.0, digitization, and opportunities for sustainability. J. Clean. Prod.; 2020; 252, 19869. [DOI: https://dx.doi.org/10.1016/j.jclepro.2019.119869]

21. Li, J.; Yang, H. A Research on Development of Construction Industrialization Based on BIM Technology under the Background of Industry 4.0. MATEC Web Conf.; 2017; 100, 02046.EDP Sciences [DOI: https://dx.doi.org/10.1051/matecconf/201710002046]

22. Bryndin, E. Directions of development of industry 4.0, digital technology and social economy. Am. J. Inf. Sci. Technol.; 2018; 2, pp. 9-17. [DOI: https://dx.doi.org/10.11648/j.ajist.20180201.12]

23. Kalsoom, T.; Ramzan, N.; Ahmed, S.; Ur-Rehman, M. Advances in Sensor Technologies in the Era of Smart Factory and Industry 4.0. Sensors; 2020; 20, 6783. [DOI: https://dx.doi.org/10.3390/s20236783] [PubMed: https://www.ncbi.nlm.nih.gov/pubmed/33261021]

24. Iyengar, K.P.; Kariya, A.D.; Botchu, R.; Jain, V.K.; Vaishya, R. Significant capabilities of SMART sensor technology and their applications for Industry 4.0 in trauma and orthopaedics. Sens. Int.; 2022; 3, 100163. [DOI: https://dx.doi.org/10.1016/j.sintl.2022.100163]

25. Bragança, S.; Costa, E.; Castellucci, I.; Arezes, P.M. A brief overview of the use of collaborative robots in industry 4.0: Human role and safety. Occupational and Environmental Safety and Health; Springer: Berlin, Germany, 2019; pp. 641-650.

26. Bahrin, M.A.K.; Othman, M.F.; Azli, N.H.N.; Talib, M.F. Industry 4.0: A review on industrial automation and robotic. J. Teknol.; 2016; 78, pp. 137-143. [DOI: https://dx.doi.org/10.11113/jt.v78.9285]

27. Kozlovska, M.; Klosova, D.; Strukova, Z. Impact of Industry 4.0 Platform on the Formation of Construction 4.0 Concept: A Literature Review. Sustainability; 2021; 13, 2683. [DOI: https://dx.doi.org/10.3390/su13052683]

28. Hu, Z.-Z.; Tian, P.-L.; Li, S.-W.; Zhang, J.-P. BIM-based integrated delivery technologies for intelligent MEP management in the operation and maintenance phase. Adv. Eng. Softw.; 2018; 115, pp. 1-16. [DOI: https://dx.doi.org/10.1016/j.advengsoft.2017.08.007]

29. Yu, Q.; Li, K.; Luo, H. A BIM-based Dynamic Model for Site Material Supply. Procedia Eng.; 2016; 164, pp. 526-533. [DOI: https://dx.doi.org/10.1016/j.proeng.2016.11.654]

30. May, K.W.; Kc, C.; Ochoa, J.J.; Gu, N.; Walsh, J.; Smith, R.T.; Thomas, B.H. The Identification, Development, and Evaluation of BIM-ARDM: A BIM-Based AR Defect Management System for Construction Inspections. Buildings; 2022; 12, 140. [DOI: https://dx.doi.org/10.3390/buildings12020140]

31. Chen, L.; Luo, H. A BIM-based construction quality management model and its applications. Autom. Constr.; 2014; 46, pp. 64-73. [DOI: https://dx.doi.org/10.1016/j.autcon.2014.05.009]

32. Karimireddy, T.; Zhang, S. Guaranteed timely delivery of control packets for reliable industrial wireless networks in industry 4.0 Era. Proceedings of the 2017 Ninth International Conference on Ubiquitous and Future Networks (ICUFN), IEEE; Milan, Italy, 4–7 July 2017; pp. 456-461. [DOI: https://dx.doi.org/10.1109/icufn.2017.7993826]

33. Li, M.; Ming, P.; Xing, D.; Liu, C. A multi-optimization model for the design of hydrogen supply chains. E3S Web Conf.; 2020; 194, 02028.EDP Sciences [DOI: https://dx.doi.org/10.1051/e3sconf/202019402028]

34. Muñoz, E.; Capón-García, E.; Moreno-Benito, M.; Espuña, A.; Puigjaner, L. Scheduling and control decision-making under an integrated information environment. Comput. Chem. Eng.; 2011; 35, pp. 774-786. [DOI: https://dx.doi.org/10.1016/j.compchemeng.2011.01.025]

35. Chen, C. The citespace manual. Coll. Comput. Inform.; 2014; 1, pp. 1-84.

36. Synnestvedt, M.B.; Chen, C.; Holmes, J.H. CiteSpace II: Visualization and knowledge discovery in bibliographic databases. AMIA Annu. Symp. Proc. AMIA Symp.; 2005; 2005, pp. 724-728. [PubMed: https://www.ncbi.nlm.nih.gov/pubmed/16779135]

37. Tao, X.; Wang, F.; Li, X. A Visualized Analysis of Game-Based Learning Research from 2013 to 2017. Proceedings of the 2018 International Joint Conference on Information, Media and Engineering (ICIME), IEEE; Osaka, Japan, 12–14 December 2018; pp. 192-196. [DOI: https://dx.doi.org/10.1109/icime.2018.00047]

38. Wan, J.; Chen, B.; Imran, M.; Tao, F.; Li, D.; Liu, C.; Ahmad, S. Toward dynamic resources management for IoT-based manufacturing. IEEE Commun. Mag.; 2018; 56, pp. 52-59. [DOI: https://dx.doi.org/10.1109/MCOM.2018.1700629]

39. Zhou, X.; Lu, Z.; Xi, L. Preventive maintenance optimization for a multi-component system under changing job shop schedule. Reliab. Eng. Syst. Saf.; 2012; 101, pp. 14-20. [DOI: https://dx.doi.org/10.1016/j.ress.2012.01.005]

40. Wu, N.; Zhou, M. Schedulability Analysis and Optimal Scheduling of Dual-Arm Cluster Tools With Residency Time Constraint and Activity Time Variation. IEEE Trans. Autom. Sci. Eng.; 2011; 9, pp. 203-209. [DOI: https://dx.doi.org/10.1109/tase.2011.2160452]

41. Xing, K.; Han, L.; Zhou, M.; Wang, F. Deadlock-Free Genetic Scheduling Algorithm for Automated Manufacturing Systems Based on Deadlock Control Policy. IEEE Trans. Syst. Man Cybern. Part B Cybern.; 2011; 42, pp. 603-615. [DOI: https://dx.doi.org/10.1109/TSMCB.2011.2170678]

42. Qiao, Y.; Wu, N.; Zhou, M. Real-Time Scheduling of Single-Arm Cluster Tools Subject to Residency Time Constraints and Bounded Activity Time Variation. IEEE Trans. Autom. Sci. Eng.; 2012; 9, pp. 564-577. [DOI: https://dx.doi.org/10.1109/TASE.2012.2192476]

43. Liu, Z.; Yin, Y.; Liu, W.; Dunford, M. Visualizing the intellectual structure and evolution of innovation systems research: A bibliometric analysis. Scientometrics; 2015; 103, pp. 135-158. [DOI: https://dx.doi.org/10.1007/s11192-014-1517-y]

44. Song, J.; Zhang, H.; Dong, W. A review of emerging trends in global PPP research: Analysis and visualization. Scientometrics; 2016; 107, pp. 1111-1147. [DOI: https://dx.doi.org/10.1007/s11192-016-1918-1]

45. Tang, L.; Xuan, H.; Liu, J. A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time. Comput. Oper. Res.; 2006; 33, pp. 3344-3359. [DOI: https://dx.doi.org/10.1016/j.cor.2005.03.028]

46. Tang, L.; Luh, P.B.; Liu, J.; Fang, L. Steel-making process scheduling using Lagrangian relaxation. Int. J. Prod. Res.; 2002; 40, pp. 55-70. [DOI: https://dx.doi.org/10.1080/00207540110073000]

47. Tang, L.; Wang, G.; Liu, J.; Liu, J. A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production. Nav. Res. Logist. (NRL); 2011; 58, pp. 370-388. [DOI: https://dx.doi.org/10.1002/nav.20452]

48. Crauwels, H.; Hariri, A.; Potts, C.N.; Van Wassenhove, L.N. Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time. Ann Oper. Res.; 1998; 83, pp. 59-76. [DOI: https://dx.doi.org/10.1023/A:1018920416308]

49. Abdul-Razaq, T.S. Machine Scheduling Problems: A Branch and Bound Approach; Keele University: Keele, UK, 1987.

50. Zhang, W.; Li, C.; Yang, W.; Gen, M. Hybrid evolutionary algorithm with sequence difference-based differential evolution for multi-objective fuzzy flow-shop scheduling problem. Int. J. Internet Manuf. Serv.; 2022; 8, 308. [DOI: https://dx.doi.org/10.1504/IJIMS.2022.128636]

51. Abdul-Razaq, T.; Potts, C.; Van Wassenhove, L. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discret. Appl. Math.; 1990; 26, pp. 235-253. [DOI: https://dx.doi.org/10.1016/0166-218X(90)90103-J]

52. Matsuo, H.; Suh, C.J.; Sullivan, R.S. A controlled search simulated annealing method for the single machine weighted tardiness problem. Ann. Oper. Res.; 1989; 21, pp. 85-108. [DOI: https://dx.doi.org/10.1007/BF02022094]

53. van Laarhoven, P.J.M.; Aarts, E.H.L.; Lenstra, J.K. Job Shop Scheduling by Simulated Annealing. Oper. Res.; 1992; 40, pp. 113-125. [DOI: https://dx.doi.org/10.1287/opre.40.1.113]

54. Chakraborty, S.; Bhowmik, S. Job shop scheduling using simulated annealing. Proceedings of the First International Conference on Computation and Communication Advancement; Kolkata, India, 12–13 October 2013; Volume 1, pp. 69-73.

55. Suresh, R.; Mohanasundaram, K. Pareto archived simulated annealing for job shop scheduling with multiple objectives. Int. J. Adv. Manuf. Technol.; 2005; 29, pp. 184-196. [DOI: https://dx.doi.org/10.1007/s00170-004-2492-x]

56. Akram, K.; Kamal, K.; Zeb, A. Fast simulated annealing hybridized with quenching for solving job shop scheduling problem. Appl. Soft Comput.; 2016; 49, pp. 510-523. [DOI: https://dx.doi.org/10.1016/j.asoc.2016.08.037]

57. Nowicki, E.; Smutnicki, C. An Advanced Tabu Search Algorithm for the Job Shop Problem. J. Sched.; 2005; 8, pp. 145-159. [DOI: https://dx.doi.org/10.1007/s10951-005-6364-5]

58. Shrouf, F.; Ordieres-Meré, J.; García-Sánchez, Á.; Ortega-Mier, M. Optimizing the production scheduling of a single machine to minimize total energy consumption costs. J. Clean. Prod.; 2014; 67, pp. 197-207. [DOI: https://dx.doi.org/10.1016/j.jclepro.2013.12.024]

59. Wang, X.; Ong, S.K.; Nee, A. A comprehensive survey of ubiquitous manufacturing research. Int. J. Prod. Res.; 2017; 56, pp. 1-25. [DOI: https://dx.doi.org/10.1080/00207543.2017.1413259]

60. Gahm, C.; Denz, F.; Dirr, M.; Tuma, A. Energy-efficient scheduling in manufacturing companies: A review and research framework. Eur. J. Oper. Res.; 2015; 248. [DOI: https://dx.doi.org/10.1016/j.ejor.2015.07.017]

61. Biel, K.; Glock, C.H. Systematic literature review of decision support models for energy-efficient production planning. Comput. Ind. Eng.; 2016; 101, pp. 243-259. [DOI: https://dx.doi.org/10.1016/j.cie.2016.08.021]

62. Luo, H.; Du, B.; Huang, G.Q.; Chen, H.; Li, X. Hybrid flow shop scheduling considering machine electricity consumption cost. Int. J. Prod. Econ.; 2013; 146, pp. 423-439. [DOI: https://dx.doi.org/10.1016/j.ijpe.2013.01.028]

63. Li, M.; Wang, G.-G. A review of green shop scheduling problem. Inf. Sci.; 2022; 589, pp. 478-496. [DOI: https://dx.doi.org/10.1016/j.ins.2021.12.122]

64. Zhang, R.; Chiong, R. Solving the energy-efficient job shop scheduling problem: A multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. J. Clean. Prod.; 2016; 112, pp. 3361-3375. [DOI: https://dx.doi.org/10.1016/j.jclepro.2015.09.097]

65. Giret, A.; Trentesaux, D.; Prabhu, V. Sustainability in manufacturing operations scheduling: A state of the art review. J. Manuf. Syst.; 2015; 37, pp. 126-140. [DOI: https://dx.doi.org/10.1016/j.jmsy.2015.08.002]

66. Mansouri, S.A.; Aktas, E.; Besikci, U. Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption. Eur. J. Oper. Res.; 2016; 248, pp. 772-788. [DOI: https://dx.doi.org/10.1016/j.ejor.2015.08.064]

67. Cui, W.; Sun, H.; Xia, B. Integrating production scheduling, maintenance planning and energy controlling for the sustainable manufacturing systems under TOU tariff. J. Oper. Res. Soc.; 2019; 71, pp. 1760-1779. [DOI: https://dx.doi.org/10.1080/01605682.2019.1630327]

68. He, Y.; Li, Y.; Wu, T.; Sutherland, J.W. An energy-responsive optimization method for machine tool selection and operation sequence in flexible machining job shops. J. Clean. Prod.; 2015; 87, pp. 245-254. [DOI: https://dx.doi.org/10.1016/j.jclepro.2014.10.006]

69. Wang, J.; Yang, J.; Zhang, Y.; Ren, S.; Liu, Y. Infinitely repeated game based real-time scheduling for low-carbon flexible job shop considering multi-time periods. J. Clean. Prod.; 2019; 247, 119093. [DOI: https://dx.doi.org/10.1016/j.jclepro.2019.119093]

70. Lee, J.; Bagheri, B.; Kao, H.A. A cyber-physical systems architecture for industry 4.0-based manufacturing systems. Manuf. Lett.; 2015; 3, pp. 18-23. [DOI: https://dx.doi.org/10.1016/j.mfglet.2014.12.001]

71. An, Y.; Chen, X.; Zhang, J.; Li, Y. A hybrid multi-objective evolutionary algorithm to integrate optimization of the production scheduling and imperfect cutting tool maintenance considering total energy consumption. J. Clean. Prod.; 2020; 268, 121540. [DOI: https://dx.doi.org/10.1016/j.jclepro.2020.121540]

72. Zhong, R.Y.; Xu, X.; Klotz, E.; Newman, S.T. Intelligent manufacturing in the context of industry 4.0: A review. Engineering; 2017; 3, pp. 616-630. [DOI: https://dx.doi.org/10.1016/J.ENG.2017.05.015]

73. Abedini, A.; Li, W.; Badurdeen, F.; Jawahir, I.S. A metric-based framework for sustainable production scheduling. J. Manuf. Syst.; 2020; 54, pp. 174-185. [DOI: https://dx.doi.org/10.1016/j.jmsy.2019.12.003]

74. Zhang, J.; Ding, G.; Zou, Y.; Qin, S.; Fu, J. Review of job shop scheduling research and its new perspectives under Industry 4.0. J. Intell. Manuf.; 2017; 30, pp. 1809-1830. [DOI: https://dx.doi.org/10.1007/s10845-017-1350-2]

75. Gong, X.; De Pessemier, T.; Joseph, W.; Martens, L. A generic method for energy-efficient and energy-cost-effective production at the unit process level. J. Clean. Prod.; 2016; 113, pp. 508-522. [DOI: https://dx.doi.org/10.1016/j.jclepro.2015.09.020]

76. Mokhtari, H.; Hasani, A. An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Comput. Chem. Eng.; 2017; 104, pp. 339-352. [DOI: https://dx.doi.org/10.1016/j.compchemeng.2017.05.004]

77. Ghaleb, M.; Zolfagharinia, H.; Taghipour, S. Real-time production scheduling in the Industry-4.0 context: Addressing uncertainties in job arrivals and machine breakdowns. Comput. Oper. Res.; 2020; 123, 105031. [DOI: https://dx.doi.org/10.1016/j.cor.2020.105031]

78. Fang, K.; Uhan, N.; Zhao, F.; Sutherland, J. A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction. J. Manuf. Syst.; 2011; 30, pp. 234-240. [DOI: https://dx.doi.org/10.1016/j.jmsy.2011.08.004]

79. Trentesaux, D.; Prabhu, V. Sustainability in Manufacturing Operations Scheduling: Stakes, Approaches and Trends. Innovative and Knowledge-Based Production Management in a Global-Local World. APMS 2014. IFIP Advances in Information and Communication Technology; Grabot, B.; Vallespir, B.; Gomes, S.; Bouras, A.; Kiritsis, D. Advances in Production Management Systems Springer: Berlin/Heidelberg, Germany, 2014; Volume 439, [DOI: https://dx.doi.org/10.1007/978-3-662-44736-9_13]

80. Dai, M.; Tang, D.; Giret, A.; Salido, M.A.; Li, W. Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm. Robot. Comput. Manuf.; 2013; 29, pp. 418-429. [DOI: https://dx.doi.org/10.1016/j.rcim.2013.04.001]

81. Prabhu, V.V.; Trentesaux, D.; Taisch, M. Energy-aware manufacturing operations. Int. J. Prod. Res.; 2015; 53, pp. 6994-7004. [DOI: https://dx.doi.org/10.1080/00207543.2015.1100766]

82. Bruzzone, A.; Anghinolfi, D.; Paolucci, M.; Tonelli, F. Energy-aware scheduling for improving manufacturing process sustainability: A mathematical model for flexible flow shops. CIRP Ann.; 2012; 61, pp. 459-462. [DOI: https://dx.doi.org/10.1016/j.cirp.2012.03.084]

83. Pach, C.; Berger, T.; Sallez, Y.; Trentesaux, D. Reactive control of overall power consumption in flexible manufacturing systems scheduling: A Potential Fields model. Control. Eng. Pr.; 2015; 44, pp. 193-208. [DOI: https://dx.doi.org/10.1016/j.conengprac.2015.08.003]

84. Duflou, J.R.; Sutherland, J.W.; Dornfeld, D.; Herrmann, C.; Jeswiet, J.; Kara, S.; Hauschild, M.Z.; Kellens, K. Towards energy and resource efficient manufacturing: A processes and systems approach. CIRP Ann.; 2012; 61, pp. 587-609. [DOI: https://dx.doi.org/10.1016/j.cirp.2012.05.002]

85. Chu, Y.; You, F. Moving horizon approach of integrating scheduling and control for sequential batch processes. AIChE J.; 2014; 60, pp. 1654-1671. [DOI: https://dx.doi.org/10.1002/aic.14359]

86. Fang, K.; Uhan, N.A.; Zhao, F.; Sutherland, J.W. Flow shop scheduling with peak power consumption constraints. Ann. Oper. Res.; 2013; 206, pp. 115-145. [DOI: https://dx.doi.org/10.1007/s10479-012-1294-z]

87. Duerden, C.; Shark, L.-K.; Hall, G.; Howe, J. Genetic algorithm for energy consumption variance minimisation in manufacturing production lines through schedule manipulation. Transactions on Engineering Technologies: World Congress on Engineering and Computer Science 2014; Springer: Dutch, The Netherlands, 2015; pp. 1-13.

88. Sony, M. Design of cyber physical system architecture for industry 4.0 through lean six sigma: Conceptual foundations and research issues. Prod. Manuf. Res.; 2020; 8, pp. 158-181. [DOI: https://dx.doi.org/10.1080/21693277.2020.1774814]

89. Kucharska, E.; Grobler-Dębska, K.; Rączka, K. Almm-based methods for optimization makespan flow-shop problem with defects. Information Systems Architecture and Technology: Proceedings of 37th International Conference on Information Systems Architecture and Technology–ISAT 2016–Part I; Springer International Publishing: New York, NY, USA, 2017; pp. 41-53.

90. He, Y.; Liu, B.; Zhang, X.; Gao, H.; Liu, X. A modeling method of task-oriented energy consumption for machining manufacturing system. J. Clean. Prod.; 2011; 23, pp. 167-174. [DOI: https://dx.doi.org/10.1016/j.jclepro.2011.10.033]

91. Nguyen, S.; Mei, Y.; Xue, B.; Zhang, M. A hybrid genetic programming algorithm for automated design of dispatching rules. Evol. Comput.; 2019; 27, pp. 467-496. [DOI: https://dx.doi.org/10.1162/evco_a_00230] [PubMed: https://www.ncbi.nlm.nih.gov/pubmed/29863420]

92. Trentesaux, D.; Pach, C.; Bekrar, A.; Sallez, Y.; Berger, T.; Bonte, T.; Leitão, P.; Barbosa, J. Benchmarking flexible job-shop scheduling and control systems. Control Eng. Pract.; 2013; 21, pp. 1204-1225. [DOI: https://dx.doi.org/10.1016/j.conengprac.2013.05.004]

93. Duerden, C.J.; Shark, L.-K.; Hall, G.; Howe, J.M. Minimisation of energy consumption variance for multi-process manufacturing lines through genetic algorithm manipulation of production schedule. Eng. Lett.; 2015; 23, pp. 40-48.

94. Chu, Y.; You, F.; Wassick, J.M.; Agarwal, A. Integrated planning and scheduling under production uncertainties: Bi-level model formulation and hybrid solution method. Comput. Chem. Eng.; 2015; 72, pp. 255-272. [DOI: https://dx.doi.org/10.1016/j.compchemeng.2014.02.023]

95. Liu, Y.; Dong, H.; Lohse, N.; Petrovic, S.; Gindy, N. An investigation into minimising total energy consumption and total weighted tardiness in job shops. J. Clean. Prod.; 2014; 65, pp. 87-96. [DOI: https://dx.doi.org/10.1016/j.jclepro.2013.07.060]

96. Nie, Y.; Biegler, L.T.; Wassick, J.M.; Villa, C.M. Extended Discrete-Time Resource Task Network Formulation for the Reactive Scheduling of a Mixed Batch/Continuous Process. Ind. Eng. Chem. Res.; 2014; 53, pp. 17112-17123. [DOI: https://dx.doi.org/10.1021/ie500363p]

97. Chu, Y.; You, F. Efficient Decomposition Method for Integrating Production Sequencing and Dynamic Optimization for a Multi-Product CSTR. Chem. Eng. Trans.; 2014; 39, pp. 715-720.

98. Zhang, C.; Li, P.; Guan, Z.; Rao, Y. A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput. Oper. Res.; 2007; 34, pp. 3229-3242. [DOI: https://dx.doi.org/10.1016/j.cor.2005.12.002]

99. Sonawane, M.P.A.; Ragha, L. Hybrid genetic algorithm and TABU search algorithm to solve class time table scheduling problem. Int. J. Res. Stud. Comput. Sci. Eng.; 2014; 1, pp. 19-26.

100. Huang, J.; Süer, G.A. A dispatching rule-based genetic algorithm for multi-objective job shop scheduling using fuzzy satisfaction levels. Comput. Ind. Eng.; 2014; 86, pp. 29-42. [DOI: https://dx.doi.org/10.1016/j.cie.2014.12.001]

101. Yan, H.-S.; Wan, X.-Q.; Xiong, F.-L. Integrated production planning and scheduling for a mixed batch job-shop based on alternant iterative genetic algorithm. J. Oper. Res. Soc.; 2015; 66, pp. 1250-1258. [DOI: https://dx.doi.org/10.1057/jors.2014.88]

102. Gonçalves, J.F.; Mendes, J.J.D.M.; Resende, M.G. A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res.; 2005; 167, pp. 77-95. [DOI: https://dx.doi.org/10.1016/j.ejor.2004.03.012]

103. Figielska, E. A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources. Comput. Ind. Eng.; 2009; 56, pp. 142-151. [DOI: https://dx.doi.org/10.1016/j.cie.2008.04.008]

104. Muthiah, A.; Rajkumar, R. A comparison of artificial bee colony algorithm and genetic algorithm to minimize the makespan for job shop scheduling. Procedia Eng.; 2014; 97, pp. 1745-1754.

105. Wong, C.; Chan, F.; Chung, S.H. A genetic algorithm approach for production scheduling with mould maintenance consideration. Int. J. Prod. Res.; 2012; 50, pp. 5683-5697. [DOI: https://dx.doi.org/10.1080/00207543.2011.613868]

106. Maimon, O.Z.; Braha, D. A genetic algorithm approach to scheduling PCBs on a single machine. Int. J. Prod. Res.; 1998; 36, pp. 761-784. [DOI: https://dx.doi.org/10.1080/002075498193688]

107. Dorigo, M.; Maniezzo, V.; Colorni, A. The Ant System: An Autocatalytic Optimizing Process. Technical Report 91-016 1991. Available online: https://www.semanticscholar.org/paper/Ant-System%3A-An-Autocatalytic-Optimizing-Process-Dorigo-Maniezzo/9649211474dcfc3a9fd75e5208ffd21d9dcb9794 (accessed on 5 January 2023).

108. Liao, C.-J.; Juan, H.-C. An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Comput. Oper. Res.; 2007; 34, pp. 1899-1909. [DOI: https://dx.doi.org/10.1016/j.cor.2005.07.020]

109. Lin, B.; Lu, C.; Shyu, S.; Tsai, C. Development of new features of ant colony optimization for flowshop scheduling. Int. J. Prod. Econ.; 2008; 112, pp. 742-755. [DOI: https://dx.doi.org/10.1016/j.ijpe.2007.06.007]

110. Yagmahan, B.; Yenisey, M.M. A multi-objective ant colony system algorithm for flow shop scheduling problem. Expert Syst. Appl.; 2010; 37, pp. 1361-1368. [DOI: https://dx.doi.org/10.1016/j.eswa.2009.06.105]

111. Saidi-Mehrabad, M.; Dehnavi-Arani, S.; Evazabadian, F.; Mahmoodian, V. An Ant Colony Algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs. Comput. Ind. Eng.; 2015; 86, pp. 2-13. [DOI: https://dx.doi.org/10.1016/j.cie.2015.01.003]

112. Neto, R.T.; Filho, M.G. Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research. Eng. Appl. Artif. Intell.; 2013; 26, pp. 150-161. [DOI: https://dx.doi.org/10.1016/j.engappai.2012.03.011]

113. Eberhart, R.; Kennedy, J. Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, Citeseer; Perth, WA, Australia, 27 November–1 December 1995; Volume 4, pp. 1942-1948.

114. Bai, J.-J.; Gong, Y.-G.; Wang, N.-S.; Tang, D.-B. An Improved PSO Algorithm for Flexible Job Shop Scheduling with Lot-Splitting. Proceedings of the 2009 International Workshop on Intelligent Systems and Applications, IEEE; Wuhan, China, 23–24 May 2009; pp. 1-5. [DOI: https://dx.doi.org/10.1109/iwisa.2009.5072720]

115. Moslehi, G.; Mahnam, M. A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int. J. Prod. Econ.; 2011; 129, pp. 14-22. [DOI: https://dx.doi.org/10.1016/j.ijpe.2010.08.004]

116. Liu, H.; Abraham, A.; Wang, Z. A Multi-swarm Approach to Multi-objective Flexible Job-shop Scheduling Problems. Fundam. Inform.; 2009; 95, pp. 465-489. [DOI: https://dx.doi.org/10.3233/FI-2009-160]

117. Mostaghim, S.; Teich, J. Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO). Proceedings of the 2003 IEEE Swarm Intelligence Symposium, SIS’03 (Cat. No.03EX706), IEEE; Indianapolis, IN, USA, 26 April 2004; pp. 26-33. [DOI: https://dx.doi.org/10.1109/sis.2003.1202243]

118. Tripathi, P.K.; Bandyopadhyay, S.; Pal, S.K. Multi-Objective Particle Swarm Optimization with time variant inertia and acceleration coefficients. Inf. Sci.; 2007; 177, pp. 5033-5049. [DOI: https://dx.doi.org/10.1016/j.ins.2007.06.018]

119. Shao, X.; Liu, W.; Liu, Q.; Zhang, C. Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem. Int. J. Adv. Manuf. Technol.; 2013; 67, pp. 2885-2901. [DOI: https://dx.doi.org/10.1007/s00170-012-4701-3]

120. Xia, W.; Wu, Z. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng.; 2005; 48, pp. 409-425. [DOI: https://dx.doi.org/10.1016/j.cie.2005.01.018]

121. Deng, G.; Gu, X. A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion. Comput. Oper. Res.; 2012; 39, pp. 2152-2160. [DOI: https://dx.doi.org/10.1016/j.cor.2011.10.024]

122. Tasgetiren, M.F.; Pan, Q.-K.; Suganthan, P.; Buyukdagli, O. A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Comput. Oper. Res.; 2013; 40, pp. 1729-1743. [DOI: https://dx.doi.org/10.1016/j.cor.2013.01.005]

123. Liu, Y.; Yin, M.; Gu, W. An effective differential evolution algorithm for permutation flow shop scheduling problem. Appl. Math. Comput.; 2014; 248, pp. 143-159. [DOI: https://dx.doi.org/10.1016/j.amc.2014.09.010]

124. Zhao, Z.; Zhou, M.; Liu, S. Iterated Greedy Algorithms for Flow-Shop Scheduling Problems: A Tutorial. IEEE Trans. Autom. Sci. Eng.; 2021; 19, pp. 1941-1959. [DOI: https://dx.doi.org/10.1109/TASE.2021.3062994]

125. Molina da Silva, F.; Tavares Neto, R. Applying an Iterated Greedy Algorithm to Production Programming on Manufacturing Environment Controlled by the PBC Ordering System. International Workshop on Hybrid Metaheuristics; Springer: Cham, Switzerland, 2019; pp. 191-199.

126. Minella, G.; Ruiz, R.; Ciavotta, M. Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems. Comput. Oper. Res.; 2011; 38, pp. 1521-1533. [DOI: https://dx.doi.org/10.1016/j.cor.2011.01.010]

127. Pan, Q.-K.; Ruiz, R. An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem. Omega; 2014; 44, pp. 41-50. [DOI: https://dx.doi.org/10.1016/j.omega.2013.10.002]

128. Kahraman, C.; Engin, O.; Kaya, I.; Öztürk, R.E. Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach. Appl. Soft Comput.; 2010; 10, pp. 1293-1300. [DOI: https://dx.doi.org/10.1016/j.asoc.2010.03.008]

129. Lu, H.; Yang, J. An improved clonal selection algorithm for job shop scheduling. Proceedings of the 2009 International Symposium on Intelligent Ubiquitous Computing and Education, IEEE; Chengdu, China, 15–16 May 2009; pp. 34-37.

130. Atay, Y.; Kodaz, H. Optimization of job shop scheduling problems using modified clonal selection algorithm. Turk. J. Electr. Eng. Comput. Sci.; 2014; 22, pp. 1528-1539. [DOI: https://dx.doi.org/10.3906/elk-1212-26]

131. Ong, Z.X.; Tay, J.C.; Kwoh, C.K. Applying the Clonal Selection Principle to Find Flexible Job-Shop Schedules. Proceedings of the International Conference on Artificial Immune Systems, ICARIS 2005; Banff, AB, Canada, 14–17 August 2005; Springer: Berlin/Heidelberg, Germany, 2005; pp. 442-455. [DOI: https://dx.doi.org/10.1007/11536444_34]

132. Coello, C.A.C.; Rivera, D.C.; Cortés, N.C. Job shop scheduling using the clonal selection principle. Adaptive Computing in Design and Manufacture VI; Springer: London, UK, 2004; pp. 113-124.

133. Hong, L. Stretching Technique-Based Clonal Selection Algorithm for Flexible Job-shop Scheduling. Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing, IEEE; Wuhan, China, 6–7 June 2009; Volume 2, pp. 111-114. [DOI: https://dx.doi.org/10.1109/cinc.2009.237]

134. Hu, J.; Li, T.; Yin, J. A hybrid clonal selection algorithm for solving job-shop scheduling problems. Proceedings of the Fourth International Workshop on Advanced Computational Intelligence, IEEE; Wuhan, China, 19–21 October 2011; pp. 735-741. [DOI: https://dx.doi.org/10.1109/iwaci.2011.6160105]

135. Lou, G.; Cai, Z. Improved hybrid immune clonal selection genetic algorithm and its application in hybrid shop scheduling. Clust. Comput.; 2018; 22, pp. 3419-3429. [DOI: https://dx.doi.org/10.1007/s10586-018-2189-9]

136. Yazdani, M.; Amiri, M.; Zandieh, M. Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst. Appl.; 2010; 37, pp. 678-687. [DOI: https://dx.doi.org/10.1016/j.eswa.2009.06.007]

137. Roshanaei, V.; Naderi, B.; Jolai, F.; Khalili, M. A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Futur. Gener. Comput. Syst.; 2009; 25, pp. 654-661. [DOI: https://dx.doi.org/10.1016/j.future.2009.01.004]

138. Adibi, M.A.; Shahrabi, J. A clustering-based modified variable neighborhood search algorithm for a dynamic job shop scheduling problem. Int. J. Adv. Manuf. Technol.; 2013; 70, pp. 1955-1961. [DOI: https://dx.doi.org/10.1007/s00170-013-5354-6]

139. Phanden, R.K.; Ferreira, J.C.E. Biogeographical and Variable Neighborhood Search Algorithm for Optimization of Flexible Job Shop Scheduling. Advances in Industrial and Production Engineering; Springer: Singapore, 2019; pp. 489-503. [DOI: https://dx.doi.org/10.1007/978-981-13-6412-9_48]

140. Zhang, G.; Gao, L.; Li, X.; Li, P. Variable Neighborhood Genetic Algorithm for the Flexible Job Shop Scheduling Problems. Proceedings of the International Conference on Intelligent Robotics and Applications; Wuhan, China, 15–17 October 2008; Springer: Berlin/Heidelberg, Germany, 2008; pp. 503-512. [DOI: https://dx.doi.org/10.1007/978-3-540-88518-4_54]

141. Wang, C.; Ji, Z.; Wang, Y. Multi-objective flexible job shop scheduling problem using variable neighborhood evolutionary algorithm. Mod. Phys. Lett. B; 2017; 31, 1740072. [DOI: https://dx.doi.org/10.1142/S0217984917400723]

142. Naderi, B.; Azab, A. Production scheduling for reconfigurable assembly systems: Mathematical modeling and algorithms. Comput. Ind. Eng.; 2021; 162, 107741. [DOI: https://dx.doi.org/10.1016/j.cie.2021.107741]

143. Dong, Y.; Jin, Y.; Li, Z.; Ji, H.; Liu, J. Scheduling optimization of a wheel hub production line based on flexible scheduling. Int. J. Ind. Eng.; 2020; 27, pp. 694-711.

144. Zandieh, M.; Gholami, M. An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int. J. Prod. Res.; 2009; 47, pp. 6999-7027. [DOI: https://dx.doi.org/10.1080/00207540802400636]

145. Laha, D. Heuristics and metaheuristics for solving scheduling problems. Handbook of Computational Intelligence in Manufacturing and Production Management; IGI Global: Hershey, PA, USA, 2008; pp. 1-18.

146. Alisantoso, D.; Khoo, L.P.; Jiang, P.Y. An immune algorithm approach to the scheduling of a flexible PCB flow shop. Int. J. Adv. Manuf. Technol.; 2003; 22, pp. 819-827. [DOI: https://dx.doi.org/10.1007/s00170-002-1498-5]

147. Tavakkoli-Moghaddam, R.; Rahimi-Vahed, A.-R.; Mirzaei, A.H. Solving a Bi-Criteria Permutation Flow Shop Problem Using Immune Algorithm. Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, IEEE; Honolulu, HI, USA, 1–5 April 2007; pp. 49-56. [DOI: https://dx.doi.org/10.1109/scis.2007.367669]

148. Li, J.; Guo, L.; Li, Y.; Liu, C.; Wang, L.; Hu, H. Enhancing Whale Optimization Algorithm with Chaotic Theory for Permutation Flow Shop Scheduling Problem. Int. J. Comput. Intell. Syst.; 2021; 14, 651. [DOI: https://dx.doi.org/10.2991/ijcis.d.210112.002]

149. Laili, Y.; Tao, F.; Zhang, L.; Cheng, Y.; Luo, Y.; Sarker, B.R. A Ranking Chaos Algorithm for dual scheduling of cloud service and computing resource in private cloud. Comput. Ind.; 2013; 64, pp. 448-463. [DOI: https://dx.doi.org/10.1016/j.compind.2013.02.008]

150. Tavazoei, M.S.; Haeri, M. An optimization algorithm based on chaotic behavior and fractal nature. J. Comput. Appl. Math.; 2007; 206, pp. 1070-1081. [DOI: https://dx.doi.org/10.1016/j.cam.2006.09.008]

151. Lu, H.-J.; Zhang, H.-M.; Ma, L.-H. A new optimization algorithm based on chaos. J. Zhejiang Univ. A; 2006; 7, pp. 539-542. [DOI: https://dx.doi.org/10.1631/jzus.2006.A0539]

152. Zhang, Y.; Zhu, H.; Tang, D.; Zhou, T.; Gui, Y. Dynamic job shop scheduling based on deep reinforcement learning for multi-agent manufacturing systems. Robot. Comput. Manuf.; 2022; 78, 102412. [DOI: https://dx.doi.org/10.1016/j.rcim.2022.102412]

153. Johnson, D.; Chen, G.; Lu, Y. Multi-Agent Reinforcement Learning for Real-Time Dynamic Production Scheduling in a Robot Assembly Cell. IEEE Robot. Autom. Lett.; 2022; 7, pp. 7684-7691. [DOI: https://dx.doi.org/10.1109/LRA.2022.3184795]

154. Zhiyao, Z.; Fang, L.; Ping, Z. Research on Multi-Agent based Optimization in Smart Production Line. Proceedings of the 2020 IEEE 6th International Conference on Computer and Communications (ICCC), IEEE; Chengdu, China, 11–14 December 2020; pp. 2318-2322.

155. Kim, Y.G.; Lee, S.; Son, J.; Bae, H.; Chung, B.D. Multi-agent system and reinforcement learning approach for distributed intelligence in a flexible smart manufacturing system. J. Manuf. Syst.; 2020; 57, pp. 440-450. [DOI: https://dx.doi.org/10.1016/j.jmsy.2020.11.004]

156. Mezgebe, T.T.; El Haouzi, H.B.; Demesure, G.; Pannequin, R.; Thomas, A. Multi-agent systems negotiation to deal with dynamic scheduling in disturbed industrial context. J. Intell. Manuf.; 2019; 31, pp. 1367-1382. [DOI: https://dx.doi.org/10.1007/s10845-019-01515-7]

157. Tan, J.; Braubach, L.; Jander, K.; Xu, R.; Chen, K. A novel multi-agent scheduling mechanism for adaptation of production plans in case of supply chain disruptions. AI Commun.; 2020; 33, pp. 1-12. [DOI: https://dx.doi.org/10.3233/AIC-200646]

158. Song, W. Suppliers Scheduling and Management of Smart Phone Manufacturing Based on the Mechanism of Multi-Agent Collaborative Feedback and Evolutionary. Proceedings of the 2019 IEEE 5th International Conference on Computer and Communications (ICCC), IEEE; Chengdu, China, 6–9 December 2019; pp. 1137-1141. [DOI: https://dx.doi.org/10.1109/iccc47050.2019.9064468]

159. Liu, Y.-K.; Zhang, X.-S.; Zhang, L.; Tao, F.; Wang, L. A multi-agent architecture for scheduling in platform-based smart manufacturing systems. Front. Inf. Technol. Electron. Eng.; 2019; 20, pp. 1465-1492. [DOI: https://dx.doi.org/10.1631/FITEE.1900094]

160. Yin, J.; Chen, B.J. Design and Implementation of the Supervisory Control Expert System for Dynamic Scheduling. Adv. Mater. Res.; 2011; 211–212, pp. 700-704. [DOI: https://dx.doi.org/10.4028/www.scientific.net/AMR.211-212.700]

161. Moynihan, G.P.; Bowers, J.H.; Fonseca, D.J.; Ray, P.S. A knowledge-based approach to maintenance project planning. Expert Syst.; 2002; 19, pp. 88-98. [DOI: https://dx.doi.org/10.1111/1468-0394.00194]

162. Ta-Hui, Y.; Lin, I.; Chia-Fen, H. A decision support system for wafer probe card production scheduling. Int. J. Ind. Eng.; 2020; 27, pp. 140-152.

163. Liu, R.; Piplani, R.; Toro, C. Deep reinforcement learning for dynamic scheduling of a flexible job shop. Int. J. Prod. Res.; 2022; 60, pp. 4049-4069. [DOI: https://dx.doi.org/10.1080/00207543.2022.2058432]

164. Zdravković, M.; Panetto, H.; Weichhart, G. AI-enabled Enterprise Information Systems for Manufacturing. Enterp. Inf. Syst.; 2021; 16, pp. 668-720. [DOI: https://dx.doi.org/10.1080/17517575.2021.1941275]

165. Lee, C.; Lee, S. A Practical Deep Reinforcement Learning Approach to Semiconductor Equipment Scheduling. Proceedings of the 2021 22nd IEEE International Conference on Industrial Technology (ICIT), IEEE; Valencia, Spain, 10–12 March 2021; Volume 1, pp. 979-985. [DOI: https://dx.doi.org/10.1109/icit46573.2021.9453533]

166. Biswas, A.; Roy, D.G. Metamorphosis of Industrial IoT using Deep Leaning. Deep Learning for Security and Privacy Preservation in IoT; Springer: Berlin, Germany, 2021; pp. 1-30.

167. Morariu, C.; Morariu, O.; Răileanu, S.; Borangiu, T. Machine learning for predictive scheduling and resource allocation in large scale manufacturing systems. Comput. Ind.; 2020; 120, 103244. [DOI: https://dx.doi.org/10.1016/j.compind.2020.103244]

168. Metaxiotis, K.; Psarras, J. Neural networks in production scheduling: Intelligent solutions and future promises. Appl. Artif. Intell.; 2003; 17, pp. 361-373. [DOI: https://dx.doi.org/10.1080/713827140]

169. Lee, K.-C.; Paik, T.-Y. A Neural Network Approach to Cost Minimizatin in a Production Scheduling Setting. Artificial Neural Networks in Real-Life Applications; IGI Global: Hershey, PA, USA, 2006; pp. 297-313.

170. Tang, L.; Liu, W.; Liu, J. A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. J. Intell. Manuf.; 2005; 16, pp. 361-370. [DOI: https://dx.doi.org/10.1007/s10845-005-7029-0]

171. Golmohammadi, D. A neural network decision-making model for job-shop scheduling. Int. J. Prod. Res.; 2013; 51, pp. 5142-5157. [DOI: https://dx.doi.org/10.1080/00207543.2013.793476]

172. Papadopoulou, T.; Mousavi, A. Dynamic job-shop lean scheduling and CONWIP shop-floor control using software agents. Proceedings of the IET International Conference on Agile Manufacturing, IET; Durham, UK, 9–11 July 2007; pp. 134-141. [DOI: https://dx.doi.org/10.1049/cp:20070019]

173. Yang, K.K. Managing a flow line with single-kanban, dual-kanban or CONWIP. Prod. Oper. Manag.; 2000; 9, pp. 349-366. [DOI: https://dx.doi.org/10.1111/j.1937-5956.2000.tb00463.x]

174. Krishnamurthy, A. Analytical Performance Models for Material Control Strategies in Manufacturing Systems; The University of Wisconsin-Madison: Madison, WI, USA, 2002.

175. Li, J.-W. Simulation study of coordinating layout change and quality improvement for adapting job shop manufacturing to CONWIP control. Int. J. Prod. Res.; 2008; 48, pp. 879-900. [DOI: https://dx.doi.org/10.1080/00207540802478814]

176. Ryan, S.M.; Vorasayan, J. Allocating work in process in a multiple-product CONWIP system with lost sales. Int. J. Prod. Res.; 2005; 43, pp. 223-246. [DOI: https://dx.doi.org/10.1080/0020754042000268875]

177. Slomp, J.; Bokhorst, J.; Germs, R. A lean production control system for high-variety/low-volume environments: A case study implementation. Prod. Plan. Control; 2009; 20, pp. 586-595. [DOI: https://dx.doi.org/10.1080/09537280903086164]

178. Arbulu, R.; Ballard, G.; Harper, N. Kanban in construction. Proceedings of the IGLC-11, Virginia Tech; Blacksburgh, VA, USA, 22–24 July 2003; pp. 16-17.

179. Kumar, C.S.; Panneerselvam, R. Literature review of JIT-KANBAN system. Int. J. Adv. Manuf. Technol.; 2007; 32, pp. 393-408. [DOI: https://dx.doi.org/10.1007/s00170-005-0340-2]

180. Singh, N.; Shek, K.H.; Meloche, D. The development of a kanban system: A case study. Int. J. Oper. Prod. Manag.; 1990; 10, pp. 28-36. [DOI: https://dx.doi.org/10.1108/01443579010140498]

181. Gupta, M.; Snyder, D. Comparing TOC with MRP and JIT: A literature review. Int. J. Prod. Res.; 2009; 47, pp. 3705-3739. [DOI: https://dx.doi.org/10.1080/00207540701636322]

182. Naufal, A.; Jaffar, A.; Yusoff, N.; Hayati, N. Development of Kanban System at Local Manufacturing Company in Malaysia–Case Study. Procedia Eng.; 2012; 41, pp. 1721-1726. [DOI: https://dx.doi.org/10.1016/j.proeng.2012.07.374]

183. Chai, L.L.S. E-based inter-enterprise supply chain Kanban for demand and order fulfilment management. Proceedings of the 2008 IEEE International Conference on Emerging Technologies and Factory Automation, IEEE; Hamburg, Germany, 15–18 September 2008; pp. 33-35. [DOI: https://dx.doi.org/10.1109/etfa.2008.4638366]

184. Maddah, B.; Jaber, M.Y.; Abboud, N. Periodic review (s, S) inventory model with permissible delay in payments. J. Oper. Res. Soc.; 2004; 55, pp. 147-159. [DOI: https://dx.doi.org/10.1057/palgrave.jors.2601675]

185. Li, Z.; Xu, S.H.; Hayya, J. A periodic-review inventory system with supply interruptions. Probab. Eng. Inf. Sci.; 2004; 18, pp. 33-53. [DOI: https://dx.doi.org/10.1017/S0269964804181035]

186. Tagaras, G.; Vlachos, D. A Periodic Review Inventory System with Emergency Replenishments. Manag. Sci.; 2001; 47, pp. 415-429. [DOI: https://dx.doi.org/10.1287/mnsc.47.3.415.9770]

187. Benders, J.; Riezebos, J. Period batch control: Classic, not outdated. Prod. Plan. Control; 2002; 13, pp. 497-506. [DOI: https://dx.doi.org/10.1080/09537280210162941]

188. MacCarthy, B.L.; Fernandes, F.C.F. A multi-dimensional classification of production systems for the design and selection of production planning and control systems. Prod. Plan. Control; 2000; 11, pp. 481-496. [DOI: https://dx.doi.org/10.1080/09537280050051988]

189. Tesic, Z.; Stevanov, B.; Jovanovic, V. Period Batch Control—A Production Planning System Applied to Virtual Manufacturing Cells. Int. J. Simul. Model.; 2016; 15, pp. 288-301. [DOI: https://dx.doi.org/10.2507/IJSIMM15(2)8.337]

190. Stevanov, B.; Gračanin, D.; Kesić, I.; Ristić, S. An application of period batch control principles and computational independent models for supporting the overhaul process of the railway braking devices. Int. J. Ind. Eng. Manag.; 2013; 4, 95.

191. Riezebos, J. Shop floor planning and control in team-based work processes. Int. J. Ind. Eng. Manag.; 2013; 4, pp. 51-56.

192. Acosta, A.P.V.; Mascle, C.; Baptiste, P. Applicability of Demand-Driven MRP in a complex manufacturing environment. Int. J. Prod. Res.; 2019; 58, pp. 4233-4245. [DOI: https://dx.doi.org/10.1080/00207543.2019.1650978]

193. Arnold, J. Introduction to Materials Management; Pearson Prentice Hall: Hoboken, NJ, USA, 2008.

194. Fernandes, N.O.; Carmo-Silva, S.D. Generic POLCA—A production and materials flow control mechanism for quick response manufacturing. Int. J. Prod. Econ.; 2006; 104, pp. 74-84. [DOI: https://dx.doi.org/10.1016/j.ijpe.2005.07.003]

195. Goldratt, E.M. Computerized shop floor scheduling. Int. J. Prod. Res.; 1988; 26, pp. 443-455. [DOI: https://dx.doi.org/10.1080/00207548808947875]

196. Spencer, M.S.; Cox, J.F. Optimum production technology (OPT) and the theory of constraints (TOC): Analysis and genealogy. Int. J. Prod. Res.; 1995; 33, pp. 1495-1504. [DOI: https://dx.doi.org/10.1080/00207549508930224]

197. Croci, F.; Pozzetti, A. OPT scheduling performances: A case study. Prod. Plan. Control; 2000; 11, pp. 82-89. [DOI: https://dx.doi.org/10.1080/095372800232513]

198. Krishnamurthy, A.; Suri, R. Planning and implementing POLCA: A card-based control system for high variety or custom engineered products. Prod. Plan. Control; 2009; 20, pp. 596-610. [DOI: https://dx.doi.org/10.1080/09537280903034297]

199. Suri, R. QRM and POLCA: A Winning Combination for Manufacturing Enterprises in the 21st Century; Center for Quick Response Manufacturing: Madison, WI, USA, 2003.

200. Lödding, H. POLCA Control. Handbook of Manufacturing Control; Springer: Berlin, Germany, 2013; pp. 419-433.

201. Braglia, M.; Castellano, D.; Frosolini, M. Optimization of POLCA-controlled production systems with a simulation-driven genetic algorithm. Int. J. Adv. Manuf. Technol.; 2013; 70, pp. 385-395. [DOI: https://dx.doi.org/10.1007/s00170-013-5282-5]

202. Santos, N.C.D.S.; Gomes, D.R.; Júnior, J.A.D.S.; Bachega, S.J.; Tavares, D.M. Simulation-based optimization of the polca ordering system. Indep. J. Manag. Prod.; 2021; 12, pp. 672-690. [DOI: https://dx.doi.org/10.14807/ijmp.v12i2.1275]

203. Chinet, F.S.; Filho, M.G. POLCA System: Literature review, classification, and analysis. Gestão Produção; 2014; 21, pp. 532-542. [DOI: https://dx.doi.org/10.1590/S0104-530X2014005000001]

204. Başak, Ö.; Albayrak, Y.E. Petri net based decision system modeling in real-time scheduling and control of flexible automotive manufacturing systems. Comput. Ind. Eng.; 2015; 86, pp. 116-126. [DOI: https://dx.doi.org/10.1016/j.cie.2014.09.024]

205. Correa, F.R. Cyber-physical systems for construction industry. Proceedings of the 2018 IEEE Industrial Cyber-Physical Systems (ICPS), IEEE; St. Petersburg, Russia, 15–18 May 2018; pp. 392-397.

206. Honarmand, M.; Zakariazadeh, A.; Jadid, S. Integrated scheduling of renewable generation and electric vehicles parking lot in a smart microgrid. Energy Convers. Manag.; 2014; 86, pp. 745-755. [DOI: https://dx.doi.org/10.1016/j.enconman.2014.06.044]

207. Hajiaghaei-Keshteli, M.; Aminnayeri, M.; Ghomi, S.F. Integrated scheduling of production and rail transportation. Comput. Ind. Eng.; 2014; 74, pp. 240-256. [DOI: https://dx.doi.org/10.1016/j.cie.2014.05.026]

208. Ahn, S.; Lee, S.; Bahn, H. A smart elevator scheduler that considers dynamic changes of energy cost and user traffic. Integr. Comput. Eng.; 2017; 24, pp. 187-202. [DOI: https://dx.doi.org/10.3233/ICA-170539]

209. Baldea, M.; Harjunkoski, I. Integrated production scheduling and process control: A systematic review. Comput. Chem. Eng.; 2014; 71, pp. 377-390. [DOI: https://dx.doi.org/10.1016/j.compchemeng.2014.09.002]

210. Mitra, K.; Gudi, R.D.; Patwardhan, S.C.; Sardar, G. Resiliency Issues in Integration of Scheduling and Control. Ind. Eng. Chem. Res.; 2009; 49, pp. 222-235. [DOI: https://dx.doi.org/10.1021/ie900380s]

211. Zhuge, J.; Ierapetritou, M.G. Integration of Scheduling and Control with Closed Loop Implementation. Ind. Eng. Chem. Res.; 2012; 51, pp. 8550-8565. [DOI: https://dx.doi.org/10.1021/ie3002364]

212. Flores-Tlacuahuac, A.; Grossmann, I.E. Simultaneous Cyclic Scheduling and Control of a Multiproduct CSTR. Ind. Eng. Chem. Res.; 2006; 45, pp. 6698-6712. [DOI: https://dx.doi.org/10.1021/ie051293d]

213. Terrazas-Moreno, S.; Flores-Tlacuahuac, A.; Grossmann, I.E. Lagrangean heuristic for the scheduling and control of polymerization reactors. AIChE J.; 2007; 54, pp. 163-182. [DOI: https://dx.doi.org/10.1002/aic.11343]

214. Baldea, M.; Touretzky, C.R. Nonlinear model predictive control of energy-integrated process systems. Syst. Control Lett.; 2013; 62, pp. 723-731. [DOI: https://dx.doi.org/10.1016/j.sysconle.2013.05.006]

215. Baldea, M.; Daoutidis, P. A general analysis and control framework for process systems with inventory recycling. Int. J. Robust Nonlinear Control; 2013; 24, pp. 2852-2866. [DOI: https://dx.doi.org/10.1002/rnc.3029]

216. Kumar, A.; Daoutidis, P. Nonlinear dynamics and control of process systems with recycle. J. Process. Control; 2002; 12, pp. 475-484. [DOI: https://dx.doi.org/10.1016/S0959-1524(01)00014-2]

217. Baldea, M.; Daoutidis, P. Dynamics and Nonlinear Control of Integrated Process Systems; Cambridge University Press: Cambridge, UK, 2012; [DOI: https://dx.doi.org/10.1017/cbo9780511978760]

218. Skogestad, S. Control structure design for complete chemical plants. Comput. Chem. Eng.; 2004; 28, pp. 219-234. [DOI: https://dx.doi.org/10.1016/j.compchemeng.2003.08.002]

219. Kadam, J.V.; Marquardt, W. Integration of Economical Optimization and Control for Intentionally Transient Process Operation. Assessment and Future Directions of Nonlinear Model Predictive Control; Springer: Berlin/Heidelberg, Germany, 2007; pp. 419-434. [DOI: https://dx.doi.org/10.1007/978-3-540-72699-9_34]

220. Engell, S. Feedback control for optimal process operation. J. Process. Control; 2007; 17, pp. 203-219. [DOI: https://dx.doi.org/10.1016/j.jprocont.2006.10.011]

221. Reaidy, P.J.; Gunasekaran, A.; Spalanzani, A. Bottom-up approach based on Internet of Things for order fulfillment in a collaborative warehousing environment. Int. J. Prod. Econ.; 2015; 159, pp. 29-40. [DOI: https://dx.doi.org/10.1016/j.ijpe.2014.02.017]

222. Gallestey, E.; Stothert, A.; Castagnoli, D.; Ferrari-Trecate, G.; Morari, M. Using model predictive control and hybrid systems for optimal scheduling of industrial processes. Automatisierungstechnik; 2003; 51, pp. 285-293. [DOI: https://dx.doi.org/10.1524/auto.51.6.285.22445]

223. Poncet, A.; Stothert, A. Scheduling of Industrial Production Processes. US Patent; App. 11/586,713, 19 April 2007.

224. Nee, A.Y.C.; Ong, S.K.; Chryssolouris, G.; Mourtzis, D. Augmented reality applications in design and manufacturing. CIRP Ann.; 2012; 61, pp. 657-679. [DOI: https://dx.doi.org/10.1016/j.cirp.2012.05.010]

225. Yu, C.; Xu, X.; Lu, Y. Computer-integrated manufacturing, cyber-physical systems and cloud manufacturing–concepts and relationships. Manuf. Lett.; 2015; 6, pp. 5-9. [DOI: https://dx.doi.org/10.1016/j.mfglet.2015.11.005]

226. Siddiqui, M.A.H.; Akhtar, S.; Chattopadhyaya, S.; Sharma, S.; Li, C.; Dwivedi, S.P.; Antosz, K.; Machado, J. Technical Risk Assessment for the Safe Design of a Man-Rider Chair Lift System. Machines; 2022; 10, 769. [DOI: https://dx.doi.org/10.3390/machines10090769]

227. Zhong, R.Y.; Lan, S.; Xu, C.; Dai, Q.; Huang, G.Q. Visualization of RFID-enabled shopfloor logistics Big Data in Cloud Manufacturing. Int. J. Adv. Manuf. Technol.; 2015; 84, pp. 5-16. [DOI: https://dx.doi.org/10.1007/s00170-015-7702-1]

228. Caspari, A.; Tsay, C.; Mhamdi, A.; Baldea, M.; Mitsos, A. The integration of scheduling and control: Top-down vs. bottom-up. J. Process. Control; 2020; 91, pp. 50-62. [DOI: https://dx.doi.org/10.1016/j.jprocont.2020.05.008]

229. Lv, Z.; Guo, J.; Lv, H. Safety Poka Yoke in Zero-Defect Manufacturing Based on Digital Twins. IEEE Trans. Ind. Inform.; 2022; 19, pp. 1176-1184. [DOI: https://dx.doi.org/10.1109/TII.2021.3139897]

230. Duan, Y.; Zhao, Y.; Hu, J. An initialization-free distributed algorithm for dynamic economic dispatch problems in microgrid: Modeling, optimization and analysis. Sustain. Energy Grids Netw.; 2023; 34, 101004. [DOI: https://dx.doi.org/10.1016/j.segan.2023.101004]

231. Xu, W.; Qu, S.; Zhang, C. Fast Terminal Sliding Mode Current Control With Adaptive Extended State Disturbance Observer for PMSM System. IEEE J. Emerg. Sel. Top. Power Electron.; 2022; 11, pp. 418-431. [DOI: https://dx.doi.org/10.1109/JESTPE.2022.3185777]

232. Ma, J.; Hu, J. Safe consensus control of cooperative-competitive multi-agent systems via differential privacy. Kybernetika; 2022; 58, pp. 426-439. [DOI: https://dx.doi.org/10.14736/kyb-2022-3-0426]

233. Wang, H.; Gao, Q.; Li, H.; Wang, H.; Yan, L.; Liu, G. A Structural Evolution-Based Anomaly Detection Method for Generalized Evolving Social Networks. Comput. J.; 2020; 65, pp. 1189-1199. [DOI: https://dx.doi.org/10.1093/comjnl/bxaa168]

234. Dai, X.; Xiao, Z.; Jiang, H.; Alazab, M.; Lui, J.C.S.; Dustdar, S.; Liu, J. Task Co-Offloading for D2D-Assisted Mobile Edge Computing in Industrial Internet of Things. IEEE Trans. Ind. Inform.; 2022; 19, pp. 480-490. [DOI: https://dx.doi.org/10.1109/TII.2022.3158974]

235. Tian, J.; Hou, M.; Bian, H.; Li, J. Variable surrogate model-based particle swarm optimization for high-dimensional expensive problems. Complex Intell. Syst.; 2022; pp. 1-49. [DOI: https://dx.doi.org/10.1007/s40747-022-00910-7]

236. Xie, B.; Li, S.; Li, M.; Liu, C.H.; Huang, G.; Wang, G. SePiCo: Semantic-Guided Pixel Contrast for Domain Adaptive Semantic Segmentation. IEEE Trans. Pattern Anal. Mach. Intell.; 2023; pp. 1-17. [DOI: https://dx.doi.org/10.1109/TPAMI.2023.3237740]

237. Wang, L.; Zhu, S.; Evans, S.; Zhang, Z.; Xia, X.; Guo, Y. Automobile recycling for remanufacturing in China: A systematic review on recycling legislations, models and methods. Sustain. Prod. Consum.; 2023; 36, pp. 369-385. [DOI: https://dx.doi.org/10.1016/j.spc.2023.01.016]

238. Tripathi, V.; Chattopadhyaya, S.; Mukhopadhyay, A.K.; Sharma, S.; Kumar, V.; Li, C.; Singh, S. Lean, green, and smart manufacturing: An ingenious framework for enhancing the sustainability of operations management on the shop floor in industry 4.0. Proc. Inst. Mech. Eng. Part E J. Process Mech. Eng.; 2023; pp. 1-18. [DOI: https://dx.doi.org/10.1177/09544089231159834]

239. Tripathi, V.; Chattopadhyay, S.; Sharma, S.; Singh, G.; Singh, J.; Chohan, J.; Kumar, R.; Singh, M. Development of an agile model using total productive maintenance to enhance industrial sustainability in industry 4.0. AIP Conf. Proc.; 2023; 2558, 020003. [DOI: https://dx.doi.org/10.1063/5.0121276]

240. Tripathi, V.; Chattopadhyaya, S.; Mukhopadhyay, A.K.; Sharma, S.; Li, C.; Singh, S.; Saleem, W.; Salah, B.; Mohamed, A. Recent Progression Developments on Process Optimization Approach for Inherent Issues in Production Shop Floor Management for Industry 4.0. Processes; 2022; 10, 1587. [DOI: https://dx.doi.org/10.3390/pr10081587]

241. Tripathi, V.; Chattopadhyaya, S.; Mukhopadhyay, A.K.; Saraswat, S.; Sharma, S.; Li, C.; Rajkumar, S. Development of a Data-Driven Decision-Making System Using Lean and Smart Manufacturing Concept in Industry 4.0: A Case Study. Math. Probl. Eng.; 2022; 2022, pp. 1-20. [DOI: https://dx.doi.org/10.1155/2022/3012215]

242. Tripathi, V.; Chattopadhyaya, S.; Mukhopadhyay, A.K.; Saraswat, S.; Sharma, S.; Li, C.; Rajkumar, S.; Georgise, F.B. A Novel Smart Production Management System for the Enhancement of Industrial Sustainability in Industry 4.0. Math. Probl. Eng.; 2022; 2022, pp. 1-24. [DOI: https://dx.doi.org/10.1155/2022/6424869]

243. Tripathi, V.; Chattopadhyaya, S.; Mukhopadhyay, A.K.; Sharma, S.; Singh, J.; Pimenov, D.Y.; Giasin, K. An Innovative Agile Model of Smart Lean–Green Approach for Sustainability Enhancement in Industry 4.0. J. Open Innov. Technol. Mark. Complex.; 2021; 7, 215. [DOI: https://dx.doi.org/10.3390/joitmc7040215]

244. Tripathi, V.; Chattopadhyaya, S.; Mukhopadhyay, A.K.; Sharma, S.; Li, C.; Singh, S.; Hussan, W.U.; Salah, B.; Saleem, W.; Mohamed, A. A Sustainable Productive Method for Enhancing Operational Excellence in Shop Floor Management for Industry 4.0 Using Hybrid Integration of Lean and Smart Manufacturing: An Ingenious Case Study. Sustainability; 2022; 14, 7452. [DOI: https://dx.doi.org/10.3390/su14127452]

245. Tripathi, V.; Chattopadhyaya, S.; Mukhopadhyay, A.K.; Sharma, S.; Li, C.; Di Bona, G. A Sustainable Methodology Using Lean and Smart Manufacturing for the Cleaner Production of Shop Floor Management in Industry 4.0. Mathematics; 2022; 10, 347. [DOI: https://dx.doi.org/10.3390/math10030347]

246. Tripathi, V.; Chattopadhyaya, S.; Bhadauria, A.; Sharma, S.; Li, C.; Pimenov, D.Y.; Giasin, K.; Singh, S.; Gautam, G.D. An Agile System to Enhance Productivity through a Modified Value Stream Mapping Approach in Industry 4.0: A Novel Approach. Sustainability; 2021; 13, 11997. [DOI: https://dx.doi.org/10.3390/su132111997]

247. Moher, D.; Liberati, A.; Tetzlaff, J.; Altman, D.G. The PRISMA Group. Preferred Reporting Items for Systematic Reviews and Meta-Analyses: The PRISMA Statement. PLoS Med.; 2009; 6, e1000097. [DOI: https://dx.doi.org/10.1371/journal.pmed.1000097]