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
In the areas of machine-learning/big data, feature selection is normally regarded as a very important problem to be solved, as it directly impacts both data analysis and model creation. The problem of optimizing the selected features of a given dataset is not always trivial, however, throughout the years various ways to counter this optimization problem have been presented. This work presents how feature-selection fits in the larger context of multi-objective problems as well as a review of how both multi-objective evolutionary algorithms and metaheuristics are being used in order to solve feature selection problems.

Abstract
Despite being one of the most cost-effective methods, email marketing remains challenging due to the low rate of opened emails and the high percentage of unsubscribed campaigns. Since the sender and the subject line are the only information that the recipient sees at first when receiving an email, the decision to open an email critically depends on these two factors, which should stand out and catch the recipient's attention. Therefore, the motivation behind this study is to support email campaign editors in choosing a subject line based on its potential quality. We propose and compare several models to measure the quality of a subject line, considering its potential to promote the email opening. The subject lines' structure and content are explored together with different machine learning techniques (Random Forest, Decision Trees, Neural Networks, Naive Bayes, Support Vector Machines, and Gradient Boosting). To validate the proposed model, a data set of 140,000 emails' subject lines was used. The results revealed that the models proposed are very promising to support the definition of the email marketing subject lines and show that the combination of data regarding the structure, the content of the subject lines, and senders characteristics leads to more accurate classifications of the potential of the subject line.

Abstract
Current technological and market challenges increase the need for development of intelligent systems to support decision making, allowing managers to concentrate on high-level tasks while improving decision response and effectiveness. A Racing based learning module is proposed to increase the effectiveness and efficiency of a Multi-Agent System used to model the decision-making process on scheduling problems. A computational study is put forward showing that the proposed Racing learning module is an important enhancement to the developed Multi-Agent Scheduling System since it can provide more effective and efficient recommendations in most cases.

Abstract
Real world optimization problems like Scheduling are generally complex, large scaled, and constrained in nature. Thereby, classical operational research methods are often inadequate to efficiently solve them. Metaheuristics (MH) are used to obtain near-optimal solutions in an efficient way, but have different numerical and/or categorical parameters which make the tuning process a very time-consuming and tedious task. Learning methods can be used to aid with the parameter tuning process. Racing techniques have been used to evaluate, in a refined and efficient way, a set of candidates and discard those that appear to be less promising during the evaluation process. Case-based Reasoning (CBR) aims to solve new problems by using information about solutions to previous similar problems. A novel Racing+CBR approach is proposed and brings together the better of the two techniques. A computational study for the resolution of the scheduling problem is presented, concluding about the effectiveness of the proposed approach.