Search Results (87)

The opto-mechanical automated manufacturing process, characterized by stringent process constraints, dynamic disturbances, and conflicting optimization objectives, presents significant control challenges for traditional scheduling and control approaches. We formulate the scheduling problem within a closed-loop control paradigm and propose a novel bi-level intelligent control framework integrating Deep Reinforcement Learning (DRL) and Bayesian Optimization (BO). The core of our approach is a bi-level intelligent control framework. An inner DRL agent acts as an adaptive controller, generating control actions (scheduling decisions) by perceiving the system state and learning a near-optimal policy through a carefully designed reward function, while an outer BO loop automatically tunes the DRL’s hyperparameters and reward weights for superior performance. This synergistic BO-DRL mechanism facilitates intelligent and adaptive decision-making. The proposed method is extensively evaluated against standard meta-heuristics, including Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), on a complex 20-jobs × 20-machines flexible job shop scheduling benchmark specific to opto-mechanical automated manufacturing. The experimental results demonstrate that our BO-DRL algorithm significantly outperforms these benchmarks, achieving reductions in makespan of 13.37% and 25.51% compared to GA and PSO, respectively, alongside higher machine utilization and better on-time delivery. Furthermore, the algorithm exhibits enhanced convergence speed, superior robustness under dynamic disruptions (e.g., machine failures, urgent orders), and excellent scalability to larger problem instances. This study confirms that integrating DRL’s perceptual decision-making capability with BO’s efficient parameter optimization yields a powerful and effective solution for intelligent scheduling in high-precision manufacturing environments. Full article

Job-shop scheduling plays a pivotal role in sustainable manufacturing because scheduling decisions strongly influence energy consumption, machine utilization, and environmental performance. Traditional job-shop scheduling research has mainly optimized makespan, throughput, and tardiness; however, growing sustainability pressures and Industry 4.0 technologies have shifted attention toward energy-conscious scheduling. This review systematically analyzes 2083 publications retrieved from SCOPUS, Web of Science, and IEEE Xplore to map the evolution of energy-efficient job-shop scheduling (EEJSS) models, methods, and industrial applications. Compared with prior surveys, this work contributes a sector-specific analysis, an updated classification of energy-aware models, and the first structured mapping of EEJSS research to sustainability and Industry 4.0 capabilities. Further, challenges such as computational complexity, absence of standardized energy benchmarks, limited industrial deployment, and narrow sustainability metrics are addressed. Overall, this review consolidates the state of EEJSS and positions energy-aware scheduling as a foundational enabler of low-carbon, resilient, and intelligent manufacturing systems. Full article

In recent decades, the flexible job shop scheduling problem (FJSP) has been widely studied. In the context of green manufacturing, objectives related to energy consumption and sustainability have emerged as essential components of the contemporary production landscape. These scheduling objectives present new obstacles for workshop coordination, routing, and process planning. Among various green scheduling targets, energy consumption objectives constitute a substantial share. Therefore, this paper focuses on the dynamic flexible job shop scheduling problem (DFJSP) with an emphasis on energy consumption. First, this paper reviews the literature on DFJSP that considers energy consumption over the past decade. Second, this paper categorizes the dynamic constraints and dynamic event handling strategies in the indexed literature. Additionally, this paper examines the current methods for addressing this complex scheduling problem and compares and evaluates their advantages and disadvantages. Finally, this paper proposes new insights for future research from the perspectives of algorithms and energy-saving strategies. Full article

The Job Shop Scheduling Problem (JSP), a classical NP-hard challenge, has given rise to various complex extensions to accommodate modern manufacturing requirements. Among them, the Dynamic Flexible Job Shop Scheduling Problem (DFJSP) remains particularly challenging, due to its stochastic task arrivals, heterogeneous deadlines, and varied task types. Traditional optimization- and rule-based approaches often fail to capture these dynamics effectively. To address this gap, this study proposes a hybrid algorithm, GA-HPO PPO, tailored for the DFJSP. The method integrates genetic-algorithm–based hyperparameter optimization with proximal policy optimization to enhance learning efficiency and scheduling performance. The algorithm was trained on four datasets and evaluated on ten benchmark datasets widely adopted in DFJSP research. Comparative experiments against Double Deep Q-Network (DDQN), standard PPO, and rule-based heuristics demonstrated that GA-HPO PPO consistently achieved superior performance. Specifically, it reduced the number of overdue tasks by an average of 18.5 in 100-task scenarios and 197 in 1000-task scenarios, while maintaining a machine utilization above 67% and 28% in these respective scenarios, and limiting the makespan to within 108–114 and 506–510 time units. The model also demonstrated a 25% faster convergence rate and 30% lower variance in performance across unseen scheduling instances compared to standard PPO, confirming its robustness and generalization capability across diverse scheduling conditions. These results indicate that GA-HPO PPO provides an effective and scalable solution for the DFJSP, contributing to improved dynamic scheduling optimization in practical manufacturing environments. Full article

Cold rolling is the precision finishing stage in the steel production process, and its scheduling optimization is essential for enhancing production efficiency. To address the complex process constraints and objectives, this paper proposes a multi-granularity random mutation genetic algorithm (MGRM-GA) for cold rolling scheduling optimization. First, a multi-objective collaborative optimization model is established to integrate the production cost and process constraints. Then, high-quality initial solutions are generated based on greedy heuristic rules to fulfill the cold rolling constraints. Finally, four random mutation strategies are designed at different task granularities and unit levels to search diverse candidates. The standard flexible job shop scheduling problem (FJSP) datasets and practical cold rolling production data are studied to validate the feasibility and competitiveness of the MGRM-GA. Experimental results show that the MGRM-GA achieves a 94.2% improvement in objective function optimization, a 14.8-fold increase in throughput, and a 94.8% reduction in execution time on cold rolling data. Compared with the heuristic mutation algorithm, MGRM-GA increases population heterogeneity and avoids premature convergence, which enhances global search ability and scheduling performance. Full article

The flexible job shop scheduling problem (FJSP) becomes significantly more complex when real-world factors such as due dates, sequence-dependent setup times, and processing times are considered as multiple criteria. This study presents a hybrid scheduling approach that combines a genetic algorithm (GA) and variable neighborhood search (VNS), where several dispatching rules are used to create the initial population and improve exploration. The multiple objectives are to minimize makespan, total tardiness, and total setup time while improving overall production efficiency. To test the proposed approach, standard FJSP datasets were extended with due dates and setup times for two different environments. Due dates were generated using the Total Work Content (TWK) method. This study also introduces a dynamic scheduling framework that addresses dynamic events such as machine breakdowns and new job arrivals. A rescheduling strategy was developed to maintain optimal solutions in dynamic situations. Experimental results show that the proposed hybrid framework consistently performs better than other methods in static scheduling and maintains high performance under dynamic conditions. The proposed method achieved 6.5% and 2.59% improvement over the baseline GA in two different environments. The results confirm that the proposed strategies effectively address complex, multi-constraint scheduling problems relevant to Industry 4.0 and smart manufacturing environments. Full article

Industrial scheduling plays a central role in Industry 4.0, where efficiency, robustness, and adaptability are essential for competitiveness. This review surveys recent advances in reinforcement learning, digital twins, and hybrid artificial intelligence (AI)–operations research (OR) approaches, which are increasingly used to address the complexity of flexible job-shop and distributed scheduling problems. We focus on how these methods compare in terms of scalability, robustness under uncertainty, and integration with industrial IT systems. To move beyond an enumerative survey, the paper introduces a structured analysis in three domains: comparative strengths and limitations of different approaches, ready-made tools and integration capabilities, and representative industrial case studies. These cases, drawn from recent literature, quantify improvements such as reductions in makespan, tardiness, and cycle time variability, or increases in throughput and schedule stability. The review also discusses critical challenges, including data scarcity, computational cost, interoperability with Enterprise Resource Planning (ERP)/Manufacturing Execution System (MES) platforms, and the need for explainable and human-in-the-loop frameworks. By synthesizing methodological advances with industrial impact, the paper highlights both the potential and the limitations of current approaches and outlines key directions for future research in resilient, data-driven production scheduling. Full article

In this paper, we propose a formulation of the permutation flow and job shop scheduling problems using special recursive functions and show its equivalence to the existing classical formulation. Equivalence is understood in the sense that both ways of defining the problem describe the same set of feasible schedules for each pair of jobs and machine numbers. In this paper, the apparatus of recursive functions is used to describe and solve three problems: permutation flow shop; permutation flow shop with the addition of the ‘and’ predicate extending the machine chain to an acyclic graph; and permutation job shop. The predicate ‘and’ allows the description of the flow shop with assembly operation tasks. Recursive functions have a common domain and range. To calculate an optimal schedule for each of these three problems, a branch and bound method is considered based on a recursive function that implements a job swapping algorithm. The complexity of the optimization algorithm does not increase compared to the non-recursive description of the PFSP. This article presents some results for the calculation of optimal schedules on several test instances. It is expected that the new method, based on the description of recursive functions and their superposition, will be productive for formulating and solving some extensions of scheduling problems that have practical significance. Full article

Effective production control requires aligning strategic planning with real-time execution under dynamic and stochastic conditions. This study proposes a scalable dual-agent Deep Reinforcement Learning (DRL) framework for the joint optimisation of Work-In-Process (WIP) control and job sequencing in flow-shop environments. A strategic DQN agent regulates global WIP to meet throughput targets, while a tactical DQN agent adaptively selects dispatching rules at the machine level on an event-driven basis. Parameter sharing in the tactical agent ensures inherent scalability, overcoming the combinatorial complexity of multi-machine scheduling. The agents coordinate indirectly via a shared simulation environment, learning to balance global stability with local responsiveness. The framework is validated through a discrete-event simulation integrating agent-based modelling, demonstrating consistent performance across multiple production scales (5–15 machines) and process time variabilities. Results show that the approach matches or surpasses analytical benchmarks and outperforms static rule-based strategies, highlighting its robustness, adaptability, and potential as a foundation for future Hierarchical Reinforcement Learning applications in manufacturing. Full article

With the rapid development of Industry 5.0, smart manufacturing has become a key focus in production systems. Hence, achieving efficient planning and scheduling on the shop floor is important, especially in job shop environments, which are widely encountered in manufacturing. However, traditional job shop scheduling problems (JSP) assume fixed operation sequences, whereas in modern production, some operations exhibit sequence flexibility, referred to as sequence-free operations. To mitigate this gap, this paper studies the JSP with discrete operation sequence flexibility (JSPDS), aiming to minimize the makespan. To effectively solve the JSPDS, a mixed-integer linear programming model is formulated to solve small-scale instances, verifying multiple optimal solutions. To enhance solution quality for larger instances, a digital twin (DT)–enhanced initialization method is proposed, which captures expert knowledge from a high-fidelity virtual workshop to generate high-quality initial population. In addition, a statistical learning-assisted local search method is developed, employing six tailored search operators and Thompson sampling to adaptively select promising operators during the evolutionary algorithm (EA) process. Extensive experiments demonstrate that the proposed DT-statistical learning EA (DT-SLEA) significantly improves scheduling performance compared with state-of-the-art algorithms, highlighting the effectiveness of integrating digital twin and statistical learning techniques for shop scheduling problems. Specifically, in the Wilcoxon test, pairwise comparisons with the other algorithms show that DT-SLEA has p-values below 0.05. Meanwhile, the proposed framework provides guidance on utilizing symmetry to improve optimization in complex manufacturing systems. Full article

The flexible job shop scheduling problem (FJSP) is a fundamental challenge in modern industrial manufacturing, where efficient scheduling is critical for optimizing both resource utilization and overall productivity. Traditional heuristic algorithms have been widely used to solve the FJSP, but they are often tailored to specific scenarios and struggle to cope with the dynamic and complex nature of real-world manufacturing environments. Although deep learning approaches have been proposed recently, they typically require extensive feature engineering, lack interpretability, and fail to generalize well under unforeseen disturbances such as machine failures or order changes. To overcome these limitations, we introduce a novel hierarchical reinforcement learning (HRL) framework for FJSP, which decomposes the scheduling task into high-level strategic decisions and low-level task allocations. This hierarchical structure allows for more efficient learning and decision-making. By leveraging policy gradient methods at both levels, our approach learns adaptive scheduling policies directly from raw system states, eliminating the need for manual feature extraction. Our HRL-based method enables real-time, autonomous decision-making that adapts to changing production conditions. Experimental results show our approach achieves a cumulative reward of 199.50 for Brandimarte, 2521.17 for Dauzère, and 2781.56 for Taillard, with success rates of 25.00%, 12.30%, and 19.00%, respectively, demonstrating the robustness of our approach in real-world job shop scheduling tasks. Full article

The Distributed No-Wait Flow Shop Scheduling Problem (DNWFSP) arises in various manufacturing contexts, such as chemical production and electronic assembly, where strict no-wait constraints and multi-factory coordination are required. Solving the DNWFSP involves determining the allocation of jobs to factories and the no-wait processing sequences within each factory, making it a highly complex combinatorial problem. To address the limitations of existing methods—including poor initial solution quality, limited neighborhood exploration, and a tendency to converge prematurely—this paper proposes a Multi-Neighborhood Adaptive Tabu Search Algorithm (MNATS). The MNATS integrates a balance–lookahead NEH initializer (BL-NEH), an adaptive neighborhood local search (ANLS) strategy, and an Adaptive Tabu-Guided Perturbation (ATP) strategy. Experimental results on multiple benchmark instances demonstrate that MNATS algorithm significantly outperforms several state-of-the-art algorithms in terms of solution quality and robustness. Full article

This study developed a simple genetic algorithm (SGA) enhanced by a random forest (RF) surrogate model, namely ${SGA}_{RF}$, to solve the permutation flow-shop scheduling problem with order acceptance under the conditions of limited capacity, weighted-tardiness, and past-sequence-dependent (PSD) setup times (PFSS-OAWT with PSD). To the best of our knowledge, this is the first study to investigate this problem. Our proposed algorithm increases the setup time for each successive job by a constant proportion of the cumulative processing time of preceding jobs to capture the progressive slowdown that often occurs on real production lines. In the developed algorithm with maximum ${10}^5$ fitness evaluations, the RF surrogate model predicts objective function values and guides crossover and mutation. On the PFSS-OAWT with PSD benchmark (up to 500 orders and 20 machines, 160 instances), ${SGA}_{RF}$ represents improvements of 0.9% over SGA, 0.8% over ${SGA}_{LS}$, and 5.6% over SABPO. Although the surrogate incurs additional runtime, the gains in both profit and order-acceptance rates justify its use for high-margin, offline planning. Overall, the results of this study suggest that integrating evolutionary search into data-driven prediction is an effective strategy for solving complex capacity-constrained scheduling problems. Full article

The advent of Industry 4.0, driven by automation and real-time data analysis, offers significant opportunities to revolutionize manufacturing, with mobile robots playing a central role in boosting productivity. In smart job shops, scheduling tasks involves not only assigning work to machines but also managing robot allocation and travel times, thus extending traditional problems like the Job Shop Scheduling Problem (JSSP) and Traveling Salesman Problem (TSP). Common solution methods include heuristics, metaheuristics, and hybrid methods. However, due to the complexity of these problems, existing models often struggle to provide efficient optimal solutions. Machine learning, particularly reinforcement learning (RL), presents a promising approach by learning from environmental interactions, offering effective solutions for task scheduling. This systematic literature review analyzes 71 papers published between 2014 and 2024, critically evaluating the current state of the art of task scheduling with mobile robots. The review identifies the increasing use of machine learning techniques and hybrid approaches to address more complex scenarios, thanks to their adaptability. Despite these advancements, challenges remain, including the integration of path planning and obstacle avoidance in the task scheduling problem, which is crucial for making these solutions stable and reliable for real-world applications and scaling for larger fleets of robots. Full article

This study addresses the assembly job shop scheduling problem (AJSSP) with parallel machines. In an assembly job shop, product structures are represented through hierarchical tree diagrams, where components and subassemblies are sequentially assembled to form the final product. A mixed-integer linear programming (MILP) model is formulated to minimize the total completion time. A dominance relations-based variable neighborhood search (DR-VNS) is proposed for solving AJSSP with parallel machines. The proposed approach integrates dominance relations among operations in the initialization phase and employs tailored neighborhood structures to address sequencing and assignment challenges, thereby enhancing the generation of neighboring solutions. Experimental studies conducted on test cases of varying scales and complexities demonstrate the effectiveness of the proposed algorithms in solving the AJSSP with parallel machines. Full article