Search

Service-oriented manufacturing (SOM) is a new industrial model that combines manufacturing with service. To enhance the competitiveness of manufacturers in SOM systems, we investigate a coordinated production and delivery scheduling problem considering a third-party logistics (3PL) provider. The considered problem can be divided into two phases, including production phase and delivery phase. In the production phase, jobs are processed by multiple manufacturers located in different geographical zones. Jobs are with deteriorating processing time and set-up time. Several structural properties of the problem in the production phase are proposed, based on which a heuristic algorithm is designed to make decisions on job batching and batch sequencing. After being processed, the finished jobs are immediately delivered to a customer by manufacturers' own vehicles or the 3PL provider. A dynamic programming algorithm is developed to solve the problem in the delivery phase. The integrated scheduling problem is proved to be NP-hard. Hence, we develop a general variable neighbourhood search (GVNS) to solve the problem in a reasonable time. The basic variable neighbourhood descent (BVND) is used as a local search method in the GVNS. Finally, the computational experiments are conducted and the results verify the effectiveness and stability of the proposed approach. [ABSTRACT FROM AUTHOR]

One of the main challenges in operating multistate manufacturing systems (MMSs) is maintaining stable and robust production against various disruptions. Therefore, an urgent need exists for an operation and maintenance (O&M) method that optimises MMS resilience, i.e. the capability of withstanding or recover from disruptions of various sources. Consequently, this study proposes an integrated resilience-oriented production and maintenance scheduling approach for MMSs. This approach enhances MMS resilience by reinforcing its adaptivity to the variation in production requirements. Based on a conceptual investigation of operational uncertainty and its mechanism of disruption, this study devotes to (i) formulating a performance loss-based resilience measurement with consideration of operational uncertainties and (ii) proposing a reinforcement learning-based approach to schedule MMS operation and maintenance activities for MMS components of different performance states. An industrial case study of a ferrite phase shifter manufacturing system is subsequently conducted to validate the proposed approach. Results demonstrate the effectiveness of the proposed approach in the resilience optimisation of MMSs. [ABSTRACT FROM AUTHOR]

The cloud-edge collaborative manufacturing system (CCMS) connects distributed factories to a cloud centre through cloud-edge collaborative communication, introducing both opportunities and challenges to conventional dynamic job scheduling. Enhancing each factory's scheduling performance by sharing general scheduling knowledge among heterogeneous factories under the consideration of data privacy protection remains challenging. To this end, this paper proposes to solve the dynamic job scheduling in the context of CCMS with a novel federated deep reinforcement learning (FDRL) approach. Within each factory, the scheduling objective involves minimising the makespan and energy consumption, accounting for machine warm-up procedures and real-time dynamics. To handle heterogeneous policy structures, we aggregate their hidden parameters through FDRL, with states, actions, and rewards designed to facilitate the aggregation. The two-phase algorithm, comprising iterative local training and global aggregation, trains the scheduling policies. Constraint items are introduced to the loss functions to smooth local training, and the global aggregation considers production scales and obtained objectives. The proposed approach enhances the solution quality and generalisation of each factory's scheduling policy without exposing original production data. Numerical experiments conducted on sixty scheduling instances validate the superiority of the proposed approach compared to twelve dynamic scheduling methods. Compared to independently trained DRL-based approaches, the proposed FDRL-based approach achieves up to an 8.9% reduction in makespan and a 22.3% decrease in energy consumption through knowledge sharing. [ABSTRACT FROM AUTHOR]

With the escalating integration of renewable energy sources (RESs) within the manufacturing sector, the synergy between energy and production management has gained paramount importance. To harmonise energy efficiency with production effectiveness, the concept of energy-aware scheduling, comprising off-line, on-line, and hybrid scheduling, has been introduced. While each approach has merits and drawbacks in handling unexpected disturbances, recovering optimal performance, and managing computational costs, their designs often tend to be ad hoc. Currently, there is a lack of a systematic design that effectively balances computational costs, robustness to unexpected disturbances, and optimal performance. Moreover, existing results do not fully leverage the flexibility in factories integrated with Renewable Energy Sources (RESs). In response, this study introduces the paradigm of event-triggered hybrid scheduling (ETHS) to achieve a balance among optimality, robustness, and computational cost by fully exploring the system's flexibility. The efficacy of ETHS is empirically demonstrated through a comprehensive case study involving a real-world manufacturing facility. Diverse scenarios are scrutinised, accompanied by sensitivity analyses pertaining to parameter choices. The outcomes conspicuously underscore the potency of ETHS in facilitating the harmonious alignment of energy and production management within the ambit of manufacturing industries. [ABSTRACT FROM AUTHOR]

Nowadays, achieving higher levels of flexibility in manufacturing systems is necessary to maintain and enhance competitiveness. Accordingly, a new generation of production machine, namely Reconfigurable Machine Tool (RMT), has recently been introduced that can be effectively adapted to changes. Nevertheless, such systems are more worker-reliant, and neglecting workforce aspects results in suboptimal or even infeasible production schedules. In this regard, this study investigates an integrated lot-sizing and scheduling problem benefiting from RMTs under workforce constraints. First, a novel Mixed-Integer Linear Programming (MILP) model is provided to formulate the problem. Afterward, to confront the high complexity of the problem, an efficient Decomposition Heuristic (DH) empowered by a tailored feasibility cut is devised. A combination of MILP and Constraint Programming (CP) is employed in the DH to model the relevant master and sub-problems, respectively. Finally, the performance of the DH compared to the MILP model and an extended lower bound is evaluated. Moreover, the advantages of utilizing RMTs in the system are explored based on four defined key performance indicators. [ABSTRACT FROM AUTHOR]

Human–robot collaboration has been incorporated into production and assembly processes to promote system flexibility, changeability and adaptability. However, it poses new challenges to resource allocation and production scheduling due to its intrinsic uncertainty and also the increasing complexity of resources. This paper investigates a stochastic flow shop scheduling problem in the context of human–robot collaboration. The goal is to achieve efficient utilisation of flexible resources including human workers and cobots and take full advantage of human–robot collaboration in production scheduling. A stochastic Cobb–Douglas production function is utilised to evaluate the production efficiency of human–robot collaboration considering instabilities of human performance. A joint chance-constrained programming model is formulated to ensure that the required system performance can be achieved. A CVaR approximation-based approach is proposed to solve the formulated model with mixed-integer variables and a nonconvex constraint. The effectiveness of the formulated model and the efficiency of the proposed solution approach are evaluated via numerical experiments. Computational results show the superiority of our solution approach over three other approaches including Bonferroni approximation, scenario approach and individual chance-constrained programming. [ABSTRACT FROM AUTHOR]

Nowadays, the manufacturing sector needs higher levels of flexibility to confront the extremely volatile market. Accordingly, exploiting both machine and workforce reconfigurability as two critical sources of flexibility is advantageous. In this regard, for the first time, this paper explores an integrated production scheduling and workforce planning problem in a Reconfigurable Manufacturing System (RMS) benefiting from reconfigurable machines and human-robot collaboration. A new Mixed-Integer Linear Programming (MILP) model and an efficient Constraint Programming (CP) model are developed to formulate the problem, minimising the makespan as the performance metric. Due to the high complexity of the problem, the MILP model cannot handle large-sized instances. Hence, to evaluate the performance of the CP model in large-sized instances, a lower bound is derived based on the relaxation of the problem. Finally, extensive computational experiments are carried out to assess the performance of the devised MILP and CP models and provide general recommendations for managers dealing with such a complex problem. The results reveal the superiority of the CP model over the MILP model in small- and medium-sized instances. Moreover, the CP model can find high-quality solutions for large-sized instances within a reasonable computational time. [ABSTRACT FROM AUTHOR]

Additive manufacturing (AM) introduces a set of technology-specific problems, such as the proper orientation of parts or the placement of several heterogeneous parts in the same build cycle, which are not addressed by traditional approaches to production planning and scheduling. Although these new production subproblems have been implicitly addressed by several works according to generic nesting and scheduling concepts, a literature review revealed that there is no uniformity in identifying and, thus, solving all these subproblems. For this reason, and as a result of an in-depth analysis of the existent literature on AM production planning and an analogy with classic cutting and packing typologies, the present paper offers a framework to formalise the production planning problem in AM at the operational level. This framework can be used as a reference to focus on and address these AM-related problems for efficient production planning. It is designed at the subproblem level and centres on production order processing in AM. A coding strategy is specifically developed for the framework, which is applied to a review of relevant works that propose models for the production planning of AM systems. Finally, the review results are discussed and possible extensions of the framework are proposed. [ABSTRACT FROM AUTHOR]

Smart manufacturing has boosted the wide application of mobile robots in robotic cells for automated material delivery. However, the mismatching between machine production process and robot movement process causes extensive energy waste. Nevertheless, most existing robotic job-shop scheduling (RJSP) studies mainly focus on minimising makespan but overlook the low energy efficiency problem faced by robotic cells. Motivated by the importance of green smart manufacturing, in this study, we innovatively propose to achieve robotic cell energy saving through coordinating the machine production process and robot movement process. Specifically, both machines and the mobile robot can flexibly adjust operating speeds with a V-scale speed framework. Two novel energy-efficient RJSP approaches (i.e. the RJSP-E and the RJSP-EM) are thus proposed. The RJSP-E focuses on minimising energy consumption, while the RJSP-EM simultaneously considers makespan (i.e. productivity) and energy consumption. Through computational experiments, the RJSP-E demonstrates superior performances in reducing energy consumption (15% on average), at a loss of productivity (20% on average). On the other hand, the RJSP-EM can select the most suitable energy-saving operating speeds without much sacrifice in productivity. Notably, the RJSP-EM can reduce energy consumption by a mean of 10% even without increasing makespan. The RJSP-EM also demonstrates higher solution efficiency. [ABSTRACT FROM AUTHOR]

Dispatching rules are one of the most widely applied methods for solving Dynamic Job Shop Scheduling problems (DJSSP) in real-world manufacturing systems. Hence, the automated design of effective rules has been an important subject in the scheduling literature for the past several years. High computational requirements and difficulty in interpreting generated rules are limitations of literature methods. Also, feature selection approaches in the field of automated design of scheduling policies have been developed for the tree-based GP approach only. Therefore, the aim of this study is to propose a feature selection approach for the Gene Expression Programming (GEP) algorithm to evolve high-quality rules in simple structures with an affordable computational budget. This integration speeds up the search process by restricting the GP search space using the linear representation of the GEP algorithm and creates concise rules with only meaningful features using the feature selection approach. The proposed algorithm is compared with five algorithms and 30 rules from the literature under different processing conditions. Three performance measures are considered including total weighted tardiness, mean tardiness, and mean flow time. The results show that the proposed algorithm can generate smaller rules with high interpretability in a much shorter training time. [ABSTRACT FROM AUTHOR]

Copyright of Light Industry Machinery is the property of Light Industry Machinery Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Minimizing job waiting time for completing related operations is a critical objective in industries such as chemical and food production, where efficient planning and production scheduling are paramount. Addressing the complex nature of flow shop scheduling problems, which pose significant challenges in the manufacturing process due to the vast solution space, this research employs a novel multiobjective genetic algorithm called distance from ideal point in genetic algorithm (DIPGA) to identify Pareto-optimal solutions. The effectiveness of the proposed algorithm is benchmarked against other powerful methods, namely, NSGA, MOGA, NSGA-II, WBGA, PAES, GWO, PSO, and ACO, using analysis of variance (ANOVA). The results demonstrate that the new approach significantly improves decision-making by evaluating a broader range of solutions, offering faster convergence and higher efficiency for large-scale scheduling problems with numerous jobs. This innovative method provides a comprehensive listing of Pareto-optimal solutions for minimizing makespan and total waiting time, showcasing its superiority in addressing highly complex problems. [ABSTRACT FROM AUTHOR]

With the increasing uncertainty and complexity of industrial production, dynamic events are inevitably happened during the production process. This paper deals with the transportation time constrained dynamic flexible job shop scheduling problem with machine breakdown, new jobs arrival, jobs cancellation, and processing time change of operations. Considering the actual production situation, a makespan rescheduling model based on transportation time is established. A Monte‐Carlo tree search based algorithm is proposed to solve the dynamic flexible job shop scheduling problem such that the makespan is minimized. In order to improve the accuracy of the developed algorithm and the quality of the obtained scheduling schemes, subtree keeping policy, multi‐branching simulation, reinforcement learning, ε−$$ \varepsilon - $$greedy strategy, and expectation‐best evaluation method are employed. Moreover, a subtree pruning policy is embedded to improve the search efficiency of the developed algorithm. Simulation experiments are conducted on a series of instances of different sizes to compare the developed approach with the GA‐based scheduling approach and the Monte‐Carlo tree search based approach. The simulation results indicate that the developed approach is superior to the existing scheduling approaches in terms of the qualities of the obtained solutions. [ABSTRACT FROM AUTHOR]

As industrial informatization progresses, virtual simulation technologies are increasingly demonstrating their potential in industrial applications. These systems utilize various sensors to capture real-time factory data, which are then transmitted to servers via communication interfaces to construct corresponding digital models. This integration facilitates tasks such as monitoring and prediction, enabling more accurate and convenient production scheduling and forecasting. This is particularly significant for flexible or mixed-flow production modes. Bionic optimization algorithms have demonstrated strong performance in factory scheduling and operations. Centered around these algorithms, researchers have explored various strategies to enhance efficiency and optimize processes within manufacturing environments.This study introduces an efficient migratory bird optimization algorithm designed to address production scheduling challenges in an assembly shop with mold quantity constraints. The research aims to minimize the maximum completion time in a batch flow mixed assembly flow shop scheduling problem, incorporating variable batch partitioning strategies. A tailored virtual simulation framework supports this objective. The algorithm employs a two-stage encoding mechanism for batch partitioning and sequencing, adapted to the unique constraints of each production stage. To enhance the search performance of the neighborhood structure, the study identifies and analyzes optimization strategies for batch partitioning and sequencing, and incorporates an adaptive neighborhood structure adjustment strategy. A competition mechanism is also designed to enhance the algorithm's optimization efficiency. Simulation experiments of varying scales demonstrate the effectiveness of the variable batch partitioning strategy, showing a 5–6% improvement over equal batch strategies. Results across different scales and parameters confirm the robustness of the algorithm. [ABSTRACT FROM AUTHOR]

The study of the flexible job shop scheduling problem (FJSP) is of great importance in the context of green manufacturing. In this paper, with the optimization objectives of minimizing the maximum completion time and the total machine energy consumption, an improved multi-objective evolutionary algorithm with decomposition (MOEA/D) based on reinforcement learning is proposed. Firstly, three initialization strategies are used to generate the initial population in a certain ratio, and four variable neighborhood search strategies are combined to increase the local search capability of the algorithm. Second, a parameter adaptation strategy based on Q-learning is proposed to guide the population to select the optimal parameters to increase diversity. Finally, the performance of the proposed algorithm is analyzed and evaluated by comparing Q-MOEA/D with IMOEA/D and NSGA-II through different sizes of Kacem and BRdata benchmark cases and production examples of automotive engine cooling system manufacturing. The results show that the Q-MOEA/D algorithm outperforms the other two algorithms in solving the energy-efficient scheduling problem for flexible job shops. [ABSTRACT FROM AUTHOR]

Steel-making and continuous casting (SCC) processes are considered the main bottlenecks in the steel industry. We consider planning and scheduling problems in SCC processes and provide an overview of the literature with our commentary. The planning problem has as goal to create out of customer orders production units for the various production processes. The scheduling problem assigns these production units to the production facilities over different time intervals. We review a large number of planning and scheduling papers and propose two basic models for the planning and the scheduling problems that incorporate the most common and essential features. We describe for each problem the respective constraints and objectives as well as the practical implications in an actual production environment. We also analyse the methodologies used in their solutions, including decomposition strategies. In the last section, we present the conclusions of our survey and propose new research directions. [ABSTRACT FROM AUTHOR]

Copyright of China Mechanical Engineering is the property of Editorial Board of China Mechanical Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Flexible manufacturing cells provide significant advantages in low-volume mass-customization production but also induce added complexity and technical challenges in terms of integration, control, and extensibility. The variety of closed-source industrial protocols, the heterogeneous equipment, and the product's manufacturing specifications are main points of consideration in the development of such a system. This study aims to describe the approach, from concept to implementation, for the development of the controller for a flexible manufacturing cell consisting of heterogeneous equipment in terms of functions and communication interfaces. Emphasis is put on the considerations and challenges for effective integration, extensibility, and interoperability. Scheduling and monitoring performed by the developed controller are demonstrated for a manufacturing cell producing microfluidic devices (bioMEMS) that consists of six workstations and a robot-based handling system. Communication between the system controller and the workstations was based on open-source technologies instead of proprietary software and protocols, to support interoperability and, to a considerable extent, code reusability. [ABSTRACT FROM AUTHOR]

In the era of Industry 4.0, production scheduling as a critical part of manufacturing system should be smarter. Smart scheduling agent is required to be real-time autonomous and possess the ability to face unforeseen and disruptive events. However, traditional methods lack adaptability and intelligence. Hence, this paper is devoted to proposing a smart approach based on proximal policy optimization (PPO) to solve dynamic job shop scheduling problem with random job arrivals. The PPO scheduling agent is trained based on an integration framework of discrete event simulation and deep reinforcement learning. Copies of trained agent can be linked with each machine for distributed control. Meanwhile, state features, actions and rewards are designed for scheduling at each decision point. Reward scaling are applied to improve the convergence performance. The numerical experiments are conducted on cases with different production configurations. The results show that PPO method can realize on-line decision making and provide better solution than dispatch rules and heuristics. It can achieve a balance between time and quality. Moreover, the trained model could also maintain certain performance even in untrained scenarios. [ABSTRACT FROM AUTHOR]

Lean production is a set of methods aimed at increasing efficiency and flexibility within a firm by eliminating waste and accurately defining value. For this reason, it is interested in eliminating activities that do not add value to the product to reduce costs. Within the scope of lean production, different methods are used based on certain priorities and simultaneously. In this study, the Lean Production Leveling-Heijunka approach, a lean production method applied in a mold sponge manufacturing firm, is discussed. In the accessible literature, it has been seen that the heijunka method has been studied little before and no linear model has been found for its application. Therefore, within the scope of this study, a multi-objective linear model that includes production leveling, sequencing and job stability elements is proposed. As the proposed model is multi-objective, the weighted sum method was used as the aim aggregation method to solve it. The problem of the firm was solved using the proposed model in GAMS/CPLEX. To evaluate the performance of the model, first a small-size sample problem was solved and then the main problem of the firm where the application was used was solved. The effectiveness of the model was evaluated by comparing the results obtained after solving the firm problem with the current case. In addition, Heijunka values for both cases were calculated to demonstrate the success of the proposed model's solution. According to the calculations, the Heijunka ratio was four in the solution obtained by applying the proposed model, while it was two in the current situation. These results demonstrate that a successful Heijunka method was implemented in the firm where the application was conducted, and the production process was made more balanced. [ABSTRACT FROM AUTHOR]

This paper addresses a job shop scheduling problem with peak power constraints, in which jobs can be processed once or multiple times on either all or a subset of the machines. The latter characteristic provides additional flexibility, nowadays present in many manufacturing systems. The problem is complicated by the need to determine both the operation sequence and starting time as well as the speed at which machines process each operation. Due to the adherence to renewable energy production and its intermittent nature, manufacturing companies need to adopt power‐flexible production schedules. The proposed power control strategies, that is, adjusting processing speed and timing to reduce peak power requirements may impact production time (makespan) and energy consumption. Therefore, we propose a bi‐objective approach that minimizes both objectives. A linear programming model is developed to provide a formal statement of the problem, which is solved to optimality for small‐sized instances. We also proposed a multi‐objective biased random key genetic algorithm framework that evolves several populations in parallel. Computational experiments provide decision and policymakers with insights into the implications of imposing or negotiating power consumption limits. Finally, the several trade‐off solutions obtained show that as the power limit is lowered, the makespan increases at an increasing rate and a similar trend is observed in energy consumption but only for very small makespan values. Furthermore, peak power demand reductions of about 25% have a limited impact on the minimum makespan value (4–6% increase), while at the same time allowing for a small reduction in energy consumption. [ABSTRACT FROM AUTHOR]

Manufacturing processes are often disrupted by unexpected events, such as machine breakdowns, raw material shortages, and the arrival of new orders. Effectively managing these uncertainties is crucial for maintaining the feasibility and optimality of the production system. The efficiency of a manufacturing system is heavily dependent on the optimality of its scheduling plan. In this study, we present a reactive scheduling approach based on the S-graph framework. The proposed method is specifically designed to handle the arrival of new jobs and generate schedules with the shortest makespan, i.e., the minimum total completion time. Whenever a new order is received, the method dynamically adjusts the production plan through rescheduling. Three distinct scheduling policies are identified that determine which tasks require scheduling or rescheduling and which tasks should remain unchanged in their schedules. To evaluate the effectiveness of the algorithm, we solve several examples from the literature and analyze the results. The findings demonstrate the efficiency and efficacy of the proposed approach. The ability to accommodate new job arrivals and generate schedules with a minimized makespan highlights the practical relevance and benefits of the S-graph-based reactive scheduling method. [ABSTRACT FROM AUTHOR]

Phase planning is one of the most important components of lean-based production planning that provides basic guidelines for the entire production process. In modular integrated construction (MiC) projects, the complicated and drawn-out features of the manufacturing or production process pose difficulties for informed phase planning decisions under uncertainties. However, owing to the nascent nature of MiC, traditional approaches have little prior knowledge of the uncertainties. This research aimed to address this problem by proposing a data-driven optimization method based on a set of valuable historical production data to hedge against uncertainties during production. A real-life case study was then conducted to validate this optimization approach. The planning solution, including the (1) critical production path, (2) detailed production schedules, and (3) simulated production process, balances production schedules and uncertainties to ensure feasible and robust phase planning. This optimization method can make full use of historical production data rather than approximations of the probability distributions to handle uncertainties in the phase planning process. This research provides an innovative and robust solution for MiC production managers to efficiently conduct phase planning under uncertainties. It enriches the literature on phase planning and contributes to lean MiC manufacturing. The biggest novelty of this research is to open up a window for researchers and practitioners to look into MiC production in factories, which are traditionally like a "black box" unknown to us. [ABSTRACT FROM AUTHOR]

In today's customer-centric economy, the demand for personalized products has compelled corporations to develop manufacturing processes that are more flexible, efficient, and cost-effective. Flexible job shops offer organizations the agility and cost-efficiency that traditional manufacturing processes lack. However, the dynamics of modern manufacturing, including machine breakdown and new order arrivals, introduce unpredictability and complexity. This study investigates the multiplicity dynamic flexible job shop scheduling problem (MDFJSP) with new order arrivals. To address this problem, we incorporate the fluid model to propose a fluid randomized adaptive search (FRAS) algorithm, comprising a construction phase and a local search phase. Firstly, in the construction phase, a fluid construction heuristic with an online fluid dynamic tracking policy generates high-quality initial solutions. Secondly, in the local search phase, we employ an improved tabu search procedure to enhance search efficiency in the solution space, incorporating symmetry considerations. The results of the numerical experiments demonstrate the superior effectiveness of the FRAS algorithm in solving the MDFJSP when compared to other algorithms. Specifically, the proposed algorithm demonstrates a superior quality of solution relative to existing algorithms, with an average improvement of 29.90%; and exhibits an acceleration in solution speed, with an average increase of 1.95%. [ABSTRACT FROM AUTHOR]

The frequently evolving manufacturing system necessitates real-time large-scale data analytics, surpassing the capabilities of classical systems or human skills, necessitating knowledge development and self-adaptive control. Unpredictable real-time events in smart factories cause changes in the effectiveness of planned schedules or tasks; even slight interruptions can accumulate to make the preplanned schedule unoptimized, if not impossible. To meet the required production efficiency, typical dynamic scenarios on the shop floor, such as failures, random job arrivals, and machine setup, must be addressed quickly. Hence, this study proposes a novel Triple Deep Q Network (TDQN) approach for learning high-quality dispatching rules for addressing the Flexible Job Shop Scheduling Problem (FJSSP) in uncertainty. For the dispatching rule-based FJSSP, the Markov Decision Process (MDP) to choose a suitable operation-machine (O-M) pair is formulated to allow operation selection and resource assignment resolutions to be made simultaneously. The performance of the TDQN method is investigated against the Double Deep Q Network (DDQN) and Deep Q Network (DQN) approach and found to be more stable. Moreover, among the 29 different shopfloor configuration settings, TDQN performed better in 62.07% of the overall instances, while DDQN and DQN performed better in only 31.03% and 6.9% of instances, respectively. [ABSTRACT FROM AUTHOR]

Considering the requirements of the actual production scheduling process, the utilization of the genetic programming hyper-heuristic (GPHH) approach to automatically design dispatching rules (DRs) has recently emerged as a popular optimization approach. However, the decision objects and decision environments for routing and sequencing decisions are different in the dynamic flexible job shop scheduling problem (DFJSSP), leading to different required feature information. Traditional algorithms that allow these two types of scheduling decisions to share one common feature set are not conducive to the further optimization of the evolved DRs, but instead introduce redundant and unnecessary search attempts for algorithm optimization. To address this, some related studies have focused on customizing the feature sets for both routing and sequencing decisions through feature selection when solving single-objective problems. While being effective in reducing the search space, the selected feature sets also diminish the diversity of the obtained DRs, ultimately impacting the optimization performance. Consequently, this paper proposes an improved GPHH with dual feature weight sets for the multi-objective energy-efficient DFJSSP, which includes two novel feature weight measures and one novel hybrid population adjustment strategy. Instead of selecting suitable features, the proposed algorithm assigns appropriate weights to the features based on their multi-objective contribution, which could provide directional guidance to the GPHH while ensuring the search space. Experimental results demonstrate that, compared to existing studies, the proposed algorithm can significantly enhance the optimization performance and interpretability of energy-efficient DRs. [ABSTRACT FROM AUTHOR]

Process planning and scheduling are two crucial components in flexible manufacturing systems. To address the challenge of information interaction and sharing during the process planning and scheduling stage of parts, a digital twin-oriented approach is proposed. The objective is to optimize the maximum makespan while accommodating fluctuations in the job shop site. Firstly, in the process planning stage, an enhanced genetic algorithm is employed to generate multiple near-optimal process routes. These routes are coded using a four-level coding system, enhancing the efficiency of the planning process. Then, in the production scheduling stage, a hybrid particle swarm optimization algorithm is constructed, considering the characteristics of multi-process routes and the status of shop production resources and production systems. To improve local search ability, various neighborhood structures are utilized. Finally, the proposed method is evaluated through production example simulations and compared with genetic algorithm and particle swarm optimization. The results demonstrate that this method has a quicker convergence rate, shorter execution time, and higher computation precision, which is not only remarkable but also practical for addressing the collaborative optimization of process planning and scheduling in discrete manufacturing systems. [ABSTRACT FROM AUTHOR]

Uncertainties in manufacturing can have a significant effect on the outcomes of a process and pose difficulties for the management of the processes. Although many models that consider uncertainties in the manufacturing process focus on differences in the processing time and availability of resources, this article reflects on a new aspect of the Stochastic Job Shop Scheduling Problem, evaluating the probability of success (or failure) of a manufacturing job and the effect of a job failure on the other jobs in the process, in particular the rework costs. The article presents a Markovian approach to model a set of manufacturing jobs based on the cost and the probabilistic distribution for success. A failure causes either rework of the failed job, or repetition of some or all previous jobs. The article presents a brief analysis for optimal tolerance assignment using the proposed model and includes a discussion on how this approach can be augmented with machine-learning tools. The article also presents an artificial intelligence–assisted methodology through online scheduling of production processes coupled with online and adaptive tolerance redesign for better management of machining assets. [ABSTRACT FROM AUTHOR]

This study investigates the unrelated parallel machine scheduling problem with release dates to minimise the makespan. The solution to this problem finds wide applications in manufacturing and logistics systems. Due to the strong NP-hardness of the problem, most researchers develop heuristics, and the largest instances they consider are limited to 400 jobs. To tackle this problem, we develop a novel mixed-integer linear program (MILP) with significantly fewer integer variables than the state-of-the-art ones. The proposed MILP does not rely on a binary sequence variable usually used in the existing models. To deal with large-sized instances, a new three-stage matheuristic algorithm (TSMA) is proposed to obtain scheduling decisions. It uses a dispatching rule to sequentially schedule jobs on machines. Then a reassignment procedure is performed to reduce the makespan. Finally, it employs a re-optimisation procedure based on the proposed MILP to perform job moves and exchanges between two selected machines. We conduct numerical experiments on 1440 instances with up to 3000 jobs and 20 machines. Our results first clearly indicate that the proposed model significantly outperforms existing ones. Moreover, the results on large-sized instances show that the proposed TSMA can obtain high-quality near-optimal solutions in a short computation time. [ABSTRACT FROM AUTHOR]

Dynamic flexible job-shop scheduling is traditionally a challenge in real-world manufacturing systems, especially considering the constraints of transportation resources and transportation time. To address the dynamic optimisation problem in flexible manufacturing systems, this paper proposes a novel proactive-reactive methodology to adapt to the dynamic changes in working environments and addresses the joint scheduling problem for machine tools and transportation resources. The joint optimisation model is first formulated as a mixed-integer programming model considering production efficiency and transportation constraints. The flowchart of the dynamic scheduling system is then designed for dynamic decision-making, and a novel particle swarm optimisation algorithm integrated with genetic operators is developed to respond to dynamic events and generate the reschedule plan in time. Finally, several numerical experiments and case studies in reality are applied to verify the efficiency of the developed methodology. Common dispatching rules and heuristic methods are also applied to test and evaluate the efficiency of the developed algorithm. Computational results demonstrate that the developed methods and decision models are efficient for dynamic job-shop scheduling problems in flexible manufacturing systems, which can acquire rather a good effect in practical production. [ABSTRACT FROM AUTHOR]

In this study, system maintenance and production scheduling are jointly decided to solve the problems of resource idleness and time cost increase due to system maintenance in the processing of production scheduling. For the multi-component system with economic dependence, a joint strategy of condition-based maintenance and production scheduling is formulated, which includes opportunistic maintenance, preventive maintenance, and corrective maintenance. On this basis, a joint decision model is established to minimise the total weighted expected completion time. Subsequently, all possible maintenance requirements and their corresponding probabilities for the multi-component system in the entire production scheduling process are deduced via the deterioration state space partition modelling method. Furthermore, the stationary probability density function of the joint state of the system is derived, and its numerical solution method is provided. Finally, taking the KS5 adjustable multi-axis tapping machine as an example, numerical experiments are conducted to verify the efficacy of the proposed strategy and the established model. Comparisons with previous strategies using different numbers of components and scheduling job scales indicate that the joint decision model yields better results. [ABSTRACT FROM AUTHOR]

The manufacturing systems' success directly relates to their accurate, reliable and flexible schedules, including how production is planned and scheduled and which constraints are considered in generating the schedules. The study's objective arises from the need to generate an optimal production scheduling system in a connecting plates manufacturing company that works on a Make-To-Stock basis. This research investigates the impact of demand and operational constraints on production schedules, including the facility capacity, operators and machines availability, raw materials availability, inventory level and warehouse capacity. A multi-agent-based optimisation model is developed to face the complexity of considering demand and operational constraints and reflects their impact on generating a reliable production schedule. This model involves a proposed heuristic algorithm that considers demand and operations constraints in such a manufacturing environment and optimises the production schedule based on these restrictions/requirements. A real-life case study based on a connecting plates manufacturer company is used as a test bench of the proposed agent-based heuristic optimisation model. The proposed algorithm is compared with other related approaches to check its superiority based on key criteria, including inventory levels, missed/unsatisfied orders and total production time. Results show that the proposed heuristics algorithm reduced the number of missed orders by 34% compared with similar approaches. [ABSTRACT FROM AUTHOR]

In the real world of manufacturing systems, production planning is crucial for organizing and optimizing various manufacturing process components. The objective of this paper is to present a methodology for both static scheduling and dynamic scheduling. In the proposed method, a hybrid algorithm is utilized to optimize the static flexible job-shop scheduling problem (FJSP) and dynamic flexible job-shop scheduling problem (DFJSP). This algorithm integrates the genetic algorithm (GA) as a global optimization technique with a simulated annealing (SA) algorithm serving as a local search optimization approach to accelerate convergence and prevent getting stuck in local minima. Additionally, variable neighborhood search (VNS) is utilized for efficient neighborhood search within this hybrid algorithm framework. For the FJSP, the proposed hybrid algorithm is simulated on a 40-benchmark dataset to evaluate its performance. Comparisons among the proposed hybrid algorithm and other algorithms are provided to show the effectiveness of the proposed algorithm, ensuring that the proposed hybrid algorithm can efficiently solve the FJSP, with 38 out of 40 instances demonstrating better results. The primary objective of this study is to perform dynamic scheduling on two datasets, including both single-purpose machine and multi-purpose machine datasets, using the proposed hybrid algorithm with a rescheduling strategy. By observing the results of the DFJSP, dynamic events such as a single machine breakdown, a single job arrival, multiple machine breakdowns, and multiple job arrivals demonstrate that the proposed hybrid algorithm with the rescheduling strategy achieves significant improvement and the proposed method obtains the best new solution, resulting in a significant decrease in makespan. [ABSTRACT FROM AUTHOR]

Efficiently managing resource utilization is critical in manufacturing systems to optimize production efficiency, especially in dynamic environments where jobs continually enter the system and machine breakdowns are potential occurrences. In fully automated environments, co-ordinating the transport system with other resources is paramount for smooth operations. Despite extensive research exploring the impact of job characteristics, such as fixed or variable task-processing times and job arrival rates, the role of the transport system has been relatively underexplored. This paper specifically addresses the utilization of a conveyor belt as the primary mode of transportation among a set of production machines. In this configuration, no input or output buffers exist at the machines, and the transport times are contingent on machine availability. In order to tackle this challenge, we introduce a randomized heuristic approach designed to swiftly identify a near-optimal joint schedule for job processing and transfer. Our solution has undergone testing on both state-of-the-art benchmarks and real-world instances, showcasing its ability to accurately predict the overall processing time of a production line. With respect to our previous work, we specifically consider the case of the arrival of a dynamic job, which requires a different design approach since there is a need to keep track of partially processed jobs, jobs that are waiting, and newly arrived jobs. We adopt a total rescheduling strategy and, in order to show its performance, we consider a clairvoyant scheduling approach, in which job arrivals are known in advance. We show that the total rescheduling strategy yields a scheduling solution that is close to optimal. [ABSTRACT FROM AUTHOR]

To solve various reworking and repair problems caused by unqualified bearing product quality inspections, this paper introduces a green re-entrant scheduling optimization method for bearing production shops considering job reworking. By taking into account quality inspection constraints, this paper establishes an integrated scheduling mathematical model based on the entire processing–transportation–assembly process of bearing production shops with the goals for minimizing the makespan, total carbon emissions, and waste emissions. To solve these problems, the concepts of the set of the longest common machine routes (SLCMR) and the set of the shortest recombination machine combinations (SSRMC) were used to propose the re-entrant scheduling optimization method, based on system reconfiguration, to enhance the system stability and production scheduling efficiency. Then, a multi-objective hybrid optimization algorithm, based on a neighborhood local search (MOOA-LS), is proposed to improve the search scope and optimization ability by constructing a multi-level neighborhood search structure. Finally, this paper takes a bearing production shop as an example to carry out the case study and designs a series of experimental analyses and comparative tests. The final results show that in the bearing production process, the proposed model and algorithm can effectively realize green and energy-saving re-entrant manufacturing scheduling. [ABSTRACT FROM AUTHOR]

In highly automated manufacturing systems running 24/7, preventive maintenance activities need to be executed during production times. Flexible job shops with several identical machines generally bear the potential to compensate temporary machine unavailability times caused by preventive maintenance without a considerable increase of the makespan due to machine paralleling. However, this requires sophisticated scheduling of manufacturing jobs and the assignment of maintenance activities over the scheduling horizon. This work, therefore, introduces a mixed-integer program that models both job scheduling and maintenance activity assignment. A local search algorithm is developed to solve both problems in an integrated way. Numerical studies are carried out based on data from a real flexible job shop in the automotive industry with 78 machines and four products. The results show that joint job scheduling and maintenance activity assignment is required to obtain a makespan similar to the makespan without maintenance consideration. Non-sophisticated scheduling of maintenance windows can increase the makespan by more than 20 percentage points compared to sophisticated scheduling. Besides, we show that only a limited amount of maintenance activities can be compensated and that higher unavailability times will inevitably lead to detrimental effects on the makespan unless maintenance worker capacity is increased. [ABSTRACT FROM AUTHOR]

Max-plus algebra is one of the analysis methods of discrete event systems which has many applications on systems theory and graph theory. Max-plus algebra is a set of real numbers R combined with ...=-∞ equipped with operations max (⊕) and plus (⊗), can be denoted [(R]_ε,⊕,⊗) with [(R]_ε=RU{ε}) . The production process of pia saronde is one of the problems that can be analyzed using max-plus algebra. The production process of this product is sequentially carried out by making skin dough, filling, baking, cooling, and packaging the pia. The max-plus algebra theory was used in this research to determine the optimal time in the production scheduling of pia saronde. Meanwhile, the Invarian Max-plus Linear System (IMLS), max-plus algebraic theory, and the Discrete Event System (DES) were used to solve the production-related problems. IMLS analysis produces eigenvalues that represent the optimum production time. The results obtained the max-plus algebra model of x(k+1)=A ...x(k), where A ...A⊕B⊗C and y=K⊗x_0⊕H⊗u for input-output IMLS analysis. From the matrix A ... eigenvalue λ = 226 and eigenvector √[278 278 278 279 299 302 324 356 488] were obtained. Furthermore, the value of λ describes the pia production schedule at a time span of 226 minutes. [ABSTRACT FROM AUTHOR]

With the gradual emergence of customized manufacturing, intelligent manufacturing systems have experienced widespread adoption, leading to a surge in research interests in the associated problem of intelligent scheduling. In this paper, we study the flexible job shop scheduling problem (FJSP) with setup time, handling time, and processing time in a multi-equipment work center production environment oriented toward smart manufacturing and make-to-order requirements. A mathematical model with the optimization objectives of minimizing the maximum completion time, the total number of machine adjustments, the total number of workpieces handled and the total load of the machine is constructed, and an improved discrete particle swarm algorithm based on Pareto optimization and a nonlinear adaptive inertia weighting strategy is proposed to solve the model. By integrating the model characteristics and algorithm features, a hybrid initialization method is designed to generate a higher-quality initialized population. Next, three cross-variance operators are used to implement particle position updates to maintain information sharing among particles. Then, the performance effectiveness of this algorithm is verified by testing and analyzing 15 FJSP test instances. Finally, the feasibility and effectiveness of the designed algorithm for solving multi-objective FJSPs are verified by designing an FJSP test example that includes processing time, setup time and handling time. [ABSTRACT FROM AUTHOR]

To address the issue of poor performance in the chimp optimization (ChOA) algorithm, a new algorithm called the manta ray-based chimpa optimization algorithm (MChOA) was developed. Introducing the Latin hypercube method to construct the initial population so that the individuals of the initial population are evenly distributed in the solution space, increasing the diversity of the initial population. Introducing nonlinear convergence factors based on positive cut functions to changing the convergence of algorithms, the early survey capabilities and later development capabilities of the algorithm are balanced. The manta ray foraging strategy is introduced at the position update to make up for the defect that the algorithm is prone to local optimization, which effectively improves the optimization performance of the algorithm. To evaluate the performance of the proposed algorithm, 27 well-known test reference functions were selected for experimentation, which showed significant advantages compared to other algorithms. Finally, in order to further verify the algorithm's applicability in actual production processes, it was applied to solve scheduling problems in three flexible workshop scenarios and an aviation engine job shop scheduling in an enterprise. This confirmed its efficacy in addressing complex real-world problems. [ABSTRACT FROM AUTHOR]

The Flexible Job Shop Scheduling Problem (FJSP) is an extension of the classical Job Shop Scheduling Problem (JSP). The research objective of the traditional FJSP mainly considers the completion time, but ignores the energy consumption of the manufacturing system. In this paper, a mathematical model of the energy-efficient flexible job shop scheduling problem is constructed. The optimization objectives are completion time, delay time, and total equipment energy consumption. To solve the model, an improved non-dominated sorting genetic algorithm (CT-NSGA-II) is proposed to obtain the optimal scheduling solution. First, the heuristic rules of GLR were used to generate the initial population with good quality and diversity. Second, different crossover and variation operators are designed for the process sequencing and equipment selection parts to enhance the diversity of the evolutionary population. The sparsity theory is introduced to find sparse solutions and three neighborhood structures are designed to perform local search on sparse solutions to improve the uniformity of the optimal solution set distribution. Finally, a competitive selection strategy based on the bidding mechanism is proposed for the Pareto optimal solution set to obtain a better scheduling scheme. The experimental results show that the proposed improved algorithm is feasible and effective in the FJSP problem considering energy consumption, and the algorithm has some application value in improving the efficiency of smart shop operation. [ABSTRACT FROM AUTHOR]

One of the common issues in production scheduling is the flow shop sequencing issue. A specific type of manufacturing process follows a predetermined linear structure in a flow shop. To solve a flow shop problem in a static workshop, the goal of this study is to determine the shortest possible total processing time (make-span) for a sequence of 'n' tasks on 'm' machines. The suggested method is based on how each work slopes as it moves from the first to the last machine. This method is contrasted with four popular heuristics (Palmer, CDS, Dannenbring, NEH). The findings of the study for 'n' x 'm' flow shop sequencing problems show that the proposed method is effective and shows a promising amount of progress when compared to the other four heuristic strategies. [ABSTRACT FROM AUTHOR]

The re-entrant flow with an unpredictable nature of arrival would apparently harm production plans and schedules in flow type of shops. The re-entrant flow with varied arrival frequencies in rotor blade manufacturing is quite complicated and results in disproportionate workloads. Hence, an attempt has been made to study the significant influence of disproportionate workloads and research on an innovative order release method to enhance performance. The manufacturing process was observed thoroughly to incorporate the uncertain events that cause disturbance in the production. A simulation model was developed on a discrete event simulation platform by analysing problem phenomena right from the conceptualization phase. The model has been verified and validated to ensure the accuracy. The model was subjected to 288 experiments representing different scenarios that a flow shop undergoes in reality. The factors considered in the experimentation were re-entrant frequency, re-entrant proportions, order release methods and priority dispatching rules. A refined load release policy for disproportionate loads has been proposed to judge its effectiveness in terms of profit computation by comparing it with other relevant policies. Results of the experiment revealed that the order release methods contribute 95.93% to throughput performance, in addition, the use of the new re-entrant method policy in the above scenario was productive in improving the overall shop performance. [ABSTRACT FROM AUTHOR]

Featured by multi-charge, multi-process integration, multi-constraint, steelmaking and continuous casting (SCC) scheduling is a complex and industrial synthesis process. Generally, it is solved by the two-stage or multistage approach. To reduce time consumption, we propose a "one-stage" optimization method that integrates the constraints into the cuckoo search algorithm (CICSA). To obtain the minimum total waiting time (TWT), we built an SCC scheduling optimization model. Firstly, we integrate machine uniqueness constraints and the process sequence into the coding of the nests. Then, non-conflict constraints and casting on time constraints are converted into the fitness values of the cuckoo search algorithm (CSA). Thus, the solutions obtained in the population after iteration meet the process constraints. The non-conflict optimal nest is taken as the optimal solution. Simulations are conducted using the actual industrial data. Comparisons among the proposed algorithm, the two-stage algorithm, and the original CSA are presented. The result shows the proposed approach achieves better performance. [ABSTRACT FROM AUTHOR]

The ability to handle unpredictable dynamic events is becoming more important in pursuing agile and flexible production scheduling. At the same time, the cyber-physical convergence in production system creates massive amounts of industrial data that needs to be mined and analysed in real-time. To facilitate such real-time control, this research proposes a hierarchical and distributed architecture to solve the dynamic flexible job shop scheduling problem. Double Deep Q-Network algorithm is used to train the scheduling agents, to capture the relationship between production information and scheduling objectives, and make real-time scheduling decisions for a flexible job shop with constant job arrivals. Specialised state and action representations are proposed to handle the variable specification of the problem in dynamic scheduling. Additionally, a surrogate reward-shaping technique to improve learning efficiency and scheduling effectiveness is developed. A simulation study is carried out to validate the performance of the proposed approach under different scenarios. Numerical results show that not only does the proposed approach deliver superior performance as compared to existing scheduling strategies, its advantages persist even if the manufacturing system configuration changes. [ABSTRACT FROM AUTHOR]

Steelmaking-Continuous Casting (SCC) is a bottleneck in the steel production process and its scheduling has become more challenging over time. In this paper, we provide an extensive literature review that highlights challenges in the SCC scheduling and compares existing solution methods. From the literature review, we collect the essential features of an SCC process, such as unrelated parallel machine environments, stage skipping, and maximum waiting time limits in between successive stages. We consider an SCC scheduling problem with as objective the minimisation of the weighted sum of cast break penalties, total waiting time, total earliness, and total tardiness. We formulate the problem as a mixed-integer linear programming model and develop an iterated greedy matheuristic that solves its subproblems to find a near-optimal solution. Through numerical experiments, we show that our algorithm outperforms two types of genetic algorithms when applied to test instances. [ABSTRACT FROM AUTHOR]

Smart manufacturing that involves tight integration of the physical system and cyber system is a hot topic in both industry and academia in the era of the Internet and big data. However, the dynamic and uncertain manufacturing environment introduces a significant adaptive issue of production scheduling, which is one of the pivotal tasks for smart manufacturing. This paper focuses on this problem and proposes a closed-loop adaptive scheduling solution based on the Cyber-Physical Production System (CPPS) with four phases: production data acquisition (PDA), dynamic disturbance identification (DDI), scheduling strategy adjustment (SSA), and schedule scheme generation (SSG). In the DDI phase, in view of the disturbance classification, a disturbance identification procedure based on CPPS monitoring is studied to ensure real-time response. In the SSA phase, an industrial big-data-driven scheduling strategy adjustment method is proposed, which consists of GA-based offline knowledge learning and KNN-based online adjustment, to enhance the system adaptability. We apply and verify the proposed adaptive scheduling solution on an experimental semiconductor manufacturing system, and the results demonstrate that the proposed method outperforms the dynamic scheduling method in terms of multiple objectives under different disturbance levels. [ABSTRACT FROM AUTHOR]

There is a lack of studies on joint optimisation of flexible job-shop scheduling problem (FJSP) considering energy consumption and production efficiency in the machining-assembly system. Thus, in this paper, we propose a methodology for multi-objective optimisation of energy-aware flexible job-shop scheduling during machining and assembly operations. First, a mixed integrated mathematical model is developed to improve production efficiency and minimise energy consumption. Then, a novel heuristic algorithm integrated particle swarm optimisation (PSO) and genetic algorithm (GA) is developed to address the established multi-objective problem. Moreover, numerical examples are carried out to verify the validity and performance of the solving methods in achieving energy awareness in the manufacturing system. Computational results are presented to demonstrate the advantage of solving the problem compared with the exact method and common heuristic algorithms, and the trade-off between production efficiency and energy efficiency is analysed to make the final decision for managers. [ABSTRACT FROM AUTHOR]