Modelling and Validation of a Mass Imbalance Oscillation Generator to Harvest Heart Motion Energy

An autonomous energy source within a human body is of key importance in the development of medical implants. This work deals with the modelling and the validation of an energy harvesting device which converts the myocardial contractions into electrical energy. The mechanism consists of a clockwork from a commercially available wrist watch. We developed a physical model which is able to predict the total amount of energy generated when applying an external excitation. For the validation of the model, a custom-made hexapod robot was used to accelerate the harvesting device along a given trajectory. We applied forward kinematics to determine the actual motion experienced by the harvesting device. The motion provides translational as well as rotational motion information for accurate simulations in three-dimensional space. The physical model could be successfully validated.

Resource-Constrained Project Scheduling with Project Management Information Systems

Most commercial project management software packages include planning methods to devise schedules for resource-constrained projects. As it is proprietary information of the software vendors which planning methods are implemented, the question arises how the software packages differ in quality with respect to their resource-allocation capabilities. We experimentally evaluate the resource-allocation capabilities of eight recent software packages by using 1,560 instances with 30, 60, and 120 activities of the well-known PSPLIB library. In some of the analyzed packages, the user may influence the resource allocation by means of multi-level priority rules, whereas in other packages, only few options can be chosen. We study the impact of various complexity parameters and priority rules on the project duration obtained by the software packages. The results indicate that the resource-allocation capabilities of these packages differ significantly. In general, the relative gap between the packages gets larger with increasing resource scarcity and with increasing number of activities. Moreover, the selection of the priority rule has a considerable impact on the project duration. Surprisingly, when selecting a priority rule in the packages where it is possible, both the mean and the variance of the project duration are in general worse than for the packages which do not offer the selection of a priority rule.

The Resource-Constrained Project Scheduling Problem with Work-Content Constraints

For executing the activities of a project, one or several resources are required, which are in general scarce. Many resource-allocation methods assume that the usage of these resources by an activity is constant during execution; in practice, however, the project manager may vary resource usage by individual activities over time within prescribed bounds. This variation gives rise to the project scheduling problem which consists in allocating the scarce resources to the project activities over time such that the project duration is minimized, the total number of resource units allocated equals the prescribed work content of each activity, and precedence and various work-content-related constraints are met.

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.

An MILP-based heuristic for staff scheduling problems with acceptance levels

We present a real-world staff-assignment problem that was reported to us by a provider of an online workforce scheduling software. The problem consists of assigning employees to work shifts subject to a large variety of requirements related to work laws, work shift compatibility, workload balancing, and personal preferences of employees. A target value is given for each requirement, and all possible deviations from these values are associated with acceptance levels. The objective is to minimize the total number of deviations in ascending order of the acceptance levels. We present an exact lexicographic goal programming MILP formulation and an MILP-based heuristic. The heuristic consists of two phases: in the first phase a feasible schedule is built and in the second phase parts of the schedule are iteratively re-optimized by applying an exact MILP model. A major advantage of such MILP-based approaches is the flexibility to account for additional constraints or modified planning objectives, which is important as the requirements may vary depending on the company or planning period. The applicability of the heuristic is demonstrated for a test set derived from real-world data. Our computational results indicate that the heuristic is able to devise optimal solutions to non-trivial problem instances, and outperforms the exact lexicographic goal programming formulation on medium- and large-sized problem instances.

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.

The Horseshoe Crab Conundrum; can we Harvest and Conserve?

Dr. Jennifer Mattei and Dr. Mark Beekey lead efforts to monitor and conserve horseshoe crabs by means of Project Limulus. The effort enlists volunteers to help document the movements and mating practices of horseshoe crabs.

Influence of Crop Load on Tree Growth, Yield, and Fruit Quality of Scab Resistant Apples at Harvest

Apple scab, caused by Venturia inaequalis, is a major disease affecting apple production. Breeding programs have developed over 30 releases of scab-resistant cultivars since 1970 with recent ones having much improved quality. Redfree and GoldRush are from a cooperative breeding program involving Purdue, Rutgers, and Illinois universities while Liberty was introduced from the Cornell University breeding program. For these cultivars to gain better acceptance, more information is needed on their cropping capacities and the effect of crop load on fruit quality attributes. Our study was conducted to determine the relationship between increasing crop load on tree growth, fruit size, and fruit quality variables of the three cultivars under Iowa conditions.

Producción de maíz bajo diferentes regímenes de riego complementario en Río Cuarto, Córdoba, Argentina. II. Producción de materia seca

El objetivo de este trabajo fue evaluar el efecto del riego complementario sobre el rendimiento de materia seca del cultivo de maíz. Se usó un diseño completamente al azar con 5 tratamientos y 4 repeticiones. Para efectuar la programación de los diferentes tratamientos de riego se dividió el ciclo del cultivo en tres etapas (precrítico, crítico y poscrítico). Para la determinación del momento de riego se realizó un balance hídrico con datos climáticos obtenidos de la Estación Meteorológica ubicada en el lugar del ensayo. El riego se efectuó con un equipo presurizado de avance lateral. El maíz cumplió su ciclo en 138 días en todos los tratamientos y requirió 1660,6 grados día para alcanzar madurez fisiológica. El rendimiento de materia seca tuvo diferencias significativas (a = 0,05) entre los distintos tratamientos regados y entre éstos y el testigo. Los valores extremos de producción fueron de 34.628 kg.ha-1 en el tratamiento 1 y 20.414 kg.ha-1 en el tratamiento sin riego. La cantidad de agua aplicada varió entre 360 y 300 mm y el agua total consumida en el ciclo del cultivo, según el balance hídrico, fue para los tratamientos con riego de 575 mm ± 15 mm y para el testigo sin riego de 308 mm. La eficiencia de uso de agua para materia seca tuvo diferencias significativas (a = 0,05) entre los tratamientos regados (5,7 kg.m-3) y no regados (6,6 kg.m-3). El índice de cosecha fue de 0,49.