Dynamique motivationnelle de l'epuisement et du bien-etre chez des enseignants africains.

This study examines the links between antecedents and consequences of Gabonese teachers' (N= 152) work motivation. The theoretical underpinnings are based on the Motivational Model of Job Burnout (MMJB) which is grounded in Self-Determination Theory (SDT) and states that the more supervisors satisfy an employee's need for self-determination, competence, and relatedness, the more self-determined is the latter's work motivation. The level of self-determined motivation has an impact on job satisfaction, which in turn determines life satisfaction. Higher levels of self-determined motivation also buffer emotional exhaustion and psychological distress. The model was confirmed via structural equation modeling and provides support for the validity and generalizability of the MMJB and SDT. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants

This paper proposes a mathematical model, valid inequalities and polyhedral results for the minimum labeling Hamiltonian cycle problem. This problem is defined on an unweighted graph in which each edge has a label. The aim is to determine a Hamiltonian cycle with the least number of labels. We also define two variants of this problem by assigning weights to the edges and by considering the tour length either as an objective or as a constraint. A branch-and-cut algorithm for the three problems is developed, and computational results are reported on randomly generated instances and on modified instances from TSPLIB.     

Scheduling and Lot Streaming in Flowshops with No-Wait in Process

Lot streaming involves splitting a production lot into a number of sublots, in order to allow the overlapping of successive operations, in multi-machine manufacturing systems. In no-wait flowshop scheduling, sublots are necessarily consistent, that is, they remain the same over all machines. The benefits of lot streaming include reductions in lead times and work-in-process, and increases in machine utilization rates. We study the problem of minimizing the makespan in no-wait flowshops producing multiple products with attached setup times, using lot streaming. Our study of the single product problem resolves an open question from the lot streaming literature. The intractable multiple product problem requires finding the optimal number of sublots, sublot sizes, and a product sequence for each machine. We develop a dynamic programming algorithm to generate all the nondominated schedule profiles for each product that are required to formulate the flowshop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and computationally test an efficient heuristic for this problem. Our results indicate that solutions can quickly be found for flowshops with up to 10 machines and 50 products. Moreover, the solutions found by our heuristic provide a substantial improvement over previously published results.     

Exact algorithms for the job sequencing and tool switching problem

The job Sequencing and tool Switching Problem (SSP) involves optimally sequencing jobs and assigning tools to a capacitated magazine in order to minimize the number of tool switches. This article analyzes two integer linear programming formulations for the SSP. A branch-and-cut algorithm and a branch-and-bound algorithm are proposed and compared. Computational results indicate that instances involving up to 25 jobs can be solved optimally using the branch-and-bound approach.     

The work–family interface and turnover intentions over the course of project-oriented assignments abroad

The work–family interface is a highly relevant, yet underexposed issue in project management. When projects require family-separation, work demands are likely to conflict with family life and the consequences may be neither beneficial for (project) organizations nor for families. The aim of this study was twofold: a) to assess within-person changes over time in employees' work–family conflict experiences, relationship satisfaction, and turnover intentions and b) to examine the interrelations between these variables, over the course of a project that requires family-separation. Quantitative data were collected among military personnel before and after their four to six months assignments abroad. The results revealed that relationship satisfaction among military personnel had decreased significantly and turnover intentions had increased significantly over time. Moreover, employees who experienced higher levels of work–family conflict reported lower levels of relationship satisfaction and higher levels of turnover intentions. Understanding the interrelations may help managing projects in a way that benefits project organizations as well as employees and their families, who are critical to its performance and success.     

Glial Modulation of Energy Balance: The Dorsal Vagal Complex Is No Exception

The avoidance of being overweight or obese is a daily challenge for a growing number of people. The growing proportion of people suffering from a nutritional imbalance in many parts of the world exemplifies this challenge and emphasizes the need for a better understanding of the mechanisms that regulate nutritional balance. Until recently, research on the central regulation of food intake primarily focused on neuronal signaling, with little attention paid to the role of glial cells. Over the last few decades, our understanding of glial cells has changed dramatically. These cells are increasingly regarded as important neuronal partners, contributing not just to cerebral homeostasis, but also to cerebral signaling. Our understanding of the central regulation of energy balance is part of this (r)evolution. Evidence is accumulating that glial cells play a dynamic role in the modulation of energy balance. In the present review, we summarize recent data indicating that the multifaceted glial compartment of the brainstem dorsal vagal complex (DVC) should be considered in research aimed at identifying feeding-related processes operating at this level.     

Glycation of the Major Milk Allergen β‐Lactoglobulin Changes Its Allergenicity by Alterations in Cellular Uptake and Degradation

1 Scope

During food processing, the Maillard reaction (МR) may occur, resulting in the formation of glycated proteins. Glycated proteins are of particular importance in food allergies because glycation may influence interactions with the immune system. This study compared native and extensively glycated milk allergen β‐lactoglobulin (BLG), in their interactions with cells crucially involved in allergy.

2 Methods and results

BLG was glycated in MR and characterized. Native and glycated BLG were tested in experiments of epithelial transport, uptake and degradation by DCs, T‐cell cytokine responses, and basophil cell degranulation using ELISA and flow cytometry. Glycation of BLG induced partial unfolding and reduced its intestinal epithelial transfer over a Caco‐2 monolayer. Uptake of glycated BLG by bone marrow–derived dendritic cells (BMDC) was increased, although both BLG forms entered BMDC via the same mechanism, receptor‐mediated endocytosis. Once inside the BMDC, glycated BLG was degraded faster, which might have led to observed lower cytokine production in BMDC/CD4⁺ T‐cells coculture. Finally, glycated BLG was less efficient in induction of degranulation of BLG‐specific IgE sensitized basophil cells.

3 Conclusions

This study suggests that glycation of BLG by MR significantly alters its fate in processes involved in immunogenicity and allergenicity, pointing out the importance of food processing in food allergy.     

The capacity and distance constrained plant location problem

This article introduces a new problem called the Capacity and Distance Constrained Plant Location Problem. It is an extension of the discrete capacitated plant location problem, where the customers assigned to each plant have to be packed in groups that will be served by one vehicle each. The constraints include two types of capacity. On the one hand plants are capacitated, and the demands of the customers are indivisible. On the other hand, the total distance traveled by each vehicle to serve its assigned customers in round trips plant–customer–plant is also limited. The paper addresses different modeling aspects of the problem. It describes a tabu search algorithm for its solution. Extensive computational tests indicate that the proposed heuristic consistently yields optimal or near-optimal solutions.