The maximum tardiness reflects the worst level of service associated with customer needs; thus, the principle that seru production reduces the maximum tardiness is investigated, and a model to minimize the maximum tardiness of the seru production system is established. In order to obtain the exact solution, the non-linear seru production model with minimizing the maximum tardiness is split into a seru formation model and a linear seru scheduling model. We propose an efficient cooperative algorithm using a genetic algorithm and an innovative reinforcement learning algorithm (CAGARL) for large-scale problems. Specifically, the GA is designed for the seru formation problem. Moreover, the QL-seru algorithm (QLSA) is designed for the seru scheduling problem by combining the features of meta-heuristics and reinforcement learning. In the QLSA, we design an innovative QL-seru table and two state trimming rules to save computational time. After extensive experiments, compared with the previous algorithm, CAGARL improved by an average of 56.6%. Finally, several managerial insights on reducing maximum tardiness are proposed.

Experience plays a vital role in the decision-making (DM) process. In this paper simulation, modeling, and analysis of past experience over DM has been done using the Iowa gambling task (IGT). The Human DM process is very complex and difficult to model through computational methods because it is a subjective type of process and varies person-to-person. Therefore, this study is an attempt to simulate a DM model similar to the human DM process. For this collection of real data was done and was provided as input to the developed eight Reinforcement Learning (RL) models. The result shows that the performance of the model based on Prospect Utility (PU) learned with Decay Reinforcement Rule (DRI) and Trial Dependency Choice (TDC) is better as compared to other models. It is observed from the analysis of data and also validated that simulation and models output that the experienced group performs better than inexperienced.

Dynamic Flexible Job Shop Scheduling (DFJSS) is a critical challenge in smart manufacturing due to dynamic job arrivals, machine breakdowns, routing flexibility, and multi-objective performance requirements. Conventional dispatching rules and metaheuristic algorithms often fail to provide adaptive real-time decisions. This paper proposes a Greedy Actor Neural Critic PPO based Reinforcement Learning (GANC-PPO-RL) framework to minimize makespan and total energy consumption. The problem is formulated as a Markov Decision Process, where machine availability, job progress, queue status, processing times, and energy levels define states, and job–machine assignments define actions. A multi-objective reward penalizes higher makespan and energy usage. The PPO algorithm ensures stable policy updates using a clipped objective. Results show makespan within ±2% of benchmarks for small instances and about 23% reduction for larger cases, with 16–20% lower makespan and 15–25% lower energy consumption compared to RL-QL.

The rapid advancement of artificial intelligence (AI) has revolutionized project portfolio management (PPM), as it has in many other areas, by introducing data-driven methods that improve decision-making, risk assessment, and strategic alignment. Unlike traditional project management, which emphasizes individual project execution, PPM requires balancing multiple initiatives to optimize value creation and resource allocation. This paper presents a systematic review of scientific research on the integration of AI techniques into PPM, focusing on their applications, benefits, and challenges. The review synthesizes findings from 73 peer-reviewed studies covering a wide range of AI methodologies, such as machine learning, deep learning, neural networks, reinforcement learning, natural language processing, and hybrid optimization models. These approaches have been applied in diverse fields, including information technology, construction, healthcare, defense, energy, and telecommunications. Analysis shows that AI significantly improves project portfolio performance by predicting project outcomes, identifying interdependencies, optimizing resource allocation, and supporting adaptive strategies in dynamic environments. In addition, advanced AI tools provide project portfolio managers with predictive and prescriptive analytics, transforming PPM from reactive monitoring to proactive governance. Despite these advances, challenges remain regarding data quality, organizational readiness, and interpretability of AI-based models. Concerns about transparency, ethical implications, and integration with existing management frameworks also hinder wider adoption. However, recent developments indicate a growing trend toward hybrid systems that combine AI with traditional decision-making models, increasing both accuracy and practical applicability. This review contributes to theory and practice by synthesizing current knowledge, highlighting research gaps, and identifying emerging directions such as the use of large language models, ensemble methods, and sustainability-focused project portfolio optimization. The findings highlight the transformative potential of AI in advancing PPM and provide valuable insights for researchers and practitioners seeking to design smarter, more adaptive, and more sustainable project portfolio management strategies.

Autonomous ground robots are increasingly relied upon in dynamic environments where reliable navigation and context-aware interaction are essential. However, existing robotic control systems often rely on cloud-based reinforcement learning (RL) frameworks or static algorithms that fail to adapt in real-time to noisy, unpredictable scenarios. These models typically overlook the constraints of edge deployment and lack robust integration with human interaction modalities such as voice and semantic object awareness. To address these limitations, this work proposes a fully embedded, IoT-enabled ground robot powered by a reinforcement learning-based adaptive control framework. The system leverages Raspberry Pi 4B+ as its core computational unit, integrating MQTT-driven communication, multimodal interaction through speech and vision, and lightweight policy convergence for obstacle-aware navigation. A novel RL-based state-action pipeline is trained and deployed entirely on-device, ensuring real-time responsiveness without external computation. Experimental evaluations show that the proposed framework reduces navigation errors by 22% and improves interaction latency by 37% over traditional PID and A*-based systems. The RL model converges in under 2200 episodes, with stable reward curves and high reliability across variable acoustic and physical terrains. This study showcases how low-cost, edge-based robots can achieve high autonomy and situational awareness contributing to future advancements in resilient, self-adaptive robotic systems within smart and resource-constrained environments.

The effectiveness and efficiency of a machine learning model can be improved by feature selection, especially for high-dimensional datasets such as in cybersecurity. The proposed approach utilizes an enhanced version of the Rainbow agent with a memory storage structure. The suggested approach is assessed using two benchmark datasets namely RT-IoT2022 which is targeted towards IoT network security and the Android Malware Detection dataset which is meant for mobile security. The specification of the reinforcement learning model has been trained for 20 epochs and it is progressively enhanced through feature subsets to enhance classification accuracy. The results show that the AUC scores continuously increase were the one for RT-IoT2022 achieves 0.91 and Android at 0.93. Three well-known classifiers XGBoost, Random Forest and multi-layer perceptron (MLP) are used to test the power of the selected features. The outcome evaluation on RT-IoT2022 dataset shows that Random Forest achieved maximum accuracy (99.48%), followed by XGBoost (99.16%), while MLP secured 94.04% accuracy. In the Android malware dataset, XGBoost model gave the best accuracy of 89.50%, followed closely by Random Forest with 87.00% and MLP with 86.50%. This clearly shows that reinforcement learning based feature selection enhances accuracy and reduces computation. The research emphasizes utilizing dynamic feature selection in any cyber security application. The future will experiment with incorporating deep reinforcement learning as well as hybrid selection.

This study proposes Q-learning-based iterated greedy (IGQ) algorithms to solve the blocking flowshop scheduling problem with the makespan criterion. Q learning is a model-free machine intelligence technique, which is adapted into the traditional iterated greedy (IG) algorithm to determine its parameters, mainly, the destruction size and temperature scale factor, adaptively during the search process. Besides IGQ algorithms, two different mathematical modeling techniques. One of these techniques is the constraint programming (CP) model, which is known to work well with scheduling problems. The other technique is the mixed integer linear programming (MILP) model, which provides the mathematical definition of the problem. The introduction of these mathematical models supports the validation of IGQ algorithms and provides a comparison between different exact solution methodologies. To measure and compare the performance of IGQ algorithms and mathematical models, extensive computational experiments have been performed on both small and large VRF benchmarks available in the literature. Computational results and statistical analyses indicate that IGQ algorithms generate substantially better results when compared to non-learning IG algorithms.