A heuristic approach for scheduling assessment centers

Human resources managers often use assessment centers to evaluate candidates for a job position. During an assessment center, the candidates perform a series of exercises. The exercises require one or two assessors (e.g., managers or psychologists) that observe and evaluate the candidate. If an exercise is designed as a role-play, an actor is required as well which plays, e.g., an unhappy customer with whom the candidate has to deal with. Besides performing the exercises, the candidates have a lunch break within a prescribed time window. Each candidate should be observed by approximately half the number of the assessors. Moreover, an assessor cannot be assigned to a candidate if they personally know each other. The planning problem consists of determining (1) resource-feasible start times of all exercises and lunch breaks and (2) a feasible assignment of assessors to candidates, such that the assessment center duration is minimized. We propose a list-scheduling heuristic that generates feasible schedules for such assessment centers. We develop novel procedures for devising an appropriate scheduling list and for incorporating the problem-specific constraints. Our computational results indicate that our approach is capable of devising optimal or near-optimal solutions to real-world instances within short CPU time.

Food advertisements during children's television programming in 2007: Comparison with ads in 1994 and the 2005 dietary recommendations

Childhood overweight and obesity are two major public health problems that are of economic and medical concern in the world today (Lobstein, Baur, & Uauy, 2004). Overweight conditions in childhood are important because they are widely prevalent, serious, and carry lifetime consequences for health and well being (Lobstein et al., 2004). Several studies have shown an association between television viewing and obesity in all age groups (Caroli, Argentieri, Cardone, & Masi, 2004; Harper, 2006; Vandewater & Huang, 2006; Wiecha et al., 2006). One mechanism that potentially links television viewing to childhood obesity is food advertising (Story, 2003). ^ The purpose of this study was to examine the types of foods advertised on children's television programming and to determine if there have been any changes in the number and types of commercials over the last 13 years. In addition, the food content of the advertisements was compared to the 2005 Dietary Guidelines to determine if the foods targeted were consistent with the current recommendations. Finally, each television network was analyzed individually to determine any differences between advertising on cable and regular programming. ^ A descriptive analysis was conducted on the most commonly advertised commercials during children's television programming on Saturday morning from 7 a.m. to 10:30 a.m. A total of 10 major television networks were viewed on three different Saturday mornings during June and July 2007. Commercial advertising accounted for approximately 19% of children's total viewing time. Of the 3,185 commercials, 28.5% were for foods, 67.7% were for non-food items, and 3.8% were PSAs. On average, there were 30 commercial advertisements and PSAs per hour, of which approximately nine were for food. ^ Of the 907 food advertisements, 72.0% were for foods classified in the fats, oils, and sugar group. The next largest group (17.3%) was for restaurant food of which 15.3% were for unhealthy/fast food restaurant fare. The most frequently advertised food product on Saturday morning television was regular cereal, accounting for 43.9% of all food advertisements. ^ Cable and regular programming stations varied slightly in the amount, length, and category of commercials. Cable television had about 50% less commercials and PSAs (1098) than regular programming (2087), but only had approximately 150 minutes less total commercial and PSA time; therefore, cable, in general, had longer commercials than regular programming. Overall, cable programming had more advertisements encouraging increased physical activity and positive nutrition behavior with less commercials focusing on the fats, oils, and sugar groups, compared to regular programming. ^ During the last 13 years, food advertisements have not improved, despite the recent IOM report on marketing foods to children (Institute of Medicine-Committee on Food Marketing and the Diets of Children and Youth, 2005), although the frequency of food advertisements has improved slightly. Children are now viewing an average of one food advertisement every 7 minutes, compared to one food advertisement every 5 minutes in 1994 (Kotz & Story, 1994). Therefore, manufacturers are putting a greater emphasis on advertising other products to children. Despite the recent attention to the issue of marketing unhealthy foods to children through television advertisements, not much progress has been noted since 1994. Further advocacy and regulatory issues concerning the content of advertisements during Saturday morning TV need to be explored. ^

Parents' impressions of inappropriate television content for Hispanic preschool children

Rates of childhood obesity have increased three-fold in the last 20 years, and experts estimate that well over half of adolescents with a Body Mass Index at or above the 95th percentile become obese adults. These trends are even more pronounced in ethnic minority and lower income populations that are disproportionately impacted by obesity and its complications. It would be appropriate, then, to focus obesity interventions on Hispanic children. Television viewing, especially, has been shown to contribute to obesity by increasing caloric intake and decreasing physical activity. Parent involvement has proven to be a critical component in changing children’s health behaviors. In order to explore parents’ motivations for limiting their children’s television viewing, I qualitatively analyzed data from twenty-five interviews with Houston area Head Start parents. Using Grounded Theory, four main categories of concern emerged from the audio-recorded conversations: developmentally inappropriate content, the influence of television, poor health behaviors/outcomes, and general disapproval with television. Developmentally inappropriate content was the most frequently mentioned category with 119 mentions. This included violence, the most common sub-theme. In all, parents were more concerned with television content that produced proximate consequences such as modeling violent behavior or inappropriate language. Content that encouraged behaviors that led to obesity or other delayed consequences were of less concern to the parents. This suggests that future interventions aimed at encouraging Hispanic parents to reduce their children’s television viewing should draw motivation from parents’ concerns about developmentally inappropriate content, rather than focusing on deleterious health outcomes such as obesity. ^

If we call them, will they change? Feasibility of a telephone adaptation of motivational interviewing aimed at parents to reduce television time among 2nd and 4th grade children

Television viewing is a sedentary behavior that is modifiable. Reducing media-related behaviors via parent-focused interventions may hold promise for decreasing childhood obesity. This feasibility study examines a novel parent-centered brief telephone-delivered Motivational Enhancement Interview (MEI) to encourage parents of 2nd and 4th graders to set a rules limiting TV time or remove the TV from the child's bedroom. This quasi-experimental sub-study was part of the larger CATCH: En Vivo pilot study conducted in a Hispanic population in the Texas Rio Grande Valley. Parents in the MEI condition were contacted via telephone and encouraged to meet the American Academy of Pediatrics (AAP) recommended 2 hours per day or less of TV. Unconditional logistic regression was used to analyze the data. At post-test, 85% of parents of 4th graders in the MEI group (compared to 71% at pre-test) reported having a rule limiting TV time. The adjusted odds ratio for the MEI group compared to the control group was 3.88, 95% CI (0.72-20.99). At pre-test, 63.16% of 2nd graders had a television in their bedrooms. The 2nd grade MEI intervention reduced that number to 41.03% (OR=0.25, 95%CI (0.08-0.82)). This first look at using MEI to target parents of children to modify TV behavior presents evidence on a promising strategy for modifying children's home media environment and warrants further investigation. ^

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

Energy and power aware scheduling algorithm modeling for battery powered embedded systems

Energy management has always been recognized as a challenge in mobile systems, especially in modern OS-based mobile systems where multi-functioning are widely supported. Nowadays, it is common for a mobile system user to run multiple applications simultaneously while having a target battery lifetime in mind for a specific application. Traditional OS-level power management (PM) policies make their best effort to save energy under performance constraint, but fail to guarantee a target lifetime, leaving the painful trading off between the total performance of applications and the target lifetime to the user itself. This thesis provides a new way to deal with the problem. It is advocated that a strong energy-aware PM scheme should first guarantee a user-specified battery lifetime to a target application by restricting the average power of those less important applications, and in addition to that, maximize the total performance of applications without harming the lifetime guarantee. As a support, energy, instead of CPU or transmission bandwidth, should be globally managed as the first-class resource by the OS. As the first-stage work of a complete PM scheme, this thesis presents the energy-based fair queuing scheduling, a novel class of energy-aware scheduling algorithms which, in combination with a mechanism of battery discharge rate restricting, systematically manage energy as the first-class resource with the objective of guaranteeing a user-specified battery lifetime for a target application in OS-based mobile systems. Energy-based fair queuing is a cross-application of the traditional fair queuing in the energy management domain. It assigns a power share to each task, and manages energy by proportionally serving energy to tasks according to their assigned power shares. The proportional energy use establishes proportional share of the system power among tasks, which guarantees a minimum power for each task and thus, avoids energy starvation on any task. Energy-based fair queuing treats all tasks equally as one type and supports periodical time-sensitive tasks by allocating each of them a share of system power that is adequate to meet the highest energy demand in all periods. However, an overly conservative power share is usually required to guarantee the meeting of all time constraints. To provide more effective and flexible support for various types of time-sensitive tasks in general purpose operating systems, an extra real-time friendly mechanism is introduced to combine priority-based scheduling into the energy-based fair queuing. Since a method is available to control the maximum time one time-sensitive task can run with priority, the power control and time-constraint meeting can be flexibly traded off. A SystemC-based test-bench is designed to assess the algorithms. Simulation results show the success of the energy-based fair queuing in achieving proportional energy use, time-constraint meeting, and a proper trading off between them. La gestión de energía en los sistema móviles está considerada hoy en día como un reto fundamental, notándose, especialmente, en aquellos terminales que utilizando un sistema operativo implementan múltiples funciones. Es común en los sistemas móviles actuales ejecutar simultaneamente diferentes aplicaciones y tener, para una de ellas, un objetivo de tiempo de uso de la batería. Tradicionalmente, las políticas de gestión de consumo de potencia de los sistemas operativos hacen lo que está en sus manos para ahorrar energía y satisfacer sus requisitos de prestaciones, pero no son capaces de proporcionar un objetivo de tiempo de utilización del sistema, dejando al usuario la difícil tarea de buscar un compromiso entre prestaciones y tiempo de utilización del sistema. Esta tesis, como contribución, proporciona una nueva manera de afrontar el problema. En ella se establece que un esquema de gestión de consumo de energía debería, en primer lugar, garantizar, para una aplicación dada, un tiempo mínimo de utilización de la batería que estuviera especificado por el usuario, restringiendo la potencia media consumida por las aplicaciones que se puedan considerar menos importantes y, en segundo lugar, maximizar las prestaciones globales sin comprometer la garantía de utilización de la batería. Como soporte de lo anterior, la energía, en lugar del tiempo de CPU o el ancho de banda, debería gestionarse globalmente por el sistema operativo como recurso de primera clase. Como primera fase en el desarrollo completo de un esquema de gestión de consumo, esta tesis presenta un algoritmo de planificación de encolado equitativo (fair queueing) basado en el consumo de energía, es decir, una nueva clase de algoritmos de planificación que, en combinación con mecanismos que restrinjan la tasa de descarga de una batería, gestionen de forma sistemática la energía como recurso de primera clase, con el objetivo de garantizar, para una aplicación dada, un tiempo de uso de la batería, definido por el usuario, en sistemas móviles empotrados. El encolado equitativo de energía es una extensión al dominio de la energía del encolado equitativo tradicional. Esta clase de algoritmos asigna una reserva de potencia a cada tarea y gestiona la energía sirviéndola de manera proporcional a su reserva. Este uso proporcional de la energía garantiza que cada tarea reciba una porción de potencia y evita que haya tareas que se vean privadas de recibir energía por otras con un comportamiento más ambicioso. Esta clase de algoritmos trata a todas las tareas por igual y puede planificar tareas periódicas en tiempo real asignando a cada una de ellas una reserva de potencia que es adecuada para proporcionar la mayor de las cantidades de energía demandadas por período. Sin embargo, es posible demostrar que sólo se consigue cumplir con los requisitos impuestos por todos los plazos temporales con reservas de potencia extremadamente conservadoras. En esta tesis, para proporcionar un soporte más flexible y eficiente para diferentes tipos de tareas de tiempo real junto con el resto de tareas, se combina un mecanismo de planificación basado en prioridades con el encolado equitativo basado en energía. En esta clase de algoritmos, gracias al método introducido, que controla el tiempo que se ejecuta con prioridad una tarea de tiempo real, se puede establecer un compromiso entre el cumplimiento de los requisitos de tiempo real y el consumo de potencia. Para evaluar los algoritmos, se ha diseñado en SystemC un banco de pruebas. Los resultados muestran que el algoritmo de encolado equitativo basado en el consumo de energía consigue el balance entre el uso proporcional a la energía reservada y el cumplimiento de los requisitos de tiempo real.

Automatic optimization of dynamic scheduling in logic programs

Abstract is not available.

Flexible scheduling for non-deterministic, and-parallel execution of logic programs

Abstract is not available.

Semantic scheduling of virtualized infrastructures for scientific workflows

Virtualized Infrastructures are a promising way for providing flexible and dynamic computing solutions for resourceconsuming tasks. Scientific Workflows are one of these kind of tasks, as they need a large amount of computational resources during certain periods of time. To provide the best infrastructure configuration for a workflow it is necessary to explore as many providers as possible taking into account different criteria like Quality of Service, pricing, response time, network latency, etc. Moreover, each one of these new resources must be tuned to provide the tools and dependencies required by each of the steps of the workflow. Working with different infrastructure providers, either public or private using their own concepts and terms, and with a set of heterogeneous applications requires a framework for integrating all the information about these elements. This work proposes semantic technologies for describing and integrating all the information about the different components of the overall system and a set of policies created by the user. Based on this information a scheduling process will be performed to generate an infrastructure configuration defining the set of virtual machines that must be run and the tools that must be deployed on them.