Job-shop manufacturing environment requires planning of schedules for the systems of low-volume having numerous variations. For a job-shop scheduling, ‘k’ number of operations and ‘n’ number of jobs on ‘m’ number of machines processed through an assured objective function to be minimized (makespan). This paper presents a capable genetic algorithm for the job-shop scheduling problems among opera...

We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the problems under consideration can be approximated in polynomial time within arbitrarily good precision. Most of our results are derived by Max SNP hardness proofs. Among the investigated problems are: scheduling unrelated ma...

The paper deals with a problem of scheduling deteriorating jobs on a single machine to minimize the total completion time. Deterioration of a job means that its processing time is a function of its execution start time. We present some optimal properties for three problems, which correspond to three different decreasing linear functions, whose increasing counterparts have been studied in the li...

We present two versions of a grid job submission system produced for the BaBar experiment. Both use globus job submission to process data spread across various sites, producing output which can be combined for analysis. The problems encountered with authorisation and authentication, data location, job submission, and the input and output sandboxes are described, as are the solutions. The total ...

We present two versions of a grid job submission system produced for the BaBar experiment. Both use globus job submission to process data spread across various sites, producing output which can be combined for analysis. The problems encountered with authorisation and authentication, data location, job submission, and the input and output sandboxes are described, as are the solutions. The total ...

This paper reviews modern genetic algorithm based approaches for solving job shop scheduling problems Genetic algorithms represent one of the most popular and mostly used metaheuristic methods applied for solving many optimization problems within last few decades. Job shop scheduling represents one of the hardest combinatorial optimization problems where number of possible schedules drastically...

For example, in job scheduling problems, one often thinks of the jobs as arriving online (i.e., one-by-one), with a new job needing to be scheduled on some machine immediately. Or in a graph problem, perhaps the vertices of a graph show up one by one (with whatever edges are incident to previously arriving vertices). Thus the meaning of “one piece at a time” varies with the problem, but it many...

background: there is little data available on job stress dimensions and their relationship to musculoskeletal disorders (msds) among iranian nurses. the aims of this study were to investigate job stress dimensions and examine their relationship to msds among nurses of hospital affiliated to shiraz university of medical sciences (sums). methods: 385 randomly selected nurses of sums participated ...

extensive job stress and workload are main causes of frustration and reduced efficiency among workers and despite negative effects of these factors on employees' performance, related studies in rehabilitation staff are limited. the aim of this study was to evaluate job stress, workload and their related factors in rehabilitation staff. in this cross-sectional study, 150 employees in three ...