From Complex to Stochastic Potential: Heavy Quarkonia in the Quark-Gluon Plasma

The in-medium physics of heavy quarkonium is an ideal proving ground for our ability to connect knowledge about the fundamental laws of physics to phenomenological predictions. One possible route to take is to attempt a description of heavy quark bound states at finite temperature through a Schrödinger equation with an instantaneous potential. Here we review recent progress in devising a comprehensive approach to define such a potential from first principles QCD and extract its, in general complex, values from non-perturbative lattice QCD simulations. Based on the theory of open quantum systems we will show how to interpret the role of the imaginary part in terms of spatial decoherence by introducing the concept of a stochastic potential. Shortcomings as well as possible paths for improvement are discussed.

Livelihood and Community Development: LforS learning and simulation game

Up to 15 people can participate in the game, which is supervised by a moderator. Households consisting of 1-5 people discuss options for diversification of household strategies. Aim of the game: By devising appropriate strategies, households seek to stand up to various types of events while improving their economic and social situation and, at the same time, taking account of ecological conditions. The annual General Community Meeting (GCM) provides an opportunity for households to create a general set-up at the local level that is more or less favourable to the strategies they are pursuing. The development of a community investment strategy, to be implemented by the GCM, and successful coordination between households will allow players to optimise their investments at the household level. The household who owns the most assets at the end of the game wins. Players participate very actively, as the game stimulates lively and interesting discussions. They find themselves confronted with different types of decision-making related to the reality of their daily lives. They explore different ways to model their own household strategies and discuss risks and opportunities. Reflections on the course of the game continually refer to the real-life situations of the participants.

On an Application of Microsoft Excel’s Evolutionary Solver to the Resource-Constrained Project Scheduling Problem RCPSP

The Solver Add-in of Microsoft Excel is widely used in courses on Operations Research and in industrial applications. Since the 2010 version of Microsoft Excel, the Solver Add-in comprises a so-called evolutionary solver. We analyze how this metaheuristic can be applied to the resource-constrained project scheduling problem (RCPSP). We present an implementation of a schedule-generation scheme in a spreadsheet, which combined with the evolutionary solver can be used for devising good feasible schedules. Our computational results indicate that using this approach, non-trivial instances of the RCPSP can be (approximately) solved to optimality.

Efficient list-generation techniques for scheduling assessment centers

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

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.