An exploratory descriptive study design was used to investigate job satisfaction and burnout among Palestinian nurses. A random sample of 152 nurses was recruited from private hospitals. The instruments included a demographic questionnaire, the Minnesota satisfaction questionnaire and the Maslach burnout inventory. Respondents reported moderate levels of job satisfaction and moderate burnout. P...

The Distributed and Flexible Job-shop Scheduling problem (DFJS) considers the scheduling of distributed manufacturing environments, where jobs are processed by a system of several Flexible Manufacturing Units (FMUs). Distributed scheduling problems deal with the assignment of jobs to FMUs and with determining the scheduling of each FMU, in terms of assignment of each job operation to one of the...

In this paper, we analyze the characteristics of the dynamic job shop scheduling problem when machine breakdown and new job arrivals occur. A hybrid approach involving neural networks(NNs) and geneticalgorithm(GA) is presented to solve the dynamic job shop scheduling problem as a static scheduling problem. The objective of this kind of job shop scheduling problem is minimizing the completion ti...

This paper describes the radiotherapy patient scheduling problem of minimising waiting times. Like many other service industry problems, radiotherapy patient scheduling may be solved by first modelling and formulating it into a shop scheduling problem. Over the years, these shop scheduling models have been researched and solved using various approaches. This paper typifies radiotherapy patient ...

Job shop scheduling problem is one of the most important problems in the combinatorial optimization problems and it is applied to various fields about engineering. Many works have been reported for this problem using Genetic Algorithm (GA). The GA is one of the most powerful optimization methods based on the mechanics of natural evolution. In this paper, we propose a new algorithm for the job s...

Job shop scheduling problems with stochastic processing and sequence-dependent setup times and dynamic arrival of job types are real world and most complex among various scheduling problems. This paper extends the previous work of Sharma and Jain (2015) by assessing the performance of proposed four setups oriented dispatching rules with respect to bench mark dispatching rule taken from literatu...

This paper proposes a new and efficient hybrid heuristic scheme for solving job-shop scheduling problems (JSP). A new and efficient population initialization and local search concept, based on genetic algorithms, is introduced to search the solution space and to determine the global minimum solution to the JSP problem. Simulated results imply that the proposed novel JSP method (called the PLGA ...

In this study we investigated the mediated influence of core self-evaluations (CSE) on employee health problems via job satisfaction and work stress, and the degree to which genetic factors explain these mediated relationships. Based on data obtained from a sample of 594 Swedish twins (114 monozygotic twin pairs and 183 dizygotic twin pairs), conventional path analysis results supported the med...

The aim of this study was to determine the prevalence of sick building syndrome (SBS) and other factors contributing to probable mental health problems among university laboratory staffs. A cross-sectional study was conducted among 264 laboratory staffs in UPM. Data was collected using validated self-administrated questionnaires consists of Job Content Questionnaire (JCQ), General Health Questi...

We consider several single machine scheduling problems in which the processing time of a job is a simple linear increasing function of its starting time and each job has a delivery time. The objectives are to minimize the functions about delivery completion times. For the former three problems, we propose polynomial-time algorithms to solve them. For the last problem, we prove that it is NP-har...