Abstract
Optimization in current decision support systems has a highly interdisciplinary nature related with the need to integrate different techniques and paradigms for solving real-world complex problems. Computing optimal solutions in many of these problems are unmanageable. Heuristic search methods are known to obtain good results in an acceptable time interval. However, parameters need to be adjusted to allow good results. In this sense, learning strategies can enhance the performance of a system, providing it with the ability to learn, for instance, the most suitable optimization technique for solving a particular class of problems, or the most suitable parameterization of a given algorithm on a given scenario. Hyper-heuristics arise in this context as efficient methodologies for selecting or generating (meta) heuristics to solve NP-hard optimization problems. This paper presents the specification of a hyper-heuristic for selecting techniques inspired in nature, for solving the problem of scheduling in manufacturing systems, based on previous experience. The proposed hyper-heuristic module uses a reinforcement learning algorithm, which enables the system with the ability to autonomously select the meta-heuristic to use in optimization process as well as the respective parameters. A computational study was carried out to evaluate the influence of the hyper-heuristics on the performance of a scheduling system. The obtained results allow to conclude about the effectiveness of the proposed approach.

Abstract
Developments in advanced autonomous production resources have increased the interest in the Single-Machine Scheduling Problem (SMSP). Until now, researchers used SMSP with little to no practical application in industry, but with the introduction of multi-purpose machines, able of executing an entire task, such as 3D Printers, replacing extensive production chains, single-machine problems are becoming a central point of interest in real-world scheduling. In this paper we study how simple, easy to implement, Just-in-Time (JIT) based, constructive heuristics, can be used to optimize customer and enterprise oriented performance measures. Customer oriented performance measures are mainly related to the accomplishment of due dates while enterprise-oriented ones typically consider other time-oriented measures.

Abstract
User modelling has become a central subject for anybody interested in understanding how users interact with technology. Personalization is a key issue in an era when there is so much information and so many people interacting in so many ways. Modern users desire a customized experience that adapts itself to their requirements and understands what they need even before they notice it. In order to morph any system into an adapting one, every relevant interaction with its users has to be maintained. Then, a mathematical structure capable of discovering patterns amongst that information is necessary, being able to classify users according to the roles they play. With a correct user categorization, the system knows when, how and what to do to adapt its content, via a mixed-initiative approach. In this paper, an artificial neural network is selected as classifier and users are divided in three roles, from beginners to experts. ADSyS, the target system of this proposal, adapts its content based on who is operating it, providing a higher usability. This guide on how to adapt a system to its users is built as part of ADSyS, but is intended to be generalized as a foundation to other systems.

Abstract
Globalization forced manufactures to enhance their production planning strategies. The use of new approaches or the reformulation of existing ones is therefore vital for remaining competitive in this global market scenario. In this context also the reinforcement of approaches for some traditional scheduling problems and performance criteria, such as for solving the unrelated parallel-machines makespan minimization problem (Rm||Cmax) continues to be of upmost importance, as for this well-known NP-hard problem exact method remain impracticable. In this paper some heuristics are used for this problem optimization, such as MOMCT (Modified Ordered Minimum Completion Time), which will determine the sequence in which tasks will be allocated, before it uses the MCT (Minimum Completion Time) to distribute them between the machines. In this paper we propose NS-MOMCT (Neighborhood Search - Modified Ordered Minimum Completion Time), which uses the MOMCT solutions as start points for repeated local searches.

Abstract
Optimization in current decision support systems has a highly interdisciplinary nature related with the need to integrate different techniques and paradigms for solving real-world complex problems. Computing optimal solutions in many of these problems are unmanageable. Heuristic search methods are known to obtain good results in an acceptable time interval. However, parameters need to be adjusted to allow good results. In this sense, learning strategies can enhance the performance of a system, providing it with the ability to learn, for instance, the most suitable optimization technique for solving a particular class of problems, or the most suitable parameterization of a given algorithm on a given scenario. Hyper-heuristics arise in this context as efficient methodologies for selecting or generating (meta) heuristics to solve NP-hard optimization problems. This paper presents the specification of a hyper-heuristic for selecting techniques inspired in nature, for solving the problem of scheduling in manufacturing systems, based on previous experience. The proposed hyper-heuristic module uses a reinforcement learning algorithm, which enables the system with the ability to autonomously select the meta-heuristic to use in optimization process as well as the respective parameters. A computational study was carried out to evaluate the influence of the hyper-heuristics on the performance of a scheduling system. The obtained results allow to conclude about the effectiveness of the proposed approach. © 2015 AISTI.

Abstract
Global competition pressures have forced manufactures to adapt their productive capabilities. In order to satisfy the ever-changing market demands many organizations adopted flexible resources capable of executing several products with different performance criteria. The unrelated parallel-machines makespan minimization problem (Rm||Cmax) is known to be NP-hard or too complex to be solved exactly. In the heuristics used for this problem, the MCT (Minimum Completion Time), which is the base for several others, allocates tasks in a random like order to the minimum completion time machine. This paper proposes an ordered approach to the MCT heuristic. MOMCT (Modified Ordered Minimum Completion Time) will order tasks in accordance to the MS index, which represents the mean difference of the completion time on each machine and the one on the minimum completion time machine. The computational study demonstrates the improved performance of MOMCT over the MCT heuristic.