What aspects of shiftwork influence off-shift well-being of healthcare workers?

Characteristics of shiftwork schedules have implications for off-shift well-being. We examined the extent to which several shift characteristics (e.g., shift length, working sundays) are associated with three aspects of off-shift well-being: work-to-family conflict, physical well-being, and mental wellbeing. We also investigated whether these relationships differed in four nations. The Survey of Work and Time was completed by 906 healthcare professionals located in Australia, Brazil, Croatia, and the USA. Hierarchical multiple regression analyses supported the hypothesis that shiftwork characteristics account for significant unique variance in all three measures of well-being beyond that accounted for by work and family demands and personal characteristics. The patterns of regression weights indicated that particular shiftwork characteristics have differential relevance to indices of work-to-family conflict, physical well-being, and mental well-being. Our findings suggest that healthcare organizations should carefully consider the implications of shiftwork characteristics for off-shift well-being. Furthermore, although our findings did not indicate national differences in the nature of relationships between shift characteristics and well-being, shiftwork characteristics and demographics for healthcare professionals differ in systematic ways among nations; as such, effective solutions may be context-specific. (c) 2008 Elsevier Ltd. All rights reserved.

A gender approach to work ability and its relationship to professional and domestic work hours among nursing personnel

The association between working hours and work ability was examined in a cross-sectional study of male (N = 156) and female (N = 1092) nurses in three public hospitals. Working hours were considered in terms of their professional and domestic hours per week and their combined impact; total work load. Logistic regression analysis showed a significant association between total work load and inadequate work ability index (WAI) for females only. Females reported a higher proportion of inadequate WAI, fewer professional work hours but longer domestic work hours. There were no significant differences in total work load by gender. The combination of professional and domestic work hours in females seemed to best explain their lower work ability. The findings suggest that investigations into female well-being need to consider their total work load. Our male sample may have lacked sufficient power to detect a relationship between working hours and work ability. (c) 2008 Elsevier Ltd. All rights reserved.

Fatigue and workability in Brazilian textile companies in different corporate social responsibility score groups

The aim of this study was to evaluate working conditions in the textile industry for different stages of Corporate Social Responsibility (CSR) development, and workers` perception of fatigue and workability. A cross-sectional study was undertaken with 126 workers in the production areas of five Brazilian textile plants. The corporate executive officers and managers of each company provided their personal evaluations of CSR. Companies were divided into 2 groups (higher and lower) of CSR scores. Workers completed questionnaires on fatigue, workability and working conditions. Ergonomic job analysis showed similar results for working conditions, independent of their CSR score. Multivariate analysis models were developed for fatigue and workability, indicating that they are both associated to factors related to working conditions and individual workers` characteristics and life styles. Work organization, (what, how, when, where and for how long the work is done), is also an associated factor for fatigue. This study suggests that workers` opinions should be taken into greater consideration when companies develop their CSR programs, in particular for those relating to working conditions. Relevance to industry: This paper underlines the importance of considering working conditions and workers` opinions of them, work organization and individual workers` characteristics and life styles in order to restore or to maintain workability and to reduce fatigue, independently of how developed a company may be in the field of Corporate Social Responsibility. (C) 2010 Elsevier B.V. All rights reserved.

A 2-year follow-up study of work ability among college educators

The aim of this study was to evaluate work ability among college educators before and after an intervention at the workplace. An administrative restructuring in the workplace started to be implemented in 2005. The work ability index (WAI) was administered to 154 educators before the restructure in 2004 and to 60 educators following the restructure in 2006. A mest comparing the WAI score of the 60 educators who took part in both phases showed a trend of improving work ability (p = 0.06; mean WAI in 2004 was 41.7 and 43.3 in 2006). The results suggest that the intervention led to an improvement in psychosocial factors, which in turn positively influenced work ability. (c) 2008 Elsevier Ltd. All rights reserved.

Investigation of a new GRASP-based clustering algorithm applied to biological data

A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.

Infeasibility handling in genetic algorithm using nested domains for production planning

In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. All rights reserved.

Job rotation in assembly lines employing disabled workers

In this paper we consider the programming of job rotation in the assembly line worker assignment and balancing problem. The motivation for this study comes from the designing of assembly lines in sheltered work centers for the disabled, where workers have different task execution times. In this context, the well-known training aspects associated with job rotation are particularly desired. We propose a metric along with a mixed integer linear model and a heuristic decomposition method to solve this new job rotation problem. Computational results show the efficacy of the proposed heuristics. (C) 2009 Elsevier B.V. All rights reserved.

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.

A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem

Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. In this paper, a coupled mathematical model is formulated and a heuristic method based on Lagrangian relaxation is proposed. Computational results prove its effectiveness. (C) 2009 Elsevier B.V. All rights reserved.

Lot sizing and furnace scheduling in small foundries

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (I the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry`s own practice. (c) 2006 Elsevier Ltd. All rights reserved.

Electrophoretic deposition of Ba0.77Ca0.23TiO3 nanopowders

Ba0.77Ca0.23TiO3 (BCT23) nanometric powders, synthesized by the modified Pechini method, were used as precursor to produce thick films (50-130 mu m) employing the electrophoretic deposition (EPD) technique. The BCT23 powder presented a single crystalline phase with an average particle size and a crystallite size of similar to 60 nm and similar to 20 nm, respectively, when calcined at 800 degrees C/2h. BCT23 thick films were deposited on platinum substrates starting from different suspensions prepared by dispersion of the powder into: isopropyl alcohol (IPA) or a mixture of acetylacetone (Acac) and ethanol (EtOH) (1:1, volumetric ratio). A milling process was used to deagglomerate the powders in order to increase the suspension stability and improving the deposition. Dense and crack free thick films with uniform microstructure were obtained after sintering at 1300 degrees C/2 h from Acac+EtOH solution. (C) 2007 Elsevier B.V. All rights reserved.

Orthogonal packing of identical rectangles within isotropic convex regions

A mixed integer continuous nonlinear model and a solution method for the problem of orthogonally packing identical rectangles within an arbitrary convex region are introduced in the present work. The convex region is assumed to be made of an isotropic material in such a way that arbitrary rotations of the items, preserving the orthogonality constraint, are allowed. The solution method is based on a combination of branch and bound and active-set strategies for bound-constrained minimization of smooth functions. Numerical results show the reliability of the presented approach. (C) 2010 Elsevier Ltd. All rights reserved.

New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/similar to egbirgin/packing/. (C) 2009 Elsevier Ltd, All rights reserved.

Three-dimensional packings with rotations

We present approximation algorithms for the three-dimensional strip packing problem, and the three-dimensional bin packing problem. We consider orthogonal packings where 90 degrees rotations are allowed. The algorithms we show for these problems have asymptotic performance bounds 2.64, and 4.89, respectively. These algorithms are for the more general case in which the bounded dimensions of the bin given in the input are not necessarily equal (that is, we consider bins for which the length. the width and the height are not necessarily equal). Moreover, we show that these problems-in the general version-are as hard to approximate as the corresponding oriented version. (C) 2009 Elsevier Ltd. All rights reserved.

Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.