Health literacy, a more complex concept than knowledge, is a required capacity to obtain, understand, integrate and act on health information [1], in order to enhance individual and community health, which is defined by different levels, according to the autonomy and personal capacitation in decision making [2]. Medium levels of Health literacy in an adolescent population were found in a study conducted in 2013/2014, being higher in sexual and reproductive health and lower in substance use. It was also noticed that the higher levels of health literacy were in the area adolescents refer to have receipt more health information. The health literacy competence with higher scores was communication skills, and the lower scores were in the capacity to analyze factors that influence health. Higher levels were also found in younger teenagers, but in a higher school level, confirming the importance of health education in these age and development stage. Adolescents seek more information in health professionals and parents, being friends more valued as a source information in older adolescents, which enhance the importance of peer education mainly in older adolescents [3]. As a set of competences based on knowledge, health literacy should be developed through education interventions, encompassing the cultural and social context of individuals, since the society, culture and education system where the individual is inserted can define the way the development and enforcement of the health literacy competences [4]. The valued sources of information should be taken into account, as well as needs of information in some topics referred by adolescents in an efficient health education. Schizophrenia is a serious and chronic mental illness which has a profound effect on the health and well-being related with the well-known nature of psychotic symptoms. The exercise has the potential to improve the life of people with schizophrenia improving physical health and alleviating psychiatric symptoms. However, most people with schizophrenia remains sedentary and lack of access to exercise programs are barriers to achieve health benefits. The aim of this study is to evaluate the effect of exercise on I) the type of intervention in mental health, II) in salivary levels of alpha-amylase and cortisol and serum levels of S100B and BDNF, and on III) the quality of life and selfperception of the physical domain of people with schizophrenia. The sample consisted of 31 females in long-term institutions in the Casa de Saúde Rainha Santa Isabel, with age between 25 and 63, and with diagnosis of schizophrenia according to the Diagnostic and Statistical Manual of Mental Disorders (DSM-IV-TR). Physical fitness was assessed by the six-minute walk distance test (6MWD). Biological variables were determined by ELISA (Enzyme-Linked Immunosorbent Assay). Psychological variables were assessed using SF-36, PSPP-SCV, RSES and SWLS tests. Walking exercise has a positive impact on physical fitness (6MWD -p = 0.001) and physical components of the psychological test...

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We propose a genetic approach based on a random key alphabet. Several genetic algorithms based on this approach are presented. These versions differ on the generation of the initial population, as well as on the use of local search. The proposed procedures are compared with existing heuristics, as well as with optimal solutions for the smaller instance sizes. The computational results show that the performance of the proposed genetic approach is improved by the addition of a local search procedure, as well as by the insertion of simple heuristic solutions in the initial population. Indeed, the genetic versions that include either or both of these features not only provide significantly better results, but are also much faster. The genetic versions that use local search are clearly superior to the existing heuristics, and the improvement in performance over the best existing procedure increases with both the size and difficulty of the instances. These genetic procedures are also quite close to the optimum, and provided an optimal solution for most of the test instances. Scope and purposeThis paper considers a single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. Scheduling with early and tardy penalties has received considerable attention from the scheduling community, due to its practical importance. Indeed, early/tardy scheduling problems are compatible with the concepts of Just-in-Time production and supply chain management, which have been adopted by many organizations. Single machine scheduling environments actually occur in several practical applications. Also, the performance of many production systems is often determined by the schedules for a single bottleneck machine. Furthermore, the study of single machine problems frequently provides results that prove useful for more complex scheduling environments. The assumption that no machine idle time is allowed is also appropriate for many production settings. In fact, idle time should be avoided when the machine has limited capacity or high operating costs, and when starting a new production run involves high set-up costs or times. In this paper, we present several algorithms based on a genetic approach that uses a random key alphabet. The various versions of the genetic algorithm differ on the generation of the initial population, as well as on the use of local search. These procedures are compared with existing heuristics, as well as with optimal solutions for some instance sizes. The computational results show that inserting solutions generated by simple heuristics in the initial population, and using a local search procedure, enhances the performance of the proposed genetic approach. In fact, the addition of one or both of these features improves both the solution quality and the speed of the genetic algorithm. The genetic versions that apply local search c...

In this paper, we present a hybrid genetic algorithm for a version of the early/tardy scheduling problem in which no unforced idle time may be inserted in a sequence. The chromosome representation of the problem is based on random keys. The genetic algorithm is used to establish the order in which the jobs are initially scheduled, and a local search procedure is subsequently applied to detect possible improvements. The approach is tested on a set of randomly generated problems and compared with existing efficient heuristic procedures based on dispatch rules and local search. The computational results show that this new approach, although requiring slightly longer computational times, is better than the previous algorithms in terms of solution quality.

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present two new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules. Both dispatch rules use a lookahead parameter that had previously been set at a fixed value. We develop functions that map some instance statistics into appropriate values for that parameter. We also consider the use of dominance rules to improve the solutions obtained by the heuristics. The computational results show that the function-based versions of the heuristics outperform their fixed value counterparts and that the use of the dominance rules can indeed improve solution quality with little additional computational effort.Keywords: scheduling, early/tardy, heuristics, dispatch rules, dominance rules ResumoNeste artigo é considerado um problema de sequenciamento com uma única máquina e custos de posse e atraso no qual não é permitida a existência de tempo morto. São apresentadas duas novas heurísticas, uma dispatch rule e um procedimento greedy, e é também considerada a melhor dispatch rule existente. Ambas as dispatch rules utilizam um parâmetro de pesquisa ao qual tem sido atribuído, em trabalhos anteriores, um valor fixo. Neste artigo são desenvolvidas funções que convertem certas estatísticas das instân-cias num valor apropriado para esse parâmetro. A utilização de regras de dominância para 1 aperfeiçoar as soluções obtidas pelas heurísticas é igualmente considerada. Os resultados computacionais mostram que as funções propostas permitem a obtenção de melhores resultados e que a utilização das regras de dominância permite melhorar a qualidade da solução sem aumentos relevantes nos tempos de computação.Palavras-chave: sequenciamento, custos de posse e atraso, heurísticas, regras de dominância

Peer Observation of Teaching has raised a lot of interest as a device for quality enhancement of teaching. While much research has focused on its models, implementation schemes and feedback to the observed, little attention has been paid to what the observer actually sees and can learn from the observation. A multidisciplinary peer observation of teaching program is described, and its data is used to identify the pedagogical aspects to which lecturers pay more attention to when observing classes. The discussion addresses the valuable learning opportunities for observers provided by this program, as well as its usefulness in disseminating, sharing and clarifying quality teaching practices. The need for further research concerning teacher-student relationships and students' engagement is also suggested.