Abstract
In complexity theory, scheduling problem is considered as a NP-complete combinatorial optimization problem. Since Multi-Agent Systems manage complex, dynamic and unpredictable environments, in this work they are used to model a scheduling system subject to perturbations. Meta-heuristics proved to be very useful in the resolution of NP-complete problems. However, these techniques require extensive parameter tuning, which is a very hard and time-consuming task to perform. Based on Multi-Agent Learning concepts, this article propose a Case-based Reasoning module in order to solve the parameter-tuning problem in a Multi-Agent Scheduling System. A computational study is performed in order to evaluate the proposed CBR module performance. © 2013 Springer-Verlag Berlin Heidelberg.

Abstract
This paper proposes a novel agent-based approach to Meta-Heuristics self-configuration. Meta-heuristics are algorithms with parameters which need to be set up as efficient as possible in order to unsure its performance. A learning module for self-parameterization of Meta-heuristics (MH) in a Multi-Agent System (MAS) for resolution of scheduling problems is proposed in this work. The learning module is based on Case-based Reasoning (CBR) and two different integration approaches are proposed. A computational study is made for comparing the two CBR integration perspectives. Finally, some conclusions are reached and future work outlined. © 2013, Springer Science+Business Media Dordrecht.

Abstract
Production scheduling is an optimizing problem that can contribute strongly to the competitive capacity of companies producing goods and services. A way to promote the survival and the sustainability of the organizations in this upcoming era of Industry 4.0 (I4.0) is the efficient use of the resources. A complete failure to stage tasks properly can easily lead to a waste of time and resources, which could result in a low level of productivity and high monetary losses. In view of the above, it is essential to analyse and continuously develop new models of production scheduling. This paper intends to present an I4.0 oriented decision support tool to the dynamic scheduling. After a fist solution has been generated, the developed prototype has the ability to create new solutions as tasks leave the system and new ones arrive, in order to minimize a certain measure of performance. Using a single machine environment, the proposed prototype was validated in an in-depth computational study through several instances of dynamic problems with stochastic characteristics. Moreover, a more robust analysis was done, which demonstrated that there is statistical evidence that the proposed prototype performance is better than single method of scheduling and proved the effectiveness of the prototype.

Abstract
Complex optimization scheduling problems frequently arise in the manufacturing and transport industries, where the goal is to find a schedule that minimizes the total amount of time (or cost) required to complete all the tasks. Since it is a critical factor in many industries, it has been, historically, a target of the scientific community. Mathematically, these problems are modelled with Job Shop scheduling approaches. Benchmark results to solve them are achieved with evolutionary algorithms. However, they still present some limitations, mostly related to execution times and the difficulty to generalize to other problems. Deep Reinforcement Learning is poised to revolutionise the field of artificial intelligence. Chosen as one of the MIT breakthrough technologies, recent developments suggest that it is a technology of unlimited potential which shall play a crucial role in achieving artificial general intelligence. This paper puts forward a state-of-the-art review on Job Shop Scheduling, Evolutionary Algorithms and Deep Reinforcement Learning. It also proposes a novel architecture capable of solving Job Shop Scheduling optimization problems using Deep Reinforcement Learning. © 2020, Springer Nature Switzerland AG.

Abstract
In this paper, we present and discuss an innovative approach to solve Job Shop scheduling problems based on machine learning techniques. Traditionally, when choosing how to solve Job Shop scheduling problems, there are two main options: either use an efficient heuristic that provides a solution quickly, or use classic optimization approaches (e.g., metaheuristics) that take more time but will output better solutions, closer to their optimal value. In this work, we aim to create a novel architecture that incorporates reinforcement learning into scheduling systems in order to improve their overall performance and overcome the limitations that current approaches present. It is also intended to investigate the development of a learning environment for reinforcement learning agents to be able to solve the Job Shop scheduling problem. The reported experimental results and the conducted statistical analysis conclude about the benefits of using an intelligent agent created with reinforcement learning techniques. The main contribution of this work is proving that reinforcement learning has the potential to become the standard method whenever a solution is necessary quickly, since it solves any problem in very few seconds with high quality, approximate to the optimal methods.

Abstract