Multicore job scheduling in the Worldwide LHC Computing Grid

NASA Astrophysics Data System (ADS)

Forti, A.; Pérez-Calero Yzquierdo, A.; Hartmann, T.; Alef, M.; Lahiff, A.; Templon, J.; Dal Pra, S.; Gila, M.; Skipsey, S.; Acosta-Silva, C.; Filipcic, A.; Walker, R.; Walker, C. J.; Traynor, D.; Gadrat, S.

2015-12-01

After the successful first run of the LHC, data taking is scheduled to restart in Summer 2015 with experimental conditions leading to increased data volumes and event complexity. In order to process the data generated in such scenario and exploit the multicore architectures of current CPUs, the LHC experiments have developed parallelized software for data reconstruction and simulation. However, a good fraction of their computing effort is still expected to be executed as single-core tasks. Therefore, jobs with diverse resources requirements will be distributed across the Worldwide LHC Computing Grid (WLCG), making workload scheduling a complex problem in itself. In response to this challenge, the WLCG Multicore Deployment Task Force has been created in order to coordinate the joint effort from experiments and WLCG sites. The main objective is to ensure the convergence of approaches from the different LHC Virtual Organizations (VOs) to make the best use of the shared resources in order to satisfy their new computing needs, minimizing any inefficiency originated from the scheduling mechanisms, and without imposing unnecessary complexities in the way sites manage their resources. This paper describes the activities and progress of the Task Force related to the aforementioned topics, including experiences from key sites on how to best use different batch system technologies, the evolution of workload submission tools by the experiments and the knowledge gained from scale tests of the different proposed job submission strategies.

A Novel Particle Swarm Optimization Approach for Grid Job Scheduling

NASA Astrophysics Data System (ADS)

Izakian, Hesam; Tork Ladani, Behrouz; Zamanifar, Kamran; Abraham, Ajith

This paper represents a Particle Swarm Optimization (PSO) algorithm, for grid job scheduling. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. In this paper we used a PSO approach for grid job scheduling. The scheduler aims at minimizing makespan and flowtime simultaneously. Experimental studies show that the proposed novel approach is more efficient than the PSO approach reported in the literature.

An improved ant colony optimization algorithm with fault tolerance for job scheduling in grid computing systems

PubMed Central

Idris, Hajara; Junaidu, Sahalu B.; Adewumi, Aderemi O.

2017-01-01

The Grid scheduler, schedules user jobs on the best available resource in terms of resource characteristics by optimizing job execution time. Resource failure in Grid is no longer an exception but a regular occurring event as resources are increasingly being used by the scientific community to solve computationally intensive problems which typically run for days or even months. It is therefore absolutely essential that these long-running applications are able to tolerate failures and avoid re-computations from scratch after resource failure has occurred, to satisfy the user’s Quality of Service (QoS) requirement. Job Scheduling with Fault Tolerance in Grid Computing using Ant Colony Optimization is proposed to ensure that jobs are executed successfully even when resource failure has occurred. The technique employed in this paper, is the use of resource failure rate, as well as checkpoint-based roll back recovery strategy. Check-pointing aims at reducing the amount of work that is lost upon failure of the system by immediately saving the state of the system. A comparison of the proposed approach with an existing Ant Colony Optimization (ACO) algorithm is discussed. The experimental results of the implemented Fault Tolerance scheduling algorithm show that there is an improvement in the user’s QoS requirement over the existing ACO algorithm, which has no fault tolerance integrated in it. The performance evaluation of the two algorithms was measured in terms of the three main scheduling performance metrics: makespan, throughput and average turnaround time. PMID:28545075

Active Solution Space and Search on Job-shop Scheduling Problem

NASA Astrophysics Data System (ADS)

Watanabe, Masato; Ida, Kenichi; Gen, Mitsuo

In this paper we propose a new searching method of Genetic Algorithm for Job-shop scheduling problem (JSP). The coding method that represent job number in order to decide a priority to arrange a job to Gannt Chart (called the ordinal representation with a priority) in JSP, an active schedule is created by using left shift. We define an active solution at first. It is solution which can create an active schedule without using left shift, and set of its defined an active solution space. Next, we propose an algorithm named Genetic Algorithm with active solution space search (GA-asol) which can create an active solution while solution is evaluated, in order to search the active solution space effectively. We applied it for some benchmark problems to compare with other method. The experimental results show good performance.

Filling the Holes: Work Schedulers as Job Crafters of Employment Practice in Long-Term Health Care

PubMed Central

Kossek, Ellen Ernst; Piszczek, Matthew M.; Mcalpine, Kristie L.; Hammer, Leslie B.; Burke, Lisa

2016-01-01

Although work schedulers serve an organizational role influencing decisions about balancing conflicting stakeholder interests over schedules and staffing, scheduling has primarily been described as an objective activity or individual job characteristic. The authors use the lens of job crafting to examine how schedulers in 26 health care facilities enact their roles as they “fill holes” to schedule workers. Qualitative analysis of interview data suggests that schedulers expand their formal scope and influence to meet their interpretations of how to manage stakeholders (employers, workers, and patients). The authors analyze variations in the extent of job crafting (cognitive, physical, relational) to broaden role repertoires. They find evidence that some schedulers engage in rule-bound interpretation to avoid role expansion. They also identify four types of schedulers: enforcers, patient-focused schedulers, employee-focused schedulers, and balancers. The article adds to the job-crafting literature by showing that job crafting is conducted not only to create meaningful work but also to manage conflicting demands and to mediate among the competing labor interests of workers, clients, and employers. PMID:27721517

Due-Window Assignment Scheduling with Variable Job Processing Times

PubMed Central

Wu, Yu-Bin

2015-01-01

We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time. PMID:25918745

Work schedule manager gap analysis : assessing the future training needs of work schedule managers using a strategic job analysis approach.

DOT National Transportation Integrated Search

2010-05-01

This report documents the results of a strategic job analysis that examined the job tasks and knowledge, skills, abilities, and other characteristics (KSAOs) needed to perform the job of a work schedule manager. The strategic job analysis compared in...

Work schedule manager gap analysis : assessing the future training needs of work schedule managers using a strategic job analysis approach

DOT National Transportation Integrated Search

2010-05-01

This report documents the results of a strategic job analysis that examined the job tasks and knowledge, skills, abilities, and other characteristics (KSAOs) needed to perform the job of a work schedule manager. The strategic job analysis compared in...

The comparison of predictive scheduling algorithms for different sizes of job shop scheduling problems

NASA Astrophysics Data System (ADS)

Paprocka, I.; Kempa, W. M.; Grabowik, C.; Kalinowski, K.; Krenczyk, D.

2016-08-01

In the paper a survey of predictive and reactive scheduling methods is done in order to evaluate how the ability of prediction of reliability characteristics influences over robustness criteria. The most important reliability characteristics are: Mean Time to Failure, Mean Time of Repair. Survey analysis is done for a job shop scheduling problem. The paper answers the question: what method generates robust schedules in the case of a bottleneck failure occurrence before, at the beginning of planned maintenance actions or after planned maintenance actions? Efficiency of predictive schedules is evaluated using criteria: makespan, total tardiness, flow time, idle time. Efficiency of reactive schedules is evaluated using: solution robustness criterion and quality robustness criterion. This paper is the continuation of the research conducted in the paper [1], where the survey of predictive and reactive scheduling methods is done only for small size scheduling problems.

Scheduling real-time, periodic jobs using imprecise results

NASA Technical Reports Server (NTRS)

Liu, Jane W. S.; Lin, Kwei-Jay; Natarajan, Swaminathan

1987-01-01

A process is called a monotone process if the accuracy of its intermediate results is non-decreasing as more time is spent to obtain the result. The result produced by a monotone process upon its normal termination is the desired result; the error in this result is zero. External events such as timeouts or crashes may cause the process to terminate prematurely. If the intermediate result produced by the process upon its premature termination is saved and made available, the application may still find the result unusable and, hence, acceptable; such a result is said to be an imprecise one. The error in an imprecise result is nonzero. The problem of scheduling periodic jobs to meet deadlines on a system that provides the necessary programming language primitives and run-time support for processes to return imprecise results is discussed. This problem differs from the traditional scheduling problems since the scheduler may choose to terminate a task before it is completed, causing it to produce an acceptable but imprecise result. Consequently, the amounts of processor time assigned to tasks in a valid schedule can be less than the amounts of time required to complete the tasks. A meaningful formulation of this problem taking into account the quality of the overall result is discussed. Three algorithms for scheduling jobs for which the effects of errors in results produced in different periods are not cumulative are described, and their relative merits are evaluated.

Estimating job runtime for CMS analysis jobs

NASA Astrophysics Data System (ADS)

Sfiligoi, I.

2014-06-01

The basic premise of pilot systems is to create an overlay scheduling system on top of leased resources. And by definition, leases have a limited lifetime, so any job that is scheduled on such resources must finish before the lease is over, or it will be killed and all the computation is wasted. In order to effectively schedule jobs to resources, the pilot system thus requires the expected runtime of the users' jobs. Past studies have shown that relying on user provided estimates is not a valid strategy, so the system should try to make an estimate by itself. This paper provides a study of the historical data obtained from the Compact Muon Solenoid (CMS) experiment's Analysis Operations submission system. Clear patterns are observed, suggesting that making prediction of an expected job lifetime range is achievable with high confidence level in this environment.

Job Shop Scheduling Focusing on Role of Buffer

NASA Astrophysics Data System (ADS)

Hino, Rei; Kusumi, Tetsuya; Yoo, Jae-Kyu; Shimizu, Yoshiaki

A scheduling problem is formulated in order to consistently manage each manufacturing resource, including machine tools, assembly robots, AGV, storehouses, material shelves, and so on. The manufacturing resources are classified into three types: producer, location, and mover. This paper focuses especially on the role of the buffer, and the differences among these types are analyzed. A unified scheduling formulation is derived from the analytical results based on the resource’s roles. Scheduling procedures based on dispatching rules are also proposed in order to numerically evaluate job shop-type production having finite buffer capacity. The influences of the capacity of bottle-necked production devices and the buffer on productivity are discussed.

NAS Requirements Checklist for Job Queuing/Scheduling Software

NASA Technical Reports Server (NTRS)

Jones, James Patton

1996-01-01

The increasing reliability of parallel systems and clusters of computers has resulted in these systems becoming more attractive for true production workloads. Today, the primary obstacle to production use of clusters of computers is the lack of a functional and robust Job Management System for parallel applications. This document provides a checklist of NAS requirements for job queuing and scheduling in order to make most efficient use of parallel systems and clusters for parallel applications. Future requirements are also identified to assist software vendors with design planning.

Generation of Look-Up Tables for Dynamic Job Shop Scheduling Decision Support Tool

NASA Astrophysics Data System (ADS)

Oktaviandri, Muchamad; Hassan, Adnan; Mohd Shaharoun, Awaluddin

2016-02-01

Majority of existing scheduling techniques are based on static demand and deterministic processing time, while most job shop scheduling problem are concerned with dynamic demand and stochastic processing time. As a consequence, the solutions obtained from the traditional scheduling technique are ineffective wherever changes occur to the system. Therefore, this research intends to develop a decision support tool (DST) based on promising artificial intelligent that is able to accommodate the dynamics that regularly occur in job shop scheduling problem. The DST was designed through three phases, i.e. (i) the look-up table generation, (ii) inverse model development and (iii) integration of DST components. This paper reports the generation of look-up tables for various scenarios as a part in development of the DST. A discrete event simulation model was used to compare the performance among SPT, EDD, FCFS, S/OPN and Slack rules; the best performances measures (mean flow time, mean tardiness and mean lateness) and the job order requirement (inter-arrival time, due dates tightness and setup time ratio) which were compiled into look-up tables. The well-known 6/6/J/Cmax Problem from Muth and Thompson (1963) was used as a case study. In the future, the performance measure of various scheduling scenarios and the job order requirement will be mapped using ANN inverse model.

Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter

PubMed Central

Loganathan, Shyamala; Mukherjee, Saswati

2015-01-01

Cloud computing is an on-demand computing model, which uses virtualization technology to provide cloud resources to users in the form of virtual machines through internet. Being an adaptable technology, cloud computing is an excellent alternative for organizations for forming their own private cloud. Since the resources are limited in these private clouds maximizing the utilization of resources and giving the guaranteed service for the user are the ultimate goal. For that, efficient scheduling is needed. This research reports on an efficient data structure for resource management and resource scheduling technique in a private cloud environment and discusses a cloud model. The proposed scheduling algorithm considers the types of jobs and the resource availability in its scheduling decision. Finally, we conducted simulations using CloudSim and compared our algorithm with other existing methods, like V-MCT and priority scheduling algorithms. PMID:26473166

Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter.

PubMed

Loganathan, Shyamala; Mukherjee, Saswati

2015-01-01

Cloud computing is an on-demand computing model, which uses virtualization technology to provide cloud resources to users in the form of virtual machines through internet. Being an adaptable technology, cloud computing is an excellent alternative for organizations for forming their own private cloud. Since the resources are limited in these private clouds maximizing the utilization of resources and giving the guaranteed service for the user are the ultimate goal. For that, efficient scheduling is needed. This research reports on an efficient data structure for resource management and resource scheduling technique in a private cloud environment and discusses a cloud model. The proposed scheduling algorithm considers the types of jobs and the resource availability in its scheduling decision. Finally, we conducted simulations using CloudSim and compared our algorithm with other existing methods, like V-MCT and priority scheduling algorithms.

An Extended Deterministic Dendritic Cell Algorithm for Dynamic Job Shop Scheduling

NASA Astrophysics Data System (ADS)

Qiu, X. N.; Lau, H. Y. K.

The problem of job shop scheduling in a dynamic environment where random perturbation exists in the system is studied. In this paper, an extended deterministic Dendritic Cell Algorithm (dDCA) is proposed to solve such a dynamic Job Shop Scheduling Problem (JSSP) where unexpected events occurred randomly. This algorithm is designed based on dDCA and makes improvements by considering all types of signals and the magnitude of the output values. To evaluate this algorithm, ten benchmark problems are chosen and different kinds of disturbances are injected randomly. The results show that the algorithm performs competitively as it is capable of triggering the rescheduling process optimally with much less run time for deciding the rescheduling action. As such, the proposed algorithm is able to minimize the rescheduling times under the defined objective and to keep the scheduling process stable and efficient.

Data location-aware job scheduling in the grid. Application to the GridWay metascheduler

NASA Astrophysics Data System (ADS)

Delgado Peris, Antonio; Hernandez, Jose; Huedo, Eduardo; Llorente, Ignacio M.

2010-04-01

Grid infrastructures constitute nowadays the core of the computing facilities of the biggest LHC experiments. These experiments produce and manage petabytes of data per year and run thousands of computing jobs every day to process that data. It is the duty of metaschedulers to allocate the tasks to the most appropriate resources at the proper time. Our work reviews the policies that have been proposed for the scheduling of grid jobs in the context of very data-intensive applications. We indicate some of the practical problems that such models will face and describe what we consider essential characteristics of an optimum scheduling system: aim to minimise not only job turnaround time but also data replication, flexibility to support different virtual organisation requirements and capability to coordinate the tasks of data placement and job allocation while keeping their execution decoupled. These ideas have guided the development of an enhanced prototype for GridWay, a general purpose metascheduler, part of the Globus Toolkit and member of the EGEE's RESPECT program. Current GridWay's scheduling algorithm is unaware of data location. Our prototype makes it possible for job requests to set data needs not only as absolute requirements but also as functions for resource ranking. As our tests show, this makes it more flexible than currently used resource brokers to implement different data-aware scheduling algorithms.

A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan

NASA Astrophysics Data System (ADS)

Rameshkumar, K.; Rajendran, C.

2018-02-01

In this work, a discrete version of PSO algorithm is proposed to minimize the makespan of a job-shop. A novel schedule builder has been utilized to generate active schedules. The discrete PSO is tested using well known benchmark problems available in the literature. The solution produced by the proposed algorithms is compared with best known solution published in the literature and also compared with hybrid particle swarm algorithm and variable neighborhood search PSO algorithm. The solution construction methodology adopted in this study is found to be effective in producing good quality solutions for the various benchmark job-shop scheduling problems.

A modify ant colony optimization for the grid jobs scheduling problem with QoS requirements

NASA Astrophysics Data System (ADS)

Pu, Xun; Lu, XianLiang

2011-10-01

Job scheduling with customers' quality of service (QoS) requirement is challenging in grid environment. In this paper, we present a modify Ant colony optimization (MACO) for the Job scheduling problem in grid. Instead of using the conventional construction approach to construct feasible schedules, the proposed algorithm employs a decomposition method to satisfy the customer's deadline and cost requirements. Besides, a new mechanism of service instances state updating is embedded to improve the convergence of MACO. Experiments demonstrate the effectiveness of the proposed algorithm.

Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm

NASA Astrophysics Data System (ADS)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

The efforts of finding optimal schedules for the job shop scheduling problems are highly important for many real-world industrial applications. In this paper, a multi-objective based job shop scheduling problem by simultaneously minimizing makespan and tardiness is taken into account. The problem is considered to be more complex due to the multiple business criteria that must be satisfied. To solve the problem more efficiently and to obtain a set of non-dominated solutions, a meta-heuristic based non-dominated sorting genetic algorithm is presented. In addition, task based representation is used for solution encoding, and tournament selection that is based on rank and crowding distance is applied for offspring selection. Swapping and insertion mutations are employed to increase diversity of population and to perform intensive search. To evaluate the modified non-dominated sorting genetic algorithm, a set of modified benchmarking job shop problems obtained from the OR-Library is used, and the results are considered based on the number of non-dominated solutions and quality of schedules obtained by the algorithm.

A neural network approach to job-shop scheduling.

PubMed

Zhou, D N; Cherkassky, V; Baldwin, T R; Olson, D E

1991-01-01

A novel analog computational network is presented for solving NP-complete constraint satisfaction problems, i.e. job-shop scheduling. In contrast to most neural approaches to combinatorial optimization based on quadratic energy cost function, the authors propose to use linear cost functions. As a result, the network complexity (number of neurons and the number of resistive interconnections) grows only linearly with problem size, and large-scale implementations become possible. The proposed approach is related to the linear programming network described by D.W. Tank and J.J. Hopfield (1985), which also uses a linear cost function for a simple optimization problem. It is shown how to map a difficult constraint-satisfaction problem onto a simple neural net in which the number of neural processors equals the number of subjobs (operations) and the number of interconnections grows linearly with the total number of operations. Simulations show that the authors' approach produces better solutions than existing neural approaches to job-shop scheduling, i.e. the traveling salesman problem-type Hopfield approach and integer linear programming approach of J.P.S. Foo and Y. Takefuji (1988), in terms of the quality of the solution and the network complexity.

Better approximation guarantees for job-shop scheduling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goldberg, L.A.; Paterson, M.; Srinivasan, A.

1997-06-01

Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein & Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work, and present further improvements for some important NP-hard special cases of this problem (e.g., in the preemptive case where machines can suspend work on operations and later resume). We also present NC algorithms with improved approximation guarantees for some NP-hard special cases.

Evaluation of Job Queuing/Scheduling Software: Phase I Report

NASA Technical Reports Server (NTRS)

Jones, James Patton

1996-01-01

The recent proliferation of high performance work stations and the increased reliability of parallel systems have illustrated the need for robust job management systems to support parallel applications. To address this issue, the national Aerodynamic Simulation (NAS) supercomputer facility compiled a requirements checklist for job queuing/scheduling software. Next, NAS began an evaluation of the leading job management system (JMS) software packages against the checklist. This report describes the three-phase evaluation process, and presents the results of Phase 1: Capabilities versus Requirements. We show that JMS support for running parallel applications on clusters of workstations and parallel systems is still insufficient, even in the leading JMS's. However, by ranking each JMS evaluated against the requirements, we provide data that will be useful to other sites in selecting a JMS.

Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs

NASA Astrophysics Data System (ADS)

Wang, Ji-Bo; Wang, Ming-Zheng; Ji, Ping

2012-05-01

In this article, we consider a single machine scheduling problem with a time-dependent learning effect and deteriorating jobs. By the effects of time-dependent learning and deterioration, we mean that the job processing time is defined by a function of its starting time and total normal processing time of jobs in front of it in the sequence. The objective is to determine an optimal schedule so as to minimize the total completion time. This problem remains open for the case of -1 < a < 0, where a denotes the learning index; we show that an optimal schedule of the problem is V-shaped with respect to job normal processing times. Three heuristic algorithms utilising the V-shaped property are proposed, and computational experiments show that the last heuristic algorithm performs effectively and efficiently in obtaining near-optimal solutions.

Dedicated heterogeneous node scheduling including backfill scheduling

DOEpatents

Wood, Robert R [Livermore, CA; Eckert, Philip D [Livermore, CA; Hommes, Gregg [Pleasanton, CA

2006-07-25

A method and system for job backfill scheduling dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes are grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule (FNS) is created so that the number of to chart the free nodes over time. For each prioritized job, using the FNS of sub-pools having nodes useable by a particular job, to determine the earliest time range (ETR) capable of running the job. Once determined for a particular job, scheduling the job to run in that ETR. If the ETR determined for a lower priority job (LPJ) has a start time earlier than a higher priority job (HPJ), then the LPJ is scheduled in that ETR if it would not disturb the anticipated start times of any HPJ previously scheduled for a future time. Thus, efficient utilization and throughput of such computing environments may be increased by utilizing resources otherwise remaining idle.

Fatigue Risk Management: The Impact of Anesthesiology Residents' Work Schedules on Job Performance and a Review of Potential Countermeasures.

PubMed

Wong, Lily R; Flynn-Evans, Erin; Ruskin, Keith J

2018-04-01

Long duty periods and overnight call shifts impair physicians' performance on measures of vigilance, psychomotor functioning, alertness, and mood. Anesthesiology residents typically work between 64 and 70 hours per week and are often required to work 24 hours or overnight shifts, sometimes taking call every third night. Mitigating the effects of sleep loss, circadian misalignment, and sleep inertia requires an understanding of the relationship among work schedules, fatigue, and job performance. This article reviews the current Accreditation Council for Graduate Medical Education guidelines for resident duty hours, examines how anesthesiologists' work schedules can affect job performance, and discusses the ramifications of overnight and prolonged duty hours on patient safety and resident well-being. We then propose countermeasures that have been implemented to mitigate the effects of fatigue and describe how training programs or practice groups who must work overnight can adapt these strategies for use in a hospital setting. Countermeasures include the use of scheduling interventions, strategic naps, microbreaks, caffeine use during overnight and extended shifts, and the use of bright lights in the clinical setting when possible or personal blue light devices when the room lights must be turned off. Although this review focuses primarily on anesthesiology residents in training, many of the mitigation strategies described here can be used effectively by physicians in practice.

Fog computing job scheduling optimization based on bees swarm

NASA Astrophysics Data System (ADS)

Bitam, Salim; Zeadally, Sherali; Mellouk, Abdelhamid

2018-04-01

Fog computing is a new computing architecture, composed of a set of near-user edge devices called fog nodes, which collaborate together in order to perform computational services such as running applications, storing an important amount of data, and transmitting messages. Fog computing extends cloud computing by deploying digital resources at the premise of mobile users. In this new paradigm, management and operating functions, such as job scheduling aim at providing high-performance, cost-effective services requested by mobile users and executed by fog nodes. We propose a new bio-inspired optimization approach called Bees Life Algorithm (BLA) aimed at addressing the job scheduling problem in the fog computing environment. Our proposed approach is based on the optimized distribution of a set of tasks among all the fog computing nodes. The objective is to find an optimal tradeoff between CPU execution time and allocated memory required by fog computing services established by mobile users. Our empirical performance evaluation results demonstrate that the proposal outperforms the traditional particle swarm optimization and genetic algorithm in terms of CPU execution time and allocated memory.

Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes

NASA Astrophysics Data System (ADS)

Cheng, Bayi; Yang, Shanlin; Hu, Xiaoxuan; Li, Kai

2014-03-01

This article considers the problem of scheduling two batch-processing machines in flow shop where the jobs have arbitrary sizes and the machines have limited capacity. The jobs are processed in batches and the total size of jobs in each batch cannot exceed the machine capacity. Once a batch is being processed, no interruption is allowed until all the jobs in it are completed. The problem of minimising makespan is NP-hard in the strong sense. First, we present a mathematical model of the problem using integer programme. We show the scale of feasible solutions of the problem and provide optimality properties. Then, we propose a polynomial time algorithm with running time in O(nlogn). The jobs are first assigned in feasible batches and then scheduled on machines. For the general case, we prove that the proposed algorithm has a performance guarantee of 4. For the special case where the processing times of each job on the two machines satisfy p 1 j = ap 2 j , the performance guarantee is ? for a > 0.

Simultaneous Scheduling of Jobs, AGVs and Tools Considering Tool Transfer Times in Multi Machine FMS By SOS Algorithm

NASA Astrophysics Data System (ADS)

Sivarami Reddy, N.; Ramamurthy, D. V., Dr.; Prahlada Rao, K., Dr.

2017-08-01

This article addresses simultaneous scheduling of machines, AGVs and tools where machines are allowed to share the tools considering transfer times of jobs and tools between machines, to generate best optimal sequences that minimize makespan in a multi-machine Flexible Manufacturing System (FMS). Performance of FMS is expected to improve by effective utilization of its resources, by proper integration and synchronization of their scheduling. Symbiotic Organisms Search (SOS) algorithm is a potent tool which is a better alternative for solving optimization problems like scheduling and proven itself. The proposed SOS algorithm is tested on 22 job sets with makespan as objective for scheduling of machines and tools where machines are allowed to share tools without considering transfer times of jobs and tools and the results are compared with the results of existing methods. The results show that the SOS has outperformed. The same SOS algorithm is used for simultaneous scheduling of machines, AGVs and tools where machines are allowed to share tools considering transfer times of jobs and tools to determine the best optimal sequences that minimize makespan.

Second Evaluation of Job Queuing/Scheduling Software. Phase 1

NASA Technical Reports Server (NTRS)

Jones, James Patton; Brickell, Cristy; Chancellor, Marisa (Technical Monitor)

1997-01-01

The recent proliferation of high performance workstations and the increased reliability of parallel systems have illustrated the need for robust job management systems to support parallel applications. To address this issue, NAS compiled a requirements checklist for job queuing/scheduling software. Next, NAS evaluated the leading job management system (JMS) software packages against the checklist. A year has now elapsed since the first comparison was published, and NAS has repeated the evaluation. This report describes this second evaluation, and presents the results of Phase 1: Capabilities versus Requirements. We show that JMS support for running parallel applications on clusters of workstations and parallel systems is still lacking, however, definite progress has been made by the vendors to correct the deficiencies. This report is supplemented by a WWW interface to the data collected, to aid other sites in extracting the evaluation information on specific requirements of interest.

Innately Split Model for Job-shop Scheduling Problem

NASA Astrophysics Data System (ADS)

Ikeda, Kokolo; Kobayashi, Sigenobu

Job-shop Scheduling Problem (JSP) is one of the most difficult benchmark problems. GA approaches often fail searching the global optimum because of the deception UV-structure of JSPs. In this paper, we introduce a novel framework model of GA, Innately Split Model (ISM) which prevents UV-phenomenon, and discuss on its power particularly. Next we analyze the structure of JSPs with the help of the UV-structure hypothesys, and finally we show ISM's excellent performance on JSP.

Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems

NASA Astrophysics Data System (ADS)

Cruz-Chávez, Marco Antonio

2015-11-01

This paper presents a neighbourhood generation mechanism for the job shop scheduling problems (JSSPs). In order to obtain a feasible neighbour with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack time between the adjacent pair of operations that is permuted, then it is proven, through theory and experimentation, that the new neighbour (schedule) generated is feasible. It is demonstrated that the neighbourhood generation mechanism is very efficient and effective in a simulated annealing.

Energy-efficient approach to minimizing the energy consumption in an extended job-shop scheduling problem

NASA Astrophysics Data System (ADS)

Tang, Dunbing; Dai, Min

2015-09-01

The traditional production planning and scheduling problems consider performance indicators like time, cost and quality as optimization objectives in manufacturing processes. However, environmentally-friendly factors like energy consumption of production have not been completely taken into consideration. Against this background, this paper addresses an approach to modify a given schedule generated by a production planning and scheduling system in a job shop floor, where machine tools can work at different cutting speeds. It can adjust the cutting speeds of the operations while keeping the original assignment and processing sequence of operations of each job fixed in order to obtain energy savings. First, the proposed approach, based on a mixed integer programming mathematical model, changes the total idle time of the given schedule to minimize energy consumption in the job shop floor while accepting the optimal solution of the scheduling objective, makespan. Then, a genetic-simulated annealing algorithm is used to explore the optimal solution due to the fact that the problem is strongly NP-hard. Finally, the effectiveness of the approach is performed smalland large-size instances, respectively. The experimental results show that the approach can save 5%-10% of the average energy consumption while accepting the optimal solution of the makespan in small-size instances. In addition, the average maximum energy saving ratio can reach to 13%. And it can save approximately 1%-4% of the average energy consumption and approximately 2.4% of the average maximum energy while accepting the near-optimal solution of the makespan in large-size instances. The proposed research provides an interesting point to explore an energy-aware schedule optimization for a traditional production planning and scheduling problem.

On scheduling task systems with variable service times

NASA Astrophysics Data System (ADS)

Maset, Richard G.; Banawan, Sayed A.

1993-08-01

Several strategies have been proposed for developing optimal and near-optimal schedules for task systems (jobs consisting of multiple tasks that can be executed in parallel). Most such strategies, however, implicitly assume deterministic task service times. We show that these strategies are much less effective when service times are highly variable. We then evaluate two strategies—one adaptive, one static—that have been proposed for retaining high performance despite such variability. Both strategies are extensions of critical path scheduling, which has been found to be efficient at producing near-optimal schedules. We found the adaptive approach to be quite effective.

Development of a job rotation scheduling algorithm for minimizing accumulated work load per body parts.

PubMed

Song, JooBong; Lee, Chaiwoo; Lee, WonJung; Bahn, Sangwoo; Jung, ChanJu; Yun, Myung Hwan

2015-01-01

For the successful implementation of job rotation, jobs should be scheduled systematically so that physical workload is evenly distributed with the use of various body parts. However, while the potential benefits are widely recognized by research and industry, there is still a need for a more effective and efficient algorithm that considers multiple work-related factors in job rotation scheduling. This study suggests a type of job rotation algorithm that aims to minimize musculoskeletal disorders with the approach of decreasing the overall workload. Multiple work characteristics are evaluated as inputs to the proposed algorithm. Important factors, such as physical workload on specific body parts, working height, involvement of heavy lifting, and worker characteristics such as physical disorders, are included in the algorithm. For evaluation of the overall workload in a given workplace, an objective function was defined to aggregate the scores from the individual factors. A case study, where the algorithm was applied at a workplace, is presented with an examination on its applicability and effectiveness. With the application of the suggested algorithm in case study, the value of the final objective function, which is the weighted sum of the workload in various body parts, decreased by 71.7% when compared to a typical sequential assignment and by 84.9% when compared to a single job assignment, which is doing one job all day. An algorithm was developed using the data from the ergonomic evaluation tool used in the plant and from the known factors related to workload. The algorithm was developed so that it can be efficiently applied with a small amount of required inputs, while covering a wide range of work-related factors. A case study showed that the algorithm was beneficial in determining a job rotation schedule aimed at minimizing workload across body parts.

Coping Work Strategies and Job Satisfaction Among Iranian Nurses

PubMed Central

Ghiyasvandian, Shahrzad; Adera Gebra, Addis

2014-01-01

Context: Nursing is a stressful job that could create physical and psychological disorders. Many studies presented information on stress, effects of coping strategies, and job satisfaction of nurses within health setting. We aimed to identify and describe nursing stresses, coping strategies and job satisfaction of Iranian nurses who are working or worked in different wards. Evidence Acquisition: In this review, we studied peer-reviewed journal articles on the field of stress, coping strategies and job satisfaction in nursing practice, especially Iranian nurses, which were published between 2000 and 2013. In this regard, we searched databases of PubMed, Elsevier, Google, BMJ, PMC, and MEDLINE. Results: The majority of the studies (60%) had analyzed the effect of coping strategies, experiences and perception of job-related stresses in Iranian nurses working in hospitals. In some of the reviewed studies (60%), the majority of the samples enrolled Iranian nurses. Forty percent of studies selected a maximum sample size of 565 (44%) participants in 2011. Nursing stress scale employed at 30% of the studies was the most commonly used strategy. This reviewed studies also revealed a combined measurement (60% of studies), based on categorical stress measurement, effects of coping strategies, and job satisfaction methods. Three studies explored the relationship between job stress and job satisfaction. For instance, the majority (74.4%) of nurses reported job satisfaction. Conclusions: Effect of coping strategies and job satisfaction on Iranian nurses is a well-accepted issue and has important positive outcomes on several areas of health discipline. PMID:25068050

Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups

NASA Astrophysics Data System (ADS)

Kim, Ji-Su; Park, Jung-Hyeon; Lee, Dong-Ho

2017-10-01

This study addresses a variant of job-shop scheduling in which jobs are grouped into job families, but they are processed individually. The problem can be found in various industrial systems, especially in reprocessing shops of remanufacturing systems. If the reprocessing shop is a job-shop type and has the component-matching requirements, it can be regarded as a job shop with job families since the components of a product constitute a job family. In particular, sequence-dependent set-ups in which set-up time depends on the job just completed and the next job to be processed are also considered. The objective is to minimize the total family flow time, i.e. the maximum among the completion times of the jobs within a job family. A mixed-integer programming model is developed and two iterated greedy algorithms with different local search methods are proposed. Computational experiments were conducted on modified benchmark instances and the results are reported.

Comparison of job stress and obesity in nurses with favorable and unfavorable work schedules.

PubMed

Han, Kihye; Trinkoff, Alison M; Storr, Carla L; Geiger-Brown, Jeanne; Johnson, Karen L; Park, Sungae

2012-08-01

To compare obesity-related factors between female nurses with favorable work schedules (WSs) and unfavorable WSs. In a cross-sectional study, 1724 female nurses were stratified by WS (favorable vs unfavorable). For each schedule type, the odds of obesity were related to health behaviors, home demands, and job stress using logistic regression models. Among nurses with unfavorable WSs, healthy behaviors (exercise, sleep) were inversely associated with obesity, whereas for those with favorable WSs, obese nurses reported significantly more unhealthy behaviors (smoking, alcohol use; odds ratio [OR], 1.19; 95% confidence interval [CI], 1.02-1.38), more physical lifting of children/dependents (OR, 1.43; 95% CI, 1.06-1.93), having more nurse input into their jobs (OR, 1.21; 95% CI, 1.02-1.44), yet less boss support at work (OR, 0.83; 95% CI, 0.68-0.99). Considering impacts of WSs on obesity and potential obesity-related health outcomes, healthful scheduling should be provided to nurses.

A controlled genetic algorithm by fuzzy logic and belief functions for job-shop scheduling.

PubMed

Hajri, S; Liouane, N; Hammadi, S; Borne, P

2000-01-01

Most scheduling problems are highly complex combinatorial problems. However, stochastic methods such as genetic algorithm yield good solutions. In this paper, we present a controlled genetic algorithm (CGA) based on fuzzy logic and belief functions to solve job-shop scheduling problems. For better performance, we propose an efficient representational scheme, heuristic rules for creating the initial population, and a new methodology for mixing and computing genetic operator probabilities.

A Comparison of the DISASTER (Trademark) Scheduling Software with a Simultaneous Scheduling Algorithm for Minimizing Maximum Tardiness in Job Shops

DTIC Science & Technology

1993-09-01

goal ( Heizer , Render , and Stair, 1993:94). Integer Prgronmming. Integer programming is a general purpose approach used to optimally solve job shop...Scheduling," Operations Research Journal. 29, No 4: 646-667 (July-August 1981). Heizer , Jay, Barry Render and Ralph M. Stair, Jr. Production and Operations

Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.

PubMed

Yang, S; Wang, D

2000-01-01

This paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems. The proposed neural network can be easily constructed and can adaptively adjust its weights of connections and biases of units based on the sequence and resource constraints of the job-shop scheduling problem during its processing. Several heuristics that can be combined with the neural network are also presented. In the combined approaches, the neural network is used to obtain feasible solutions, the heuristic algorithms are used to improve the performance of the neural network and the quality of the obtained solutions. Simulations have shown that the proposed neural network and its combined approaches are efficient with respect to the quality of solutions and the solving speed.

Solving Open Job-Shop Scheduling Problems by SAT Encoding

NASA Astrophysics Data System (ADS)

Koshimura, Miyuki; Nabeshima, Hidetomo; Fujita, Hiroshi; Hasegawa, Ryuzo

This paper tries to solve open Job-Shop Scheduling Problems (JSSP) by translating them into Boolean Satisfiability Testing Problems (SAT). The encoding method is essentially the same as the one proposed by Crawford and Baker. The open problems are ABZ8, ABZ9, YN1, YN2, YN3, and YN4. We proved that the best known upper bounds 678 of ABZ9 and 884 of YN1 are indeed optimal. We also improved the upper bound of YN2 and lower bounds of ABZ8, YN2, YN3 and YN4.

Applying mathematical modeling to create job rotation schedules for minimizing occupational noise exposure.

PubMed

Tharmmaphornphilas, Wipawee; Green, Benjamin; Carnahan, Brian J; Norman, Bryan A

2003-01-01

This research developed worker schedules by using administrative controls and a computer programming model to reduce the likelihood of worker hearing loss. By rotating the workers through different jobs during the day it was possible to reduce their exposure to hazardous noise levels. Computer simulations were made based on data collected in a real setting. Worker schedules currently used at the site are compared with proposed worker schedules from the computer simulations. For the worker assignment plans found by the computer model, the authors calculate a significant decrease in time-weighted average (TWA) sound level exposure. The maximum daily dose that any worker is exposed to is reduced by 58.8%, and the maximum TWA value for the workers is reduced by 3.8 dB from the current schedule.

The Canadian Jobs Strategy. A Review of the First Years.

ERIC Educational Resources Information Center

Canada Employment and Immigration Commission, Ottawa (Ontario).

In September 1985, the Canadian government introduced the Canadian Jobs Strategy. Two features distinguish the jobs strategy program from Canada's old job development programs and programs for purchasing job training from colleges. These features are: (1) focusing of federal support for labor market adjustment on those individuals who are most in…

Extended precedence preservative crossover for job shop scheduling problems

NASA Astrophysics Data System (ADS)

Ong, Chung Sin; Moin, Noor Hasnah; Omar, Mohd

2013-04-01

Job shop scheduling problems (JSSP) is one of difficult combinatorial scheduling problems. A wide range of genetic algorithms based on the two parents crossover have been applied to solve the problem but multi parents (more than two parents) crossover in solving the JSSP is still lacking. This paper proposes the extended precedence preservative crossover (EPPX) which uses multi parents for recombination in the genetic algorithms. EPPX is a variation of the precedence preservative crossover (PPX) which is one of the crossovers that perform well to find the solutions for the JSSP. EPPX is based on a vector to determine the gene selected in recombination for the next generation. Legalization of children (offspring) can be eliminated due to the JSSP representation encoded by using permutation with repetition that guarantees the feasibility of chromosomes. The simulations are performed on a set of benchmarks from the literatures and the results are compared to ensure the sustainability of multi parents recombination in solving the JSSP.

Evaluation and Selection of Best Priority Sequencing Rule in Job Shop Scheduling using Hybrid MCDM Technique

NASA Astrophysics Data System (ADS)

Kiran Kumar, Kalla; Nagaraju, Dega; Gayathri, S.; Narayanan, S.

2017-05-01

Priority Sequencing Rules provide the guidance for the order in which the jobs are to be processed at a workstation. The application of different priority rules in job shop scheduling gives different order of scheduling. More experimentation needs to be conducted before a final choice is made to know the best priority sequencing rule. Hence, a comprehensive method of selecting the right choice is essential in managerial decision making perspective. This paper considers seven different priority sequencing rules in job shop scheduling. For evaluation and selection of the best priority sequencing rule, a set of eight criteria are considered. The aim of this work is to demonstrate the methodology of evaluating and selecting the best priority sequencing rule by using hybrid multi criteria decision making technique (MCDM), i.e., analytical hierarchy process (AHP) with technique for order preference by similarity to ideal solution (TOPSIS). The criteria weights are calculated by using AHP whereas the relative closeness values of all priority sequencing rules are computed based on TOPSIS with the help of data acquired from the shop floor of a manufacturing firm. Finally, from the findings of this work, the priority sequencing rules are ranked from most important to least important. The comprehensive methodology presented in this paper is very much essential for the management of a workstation to choose the best priority sequencing rule among the available alternatives for processing the jobs with maximum benefit.

The MICRO-BOSS scheduling system: Current status and future efforts

NASA Technical Reports Server (NTRS)

Sadeh, Norman M.

1992-01-01

In this paper, a micro-opportunistic approach to factory scheduling was described that closely monitors the evolution of bottlenecks during the construction of the schedule and continuously redirects search towards the bottleneck that appears to be most critical. This approach differs from earlier opportunistic approaches, as it does not require scheduling large resource subproblems or large job subproblems before revising the current scheduling strategy. This micro-opportunistic approach was implemented in the context of the MICRO-BOSS factory scheduling system. A study comparing MICRO-BOSS against a macro-opportunistic scheduler suggests that the additional flexibility of the micro-opportunistic approach to scheduling generally yields important reductions in both tardiness and inventory. Current research efforts include: adaptation of MICRO-BOSS to deal with sequence-dependent setups and development of micro-opportunistic reactive scheduling techniques that will enable the system to patch the schedule in the presence of contingencies such as machine breakdowns, raw materials arriving late, job cancellations, etc.

A Woman's Job Search: Five Strategies for Success.

ERIC Educational Resources Information Center

Reis, Susan L.

An alternate approach to traditional job search methods which may be helpful to women is presented. The following five strategies are considered: (1) know what you want; (2) develop a network of professional contacts to help identify the hidden job market; (3) be selective in the job search; (4) research job openings thoroughly before deciding to…

A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems

NASA Astrophysics Data System (ADS)

Thammano, Arit; Teekeng, Wannaporn

2015-05-01

The job-shop scheduling problem is one of the most difficult production planning problems. Since it is in the NP-hard class, a recent trend in solving the job-shop scheduling problem is shifting towards the use of heuristic and metaheuristic algorithms. This paper proposes a novel metaheuristic algorithm, which is a modification of the genetic algorithm. This proposed algorithm introduces two new concepts to the standard genetic algorithm: (1) fuzzy roulette wheel selection and (2) the mutation operation with tabu list. The proposed algorithm has been evaluated and compared with several state-of-the-art algorithms in the literature. The experimental results on 53 JSSPs show that the proposed algorithm is very effective in solving the combinatorial optimization problems. It outperforms all state-of-the-art algorithms on all benchmark problems in terms of the ability to achieve the optimal solution and the computational time.

The Relation between Career Decision-Making Strategies and Person-Job Fit: A Study of Job Changers

ERIC Educational Resources Information Center

Singh, Romila; Greenhaus, Jeffrey H.

2004-01-01

This study examined relations between three career decision-making strategies (rational, intuitive, and dependent) and person--job fit among 361 professionals who had recently changed jobs. We found that the relation between each decision-making strategy and fit was contingent upon the concurrent use of other strategies. A rational strategy…

Parallel-aware, dedicated job co-scheduling within/across symmetric multiprocessing nodes

DOEpatents

Jones, Terry R.; Watson, Pythagoras C.; Tuel, William; Brenner, Larry; ,Caffrey, Patrick; Fier, Jeffrey

2010-10-05

In a parallel computing environment comprising a network of SMP nodes each having at least one processor, a parallel-aware co-scheduling method and system for improving the performance and scalability of a dedicated parallel job having synchronizing collective operations. The method and system uses a global co-scheduler and an operating system kernel dispatcher adapted to coordinate interfering system and daemon activities on a node and across nodes to promote intra-node and inter-node overlap of said interfering system and daemon activities as well as intra-node and inter-node overlap of said synchronizing collective operations. In this manner, the impact of random short-lived interruptions, such as timer-decrement processing and periodic daemon activity, on synchronizing collective operations is minimized on large processor-count SPMD bulk-synchronous programming styles.

Job satisfaction among a multigenerational nursing workforce.

PubMed

Wilson, Barbara; Squires, Mae; Widger, Kimberley; Cranley, Lisa; Tourangeau, Ann

2008-09-01

To explore generational differences in job satisfaction. Effective retention strategies are required to mitigate the international nursing shortage. Job satisfaction, a strong and consistent predictor of retention, may differ across generations. Understanding job satisfaction generational differences may lead to increasing clarity about generation-specific retention approaches. The Ontario Nurse Survey collected data from 6541 Registered Nurses. Participants were categorized as Baby Boomer, Generation X or Generation Y based on birth year. Multivariate analysis of variance explored generational differences for overall and specific satisfaction components. In overall job satisfaction and five specific satisfaction components, Baby Boomers were significantly more satisfied than Generations X and Y. It is imperative to improve job satisfaction for younger generations of nurses. Strategies to improve job satisfaction for younger generations of nurses may include creating a shared governance framework where nurses are empowered to make decisions. Implementing shared governance, through nurse-led unit-based councils, may lead to greater job satisfaction, particularly for younger nurses. Opportunities to self schedule or job share may be other potential approaches to increase job satisfaction, especially for younger generations of nurses. Another potential strategy would be to aggressively provide and support education and career-development opportunities.

Scheduling with genetic algorithms

NASA Technical Reports Server (NTRS)

Fennel, Theron R.; Underbrink, A. J., Jr.; Williams, George P. W., Jr.

1994-01-01

In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.

Evolution of CMS workload management towards multicore job support

NASA Astrophysics Data System (ADS)

Pérez-Calero Yzquierdo, A.; Hernández, J. M.; Khan, F. A.; Letts, J.; Majewski, K.; Rodrigues, A. M.; McCrea, A.; Vaandering, E.

2015-12-01

The successful exploitation of multicore processor architectures is a key element of the LHC distributed computing system in the coming era of the LHC Run 2. High-pileup complex-collision events represent a challenge for the traditional sequential programming in terms of memory and processing time budget. The CMS data production and processing framework is introducing the parallel execution of the reconstruction and simulation algorithms to overcome these limitations. CMS plans to execute multicore jobs while still supporting singlecore processing for other tasks difficult to parallelize, such as user analysis. The CMS strategy for job management thus aims at integrating single and multicore job scheduling across the Grid. This is accomplished by employing multicore pilots with internal dynamic partitioning of the allocated resources, capable of running payloads of various core counts simultaneously. An extensive test programme has been conducted to enable multicore scheduling with the various local batch systems available at CMS sites, with the focus on the Tier-0 and Tier-1s, responsible during 2015 of the prompt data reconstruction. Scale tests have been run to analyse the performance of this scheduling strategy and ensure an efficient use of the distributed resources. This paper presents the evolution of the CMS job management and resource provisioning systems in order to support this hybrid scheduling model, as well as its deployment and performance tests, which will enable CMS to transition to a multicore production model for the second LHC run.

Evolution of CMS Workload Management Towards Multicore Job Support

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perez-Calero Yzquierdo, A.; Hernández, J. M.; Khan, F. A.

The successful exploitation of multicore processor architectures is a key element of the LHC distributed computing system in the coming era of the LHC Run 2. High-pileup complex-collision events represent a challenge for the traditional sequential programming in terms of memory and processing time budget. The CMS data production and processing framework is introducing the parallel execution of the reconstruction and simulation algorithms to overcome these limitations. CMS plans to execute multicore jobs while still supporting singlecore processing for other tasks difficult to parallelize, such as user analysis. The CMS strategy for job management thus aims at integrating single andmore » multicore job scheduling across the Grid. This is accomplished by employing multicore pilots with internal dynamic partitioning of the allocated resources, capable of running payloads of various core counts simultaneously. An extensive test programme has been conducted to enable multicore scheduling with the various local batch systems available at CMS sites, with the focus on the Tier-0 and Tier-1s, responsible during 2015 of the prompt data reconstruction. Scale tests have been run to analyse the performance of this scheduling strategy and ensure an efficient use of the distributed resources. This paper presents the evolution of the CMS job management and resource provisioning systems in order to support this hybrid scheduling model, as well as its deployment and performance tests, which will enable CMS to transition to a multicore production model for the second LHC run.« less

Emergency Radiology Practice Patterns: Shifts, Schedules, and Job Satisfaction.

PubMed

Hanna, Tarek N; Shekhani, Haris; Lamoureux, Christine; Mar, Hanna; Nicola, Refky; Sliker, Clint; Johnson, Jamlik-Omari

2017-03-01

To assess the practice environment of emergency radiologists with a focus on schedule, job satisfaction, and self-perception of health, wellness, and diagnostic accuracy. A survey drawing from prior radiology and health care shift-work literature was distributed via e-mail to national societies, teleradiology groups, and private practices. The survey remained open for 4 weeks in 2016, with one reminder. Data were analyzed using hypothesis testing and logistic regression modeling. Response rate was 29.6% (327/1106); 69.1% of respondents (n = 226) were greater than 40 years old, 73% (n = 240) were male, and 87% (n = 284) practiced full time. With regard to annual overnight shifts (NS): 36% (n = 118) did none, 24.9% (n = 81) did 182 or more, and 15.6% (n = 51) did 119. There was a significant association between average NS worked per year and both perceived negative health effects (P < .01) and negative impact on memory (P < .01). There was an inverse association between overall job enjoyment and number of annual NS (P < .05). The odds of agreeing to the statement "I enjoy my job" for radiologists who work no NS is 2.21 times greater than for radiologists who work at least 119 NS, when shift length is held constant. Radiologists with 11+ years of experience who work no NS or 1 to 100 NS annually have lower odds of feeling overwhelmed when compared with those working the same number of NS with <10 years' experience. There is significant variation in emergency radiology practice patterns. Annual NS burden is associated with lower job satisfaction and negative health self-perception. Copyright © 2016 American College of Radiology. Published by Elsevier Inc. All rights reserved.

[Personal resources and nursing work: a research on coping strategies and job satisfaction].

PubMed

Formentin, Silvia; Dallago, Lorenza; Negrisolo, Adriana

2009-01-01

The coping (ability to face a difficult situation), is an essential resource for nurses, because it increases the effective functioning in the working environment, job satisfaction and individual level of wellness. The aim of this study is to explore the relationship between coping strategies and job satisfaction. A self report questionnaire was administered to all the nurses working in health services and hospitals of Padua province and to free lance nurses members of the College of Nurses, to collect information on coping strategies and job satisfaction. 2264 questionnaires were returned (71%). Active coping strategies are adopted mainly from older nurses while avoiding strategies are prevalent among younger. An association was observed between job satisfaction and active coping strategies, aimed at problem solving: active strategies increase job satisfaction while avoiding strategies descrease it. Individual coping strategies implemented to face difficult situations are associated to job satisfaction.

Job Strategies for Professionals. A Survival Guide for Experienced White-Collar Workers.

ERIC Educational Resources Information Center

Farr, J. Michael, Ed.

This book, aimed at college-educated professional people, contains nine chapters covering job loss and strategies for finding new employment. Originally published by the U.S. Employment Service under the title "Job Search Guide: Strategies for Professionals," the guide presents an overview of the job search, including handling job loss, managing…

A Market-Based Approach to Multi-factory Scheduling

NASA Astrophysics Data System (ADS)

Vytelingum, Perukrishnen; Rogers, Alex; MacBeth, Douglas K.; Dutta, Partha; Stranjak, Armin; Jennings, Nicholas R.

In this paper, we report on the design of a novel market-based approach for decentralised scheduling across multiple factories. Specifically, because of the limitations of scheduling in a centralised manner - which requires a center to have complete and perfect information for optimality and the truthful revelation of potentially commercially private preferences to that center - we advocate an informationally decentralised approach that is both agile and dynamic. In particular, this work adopts a market-based approach for decentralised scheduling by considering the different stakeholders representing different factories as self-interested, profit-motivated economic agents that trade resources for the scheduling of jobs. The overall schedule of these jobs is then an emergent behaviour of the strategic interaction of these trading agents bidding for resources in a market based on limited information and their own preferences. Using a simple (zero-intelligence) bidding strategy, we empirically demonstrate that our market-based approach achieves a lower bound efficiency of 84%. This represents a trade-off between a reasonable level of efficiency (compared to a centralised approach) and the desirable benefits of a decentralised solution.

The moderating effect of control over work scheduling and overtime on the relationship between workload demands and perceived job risk.

PubMed

Näswall, Katharina; Burt, Christopher D B; Pearce, Megan

2015-01-01

This study investigated the impact of workload demands on perceived job risk using the Job Demand-Control model as a research framework. The primary objective was to test the hypothesis that employee control over work scheduling and overtime would moderate the relationship between workload demands and perceived job risk. Ninety-six participants working in a variety of industries completed measures of workload demands, and of control over work scheduling and overtime, and a measure of perceived job risk. Workload demands predicted higher perceptions of job risk. However, the results also suggest that control over overtime moderated this relationship, where those with the combination of high workload demands and low control over overtime reported higher levels of perceived risk. The results indicate that the JDC model is applicable to safety research. The results suggest that employee control over workload demands is an important variable to consider in terms of managing workplace safety. The present study also points to important areas for future research to explore in order to further understand the connection between demands and safety.

A New Strategy for Job Enrichment. Technical Report No. 3.

ERIC Educational Resources Information Center

Hackman, J. Richard; And Others

In presenting a new strategy for redesigning jobs to increase the work motivation and satisfaction of employees, the paper examines a basic theory of job motivation, a group of core dimensions of jobs which create the conditions for such internal motivation to develop on the job, a set of diagnostic tools for evaluating jobs and people's reaction…

The MICRO-BOSS scheduling system: Current status and future efforts

NASA Technical Reports Server (NTRS)

Sadeh, Norman M.

1993-01-01

In this paper, a micro-opportunistic approach to factory scheduling was described that closely monitors the evolution of bottlenecks during the construction of the schedule, and continuously redirects search towards the bottleneck that appears to be most critical. This approach differs from earlier opportunistic approaches, as it does not require scheduling large resource subproblems or large job subproblems before revising the current scheduling strategy. This micro-opportunistic approach was implemented in the context of the MICRO-BOSS factory scheduling system. A study comparing MICRO-BOSS against a macro-opportunistic scheduler suggests that the additional flexibility of the micro-opportunistic approach to scheduling generally yields important reductions in both tardiness and inventory.

Performance evaluation of different types of particle representation procedures of Particle Swarm Optimization in Job-shop Scheduling Problems

NASA Astrophysics Data System (ADS)

Izah Anuar, Nurul; Saptari, Adi

2016-02-01

This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representation procedures in Particle Swarm Optimization (PSO) in the case of solving Job-shop Scheduling Problems (JSP). Particle representation procedures refer to the mapping between the particle position in PSO and the scheduling solution in JSP. It is an important step to be carried out so that each particle in PSO can represent a schedule in JSP. Three procedures such as Operation and Particle Position Sequence (OPPS), random keys representation and random-key encoding scheme are used in this study. These procedures have been tested on FT06 and FT10 benchmark problems available in the OR-Library, where the objective function is to minimize the makespan by the use of MATLAB software. Based on the experimental results, it is discovered that OPPS gives the best performance in solving both benchmark problems. The contribution of this paper is the fact that it demonstrates to the practitioners involved in complex scheduling problems that different particle representation procedures can have significant effects on the performance of PSO in solving JSP.

MIP models and hybrid algorithms for simultaneous job splitting and scheduling on unrelated parallel machines.

PubMed

Eroglu, Duygu Yilmaz; Ozmutlu, H Cenk

2014-01-01

We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs. We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA). Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented. We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes' random key numbers. This is the second contribution of the paper. The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously. The fourth contribution of this paper is implementation of the GAspLAMIP. This implementation let us verify the optimality of GAspLA for the studied combinations. The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms.

MIP Models and Hybrid Algorithms for Simultaneous Job Splitting and Scheduling on Unrelated Parallel Machines

PubMed Central

Ozmutlu, H. Cenk

2014-01-01

We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs. We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA). Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented. We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes' random key numbers. This is the second contribution of the paper. The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously. The fourth contribution of this paper is implementation of the GAspLAMIP. This implementation let us verify the optimality of GAspLA for the studied combinations. The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms. PMID:24977204

Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization.

PubMed

Huang, Song; Tian, Na; Wang, Yan; Ji, Zhicheng

2016-01-01

Taking resource allocation into account, flexible job shop problem (FJSP) is a class of complex scheduling problem in manufacturing system. In order to utilize the machine resources rationally, multi-objective particle swarm optimization (MOPSO) integrating with variable neighborhood search is introduced to address FJSP efficiently. Firstly, the assignment rules (AL) and dispatching rules (DR) are provided to initialize the population. And then special discrete operators are designed to produce new individuals and earliest completion machine (ECM) is adopted in the disturbance operator to escape the optima. Secondly, personal-best archives (cognitive memories) and global-best archive (social memory), which are updated by the predefined non-dominated archive update strategy, are simultaneously designed to preserve non-dominated individuals and select personal-best positions and the global-best position. Finally, three neighborhoods are provided to search the neighborhoods of global-best archive for enhancing local search ability. The proposed algorithm is evaluated by using Kacem instances and Brdata instances, and a comparison with other approaches shows the effectiveness of the proposed algorithm for FJSP.

Job shop scheduling model for non-identic machine with fixed delivery time to minimize tardiness

NASA Astrophysics Data System (ADS)

Kusuma, K. K.; Maruf, A.

2016-02-01

Scheduling non-identic machines problem with low utilization characteristic and fixed delivery time are frequent in manufacture industry. This paper propose a mathematical model to minimize total tardiness for non-identic machines in job shop environment. This model will be categorized as an integer linier programming model and using branch and bound algorithm as the solver method. We will use fixed delivery time as main constraint and different processing time to process a job. The result of this proposed model shows that the utilization of production machines can be increase with minimal tardiness using fixed delivery time as constraint.

A model for developing job rotation schedules that eliminate sequential high workloads and minimize between-worker variability in cumulative daily workloads: Application to automotive assembly lines.

PubMed

Yoon, Sang-Young; Ko, Jeonghan; Jung, Myung-Chul

2016-07-01

The aim of study is to suggest a job rotation schedule by developing a mathematical model in order to reduce cumulative workload from the successive use of the same body region. Workload assessment using rapid entire body assessment (REBA) was performed for the model in three automotive assembly lines of chassis, trim, and finishing to identify which body part exposed to relatively high workloads at workstations. The workloads were incorporated to the model to develop a job rotation schedule. The proposed schedules prevent the exposure to high workloads successively on the same body region and minimized between-worker variance in cumulative daily workload. Whereas some of workers were successively assigned to high workload workstation under no job rotation and serial job rotation. This model would help to reduce the potential for work-related musculoskeletal disorders (WMSDs) without additional cost for engineering work, although it may need more computational time and relative complex job rotation sequences. Copyright © 2016 Elsevier Ltd and The Ergonomics Society. All rights reserved.

Proposed algorithm to improve job shop production scheduling using ant colony optimization method

NASA Astrophysics Data System (ADS)

Pakpahan, Eka KA; Kristina, Sonna; Setiawan, Ari

2017-12-01

This paper deals with the determination of job shop production schedule on an automatic environment. On this particular environment, machines and material handling system are integrated and controlled by a computer center where schedule were created and then used to dictate the movement of parts and the operations at each machine. This setting is usually designed to have an unmanned production process for a specified interval time. We consider here parts with various operations requirement. Each operation requires specific cutting tools. These parts are to be scheduled on machines each having identical capability, meaning that each machine is equipped with a similar set of cutting tools therefore is capable of processing any operation. The availability of a particular machine to process a particular operation is determined by the remaining life time of its cutting tools. We proposed an algorithm based on the ant colony optimization method and embedded them on matlab software to generate production schedule which minimize the total processing time of the parts (makespan). We test the algorithm on data provided by real industry and the process shows a very short computation time. This contributes a lot to the flexibility and timelines targeted on an automatic environment.

Automatic programming via iterated local search for dynamic job shop scheduling.

PubMed

Nguyen, Su; Zhang, Mengjie; Johnston, Mark; Tan, Kay Chen

2015-01-01

Dispatching rules have been commonly used in practice for making sequencing and scheduling decisions. Due to specific characteristics of each manufacturing system, there is no universal dispatching rule that can dominate in all situations. Therefore, it is important to design specialized dispatching rules to enhance the scheduling performance for each manufacturing environment. Evolutionary computation approaches such as tree-based genetic programming (TGP) and gene expression programming (GEP) have been proposed to facilitate the design task through automatic design of dispatching rules. However, these methods are still limited by their high computational cost and low exploitation ability. To overcome this problem, we develop a new approach to automatic programming via iterated local search (APRILS) for dynamic job shop scheduling. The key idea of APRILS is to perform multiple local searches started with programs modified from the best obtained programs so far. The experiments show that APRILS outperforms TGP and GEP in most simulation scenarios in terms of effectiveness and efficiency. The analysis also shows that programs generated by APRILS are more compact than those obtained by genetic programming. An investigation of the behavior of APRILS suggests that the good performance of APRILS comes from the balance between exploration and exploitation in its search mechanism.

A dynamic scheduling method of Earth-observing satellites by employing rolling horizon strategy.

PubMed

Dishan, Qiu; Chuan, He; Jin, Liu; Manhao, Ma

2013-01-01

Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments.

Scheduling with non-decreasing deterioration jobs and variable maintenance activities on a single machine

NASA Astrophysics Data System (ADS)

Zhang, Xingong; Yin, Yunqiang; Wu, Chin-Chia

2017-01-01

There is a situation found in many manufacturing systems, such as steel rolling mills, fire fighting or single-server cycle-queues, where a job that is processed later consumes more time than that same job when processed earlier. The research finds that machine maintenance can improve the worsening of processing conditions. After maintenance activity, the machine will be restored. The maintenance duration is a positive and non-decreasing differentiable convex function of the total processing times of the jobs between maintenance activities. Motivated by this observation, the makespan and the total completion time minimization problems in the scheduling of jobs with non-decreasing rates of job processing time on a single machine are considered in this article. It is shown that both the makespan and the total completion time minimization problems are NP-hard in the strong sense when the number of maintenance activities is arbitrary, while the makespan minimization problem is NP-hard in the ordinary sense when the number of maintenance activities is fixed. If the deterioration rates of the jobs are identical and the maintenance duration is a linear function of the total processing times of the jobs between maintenance activities, then this article shows that the group balance principle is satisfied for the makespan minimization problem. Furthermore, two polynomial-time algorithms are presented for solving the makespan problem and the total completion time problem under identical deterioration rates, respectively.

Stochastic flow shop scheduling of overlapping jobs on tandem machines in application to optimizing the US Army's deliberate nuclear, biological, and chemical decontamination process, (final report). Master's thesis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Novikov, V.

1991-05-01

The U.S. Army's detailed equipment decontamination process is a stochastic flow shop which has N independent non-identical jobs (vehicles) which have overlapping processing times. This flow shop consists of up to six non-identical machines (stations). With the exception of one station, the processing times of the jobs are random variables. Based on an analysis of the processing times, the jobs for the 56 Army heavy division companies were scheduled according to the best shortest expected processing time - longest expected processing time (SEPT-LEPT) sequence. To assist in this scheduling the Gap Comparison Heuristic was developed to select the best SEPT-LEPTmore » schedule. This schedule was then used in balancing the detailed equipment decon line in order to find the best possible site configuration subject to several constraints. The detailed troop decon line, in which all jobs are independent and identically distributed, was then balanced. Lastly, an NBC decon optimization computer program was developed using the scheduling and line balancing results. This program serves as a prototype module for the ANBACIS automated NBC decision support system.... Decontamination, Stochastic flow shop, Scheduling, Stochastic scheduling, Minimization of the makespan, SEPT-LEPT Sequences, Flow shop line balancing, ANBACIS.« less

Performance of Extended Local Clustering Organization (LCO) for Large Scale Job-Shop Scheduling Problem (JSP)

NASA Astrophysics Data System (ADS)

Konno, Yohko; Suzuki, Keiji

This paper describes an approach to development of a solution algorithm of a general-purpose for large scale problems using “Local Clustering Organization (LCO)” as a new solution for Job-shop scheduling problem (JSP). Using a performance effective large scale scheduling in the study of usual LCO, a solving JSP keep stability induced better solution is examined. In this study for an improvement of a performance of a solution for JSP, processes to a optimization by LCO is examined, and a scheduling solution-structure is extended to a new solution-structure based on machine-division. A solving method introduced into effective local clustering for the solution-structure is proposed as an extended LCO. An extended LCO has an algorithm which improves scheduling evaluation efficiently by clustering of parallel search which extends over plural machines. A result verified by an application of extended LCO on various scale of problems proved to conduce to minimizing make-span and improving on the stable performance.

A Dynamic Scheduling Method of Earth-Observing Satellites by Employing Rolling Horizon Strategy

PubMed Central

Dishan, Qiu; Chuan, He; Jin, Liu; Manhao, Ma

2013-01-01

Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments. PMID:23690742

Job sharing in clinical nutrition management: a plan for successful implementation.

PubMed

Visocan, B J; Herold, L S; Mulcahy, M J; Schlosser, M F

1993-10-01

While women continue to enter the American work force in record numbers; many experience difficulty in juggling career and family obligations. Flexible scheduling is one option used to ease work and family pressures. Women's changing work roles have potentially noteworthy implications for clinical nutrition management, a traditionally female-dominated profession where the recruitment and retention of valued, experienced registered dietitians can prove to be a human resources challenge. Job sharing, one type of flexible scheduling, is applicable to the nutrition management arena. This article describes and offers a plan for overcoming obstacles to job sharing, including determining feasibility, gaining support of top management, establishing program design, announcing the job share program, and using implementation, monitoring, and fine-tuning strategies. Benefits that can be derived from a successful job share are reduced absenteeism, decreased turnover, enhanced recruitment, improved morale, increased productivity, improved job coverage, and enhanced skills and knowledge base. A case study illustrates one method for achieving job sharing success in clinical nutrition management.

Alternative work schedules for female pharmacists.

PubMed

Mason, N A; Perry, W R; Ryan, M L

1991-01-01

The impact of the increased proportion of women in pharmacy is discussed, and two leadership positions for which part-time work schedules were implemented are described. Issues associated with the increased representation of women include pharmacist shortages, loss of future leaders, decreased staff productivity related to inadequate day-care services, and a reduced earning potential of pharmacists. Many of these problems can be addressed by altering benefit packages and work schedules to enable employees to raise children while continuing to work. Specific strategies include legislation, day-care programs, flex time and flex scheduling, telecommuting, and the creation of alternative work schedules or permanent part-time positions. At the University of Michigan, a part-time position that combines faculty and clinical responsibilities has been in place since 1988. At The Washington Hospital Center, one of the three assistant director of pharmacy positions is part-time. The women in both positions have met or exceeded job performance requirements while raising a family. Issues raised by the increasing number of female pharmacists must be addressed by the profession. Part-time work schedules are one strategy for enabling female pharmacists to meet both their family and career responsibilities.

SPANR planning and scheduling

NASA Astrophysics Data System (ADS)

Freund, Richard F.; Braun, Tracy D.; Kussow, Matthew; Godfrey, Michael; Koyama, Terry

2001-07-01

SPANR (Schedule, Plan, Assess Networked Resources) is (i) a pre-run, off-line planning and (ii) a runtime, just-in-time scheduling mechanism. It is designed to support primarily commercial applications in that it optimizes throughput rather than individual jobs (unless they have highest priority). Thus it is a tool for a commercial production manager to maximize total work. First the SPANR Planner is presented showing the ability to do predictive 'what-if' planning. It can answer such questions as, (i) what is the overall effect of acquiring new hardware or (ii) what would be the effect of a different scheduler. The ability of the SPANR Planner to formulate in advance tree-trimming strategies is useful in several commercial applications, such as electronic design or pharmaceutical simulations. The SPANR Planner is demonstrated using a variety of benchmarks. The SPANR Runtime Scheduler (RS) is briefly presented. The SPANR RS can provide benefit for several commercial applications, such as airframe design and financial applications. Finally a design is shown whereby SPANR can provide scheduling advice to most resource management systems.

Scheduling multicore workload on shared multipurpose clusters

NASA Astrophysics Data System (ADS)

Templon, J. A.; Acosta-Silva, C.; Flix Molina, J.; Forti, A. C.; Pérez-Calero Yzquierdo, A.; Starink, R.

2015-12-01

With the advent of workloads containing explicit requests for multiple cores in a single grid job, grid sites faced a new set of challenges in workload scheduling. The most common batch schedulers deployed at HEP computing sites do a poor job at multicore scheduling when using only the native capabilities of those schedulers. This paper describes how efficient multicore scheduling was achieved at the sites the authors represent, by implementing dynamically-sized multicore partitions via a minimalistic addition to the Torque/Maui batch system already in use at those sites. The paper further includes example results from use of the system in production, as well as measurements on the dependence of performance (especially the ramp-up in throughput for multicore jobs) on node size and job size.

Block Scheduling: Teaching Strategies for the Restructured School Day.

ERIC Educational Resources Information Center

National Science Teachers Association, Arlington, VA.

This book is a compilation of articles taken from the National Science Teachers Association (NSTA) journal entitled "The Science Teacher" that pertain to block scheduling and strategies for effective science instruction within this framework. Articles include "Blockbuster Ideas" (Judy Bohince and Ireve King), "Tackling Block Scheduling" (Martha M.…

Space communications scheduler: A rule-based approach to adaptive deadline scheduling

NASA Technical Reports Server (NTRS)

Straguzzi, Nicholas

1990-01-01

Job scheduling is a deceptively complex subfield of computer science. The highly combinatorial nature of the problem, which is NP-complete in nearly all cases, requires a scheduling program to intelligently transverse an immense search tree to create the best possible schedule in a minimal amount of time. In addition, the program must continually make adjustments to the initial schedule when faced with last-minute user requests, cancellations, unexpected device failures, quests, cancellations, unexpected device failures, etc. A good scheduler must be quick, flexible, and efficient, even at the expense of generating slightly less-than-optimal schedules. The Space Communication Scheduler (SCS) is an intelligent rule-based scheduling system. SCS is an adaptive deadline scheduler which allocates modular communications resources to meet an ordered set of user-specified job requests on board the NASA Space Station. SCS uses pattern matching techniques to detect potential conflicts through algorithmic and heuristic means. As a result, the system generates and maintains high density schedules without relying heavily on backtracking or blind search techniques. SCS is suitable for many common real-world applications.

More reliable protein NMR peak assignment via improved 2-interval scheduling.

PubMed

Chen, Zhi-Zhong; Lin, Guohui; Rizzi, Romeo; Wen, Jianjun; Xu, Dong; Xu, Ying; Jiang, Tao

2005-03-01

Protein NMR peak assignment refers to the process of assigning a group of "spin systems" obtained experimentally to a protein sequence of amino acids. The automation of this process is still an unsolved and challenging problem in NMR protein structure determination. Recently, protein NMR peak assignment has been formulated as an interval scheduling problem (ISP), where a protein sequence P of amino acids is viewed as a discrete time interval I (the amino acids on P one-to-one correspond to the time units of I), each subset S of spin systems that are known to originate from consecutive amino acids from P is viewed as a "job" j(s), the preference of assigning S to a subsequence P of consecutive amino acids on P is viewed as the profit of executing job j(s) in the subinterval of I corresponding to P, and the goal is to maximize the total profit of executing the jobs (on a single machine) during I. The interval scheduling problem is max SNP-hard in general; but in the real practice of protein NMR peak assignment, each job j(s) usually requires at most 10 consecutive time units, and typically the jobs that require one or two consecutive time units are the most difficult to assign/schedule. In order to solve these most difficult assignments, we present an efficient 13/7-approximation algorithm for the special case of the interval scheduling problem where each job takes one or two consecutive time units. Combining this algorithm with a greedy filtering strategy for handling long jobs (i.e., jobs that need more than two consecutive time units), we obtain a new efficient heuristic for protein NMR peak assignment. Our experimental study shows that the new heuristic produces the best peak assignment in most of the cases, compared with the NMR peak assignment algorithms in the recent literature. The above algorithm is also the first approximation algorithm for a nontrivial case of the well-known interval scheduling problem that breaks the ratio 2 barrier.

Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment

PubMed Central

Wan, Long

2014-01-01

We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example. PMID:25147861

Manipulating Tabu List to Handle Machine Breakdowns in Job Shop Scheduling Problems

NASA Astrophysics Data System (ADS)

Nababan, Erna Budhiarti; SalimSitompul, Opim

2011-06-01

Machine breakdowns in a production schedule may occur on a random basis that make the well-known hard combinatorial problem of Job Shop Scheduling Problems (JSSP) becomes more complex. One of popular techniques used to solve the combinatorial problems is Tabu Search. In this technique, moves that will be not allowed to be revisited are retained in a tabu list in order to avoid in gaining solutions that have been obtained previously. In this paper, we propose an algorithm to employ a second tabu list to keep broken machines, in addition to the tabu list that keeps the moves. The period of how long the broken machines will be kept on the list is categorized using fuzzy membership function. Our technique are tested to the benchmark data of JSSP available on the OR library. From the experiment, we found that our algorithm is promising to help a decision maker to face the event of machine breakdowns.

Scheduling Real-Time Mixed-Criticality Jobs

NASA Astrophysics Data System (ADS)

Baruah, Sanjoy K.; Bonifaci, Vincenzo; D'Angelo, Gianlorenzo; Li, Haohan; Marchetti-Spaccamela, Alberto; Megow, Nicole; Stougie, Leen

Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such "mixed-criticality" systems give rise to interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. In this paper, we study a formal model for representing such mixed-criticality workloads. We demonstrate first the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements, even for systems subject to two sets of certification requirements. Then we quantify, via the metric of processor speedup factor, the effectiveness of two techniques, reservation-based scheduling and priority-based scheduling, that are widely used in scheduling such mixed-criticality systems, showing that the latter of the two is superior to the former. We also show that the speedup factors are tight for these two techniques.

Cloud computing task scheduling strategy based on improved differential evolution algorithm

NASA Astrophysics Data System (ADS)

Ge, Junwei; He, Qian; Fang, Yiqiu

2017-04-01

In order to optimize the cloud computing task scheduling scheme, an improved differential evolution algorithm for cloud computing task scheduling is proposed. Firstly, the cloud computing task scheduling model, according to the model of the fitness function, and then used improved optimization calculation of the fitness function of the evolutionary algorithm, according to the evolution of generation of dynamic selection strategy through dynamic mutation strategy to ensure the global and local search ability. The performance test experiment was carried out in the CloudSim simulation platform, the experimental results show that the improved differential evolution algorithm can reduce the cloud computing task execution time and user cost saving, good implementation of the optimal scheduling of cloud computing tasks.

A Solution Method of Job-shop Scheduling Problems by the Idle Time Shortening Type Genetic Algorithm

NASA Astrophysics Data System (ADS)

Ida, Kenichi; Osawa, Akira

In this paper, we propose a new idle time shortening method for Job-shop scheduling problems (JSPs). We insert its method into a genetic algorithm (GA). The purpose of JSP is to find a schedule with the minimum makespan. We suppose that it is effective to reduce idle time of a machine in order to improve the makespan. The left shift is a famous algorithm in existing algorithms for shortening idle time. The left shift can not arrange the work to idle time. For that reason, some idle times are not shortened by the left shift. We propose two kinds of algorithms which shorten such idle time. Next, we combine these algorithms and the reversal of a schedule. We apply GA with its algorithm to benchmark problems and we show its effectiveness.

Daily Use of Energy Management Strategies and Occupational Well-being: The Moderating Role of Job Demands.

PubMed

Parker, Stacey L; Zacher, Hannes; de Bloom, Jessica; Verton, Thomas M; Lentink, Corine R

2017-01-01

We examine the relationships among employees' use of energy management strategies and two occupational well-being outcomes: job satisfaction and emotional exhaustion. Based on conservation of resources theory, it was hypothesized that employees with high job demands would benefit more from using energy management strategies (i.e., including prosocial, organizing, and meaning-related strategies), compared to employees with low job demands. We tested this proposition using a quantitative diary study. Fifty-four employees provided data twice daily across one work week (on average, 7 daily entries). Supporting the hypotheses, prosocial energy management was positively related to job satisfaction. Moreover, employees with high job demands were less emotionally exhausted when using prosocial strategies. Contrary to predictions, when using organizing strategies, employees with low job demands had higher job satisfaction and lower emotional exhaustion. Under high job demands, greater use of organizing strategies was associated with lower job satisfaction and higher emotional exhaustion. Finally, use of meaning-related strategies was associated with higher emotional exhaustion when job demands were low. With this research, we position energy management as part of a resource investment process aimed at maintaining and improving occupational well-being. Our findings show that this resource investment will be more or less effective depending on the type of strategy used and the existing drain on resources (i.e., job demands). This is the first study to examine momentary effects of distinct types of work-related energy management strategies on occupational well-being.

Daily Use of Energy Management Strategies and Occupational Well-being: The Moderating Role of Job Demands

PubMed Central

Parker, Stacey L.; Zacher, Hannes; de Bloom, Jessica; Verton, Thomas M.; Lentink, Corine R.

2017-01-01

We examine the relationships among employees’ use of energy management strategies and two occupational well-being outcomes: job satisfaction and emotional exhaustion. Based on conservation of resources theory, it was hypothesized that employees with high job demands would benefit more from using energy management strategies (i.e., including prosocial, organizing, and meaning-related strategies), compared to employees with low job demands. We tested this proposition using a quantitative diary study. Fifty-four employees provided data twice daily across one work week (on average, 7 daily entries). Supporting the hypotheses, prosocial energy management was positively related to job satisfaction. Moreover, employees with high job demands were less emotionally exhausted when using prosocial strategies. Contrary to predictions, when using organizing strategies, employees with low job demands had higher job satisfaction and lower emotional exhaustion. Under high job demands, greater use of organizing strategies was associated with lower job satisfaction and higher emotional exhaustion. Finally, use of meaning-related strategies was associated with higher emotional exhaustion when job demands were low. With this research, we position energy management as part of a resource investment process aimed at maintaining and improving occupational well-being. Our findings show that this resource investment will be more or less effective depending on the type of strategy used and the existing drain on resources (i.e., job demands). This is the first study to examine momentary effects of distinct types of work-related energy management strategies on occupational well-being. PMID:28912741

Work stressors, Chinese coping strategies, and job performance in Greater China.

PubMed

Lu, Luo; Kao, Shu-Fang; Siu, Oi-Ling; Lu, Chang-Qin

2010-08-01

The aim of this research was to jointly test effects of work stressors and coping strategies on job performance among employees in the Greater China region. A self-administered survey was conducted to collect data from three major cities in the region, namely Beijing, Hong Kong, and Taipei (N = 380). Four important work stressors were assessed: heavy workload, organizational constraints, lack of work autonomy, and interpersonal conflict. We used a four-factor model of Chinese coping strategies composed of hobbies/relaxation, active action, seeking social support, and passive adaptation. Job performance was indicated by both task performance (quantity of work, quality of work, job knowledge) and contextual performance (attendance, getting along with others). We found that: (1) work stressors were related to job performance. Specifically, workload had a positive relation with quantity of work, whereas organizational constraints had negative relations with quantity of work and attendance. In addition, interpersonal conflict had a negative relation with getting along with others. (2) Chinese positive coping strategies were positively related to job performance. Specifically, seeking social support had positive relations with quantity of work and getting along with others, whereas active action had positive relations with attendance and job knowledge. (3) Chinese passive adaptation coping behaviors were negatively related to job performance. Specifically, passive adaptation had negative relations with quantity of work, quality of work, and getting along with others. The present study thus found joint effects of work stressors and coping behaviors among Chinese employees in the Greater China region, encompassing three sub-societies of mainland China, Hong Kong, and Taiwan. Differential effects of Chinese positive and passive coping strategies were also noted. Most importantly, all these effects were demonstrated on multiple indicators of job performance, a rarely studied

New VLBI2010 scheduling strategies and implications on the terrestrial reference frames.

PubMed

Sun, Jing; Böhm, Johannes; Nilsson, Tobias; Krásná, Hana; Böhm, Sigrid; Schuh, Harald

In connection with the work for the next generation VLBI2010 Global Observing System (VGOS) of the International VLBI Service for Geodesy and Astrometry, a new scheduling package (Vie_Sched) has been developed at the Vienna University of Technology as a part of the Vienna VLBI Software. In addition to the classical station-based approach it is equipped with a new scheduling strategy based on the radio sources to be observed. We introduce different configurations of source-based scheduling options and investigate the implications on present and future VLBI2010 geodetic schedules. By comparison to existing VLBI schedules of the continuous campaign CONT11, we find that the source-based approach with two sources has a performance similar to the station-based approach in terms of number of observations, sky coverage, and geodetic parameters. For an artificial 16 station VLBI2010 network, the source-based approach with four sources provides an improved distribution of source observations on the celestial sphere. Monte Carlo simulations yield slightly better repeatabilities of station coordinates with the source-based approach with two sources or four sources than the classical strategy. The new VLBI scheduling software with its alternative scheduling strategy offers a promising option with respect to applications of the VGOS.

New VLBI2010 scheduling strategies and implications on the terrestrial reference frames

NASA Astrophysics Data System (ADS)

Sun, Jing; Böhm, Johannes; Nilsson, Tobias; Krásná, Hana; Böhm, Sigrid; Schuh, Harald

2014-05-01

In connection with the work for the next generation VLBI2010 Global Observing System (VGOS) of the International VLBI Service for Geodesy and Astrometry, a new scheduling package (Vie_Sched) has been developed at the Vienna University of Technology as a part of the Vienna VLBI Software. In addition to the classical station-based approach it is equipped with a new scheduling strategy based on the radio sources to be observed. We introduce different configurations of source-based scheduling options and investigate the implications on present and future VLBI2010 geodetic schedules. By comparison to existing VLBI schedules of the continuous campaign CONT11, we find that the source-based approach with two sources has a performance similar to the station-based approach in terms of number of observations, sky coverage, and geodetic parameters. For an artificial 16 station VLBI2010 network, the source-based approach with four sources provides an improved distribution of source observations on the celestial sphere. Monte Carlo simulations yield slightly better repeatabilities of station coordinates with the source-based approach with two sources or four sources than the classical strategy. The new VLBI scheduling software with its alternative scheduling strategy offers a promising option with respect to applications of the VGOS.

Employer retention strategies and their effect on nurses' job satisfaction and intent to stay.

PubMed

Ellenbecker, Carol Hall; Samia, Linda; Cushman, Margaret J; Porell, Frank W

2007-01-01

Faced with a nursing shortage and anticipated increase in demand, home care agencies are implementing retention strategies with little knowledge of their effectiveness. The purpose of this study is to describe the strategies implemented and their effect on nurse job satisfaction and intention to leave. Data were collected from a random sample of 123 New England agencies during in-person interviews. Most agencies reported implementing multiple recruitment and retention strategies. Regression results suggest that the effects of employer retention strategy on nurses' intent to stay are the indirect result of its effects on job satisfaction. The only retention intervention that made a statistically significant difference in job satisfaction was shared governance, and no retention strategy directly affected nurses' intention to stay in their jobs.

The relationship between emotion regulation strategies and job search behavior among fourth-year university students.

PubMed

Wang, Ling; Xu, Huihui; Zhang, Xue; Fang, Ping

2017-08-01

The job search process is a stressful experience. This study investigated the effect of emotion regulation strategies on job search behavior in combination with anxiety and job search self-efficacy among Chinese university fourth-year students (N = 816, mean age = 21.98, 31.5% male, 34.9% majored in science, 18.0% from "211 Project" universities). Results showed that cognitive reappraisal was positively related to job search behavior, while expressive suppression was negatively related to job search behavior. Additionally, anxiety was negatively related to job search behavior, while job search self-efficacy was positively associated with job search behavior. Moreover, both anxiety and job search self-efficacy mediated the relationship between emotion regulation strategies and job search behavior. In general, emotion regulation strategies played an important role in job search behavior. Implications include the notion that emotion regulation interventions may be helpful to increase job search behavior among university students. Copyright © 2017 The Foundation for Professionals in Services for Adolescents. Published by Elsevier Ltd. All rights reserved.

A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling.

PubMed

Deng, Qianwang; Gong, Guiliang; Gong, Xuran; Zhang, Like; Liu, Wei; Ren, Qinghua

2017-01-01

Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload of all machines. It adopts a two-stage optimization mechanism during the optimizing process. In the first stage, the NSGA-II algorithm with T iteration times is first used to obtain the initial population N , in which a bee evolutionary guiding scheme is presented to exploit the solution space extensively. In the second stage, the NSGA-II algorithm with GEN iteration times is used again to obtain the Pareto-optimal solutions. In order to enhance the searching ability and avoid the premature convergence, an updating mechanism is employed in this stage. More specifically, its population consists of three parts, and each of them changes with the iteration times. What is more, numerical simulations are carried out which are based on some published benchmark instances. Finally, the effectiveness of the proposed BEG-NSGA-II algorithm is shown by comparing the experimental results and the results of some well-known algorithms already existed.

A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling

PubMed Central

Deng, Qianwang; Gong, Xuran; Zhang, Like; Liu, Wei; Ren, Qinghua

2017-01-01

Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload of all machines. It adopts a two-stage optimization mechanism during the optimizing process. In the first stage, the NSGA-II algorithm with T iteration times is first used to obtain the initial population N, in which a bee evolutionary guiding scheme is presented to exploit the solution space extensively. In the second stage, the NSGA-II algorithm with GEN iteration times is used again to obtain the Pareto-optimal solutions. In order to enhance the searching ability and avoid the premature convergence, an updating mechanism is employed in this stage. More specifically, its population consists of three parts, and each of them changes with the iteration times. What is more, numerical simulations are carried out which are based on some published benchmark instances. Finally, the effectiveness of the proposed BEG-NSGA-II algorithm is shown by comparing the experimental results and the results of some well-known algorithms already existed. PMID:28458687

Electric Vehicles Charging Scheduling Strategy Considering the Uncertainty of Photovoltaic Output

NASA Astrophysics Data System (ADS)

Wei, Xiangxiang; Su, Su; Yue, Yunli; Wang, Wei; He, Luobin; Li, Hao; Ota, Yutaka

2017-05-01

The rapid development of electric vehicles and distributed generation bring new challenges to security and economic operation of the power system, so the collaborative research of the EVs and the distributed generation have important significance in distribution network. Under this background, an EVs charging scheduling strategy considering the uncertainty of photovoltaic(PV) output is proposed. The characteristics of EVs charging are analysed first. A PV output prediction method is proposed with a PV database then. On this basis, an EVs charging scheduling strategy is proposed with the goal to satisfy EVs users’ charging willingness and decrease the power loss in distribution network. The case study proves that the proposed PV output prediction method can predict the PV output accurately and the EVs charging scheduling strategy can reduce the power loss and stabilize the fluctuation of the load in distributed network.

Binary Trees and Parallel Scheduling Algorithms.

DTIC Science & Technology

1980-09-01

been pro- cessed for p. time units. If a job does not complete by its due time, it is tardy. In a nonpreemptive schedule, job i is scheduled to process...the preemptive schedule obtained by the algorithm of section 2.1.2 also minimizes 5Ti, this problem is easily solved in parallel. When lci is to e...August 1978, pp. 657-661. 14. Horn, W. A., "Some simple scheduling algorithms," Naval Res. Logist . Qur., Vol. 21, pp. 177-185, 1974. i5. Hforowitz, E

Organisational change stressors and nursing job satisfaction: the mediating effect of coping strategies.

PubMed

Teo, Stephen T T; Pick, David; Newton, Cameron J; Yeung, Melissa E; Chang, Esther

2013-09-01

To examine the mediating effect of coping strategies on the consequences of nursing and non-nursing (administrative) stressors on the job satisfaction of nurses during change management. Organisational change can result in an increase in nursing and non-nursing-related stressors, which can have a negative impact on the job satisfaction of nurses employed in health-care organisations. Matched data were collected in 2009 via an online survey at two time-points (six months apart). Partial least squares path analysis revealed a significant causal relationship between Time 1 administrative and role stressors and an increase in nursing-specific stressors in Time 2. A significant relationship was also identified between job-specific nursing stressors and the adoption of effective coping strategies to deal with increased levels of change-induced stress and strain and the likelihood of reporting higher levels of job satisfaction in Time 2. The effectiveness of coping strategies is critical in helping nurses to deal with the negative consequences of organisational change. This study shows that there is a causal relationship between change, non-nursing stressors and job satisfaction. Senior management should implement strategies aimed at reducing nursing and non-nursing stress during change in order to enhance the job satisfaction of nurses. © 2013 John Wiley & Sons Ltd.

An algorithm for a single machine scheduling problem with sequence dependent setup times and scheduling windows

NASA Technical Reports Server (NTRS)

Moore, J. E.

1975-01-01

An enumeration algorithm is presented for solving a scheduling problem similar to the single machine job shop problem with sequence dependent setup times. The scheduling problem differs from the job shop problem in two ways. First, its objective is to select an optimum subset of the available tasks to be performed during a fixed period of time. Secondly, each task scheduled is constrained to occur within its particular scheduling window. The algorithm is currently being used to develop typical observational timelines for a telescope that will be operated in earth orbit. Computational times associated with timeline development are presented.

Strategies for Involving the Private Sector in Job Training Programs.

ERIC Educational Resources Information Center

Greenwood, Katy; And Others

This two-part report describes various strategies for involving the private sector in job training programs and summarizes a study conducted with prime sponsors of Comprehensive Employment and Training Act (CETA) programs in Texas. Included in a discussion of involving the private sector in job training programs are the following topics: the new…

Analysis of Application Power and Schedule Composition in a High Performance Computing Environment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Elmore, Ryan; Gruchalla, Kenny; Phillips, Caleb

As the capacity of high performance computing (HPC) systems continues to grow, small changes in energy management have the potential to produce significant energy savings. In this paper, we employ an extensive informatics system for aggregating and analyzing real-time performance and power use data to evaluate energy footprints of jobs running in an HPC data center. We look at the effects of algorithmic choices for a given job on the resulting energy footprints, and analyze application-specific power consumption, and summarize average power use in the aggregate. All of these views reveal meaningful power variance between classes of applications as wellmore » as chosen methods for a given job. Using these data, we discuss energy-aware cost-saving strategies based on reordering the HPC job schedule. Using historical job and power data, we present a hypothetical job schedule reordering that: (1) reduces the facility's peak power draw and (2) manages power in conjunction with a large-scale photovoltaic array. Lastly, we leverage this data to understand the practical limits on predicting key power use metrics at the time of submission.« less

Coping with Powerlessness: The Relationship of Gender and Job Dependency to Empowerment-Strategy Usage.

ERIC Educational Resources Information Center

Mainiero, Lisa A.

1986-01-01

Critical incident interviews of males and females determined coping strategies used during frustrating workplace situations of powerlessness because of dependency on others. Although men and women did not differ in relative job power, women more frequently used an acquiescence strategy. Job dependency, however, determined this strategy more than…

Training and certification of work schedule managers may improve shift scheduling practices

DOT National Transportation Integrated Search

2011-02-01

The Federal Railroad Administration (FRA) Human Factors Research and Development (R&D) Program : sponsored the implementation of a strategic job analysis to investigate the job of work schedule managers : (WSMs) across a diverse range of industries t...

Flexible Job-Shop Scheduling with Dual-Resource Constraints to Minimize Tardiness Using Genetic Algorithm

NASA Astrophysics Data System (ADS)

Paksi, A. B. N.; Ma'ruf, A.

2016-02-01

In general, both machines and human resources are needed for processing a job on production floor. However, most classical scheduling problems have ignored the possible constraint caused by availability of workers and have considered only machines as a limited resource. In addition, along with production technology development, routing flexibility appears as a consequence of high product variety and medium demand for each product. Routing flexibility is caused by capability of machines that offers more than one machining process. This paper presents a method to address scheduling problem constrained by both machines and workers, considering routing flexibility. Scheduling in a Dual-Resource Constrained shop is categorized as NP-hard problem that needs long computational time. Meta-heuristic approach, based on Genetic Algorithm, is used due to its practical implementation in industry. Developed Genetic Algorithm uses indirect chromosome representative and procedure to transform chromosome into Gantt chart. Genetic operators, namely selection, elitism, crossover, and mutation are developed to search the best fitness value until steady state condition is achieved. A case study in a manufacturing SME is used to minimize tardiness as objective function. The algorithm has shown 25.6% reduction of tardiness, equal to 43.5 hours.

Work conditions and the food choice coping strategies of employed parents.

PubMed

Devine, Carol M; Farrell, Tracy J; Blake, Christine E; Jastran, Margaret; Wethington, Elaine; Bisogni, Carole A

2009-01-01

How work conditions relate to parents' food choice coping strategies. Pilot telephone survey. City in the northeastern United States (US). Black, white, and Hispanic employed mothers (25) and fathers (25) randomly recruited from low-/moderate-income zip codes; 78% of those reached and eligible participated. Sociodemographic characteristics; work conditions (hours, shift, job schedule, security, satisfaction, food access); food choice coping strategies (22 behavioral items for managing food in response to work and family demands (ie, food prepared at/away from home, missing meals, individualizing meals, speeding up, planning). Two-tailed chi-square and Fisher exact tests (P < or = .05, unless noted). Half or more of respondents often/sometimes used 12 of 22 food choice coping strategies. Long hours and nonstandard hours and schedules were positively associated among fathers with take-out meals, missed family meals, prepared entrees, and eating while working; and among mothers with restaurant meals, missed breakfast, and prepared entrees. Job security, satisfaction, and food access were also associated with gender-specific strategies. Structural work conditions among parents such as job hours, schedule, satisfaction, and food access are associated with food choice coping strategies with importance for dietary quality. Findings have implications for worksite interventions but need examination in a larger sample.

A microeconomic scheduler for parallel computers

NASA Technical Reports Server (NTRS)

Stoica, Ion; Abdel-Wahab, Hussein; Pothen, Alex

1995-01-01

We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to the classical objectives of increasing the system throughput and reducing the response time, we consider fairness in allocating system resources among the users, and providing the user with control over the relative performances of his jobs. We associate with every user a savings account in which he receives money at a constant rate. When a user wants to run a job, he creates an expense account for that job to which he transfers money from his savings account. The job uses the funds in its expense account to obtain the system resources it needs for execution. The share of the system resources allocated to the user is directly related to the rate at which the user receives money; the rate at which the user transfers money into a job expense account controls the job's performance. We prove that starvation is not possible in our model. Simulation results show that our scheduler improves both system and user performances in comparison with two different variable partitioning policies. It is also shown to be effective in guaranteeing fairness and providing control over the performance of jobs.

A best on-line algorithm for single machine scheduling the equal length jobs with the special chain precedence and delivery time

NASA Astrophysics Data System (ADS)

Gu, Cunchang; Mu, Yundong

2013-03-01

In this paper, we consider a single machine on-line scheduling problem with the special chains precedence and delivery time. All jobs arrive over time. The chains chainsi arrive at time ri , it is known that the processing and delivery time of each job on the chain satisfy one special condition CD a forehand: if the job J(i)j is the predecessor of the job J(i)k on the chain chaini, then they satisfy p(i)j = p(i)k = p >= qj >= qk , i = 1,2, ---,n , where pj and qj denote the processing time and the delivery time of the job Jj respectively. Obviously, if the arrival jobs have no chains precedence, it shows that the length of the corresponding chain is 1. The objective is to minimize the time by which all jobs have been delivered. We provide an on-line algorithm with a competitive ratio of √2 , and the result is the best possible.

Car painting process scheduling with harmony search algorithm

NASA Astrophysics Data System (ADS)

Syahputra, M. F.; Maiyasya, A.; Purnamawati, S.; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.

2018-02-01

Automotive painting program in the process of painting the car body by using robot power, making efficiency in the production system. Production system will be more efficient if pay attention to scheduling of car order which will be done by considering painting body shape of car. Flow shop scheduling is a scheduling model in which the job-job to be processed entirely flows in the same product direction / path. Scheduling problems often arise if there are n jobs to be processed on the machine, which must be specified which must be done first and how to allocate jobs on the machine to obtain a scheduled production process. Harmony Search Algorithm is a metaheuristic optimization algorithm based on music. The algorithm is inspired by observations that lead to music in search of perfect harmony. This musical harmony is in line to find optimal in the optimization process. Based on the tests that have been done, obtained the optimal car sequence with minimum makespan value.

Techniques for cash management in scheduling manufacturing operations

NASA Astrophysics Data System (ADS)

Morady Gohareh, Mehdy; Shams Gharneh, Naser; Ghasemy Yaghin, Reza

2017-06-01

The objective in traditional scheduling is usually time based. Minimizing the makespan, total flow times, total tardi costs, etc. are instances of these objectives. In manufacturing, processing each job entails a cost paying and price receiving. Thus, the objective should include some notion of managing the flow of cash. We have defined two new objectives: maximization of average and minimum available cash. For single machine scheduling, it is demonstrated that scheduling jobs in decreasing order of profit ratios maximizes the former and improves productivity. Moreover, scheduling jobs in increasing order of costs and breaking ties in decreasing order of prices maximizes the latter and creates protection against financial instability.

Uncertainty management by relaxation of conflicting constraints in production process scheduling

NASA Technical Reports Server (NTRS)

Dorn, Juergen; Slany, Wolfgang; Stary, Christian

1992-01-01

Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.

Alumni Job Search Strategies, Class of 2011. GMAC[R] Data-to-Go Series

ERIC Educational Resources Information Center

Graduate Management Admission Council, 2012

2012-01-01

Examining the job search strategies and employment outcomes for Class of 2011 graduate business school alumni sheds light on current job market trends and the effort required to secure a first job after earning a graduate business degree. This fact sheet highlights the job search methods used by Class of 2011 business school graduates as reported…

20 CFR 638.505 - Scheduling of training.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false Scheduling of training. 638.505 Section 638.505 Employees' Benefits EMPLOYMENT AND TRAINING ADMINISTRATION, DEPARTMENT OF LABOR JOB CORPS PROGRAM UNDER TITLE IV-B OF THE JOB TRAINING PARTNERSHIP ACT Center Operations § 638.505 Scheduling of training...

Peer-to-peer Cooperative Scheduling Architecture for National Grid Infrastructure

NASA Astrophysics Data System (ADS)

Matyska, Ludek; Ruda, Miroslav; Toth, Simon

For some ten years, the Czech National Grid Infrastructure MetaCentrum uses a single central PBSPro installation to schedule jobs across the country. This centralized approach keeps a full track about all the clusters, providing support for jobs spanning several sites, implementation for the fair-share policy and better overall control of the grid environment. Despite a steady progress in the increased stability and resilience to intermittent very short network failures, growing number of sites and processors makes this architecture, with a single point of failure and scalability limits, obsolete. As a result, a new scheduling architecture is proposed, which relies on higher autonomy of clusters. It is based on a peer to peer network of semi-independent schedulers for each site or even cluster. Each scheduler accepts jobs for the whole infrastructure, cooperating with other schedulers on implementation of global policies like central job accounting, fair-share, or submission of jobs across several sites. The scheduling system is integrated with the Magrathea system to support scheduling of virtual clusters, including the setup of their internal network, again eventually spanning several sites. On the other hand, each scheduler is local to one of several clusters and is able to directly control and submit jobs to them even if the connection of other scheduling peers is lost. In parallel to the change of the overall architecture, the scheduling system itself is being replaced. Instead of PBSPro, chosen originally for its declared support of large scale distributed environment, the new scheduling architecture is based on the open-source Torque system. The implementation and support for the most desired properties in PBSPro and Torque are discussed and the necessary modifications to Torque to support the MetaCentrum scheduling architecture are presented, too.

Production scheduling and rescheduling with genetic algorithms.

PubMed

Bierwirth, C; Mattfeld, D C

1999-01-01

A general model for job shop scheduling is described which applies to static, dynamic and non-deterministic production environments. Next, a Genetic Algorithm is presented which solves the job shop scheduling problem. This algorithm is tested in a dynamic environment under different workload situations. Thereby, a highly efficient decoding procedure is proposed which strongly improves the quality of schedules. Finally, this technique is tested for scheduling and rescheduling in a non-deterministic environment. It is shown by experiment that conventional methods of production control are clearly outperformed at reasonable run-time costs.

A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.

PubMed

Hart, Emma; Sim, Kevin

2016-01-01

We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics composed of linear sequences of dispatching rules: each rule is represented using a tree structure and is itself evolved. Following a training period, the ensemble is shown to outperform both existing dispatching rules and a standard genetic programming algorithm on a large set of new test instances. In addition, it obtains superior results on a set of 210 benchmark problems from the literature when compared to two state-of-the-art hyper-heuristic approaches. Further analysis of the relationship between heuristics in the evolved ensemble and the instances each solves provides new insights into features that might describe similar instances.

Multi-objective flexible job shop scheduling problem using variable neighborhood evolutionary algorithm

NASA Astrophysics Data System (ADS)

Wang, Chun; Ji, Zhicheng; Wang, Yan

2017-07-01

In this paper, multi-objective flexible job shop scheduling problem (MOFJSP) was studied with the objects to minimize makespan, total workload and critical workload. A variable neighborhood evolutionary algorithm (VNEA) was proposed to obtain a set of Pareto optimal solutions. First, two novel crowded operators in terms of the decision space and object space were proposed, and they were respectively used in mating selection and environmental selection. Then, two well-designed neighborhood structures were used in local search, which consider the problem characteristics and can hold fast convergence. Finally, extensive comparison was carried out with the state-of-the-art methods specially presented for solving MOFJSP on well-known benchmark instances. The results show that the proposed VNEA is more effective than other algorithms in solving MOFJSP.

Implementation and Evaluation of Self-Scheduling in a Hospital System.

PubMed

Wright, Christina; McCartt, Peggy; Raines, Diane; Oermann, Marilyn H

Inflexible work schedules affect job satisfaction and influence nurse turnover. Job satisfaction is a significant predictor of nurse retention. Acute care hospitals report that job satisfaction is influenced by autonomy and educational opportunity. This project discusses implementation of computer-based self-scheduling in a hospital system and its impact. It is important for staff development educators to be aware that self-scheduling may play a key role in autonomy, professional development, turnover, and hospital costs.

Strategies of emotion management: not just on, but off the job.

PubMed

Hammonds, Clare; Cadge, Wendy

2014-06-01

Intensive care nurses, like professionals in other intense occupations characterized by high degrees of uncertainty, manage the emotions that result from their work both on and off the job. We focus on the job strategies - calling-in, sharing their experiences with others and engaging in a range of activities oriented to emotional recovery - that 37 intensive care nurses use to manage their emotions off the job. These strategies show how the social organization and division of labor in intensive care units influences nurses' emotional management outside of them and how organizational troubles for hospitals becomes personal ones for staff. They further support theoretical approaches that view emotions as dynamic elements belonging to individuals rather than aspects of people that can be fully appropriated by organizations. © 2013 John Wiley & Sons Ltd.

The Job Accommodation Scale (JAS): psychometric evaluation of a new measure of employer support for temporary job modifications.

PubMed

Shaw, William S; Kristman, Vicki L; Williams-Whitt, Kelly; Soklaridis, Sophie; Huang, Yueng-Hsiang; Côté, Pierre; Loisel, Patrick

2014-12-01

An employer offer of temporary job modification is a key strategy for facilitating return-to-work for musculoskeletal conditions, but there are no validated scales to assess the level of support for temporary job modifications across a range of job types and organizations. To pilot test a new 21-item self-report measure [the Job Accommodation Scale (JAS)] to assess its applicability, internal consistency, factor structure, and relation to physical job demands. Supervisors (N = 804, 72.8 % male, mean age = 46) were recruited from 19 employment settings in the USA and Canada and completed a 30-min online survey regarding job modification practices. As part of the survey, supervisors nominated and described a job position they supervised and completed the JAS for a hypothetical worker (in that position) with an episode of low back pain. Job characteristics were derived from the occupational informational network job classification database. The full response range (1-4) was utilized on all 21 items, with no ceiling or floor effects. Avoiding awkward postures was the most feasible accommodation and moving the employee to a different site or location was the least feasible. An exploratory factor analysis suggested five underlying factors (Modify physical workload; Modify work environment; Modify work schedule; Find alternate work; and Arrange for assistance), and there was an acceptable goodness-of-fit for the five parceled sub-factor scores as a single latent construct in a measurement model (structural equation model). Job accommodations were less feasible for more physical jobs and for heavier industries. The pilot administration of the JAS with respect to a hypothetical worker with low back pain showed initial support for its applicability, reliability, and validity when administered to supervisors. Future studies should assess its validity for use in actual disability cases, for a range of health conditions, and to assess different stakeholder opinions about the

Job Stress, Coping Strategies, and Burnout among Abuse-Specific Counselors

ERIC Educational Resources Information Center

Wallace, Sam Loc; Lee, Jayoung; Lee, Sang Min

2010-01-01

The purpose of this study is to investigate whether effective coping strategies play an important role to reduce burnout levels among sexual or substance abuse counselors. The authors examined whether coping strategies mediated or moderated relations between job stress and burnout in a sample of 232 abuse-specific counselors. Results indicated…

Collectives for Multiple Resource Job Scheduling Across Heterogeneous Servers

NASA Technical Reports Server (NTRS)

Tumer, K.; Lawson, J.

2003-01-01

Efficient management of large-scale, distributed data storage and processing systems is a major challenge for many computational applications. Many of these systems are characterized by multi-resource tasks processed across a heterogeneous network. Conventional approaches, such as load balancing, work well for centralized, single resource problems, but breakdown in the more general case. In addition, most approaches are often based on heuristics which do not directly attempt to optimize the world utility. In this paper, we propose an agent based control system using the theory of collectives. We configure the servers of our network with agents who make local job scheduling decisions. These decisions are based on local goals which are constructed to be aligned with the objective of optimizing the overall efficiency of the system. We demonstrate that multi-agent systems in which all the agents attempt to optimize the same global utility function (team game) only marginally outperform conventional load balancing. On the other hand, agents configured using collectives outperform both team games and load balancing (by up to four times for the latter), despite their distributed nature and their limited access to information.

Job design and ethnic differences in working women's physical activity.

PubMed

Grzywacz, Joseph G; Crain, A Lauren; Martinson, Brian C; Quandt, Sara A

2014-01-01

To document the role job control and schedule control play in shaping women's physical activity, and how it delineates educational and racial variability in associations of job and social control with physical activity. Prospective data were obtained from a community-based sample of working women (N = 302). Validated instruments measured job control and schedule control. Steps per day were assessed using New Lifestyles 800 activity monitors. Greater job control predicted more steps per day, whereas greater schedule control predicted fewer steps. Small indirect associations between ethnicity and physical activity were observed among women with a trade school degree or less but not for women with a college degree. Low job control created barriers to physical activity among working women with a trade school degree or less. Greater schedule control predicted less physical activity, suggesting women do not use time "created" by schedule flexibility for personal health enhancement.

Knowledge translation in job development: strategies for involving families.

PubMed

Hall, Allison; Bose, Jennifer; Winsor, Jean; Migliore, Alberto

2014-09-01

Although United States employment policies have increased support for people with disabilities working in community settings, the unemployment rate for this population remains very high, particularly for people with intellectual or developmental disabilities. Research shows that job developers (direct support professionals who assist people with disabilities to secure, maintain, and advance in employment) are critical to achieving quality employment outcomes. However, the extent to which job developers use practices that are considered promising in their field (such as engaging families) is not well known. This brief report summarizes findings from a qualitative study about the extent to which job developers use the recommended promising practices when working with individuals and family members. Qualitative analysis identified the following themes among job developers: factors affecting family involvement, perceptions of family involvement, and the influence of expectation on strategies. The field of job development faces a challenge common to many professions: translating research on best practices to those who need this knowledge the most and can use it to greatest effect. Future research should address how community rehabilitation providers (CRPs) communicate about and instill best practices, including effective family engagement, within their organizations. © 2013 John Wiley & Sons Ltd.

Alaska Job Center Network

Science.gov Websites

Job Centers Toll-free in Alaska (877)724-2539 *Workshop Schedules are linked under participating Job : midtown.jobcenter@alaska.gov Employers: anchorage.employers@alaska.gov Toll free Anchorage Employer Phone: 1-888-830 -1149 Phone: 842-5579 Fax: 842-5679, Toll Free: 1-800-478-5579 Job Seekers & Employers

Three hybridization models based on local search scheme for job shop scheduling problem

NASA Astrophysics Data System (ADS)

Balbi Fraga, Tatiana

2015-05-01

This work presents three different hybridization models based on the general schema of Local Search Heuristics, named Hybrid Successive Application, Hybrid Neighborhood, and Hybrid Improved Neighborhood. Despite similar approaches might have already been presented in the literature in other contexts, in this work these models are applied to analyzes the solution of the job shop scheduling problem, with the heuristics Taboo Search and Particle Swarm Optimization. Besides, we investigate some aspects that must be considered in order to achieve better solutions than those obtained by the original heuristics. The results demonstrate that the algorithms derived from these three hybrid models are more robust than the original algorithms and able to get better results than those found by the single Taboo Search.

Multi-core processing and scheduling performance in CMS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hernandez, J. M.; Evans, D.; Foulkes, S.

2012-01-01

Commodity hardware is going many-core. We might soon not be able to satisfy the job memory needs per core in the current single-core processing model in High Energy Physics. In addition, an ever increasing number of independent and incoherent jobs running on the same physical hardware not sharing resources might significantly affect processing performance. It will be essential to effectively utilize the multi-core architecture. CMS has incorporated support for multi-core processing in the event processing framework and the workload management system. Multi-core processing jobs share common data in memory, such us the code libraries, detector geometry and conditions data, resultingmore » in a much lower memory usage than standard single-core independent jobs. Exploiting this new processing model requires a new model in computing resource allocation, departing from the standard single-core allocation for a job. The experiment job management system needs to have control over a larger quantum of resource since multi-core aware jobs require the scheduling of multiples cores simultaneously. CMS is exploring the approach of using whole nodes as unit in the workload management system where all cores of a node are allocated to a multi-core job. Whole-node scheduling allows for optimization of the data/workflow management (e.g. I/O caching, local merging) but efficient utilization of all scheduled cores is challenging. Dedicated whole-node queues have been setup at all Tier-1 centers for exploring multi-core processing workflows in CMS. We present the evaluation of the performance scheduling and executing multi-core workflows in whole-node queues compared to the standard single-core processing workflows.« less

Multi-core processing and scheduling performance in CMS

NASA Astrophysics Data System (ADS)

Hernández, J. M.; Evans, D.; Foulkes, S.

2012-12-01

Commodity hardware is going many-core. We might soon not be able to satisfy the job memory needs per core in the current single-core processing model in High Energy Physics. In addition, an ever increasing number of independent and incoherent jobs running on the same physical hardware not sharing resources might significantly affect processing performance. It will be essential to effectively utilize the multi-core architecture. CMS has incorporated support for multi-core processing in the event processing framework and the workload management system. Multi-core processing jobs share common data in memory, such us the code libraries, detector geometry and conditions data, resulting in a much lower memory usage than standard single-core independent jobs. Exploiting this new processing model requires a new model in computing resource allocation, departing from the standard single-core allocation for a job. The experiment job management system needs to have control over a larger quantum of resource since multi-core aware jobs require the scheduling of multiples cores simultaneously. CMS is exploring the approach of using whole nodes as unit in the workload management system where all cores of a node are allocated to a multi-core job. Whole-node scheduling allows for optimization of the data/workflow management (e.g. I/O caching, local merging) but efficient utilization of all scheduled cores is challenging. Dedicated whole-node queues have been setup at all Tier-1 centers for exploring multi-core processing workflows in CMS. We present the evaluation of the performance scheduling and executing multi-core workflows in whole-node queues compared to the standard single-core processing workflows.

The Job Accommodation Scale (JAS): Psychometric evaluation of a new measure of employer support for temporary job modifications

PubMed Central

Shaw, William S.; Kristman, Vicki L.; Williams-Whitt, Kelly; Soklaridis, Sophie; Huang, Yueng-Hsiang; Côté, Pierre; Loisel, Patrick

2015-01-01

INTRODUCTION An employer offer of temporary job modification is a key strategy for facilitating return-to-work (RTW) for musculoskeletal conditions, but there are no validated scales to assess the level of support for temporary job modifications across a range of job types and organizations. OBJECTIVE To pilot test a new 21-item self-report measure (the Job Accommodation Scale [JAS]) to assess its applicability, internal consistency, factor structure, and relation to physical job demands. METHODS Supervisors (N = 804, 72.8% male, mean age = 46) were recruited from 19 employment settings in the USA and Canada and completed a 30-min online survey regarding job modification practices. As part of the survey, supervisors nominated and described a job position they supervised and completed the JAS for a hypothetical worker (in that position) with an episode of low back pain. Job characteristics were derived from the occupational informational network job classification database. RESULTS The full response range (1–4) was utilized on all 21 items, with no ceiling or floor effects. Avoiding awkward postures was the most feasible accommodation and moving the employee to a different site or location was the least feasible. An exploratory factor analysis suggested five underlying factors (Modify physical workload; Modify work environment; Modify work schedule; Find alternate work; and Arrange for assistance), and there was an acceptable goodness-of-fit for the five parceled sub-factor scores as a single latent construct in a measurement model (structural equation model). Job accommodations were less feasible for more physical jobs and for heavier industries. CONCLUSIONS The pilot administration of the JAS with respect to a hypothetical worker with LBP showed initial support for its applicability, reliability, and validity when administered to supervisors. Future studies should assess its validity for use in actual disability cases, for a range of health conditions, and to

Job Stress and Coping Strategies among Early Childhood Teachers in Central Taiwan

ERIC Educational Resources Information Center

Hung, Chih-Lun

2012-01-01

The purpose of this study was to explore the association between job stress and coping strategies in early childhood teachers in Central Taiwan. A quantitative approach was utilized, and data were collected from 314 participants. The results of the present study suggest that (1) early childhood teachers believed that their job stress was due to a…

A narrative literature review regarding job retention strategies for people with chronic illnesses.

PubMed

Koch, Lynn C; Rumrill, Phillip D; Conyers, Liza; Wohlford, Sarah

2013-01-01

Job retention is a major concern for individuals with chronic illnesses, who represent a rapidly growing vocational rehabilitation (VR) consumer population. The purpose of this article is to examine selected job retention considerations for consumers with chronic illnesses. The authors (a) describe distinguishing characteristics of chronic illnesses in terms of populations affected and psychosocial implications, (b) discuss the vocational implications of chronic illnesses, (c) provide general considerations for the provision of job retention services, and (d) examine job retention strategies aimed at improving employment outcomes for individuals with chronic illnesses.

Job strain and psychological distress among employed pregnant Thai women: role of social support and coping strategies.

PubMed

Sanguanklin, Natthananporn; McFarlin, Barbara L; Finnegan, Lorna; Park, Chang Gi; Giurgescu, Carmen; White-Traut, Rosemary; Engstrom, Janet L

2014-08-01

Most Thai women continue to work throughout their pregnancy; however, little is known about job strain and its relation to psychological distress. This study aimed to examine: (1) the direct effects of job strain, perceived workplace support, perceived family support, and coping strategies on psychological distress and (2) the moderating effect of perceived workplace support, perceived family support, and coping strategies on the relationship between job strain and psychological distress. Lazarus and Folkman's transactional model of stress and coping guided this cross-sectional study. Full-time employed pregnant women (N = 300) were recruited from three antenatal clinics in Thailand. Thai versions of the following instruments were used: the State-Anxiety Inventory and Center for Epidemiological Studies-Depression Scale (psychological distress), the Job Content Questionnaire (job strain and perceived workplace support), the Medical Outcome Study Social Support Survey (perceived family support), and the Ways of Coping Checklist-Revised (coping strategies). Job strain with other predictors explained 54% of the variance in psychological distress. In the separate hierarchical multiple linear regression models, two types of coping strategies, seeking social support and wishful thinking, moderated the effects of job strain on psychological distress. Perceived family support had a direct effect in reducing psychological distress. Job strain is a significant contributor to psychological distress. The average levels of seeking social support and wishful thinking were most beneficial in moderating the negative impact of job strain on psychological distress. Since perceived workplace and family support did not have moderating effects, stress management programs for decreasing the levels of job strain should be developed.

Job Design and Ethnic Differences in Working Women’s Physical Activity

PubMed Central

Grzywacz, Joseph G.; Crain, A. Lauren; Martinson, Brian C.; Quandt, Sara A.

2014-01-01

Objective To document the role job control and schedule control play in shaping women’s physical activity, and how it delineates educational and racial variability in associations of job and social control with physical activity. Methods Prospective data were obtained from a community-based sample of working women (N = 302). Validated instruments measured job control and schedule control. Steps per day were assessed using New Lifestyles 800 activity monitors. Results Greater job control predicted more steps per day, whereas greater schedule control predicted fewer steps. Small indirect associations between ethnicity and physical activity were observed among women with a trade school degree or less but not for women with a college degree. Conclusions Low job control created barriers to physical activity among working women with a trade school degree or less. Greater schedule control predicted less physical activity, suggesting women do not use time “created” by schedule flexibility for personal health enhancement. PMID:24034681

An Optimization Model for Scheduling Problems with Two-Dimensional Spatial Resource Constraint

NASA Technical Reports Server (NTRS)

Garcia, Christopher; Rabadi, Ghaith

2010-01-01

Traditional scheduling problems involve determining temporal assignments for a set of jobs in order to optimize some objective. Some scheduling problems also require the use of limited resources, which adds another dimension of complexity. In this paper we introduce a spatial resource-constrained scheduling problem that can arise in assembly, warehousing, cross-docking, inventory management, and other areas of logistics and supply chain management. This scheduling problem involves a twodimensional rectangular area as a limited resource. Each job, in addition to having temporal requirements, has a width and a height and utilizes a certain amount of space inside the area. We propose an optimization model for scheduling the jobs while respecting all temporal and spatial constraints.

Aerial Refueling Process Rescheduling Under Job Related Disruptions

NASA Technical Reports Server (NTRS)

Kaplan, Sezgin; Rabadi, Ghaith

2011-01-01

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for each fighter aircraft (job) on the multiple tankers (machines) to minimize the total weighted tardiness. ARSP assumes that the jobs have different release times and due dates. The ARSP is dynamic environment and unexpected events may occur. In this paper, rescheduling in the aerial refueling process with a time set of jobs will be studied to deal with job related disruptions such as the arrival of new jobs, the departure of an existing job, high deviations in the release times and changes in job priorities. In order to keep the stability and to avoid excessive computation, partial schedule repair algorithm is developed and its preliminary results are presented.

Decentralized Control of Scheduling in Distributed Systems.

DTIC Science & Technology

1983-03-18

the job scheduling algorithm adapts to the changing busyness of the various hosts in the system. The environment in which the job scheduling entities...resources and processes that constitute the node and a set of interfaces for accessing these processes and resources. The structure of a node could change ...parallel. Chang [CHNG82] has also described some algorithms for detecting properties of general graphs by traversing paths in a graph in parallel. One of

MaGate Simulator: A Simulation Environment for a Decentralized Grid Scheduler

NASA Astrophysics Data System (ADS)

Huang, Ye; Brocco, Amos; Courant, Michele; Hirsbrunner, Beat; Kuonen, Pierre

This paper presents a simulator for of a decentralized modular grid scheduler named MaGate. MaGate’s design emphasizes scheduler interoperability by providing intelligent scheduling serving the grid community as a whole. Each MaGate scheduler instance is able to deal with dynamic scheduling conditions, with continuously arriving grid jobs. Received jobs are either allocated on local resources, or delegated to other MaGates for remote execution. The proposed MaGate simulator is based on GridSim toolkit and Alea simulator, and abstracts the features and behaviors of complex fundamental grid elements, such as grid jobs, grid resources, and grid users. Simulation of scheduling tasks is supported by a grid network overlay simulator executing distributed ant-based swarm intelligence algorithms to provide services such as group communication and resource discovery. For evaluation, a comparison of behaviors of different collaborative policies among a community of MaGates is provided. Results support the use of the proposed approach as a functional ready grid scheduler simulator.

Work-related factors, job satisfaction and intent to leave the current job among United States nurses.

PubMed

Han, Kihye; Trinkoff, Alison M; Gurses, Ayse P

2015-11-01

To examine the relationships of work-related factors (e.g., autonomy, work schedule, supervisory and peer support) to nurses' job satisfaction and intent to leave their current position. Low job satisfaction and high turnover of nurses are major problems for health care. To improve nurse retention, work-related factors associated with job satisfaction and intent to leave should be investigated. A cross-sectional secondary data analysis. Data were obtained in 2004 from Wave 3 of the Nurses' Worklife and Health Study. A random sample of 5000 actively licenced nurses in Illinois and North Carolina (two U.S. states) were sent the survey in wave 1, of which 1641 actively working bedside nurses participated in wave 3. We examined associations of various work-related factors with job satisfaction and intent to leave the current position. Nurses who were dissatisfied with their job reported significantly higher psychological demands and lower autonomy than nurses who were satisfied. Nurses were significantly less satisfied with their jobs when they worked longer hours with inadequate breaks or sick days. Lack of support from peers and supervisors was also related to significantly lower odds of job satisfaction. For intention to leave, nurses who said they planned to leave their current job reported significantly lower autonomy and less support from their peers than nurses who intended to stay. A variety of modifiable work-related factors were significantly related to job satisfaction and intention to leave the current job among nurses. Future research should focus on developing interventions that could mitigate these factors (e.g., by improving work schedules, increasing autonomy and/or nurse support). The impact of such interventions on job satisfaction and intention to leave the current position could then be evaluated. To increase nurse retention, improved schedules, autonomy and supportive work environments should be promoted. © 2015 John Wiley & Sons Ltd.

Application of a hybrid generation/utility assessment heuristic to a class of scheduling problems

NASA Technical Reports Server (NTRS)

Heyward, Ann O.

1989-01-01

A two-stage heuristic solution approach for a class of multiobjective, n-job, 1-machine scheduling problems is described. Minimization of job-to-job interference for n jobs is sought. The first stage generates alternative schedule sequences by interchanging pairs of schedule elements. The set of alternative sequences can represent nodes of a decision tree; each node is reached via decision to interchange job elements. The second stage selects the parent node for the next generation of alternative sequences through automated paired comparison of objective performance for all current nodes. An application of the heuristic approach to communications satellite systems planning is presented.

The Costs of Today's Jobs: Job Characteristics and Organizational Supports as Antecedents of Negative Spillover

ERIC Educational Resources Information Center

Grotto, Angela R.; Lyness, Karen S.

2010-01-01

This study examined job characteristics and organizational supports as antecedents of negative work-to-nonwork spillover for 1178 U.S. employees. Based on hierarchical regression analyses of 2002 National Study of the Changing Workforce data and O*NET data, job demands (requirements to work at home beyond scheduled hours, job complexity, time and…

AWAS: A dynamic work scheduling system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Y.; Hao, J.; Kocur, G.

1994-12-31

The Automated Work Administration System (AWAS) is an automated scheduling system developed at GTE. A typical work center has 1000 employees and processes 4000 jobs each day. Jobs are geographically distributed within the service area of the work center, require different skills, and have to be done within specified time windows. Each job can take anywhere from 12 minutes to several hours to complete. Each employee can have his/her individual schedule, skill, or working area. The jobs can enter and leave the system at any time The employees dial up to the system to request for their next job atmore » the beginning of a day or after a job is done. The system is able to respond to the changes dynamically and produce close to optimum solutions at real time. We formulate the real world problem as a minimum cost network flow problem. Both employees and jobs are formulated as nodes. Relationship between jobs and employees are formulated as arcs, and working hours contributed by employees and consumed by jobs are formulated as flow. The goal is to minimize missed commitments. We solve the problem with the successive shortest path algorithm. Combined with pre-processing and post-processing, the system produces reasonable outputs and the response time is very good.« less

A meta-heuristic method for solving scheduling problem: crow search algorithm

NASA Astrophysics Data System (ADS)

Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

2018-04-01

Scheduling is one of the most important processes in an industry both in manufacturingand services. The scheduling process is the process of selecting resources to perform an operation on tasks. Resources can be machines, peoples, tasks, jobs or operations.. The selection of optimum sequence of jobs from a permutation is an essential issue in every research in scheduling problem. Optimum sequence becomes optimum solution to resolve scheduling problem. Scheduling problem becomes NP-hard problem since the number of job in the sequence is more than normal number can be processed by exact algorithm. In order to obtain optimum results, it needs a method with capability to solve complex scheduling problems in an acceptable time. Meta-heuristic is a method usually used to solve scheduling problem. The recently published method called Crow Search Algorithm (CSA) is adopted in this research to solve scheduling problem. CSA is an evolutionary meta-heuristic method which is based on the behavior in flocks of crow. The calculation result of CSA for solving scheduling problem is compared with other algorithms. From the comparison, it is found that CSA has better performance in term of optimum solution and time calculation than other algorithms.

Two-machine flow shop scheduling integrated with preventive maintenance planning

NASA Astrophysics Data System (ADS)

Wang, Shijin; Liu, Ming

2016-02-01

This paper investigates an integrated optimisation problem of production scheduling and preventive maintenance (PM) in a two-machine flow shop with time to failure of each machine subject to a Weibull probability distribution. The objective is to find the optimal job sequence and the optimal PM decisions before each job such that the expected makespan is minimised. To investigate the value of integrated scheduling solution, computational experiments on small-scale problems with different configurations are conducted with total enumeration method, and the results are compared with those of scheduling without maintenance but with machine degradation, and individual job scheduling combined with independent PM planning. Then, for large-scale problems, four genetic algorithm (GA) based heuristics are proposed. The numerical results with several large problem sizes and different configurations indicate the potential benefits of integrated scheduling solution and the results also show that proposed GA-based heuristics are efficient for the integrated problem.

What Strategies Do the Nurses Apply to Cope With Job Stress?: A Qualitative Study

PubMed Central

Akbar, Rasool Eslami; Elahi, Nasrin; Mohammadi, Eesa; Khoshknab, Masoud Fallahi

2016-01-01

Background: Nursing staff encounter a lot of physical, psychological and social stressors at work. Because the adverse effects of job stress on the health of this group of staff and subsequently on the quality of care services provided by nurses; study and identify how nurses cope with the job stress is very important and can help prevent the occurrence of unfavorable outcomes. Objectives: The aim of this study was to explore the experiences of nurses to identify the strategies they used to cope with the job stress. Methods: In this qualitative study content analysis approach was used. Purposive sampling approach was applied. The sample population included 18 nurses working in three hospitals. Data collection was conducted through face to face unstructured interview and was analyzed using conventional content analysis approach. Findings: The analysis of the data emerged six main themes about the strategies used by nurses to cope with job stress, which, include: situational control of conditions, seeking help, preventive monitoring of situation, self-controlling, avoidance and escape and spiritual coping. Conclusions: Exploring experiences of nurses on how to cope with job stress emerged context-dependent and original strategies and this knowledge can pave the ground for nurses to increase self-awareness of how to cope with job stress. And could also be the basis for planning and the adoption of necessary measures by the authorities to adapt nurses with their profession better and improves their health which are essential elements to fulfill high-quality nursing care. PMID:26755462

Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: a case study

NASA Astrophysics Data System (ADS)

Gao, Kaizhou; Wang, Ling; Luo, Jianping; Jiang, Hua; Sadollah, Ali; Pan, Quanke

2018-06-01

In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and tardiness (E/T). These two objectives are also considered together as a bi-objective problem. Computational optimization results and comparisons show that the proposed DHS is able to solve the scheduling and rescheduling problems effectively and productively. Using the proposed approach, satisfactory optimization results can be achieved for scheduling and rescheduling on a real-life shop floor.

20 CFR 628.420 - Job training plan.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 20 Employees' Benefits 3 2011-04-01 2011-04-01 false Job training plan. 628.420 Section 628.420... THE JOB TRAINING PARTNERSHIP ACT Local Service Delivery System § 628.420 Job training plan. (a) The Governor shall issue instructions and schedules to assure that job training plans and plan modifications...

20 CFR 628.420 - Job training plan.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 20 Employees' Benefits 3 2012-04-01 2012-04-01 false Job training plan. 628.420 Section 628.420... THE JOB TRAINING PARTNERSHIP ACT Local Service Delivery System § 628.420 Job training plan. (a) The Governor shall issue instructions and schedules to assure that job training plans and plan modifications...

20 CFR 628.420 - Job training plan.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false Job training plan. 628.420 Section 628.420... THE JOB TRAINING PARTNERSHIP ACT Local Service Delivery System § 628.420 Job training plan. (a) The Governor shall issue instructions and schedules to assure that job training plans and plan modifications...

Enhancing the intrinsic work motivation of community nutrition educators: how supportive supervision and job design foster autonomy.

PubMed

Dickin, Katherine L; Dollahite, Jamie S; Habicht, Jean-Pierre

2011-01-01

Mixed-methods research investigated the work motivation of paraprofessional community nutrition educators (CNEs) delivering a long-running public health nutrition program. In interviews, CNEs (n = 9) emphasized "freedom," supportive supervision, and "making a difference" as key sources of motivation. Community nutrition educator surveys (n = 115) confirmed high levels of autonomy, which was associated with supervisors' delegation and support, CNE decision-making on scheduling and curricula, and job satisfaction. Supervisors (n = 32) rated CNEs' job design as having inherently motivating characteristics comparable to professional jobs. Supervisory strategies can complement job design to create structured, supportive contexts that maintain fidelity, while granting autonomy to paraprofessionals to enhance intrinsic work motivation.

Effects of a Photo Activity Schedule Book on Independent Task Changes by Students with Intellectual Disabilities in Community and School Job Sites

ERIC Educational Resources Information Center

Carson, Keyla D; Gast, David L.; Ayres, Kevin M.

2008-01-01

The purpose of this study was to evaluate the effectiveness of using a photo activity schedule book to increase independent transitioning between vocational tasks inside a school cafeteria and at a community job site. Three students with mild to moderate intellectual disabilities, enrolled in a self-contained classroom in a public high school,…

Deconstructing Nowicki and Smutnickis i-TSAB tabu search algorithm for the job-shop scheduling problem.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitley, L. Darrell; Watson, Jean-Paul; Howe, Adele E.

Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art performance levels on a range of academic and real-world problems. Yet, despite these successes, remarkably little research has been devoted to developing an understanding of why tabu search is so effective on this problem class. In this paper, we report results that provide significant progress in this direction. We consider Nowicki and Smutnicki's i-TSAB tabu search algorithm, which represents the current state-of-the-art for the makespan-minimization form of the classical jobshop scheduling problem. Via a series ofmore » controlled experiments, we identify those components of i-TSAB that enable it to achieve state-of-the-art performance levels. In doing so, we expose a number of misconceptions regarding the behavior and/or benefits of tabu search and other local search metaheuristics for the job-shop problem. Our results also serve to focus future research, by identifying those specific directions that are most likely to yield further improvements in performance.« less

Flexible Work Schedules. ERIC Digest.

ERIC Educational Resources Information Center

Kerka, Sandra

Flexible work schedules are one response to changes in the composition of the work force, new life-styles, and changes in work attitudes. Types of alternative work schedules are part-time and temporary employment, job sharing, and flextime. Part-time workers are a diverse group--women, the very young, and older near-retirees. Although part-time…

Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times.

PubMed

Yang, Xin; Zeng, Zhenxiang; Wang, Ruidong; Sun, Xueshan

2016-01-01

This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The case study on GM Corporation verifies that the NSGA-II used in this paper is effective and has advantages to solve the proposed model comparing with HPSO and PSO+SA. The idea and method of the paper can be generalized widely in the manufacturing industry, because it can reduce the energy consumption of the energy-intensive manufacturing enterprise with less investment when the new approach is applied in existing systems.

Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times

PubMed Central

Zeng, Zhenxiang; Wang, Ruidong; Sun, Xueshan

2016-01-01

This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The case study on GM Corporation verifies that the NSGA-II used in this paper is effective and has advantages to solve the proposed model comparing with HPSO and PSO+SA. The idea and method of the paper can be generalized widely in the manufacturing industry, because it can reduce the energy consumption of the energy-intensive manufacturing enterprise with less investment when the new approach is applied in existing systems. PMID:27907163

Job Satisfaction, Stress and Coping Strategies in the Teaching Profession-What Do Teachers Say?

ERIC Educational Resources Information Center

Skaalvik, Einar M.; Skaalvik, Sidsel

2015-01-01

This study explored job satisfaction, work-related stress, consequences of stress, and coping strategies among Norwegian teachers. The study is based on qualitative interviews with 30 working teachers and four retired teachers. The respondents reported high job satisfaction but also severe stress and exhaustion. Teachers of different ages or at…

Structuring On-the-Job Training.

ERIC Educational Resources Information Center

DeJong, J. A.; Versloot, A. M.

A study examined on-the-job training (OJT) at 8 Dutch firms employing more than 500 individuals each. A case study approach was used to investigate the following: job characteristics, program history, training schedules, training process, training materials, interaction with production, trainee characteristics, trainer characteristics, social…

Multiobjective optimisation design for enterprise system operation in the case of scheduling problem with deteriorating jobs

NASA Astrophysics Data System (ADS)

Wang, Hongfeng; Fu, Yaping; Huang, Min; Wang, Junwei

2016-03-01

The operation process design is one of the key issues in the manufacturing and service sectors. As a typical operation process, the scheduling with consideration of the deteriorating effect has been widely studied; however, the current literature only studied single function requirement and rarely considered the multiple function requirements which are critical for a real-world scheduling process. In this article, two function requirements are involved in the design of a scheduling process with consideration of the deteriorating effect and then formulated into two objectives of a mathematical programming model. A novel multiobjective evolutionary algorithm is proposed to solve this model with combination of three strategies, i.e. a multiple population scheme, a rule-based local search method and an elitist preserve strategy. To validate the proposed model and algorithm, a series of randomly-generated instances are tested and the experimental results indicate that the model is effective and the proposed algorithm can achieve the satisfactory performance which outperforms the other state-of-the-art multiobjective evolutionary algorithms, such as nondominated sorting genetic algorithm II and multiobjective evolutionary algorithm based on decomposition, on all the test instances.

An expert system for planning and scheduling in a telerobotic environment

NASA Technical Reports Server (NTRS)

Ntuen, Celestine A.; Park, Eui H.

1991-01-01

A knowledge based approach to assigning tasks to multi-agents working cooperatively in jobs that require a telerobot in the loop was developed. The generality of the approach allows for such a concept to be applied in a nonteleoperational domain. The planning architecture known as the task oriented planner (TOP) uses the principle of flow mechanism and the concept of planning by deliberation to preserve and use knowledge about a particular task. The TOP is an open ended architecture developed with a NEXPERT expert system shell and its knowledge organization allows for indirect consultation at various levels of task abstraction. Considering that a telerobot operates in a hostile and nonstructured environment, task scheduling should respond to environmental changes. A general heuristic was developed for scheduling jobs with the TOP system. The technique is not to optimize a given scheduling criterion as in classical job and/or flow shop problems. For a teleoperation job schedule, criteria are situation dependent. A criterion selection is fuzzily embedded in the task-skill matrix computation. However, goal achievement with minimum expected risk to the human operator is emphasized.

28 CFR 345.83 - Job safety training.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 28 Judicial Administration 2 2013-07-01 2013-07-01 false Job safety training. 345.83 Section 345... INDUSTRIES (FPI) INMATE WORK PROGRAMS FPI Inmate Training and Scholarship Programs § 345.83 Job safety training. FPI provides inmates with regular job safety training which is developed and scheduled in...

28 CFR 345.83 - Job safety training.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 28 Judicial Administration 2 2014-07-01 2014-07-01 false Job safety training. 345.83 Section 345... INDUSTRIES (FPI) INMATE WORK PROGRAMS FPI Inmate Training and Scholarship Programs § 345.83 Job safety training. FPI provides inmates with regular job safety training which is developed and scheduled in...

28 CFR 345.83 - Job safety training.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 28 Judicial Administration 2 2012-07-01 2012-07-01 false Job safety training. 345.83 Section 345... INDUSTRIES (FPI) INMATE WORK PROGRAMS FPI Inmate Training and Scholarship Programs § 345.83 Job safety training. FPI provides inmates with regular job safety training which is developed and scheduled in...

28 CFR 345.83 - Job safety training.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 28 Judicial Administration 2 2011-07-01 2011-07-01 false Job safety training. 345.83 Section 345... INDUSTRIES (FPI) INMATE WORK PROGRAMS FPI Inmate Training and Scholarship Programs § 345.83 Job safety training. FPI provides inmates with regular job safety training which is developed and scheduled in...

28 CFR 345.83 - Job safety training.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 28 Judicial Administration 2 2010-07-01 2010-07-01 false Job safety training. 345.83 Section 345... INDUSTRIES (FPI) INMATE WORK PROGRAMS FPI Inmate Training and Scholarship Programs § 345.83 Job safety training. FPI provides inmates with regular job safety training which is developed and scheduled in...

Limited access: gender, occupational composition, and flexible work scheduling.

PubMed

Glauber, Rebecca

2011-01-01

The current study draws on national data to explore differences in access to flexible work scheduling by the gender composition of women's and men's occupations. Results show that those who work in integrated occupations are more likely to have access to flexible scheduling. Women and men do not take jobs with lower pay in return for greater access to flexibility. Instead, jobs with higher pay offer greater flexibility. Integrated occupations tend to offer the greatest access to flexible scheduling because of their structural locations. Part-time work is negatively associated with men's access to flexible scheduling but positively associated with women's access. Women have greater flexibility when they work for large establishments, whereas men have greater flexibility when they work for small establishments.

A hybrid dynamic harmony search algorithm for identical parallel machines scheduling

NASA Astrophysics Data System (ADS)

Chen, Jing; Pan, Quan-Ke; Wang, Ling; Li, Jun-Qing

2012-02-01

In this article, a dynamic harmony search (DHS) algorithm is proposed for the identical parallel machines scheduling problem with the objective to minimize makespan. First, an encoding scheme based on a list scheduling rule is developed to convert the continuous harmony vectors to discrete job assignments. Second, the whole harmony memory (HM) is divided into multiple small-sized sub-HMs, and each sub-HM performs evolution independently and exchanges information with others periodically by using a regrouping schedule. Third, a novel improvisation process is applied to generate a new harmony by making use of the information of harmony vectors in each sub-HM. Moreover, a local search strategy is presented and incorporated into the DHS algorithm to find promising solutions. Simulation results show that the hybrid DHS (DHS_LS) is very competitive in comparison to its competitors in terms of mean performance and average computational time.

Which resources moderate the effects of demanding work schedules on nurses working in residential elder care? A longitudinal study.

PubMed

Peters, Velibor; Houkes, Inge; de Rijk, Angelique E; Bohle, Philip L; Engels, Josephine A; Nijhuis, Frans J N

2016-06-01

Shiftwork is a major job demand for nurses and has been related to various negative consequences. Research suggests that personal and job resources moderate the impact of work schedules on stress, health and well-being. This longitudinal study examined whether the interactions of personal and job resources with work schedule demands predicted work engagement and emotional exhaustion in nursing. This longitudinal study included two waves of data collection with a one year follow-up using self-report questionnaires among 247 nurses working shifts or irregular working hours in residential care for the elderly in the Netherlands. Moderated structural equation modelling was conducted to examine the interactions between personal and job resources and work schedule demands. Two work schedule demands were assessed: type of work schedule (demanding vs. less demanding) and average weekly working hours. Two personal resources, active coping and healthy lifestyle, and two job resources, work schedule control and the work schedule fit with nurses' private life, were assessed. Results showed that the work schedule fit with nurses' private life buffered the relationship between work schedule demands and emotional exhaustion one year later. Furthermore, the work schedule fit with nurses' private life increased work engagement one year later when work schedule demands were high. Work schedule control strengthened the positive relationship between work schedule demands and emotional exhaustion one year later. The personal resources, active coping and healthy lifestyle were no moderators in this model. Nurses suffer less from decreasing work engagement and emotional exhaustion due to work schedule demands when their work schedules fit with their private lives. Work schedule control did not buffer, but strengthened the positive relationship between weekly working hours and emotional exhaustion one year later. Job resources appeared to be more important for nurses' well-being than

Active Job Monitoring in Pilots

NASA Astrophysics Data System (ADS)

Kuehn, Eileen; Fischer, Max; Giffels, Manuel; Jung, Christopher; Petzold, Andreas

2015-12-01

Recent developments in high energy physics (HEP) including multi-core jobs and multi-core pilots require data centres to gain a deep understanding of the system to monitor, design, and upgrade computing clusters. Networking is a critical component. Especially the increased usage of data federations, for example in diskless computing centres or as a fallback solution, relies on WAN connectivity and availability. The specific demands of different experiments and communities, but also the need for identification of misbehaving batch jobs, requires an active monitoring. Existing monitoring tools are not capable of measuring fine-grained information at batch job level. This complicates network-aware scheduling and optimisations. In addition, pilots add another layer of abstraction. They behave like batch systems themselves by managing and executing payloads of jobs internally. The number of real jobs being executed is unknown, as the original batch system has no access to internal information about the scheduling process inside the pilots. Therefore, the comparability of jobs and pilots for predicting run-time behaviour or network performance cannot be ensured. Hence, identifying the actual payload is important. At the GridKa Tier 1 centre a specific tool is in use that allows the monitoring of network traffic information at batch job level. This contribution presents the current monitoring approach and discusses recent efforts and importance to identify pilots and their substructures inside the batch system. It will also show how to determine monitoring data of specific jobs from identified pilots. Finally, the approach is evaluated.

Job sharing: a retention strategy for nurses.

PubMed

Kane, D

1999-01-01

Job sharing is a part-time employment alternative which offers advantages for employers interested in retaining experienced staff and nurses who are seeking a more equitable balance between work life and home life responsibilities. This quasi experimental, ex post facto research study was designed to determine if there are differences in job satisfaction, burnout, and desire to leave their position, in nurses who are employed in full-time, part-time, or job sharing positions. The sample (N = 269) was drawn from a large Canadian teaching and referral hospital. Three sample groups were developed, consisting of job sharing, full-time, and part-time nurses, respectively. Descriptive statistics were used to identify characteristics of the selected population. Analysis of variance was used to examine differences between the three employment groups on the outcome measures of job satisfaction, burnout, and desire to leave their position. The results of this study significantly support the belief that job sharing has a positive impact on job satisfaction and job retention. Implications for nursing administrators as well as individual nurses will be discussed.

Stochastic scheduling on a repairable manufacturing system

NASA Astrophysics Data System (ADS)

Li, Wei; Cao, Jinhua

1995-08-01

In this paper, we consider some stochastic scheduling problems with a set of stochastic jobs on a manufacturing system with a single machine that is subject to multiple breakdowns and repairs. When the machine processing a job fails, the job processing must restart some time later when the machine is repaired. For this typical manufacturing system, we find the optimal policies that minimize the following objective functions: (1) the weighed sum of the completion times; (2) the weighed number of late jobs having constant due dates; (3) the weighted number of late jobs having random due dates exponentially distributed, which generalize some previous results.

A multi-group and preemptable scheduling of cloud resource based on HTCondor

NASA Astrophysics Data System (ADS)

Jiang, Xiaowei; Zou, Jiaheng; Cheng, Yaodong; Shi, Jingyan

2017-10-01

Due to the features of virtual machine-flexibility, easy controlling and various system environments, more and more fields utilize the virtualization technology to construct the distributed system with the virtual resources, also including high energy physics. This paper introduce a method used in high energy physics that supports multiple resource group and preemptable cloud resource scheduling, combining virtual machine with HTCondor (a batch system). It makes resource controlling more flexible and more efficient and makes resource scheduling independent of job scheduling. Firstly, the resources belong to different experiment-groups, and the type of user-groups mapping to resource-groups(same as experiment-group) is one-to-one or many-to-one. In order to make the confused group simply to be managed, we designed the permission controlling component to ensure that the different resource-groups can get the suitable jobs. Secondly, for the purpose of elastically allocating resources for suitable resource-group, it is necessary to schedule resources like scheduling jobs. So this paper designs the cloud resource scheduling to maintain a resource queue and allocate an appropriate amount of virtual resources to the request resource-group. Thirdly, in some kind of situations, because of the resource occupied for a long time, resources need to be preempted. This paper adds the preemption function for the resource scheduling that implement resource preemption based on the group priority. Additionally, the way to preempting is soft that when virtual resources are preempted, jobs will not be killed but also be held and rematched later. It is implemented with the help of HTCondor, storing the held job information in scheduler, releasing the job to idle status and doing second matcher. In IHEP (institute of high energy physics), we have built a batch system based on HTCondor with a virtual resources pool based on Openstack. And this paper will show some cases of experiment JUNO

On-the-fly scheduling as a manifestation of partial-order planning and dynamic task values.

PubMed

Hannah, Samuel D; Neal, Andrew

2014-09-01

The aim of this study was to develop a computational account of the spontaneous task ordering that occurs within jobs as work unfolds ("on-the-fly task scheduling"). Air traffic control is an example of work in which operators have to schedule their tasks as a partially predictable work flow emerges. To date, little attention has been paid to such on-the-fly scheduling situations. We present a series of discrete-event models fit to conflict resolution decision data collected from experienced controllers operating in a high-fidelity simulation. Our simulations reveal air traffic controllers' scheduling decisions as examples of the partial-order planning approach of Hayes-Roth and Hayes-Roth. The most successful model uses opportunistic first-come-first-served scheduling to select tasks from a queue. Tasks with short deadlines are executed immediately. Tasks with long deadlines are evaluated to assess whether they need to be executed immediately or deferred. On-the-fly task scheduling is computationally tractable despite its surface complexity and understandable as an example of both the partial-order planning strategy and the dynamic-value approach to prioritization.

Job-shop scheduling applied to computer vision

NASA Astrophysics Data System (ADS)

Sebastian y Zuniga, Jose M.; Torres-Medina, Fernando; Aracil, Rafael; Reinoso, Oscar; Jimenez, Luis M.; Garcia, David

1997-09-01

This paper presents a method for minimizing the total elapsed time spent by n tasks running on m differents processors working in parallel. The developed algorithm not only minimizes the total elapsed time but also reduces the idle time and waiting time of in-process tasks. This condition is very important in some applications of computer vision in which the time to finish the total process is particularly critical -- quality control in industrial inspection, real- time computer vision, guided robots. The scheduling algorithm is based on the use of two matrices, obtained from the precedence relationships between tasks, and the data obtained from the two matrices. The developed scheduling algorithm has been tested in one application of quality control using computer vision. The results obtained have been satisfactory in the application of different image processing algorithms.

Job Sharing: An Employment Alternative for the Career Services Professional.

ERIC Educational Resources Information Center

Johnson, Louise; Meerdink, Lois A.

1985-01-01

Describes and assesses job sharing as an employment alternative for career services professionals. Discusses the job-sharing format with regard to fringe benefits, scheduling, advantages, client reactions, potential problems, and specific factors that contribute to successful job sharing. (BH)

Job Campaign Strategies. The Career Life Assessment Skills Series, Booklet Three. A Program to Meet Adult Developmental Needs.

ERIC Educational Resources Information Center

Curtin, Bernadette M.; Hecklinger, Fred J.

As part of a series on career and life planning for adults, this four-part booklet discusses job search strategies, resume writing, and job interviews. Part I discourages conventional job-hunting techniques (i.e., visiting employment agencies, researching want ads, going through company personnel offices, and sending resumes and cover letters in…

In-Space Crew-Collaborative Task Scheduling

NASA Technical Reports Server (NTRS)

Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

2007-01-01

For all past and current human space missions, the final scheduling of tasks to be done in space has been devoid of crew control, flexibility, and insight. Ground controllers, with minimal input from the crew, schedule the tasks and uplink the timeline to the crew or uplink the command sequences to the hardware. Prior to the International Space Station (ISS), the crew could make requests about tomorrow s timeline, they could omit a task, or they could request that something in the timeline be delayed. This lack of control over one's own schedule has had negative consequences. There is anecdotal consensus among astronauts that control over their own schedules will mitigate the stresses of long duration missions. On ISS, a modicum of crew control is provided by the job jar. Ground controllers prepare a task list (a.k.a. "job jar") of non-conflicting tasks from which jobs can be chosen by the in space crew. Because there is little free time and few interesting non-conflicting activities, the task-list approach provides little relief from the tedium of being micro-managed by the timeline. Scheduling for space missions is a complex and laborious undertaking which usually requires a large cadre of trained specialists and suites of complex software tools. It is a giant leap from today s ground prepared timeline (with a job jar) to full crew control of the timeline. However, technological advances, currently in-work or proposed, make it reasonable to consider scheduling a collaborative effort by the ground-based teams and the in-space crew. Collaboration would allow the crew to make minor adjustments, add tasks according to their preferences, understand the reasons for the placement of tasks on the timeline, and provide them a sense of control. In foreseeable but extraordinary situations, such as a quick response to anomalies and extended or unexpected loss of signal, the crew should have the autonomous ability to make appropriate modifications to the timeline, extend the

Providing Better University Personnel through Job Sharing.

ERIC Educational Resources Information Center

Hutton, Clifford E.; McFarlin, Joy Simon

1982-01-01

Universities could benefit by offering more flexible part-time job opportunities such as job-sharing, following an apparent national trend in accommodating social and economic needs. Institutions have many options in scheduling and allocating tasks. Possible benefits include improved employee attitude and productivity. (MSE)

Job demands-control-social support model and coping strategies: predicting burnout and wellbeing in a group of Italian nurses.

PubMed

Pisanti, R

2012-01-01

Nursing is generally considered to be a stressful profession. The purpose of the present study was to test the core hypotheses of the job demands-control-social support model (JDCS) of Karasek & Theorell (1990). In order to refine and extend the JDCS model, we also analyzed the direct and interactive role of three coping strategies: task- oriented, emotion-oriented, and avoidance-oriented coping. Questionnaire data from 1383 nurses (77%female) were collected. Controlling for demographic variables and non-linearity of the associations between job characteristics and outcomes (job satisfaction; burnout dimensions, psychological distress, and somatic complaints), hierarchical regression analyses indicated that job control and social support combined additively (p < 0.001) with job demands to explain the wellbeing outcomes (explained variance between 6% and 28%). Coping strategies accounted for additional variance (p < 0.001; explained variance between 4% and 15%) in all outcomes except in job satisfaction. Support was found for main effects of coping. Coping strategies did not moderate the impact of job characteristics on burnout and wellbeing. Emotion-oriented coping emerged as the most important predictor and was consistently associated with higher burnout levels and lower wellbeing levels. The results demonstrated the need to include the role of individual variables in the JDCS model. The limitations of the study, and theoretical and practical implications are discussed.

Do job demands and job control affect problem-solving?

PubMed

Bergman, Peter N; Ahlberg, Gunnel; Johansson, Gun; Stoetzer, Ulrich; Aborg, Carl; Hallsten, Lennart; Lundberg, Ingvar

2012-01-01

The Job Demand Control model presents combinations of working conditions that may facilitate learning, the active learning hypothesis, or have detrimental effects on health, the strain hypothesis. To test the active learning hypothesis, this study analysed the effects of job demands and job control on general problem-solving strategies. A population-based sample of 4,636 individuals (55% women, 45% men) with the same job characteristics measured at two times with a three year time lag was used. Main effects of demands, skill discretion, task authority and control, and the combined effects of demands and control were analysed in logistic regressions, on four outcomes representing general problem-solving strategies. Those reporting high on skill discretion, task authority and control, as well as those reporting high demand/high control and low demand/high control job characteristics were more likely to state using problem solving strategies. Results suggest that working conditions including high levels of control may affect how individuals cope with problems and that workplace characteristics may affect behaviour in the non-work domain.

Single-machine group scheduling problems with deteriorating and learning effect

NASA Astrophysics Data System (ADS)

Xingong, Zhang; Yong, Wang; Shikun, Bai

2016-07-01

The concepts of deteriorating jobs and learning effects have been individually studied in many scheduling problems. However, most studies considering the deteriorating and learning effects ignore the fact that production efficiency can be increased by grouping various parts and products with similar designs and/or production processes. This phenomenon is known as 'group technology' in the literature. In this paper, a new group scheduling model with deteriorating and learning effects is proposed, where learning effect depends not only on job position, but also on the position of the corresponding job group; deteriorating effect depends on its starting time of the job. This paper shows that the makespan and the total completion time problems remain polynomial optimal solvable under the proposed model. In addition, a polynomial optimal solution is also presented to minimise the maximum lateness problem under certain agreeable restriction.

Non preemptive soft real time scheduler: High deadline meeting rate on overload

NASA Astrophysics Data System (ADS)

Khalib, Zahereel Ishwar Abdul; Ahmad, R. Badlishah; El-Shaikh, Mohamed

2015-05-01

While preemptive scheduling has gain more attention among researchers, current work in non preemptive scheduling had shown promising result in soft real time jobs scheduling. In this paper we present a non preemptive scheduling algorithm meant for soft real time applications, which is capable of producing better performance during overload while maintaining excellent performance during normal load. The approach taken by this algorithm has shown more promising results compared to other algorithms including its immediate predecessor. We will present the analysis made prior to inception of the algorithm as well as simulation results comparing our algorithm named gutEDF with EDF and gEDF. We are convinced that grouping jobs utilizing pure dynamic parameters would produce better performance.

Integrated resource scheduling in a distributed scheduling environment

NASA Technical Reports Server (NTRS)

Zoch, David; Hall, Gardiner

1988-01-01

The Space Station era presents a highly-complex multi-mission planning and scheduling environment exercised over a highly distributed system. In order to automate the scheduling process, customers require a mechanism for communicating their scheduling requirements to NASA. A request language that a remotely-located customer can use to specify his scheduling requirements to a NASA scheduler, thus automating the customer-scheduler interface, is described. This notation, Flexible Envelope-Request Notation (FERN), allows the user to completely specify his scheduling requirements such as resource usage, temporal constraints, and scheduling preferences and options. The FERN also contains mechanisms for representing schedule and resource availability information, which are used in the inter-scheduler inconsistency resolution process. Additionally, a scheduler is described that can accept these requests, process them, generate schedules, and return schedule and resource availability information to the requester. The Request-Oriented Scheduling Engine (ROSE) was designed to function either as an independent scheduler or as a scheduling element in a network of schedulers. When used in a network of schedulers, each ROSE communicates schedule and resource usage information to other schedulers via the FERN notation, enabling inconsistencies to be resolved between schedulers. Individual ROSE schedules are created by viewing the problem as a constraint satisfaction problem with a heuristically guided search strategy.

Job Priorities on Peregrine | High-Performance Computing | NREL

Science.gov Websites

allocation when run with qos=high. Requesting a Node Reservation If you are doing work that requires real scheduler more efficiently plan resources for larger jobs. When projects reach their allocation limit, jobs associated with those projects will run at very low priority, which will ensure that these jobs run only when

On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai

2014-08-01

This article investigates the open-shop scheduling problem with the optimal criterion of minimising the sum of quadratic completion times. For this NP-hard problem, the asymptotic optimality of the shortest processing time block (SPTB) heuristic is proven in the sense of limit. Moreover, three different improvements, namely, the job-insert scheme, tabu search and genetic algorithm, are introduced to enhance the quality of the original solution generated by the SPTB heuristic. At the end of the article, a series of numerical experiments demonstrate the convergence of the heuristic, the performance of the improvements and the effectiveness of the quadratic objective.

Some single-machine scheduling problems with learning effects and two competing agents.

PubMed

Li, Hongjie; Li, Zeyuan; Yin, Yunqiang

2014-01-01

This study considers a scheduling environment in which there are two agents and a set of jobs, each of which belongs to one of the two agents and its actual processing time is defined as a decreasing linear function of its starting time. Each of the two agents competes to process its respective jobs on a single machine and has its own scheduling objective to optimize. The objective is to assign the jobs so that the resulting schedule performs well with respect to the objectives of both agents. The objective functions addressed in this study include the maximum cost, the total weighted completion time, and the discounted total weighted completion time. We investigate three problems arising from different combinations of the objectives of the two agents. The computational complexity of the problems is discussed and solution algorithms where possible are presented.

Processing time tolerance-based ACO algorithm for solving job-shop scheduling problem

NASA Astrophysics Data System (ADS)

Luo, Yabo; Waden, Yongo P.

2017-06-01

Ordinarily, Job Shop Scheduling Problem (JSSP) is known as NP-hard problem which has uncertainty and complexity that cannot be handled by a linear method. Thus, currently studies on JSSP are concentrated mainly on applying different methods of improving the heuristics for optimizing the JSSP. However, there still exist many problems for efficient optimization in the JSSP, namely, low efficiency and poor reliability, which can easily trap the optimization process of JSSP into local optima. Therefore, to solve this problem, a study on Ant Colony Optimization (ACO) algorithm combined with constraint handling tactics is carried out in this paper. Further, the problem is subdivided into three parts: (1) Analysis of processing time tolerance-based constraint features in the JSSP which is performed by the constraint satisfying model; (2) Satisfying the constraints by considering the consistency technology and the constraint spreading algorithm in order to improve the performance of ACO algorithm. Hence, the JSSP model based on the improved ACO algorithm is constructed; (3) The effectiveness of the proposed method based on reliability and efficiency is shown through comparative experiments which are performed on benchmark problems. Consequently, the results obtained by the proposed method are better, and the applied technique can be used in optimizing JSSP.

Shift work, mental distress and job satisfaction among Palestinian nurses.

PubMed

Jaradat, Y M; Nielsen, M B; Kristensen, P; Bast-Pettersen, R

2017-01-01

Associations between shift work (SW) schedules, mental distress and job satisfaction have never been completely described. To examine gender-specific associations of SW with mental distress and job satisfaction in nurses in Hebron District, Palestine, in 2012. Detailed information on work schedules (day versus shift), socio-demographic status, mental distress (General Health Questionnaire, GHQ-30) and job satisfaction (Generic Job Satisfaction Scale) in nurses employed in Hebron District, Palestine, was obtained through a questionnaire survey. Associations of SW and outcomes were examined by linear regression analysis. Of 372 nurses eligible for the study, 309 and 338 completed surveys regarding mental distress and job satisfaction, respectively. The sample comprised 62% women and 38% men. After adjusting for covariates, women working shifts reported significantly higher levels of mean mental distress [β coefficient 3.6; 95% confidence interval (CI) 0.3-7.0] compared with women working regular day shifts. Men working shifts reported significantly lower levels of job satisfaction (-3.3; 95% CI -6.2 to -0.5) than men working regular day shifts. Women reported higher levels of mental distress than men, but this was unrelated to work schedule. In this study, nurses working shifts reported higher levels of mental distress and lower levels of job satisfaction, although these associations were weaker when adjusted for potential covariates. There was no evidence of a gender differential in the association between SW and mental distress and job satisfaction. © The Author 2016. Published by Oxford University Press on behalf of the Society of Occupational Medicine.

Running Jobs on the Peregrine System | High-Performance Computing | NREL

Science.gov Websites

on the Peregrine high-performance computing (HPC) system. Running Different Types of Jobs Batch jobs scheduling policies - queue names, limits, etc. Requesting different node types Sample batch scripts

Working Less and Enjoying It More: Alternative Work Schedules.

ERIC Educational Resources Information Center

Shanks, Katherine

1984-01-01

Explores three forms of alternative work schedules that research has shown improve job performance and decrease absenteeism: flextime (starting and stopping times vary within limits); permanent part-time employment (regular employment carried out during shorter working hours); and job sharing (two or more part-time employees share one full-time…

Responding to Illegal Inquiries on Job Application Blanks: The Effects of Information Management Strategy, Gender, and Position Type on Applicant Ratings.

ERIC Educational Resources Information Center

Bredeson, P. V.

1992-01-01

Effects of an applicant's information management strategy while responding to a job application item requesting illegal candidate information and moderating effects of applicant sex and position were studied for 12 hypothetical school job applicants with 108 graduate student raters. The interactions of strategy, sex, and position have important…

Relationship between job stress level and coping strategies used by Hong Kong nurses working in an acute surgical unit.

PubMed

Wang, Wenru; Kong, Amelia Wai Man; Chair, Sek Ying

2011-11-01

The aim of this study is to explore the relationship between job stress and coping strategies of Hong Kong nurses working in an acute surgical unit. This is a descriptive correlational study. Data were collected from 98 Hong Kong surgical nurses using the Nursing Stress Scale and the Jalowiec Coping Scale. Results showed that workload (M = 15.36), lack of support (M = 13.32), and inadequate preparation (M = 12.33) are the most common stressors for Hong Kong surgical nurses. The most frequent strategies used by nurses to cope with stress can be characterized as evasive (M = 19.23), confrontive (M = 17.46), and optimistic (M = 15.81), all of which are also rated as the most effective strategies in reducing stress levels. Only the confrontive, optimistic, supportant, and emotive coping strategies reveal significant correlations (p < .05) with the stress levels of nurses, whereas the evasive, fatalistic, palliative, and self-reliant strategies showed no significant correlation with stress levels (p > .05). Recognizing the impacts of job-related stress and making use of effective coping methods play a vital role in reducing nurse's stress. A change in leadership styles from the managerial level and reallocation of manpower may help reduce job stress. The use of confrontive and optimistic coping strategies in reducing job-related stress for surgical nurses should be advocated and promoted in their daily work. Copyright © 2011 Elsevier Inc. All rights reserved.

Outsourcing and scheduling for a two-machine flow shop with release times

NASA Astrophysics Data System (ADS)

Ahmadizar, Fardin; Amiri, Zeinab

2018-03-01

This article addresses a two-machine flow shop scheduling problem where jobs are released intermittently and outsourcing is allowed. The first operations of outsourced jobs are processed by the first subcontractor, they are transported in batches to the second subcontractor for processing their second operations, and finally they are transported back to the manufacturer. The objective is to select a subset of jobs to be outsourced, to schedule both the in-house and the outsourced jobs, and to determine a transportation plan for the outsourced jobs so as to minimize the sum of the makespan and the outsourcing and transportation costs. Two mathematical models of the problem and several necessary optimality conditions are presented. A solution approach is then proposed by incorporating the dominance properties with an ant colony algorithm. Finally, computational experiments are conducted to evaluate the performance of the models and solution approach.

Job Search Strategies of Recent University Graduates in Poland: Plans and Effectiveness

ERIC Educational Resources Information Center

Piróg, Danuta

2016-01-01

The objective of this article was to highlight plans versus actual actions of university graduates in Poland aimed at finding employment. The paper also empirically verifies the impact of chosen job-seeking strategies on the success or failure of their transition to employment. The study was Polish-wide and included graduates of geography. It…

A method of operation scheduling based on video transcoding for cluster equipment

NASA Astrophysics Data System (ADS)

Zhou, Haojie; Yan, Chun

2018-04-01

Because of the cluster technology in real-time video transcoding device, the application of facing the massive growth in the number of video assignments and resolution and bit rate of diversity, task scheduling algorithm, and analyze the current mainstream of cluster for real-time video transcoding equipment characteristics of the cluster, combination with the characteristics of the cluster equipment task delay scheduling algorithm is proposed. This algorithm enables the cluster to get better performance in the generation of the job queue and the lower part of the job queue when receiving the operation instruction. In the end, a small real-time video transcode cluster is constructed to analyze the calculation ability, running time, resource occupation and other aspects of various algorithms in operation scheduling. The experimental results show that compared with traditional clustering task scheduling algorithm, task delay scheduling algorithm has more flexible and efficient characteristics.

Administrative Challenges and Response Strategies to the Job Performance of Marketing Department Chairs.

ERIC Educational Resources Information Center

Dyer, Beverly G.; Miller, Michael T.

This study reports on the job challenges and corresponding response strategies that department chairs at graduate and undergraduate colleges and universities encounter and rely upon. Literature and research related to marketing department chairs, marketing education, and marketing majors indicates that business schools have come under attack by…

Strategies used by women workers to reconcile family responsibilities with atypical work schedules in the service sector.

PubMed

Barthe, B; Messing, K; Abbas, L

2011-01-01

Workers' attempts to accommodate family needs may be considered illegitimate in the paid work sphere. Their attempts at work-family balancing (WFB) in that sphere can remain invisible, even when those attempts require considerable energy. Since identification of WFB strategies can potentially lead to suggestions to improve management practices, we report an attempt to find them in the work sphere. 14 care aides in a Québec residence for seniors and 2~schedule managers were recruited. Qualitative ergonomic analysis was employed. 24 hours observation; interviews of nursing and human resources staff; qualitative ergonomic analysis by two researchers; feedback collected from meetings with management and union. Strategies for schedule choice were compared between care aides with heavier vs. lighter family responsibilities. For workers with heavier family responsibilities, choice of work schedules was almost entirely conditioned by family considerations, leaving little leeway to manage workers' own health protection. Family constraints affected activity at work, and strategies for handling family constraints could potentially be affected by changes in work organization. Managers should encourage full discussion of work-family balancing strategies if they wish to adapt their working conditions to the workers, and ergonomists should include this balancing as a facet of work activity, despite possible negative consequences.

Meta-RaPS Algorithm for the Aerial Refueling Scheduling Problem

NASA Technical Reports Server (NTRS)

Kaplan, Sezgin; Arin, Arif; Rabadi, Ghaith

2011-01-01

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for each fighter aircraft (job) on multiple tankers (machines). ARSP assumes that jobs have different release times and due dates, The total weighted tardiness is used to evaluate schedule's quality. Therefore, ARSP can be modeled as a parallel machine scheduling with release limes and due dates to minimize the total weighted tardiness. Since ARSP is NP-hard, it will be more appropriate to develop a pproimate or heuristic algorithm to obtain solutions in reasonable computation limes. In this paper, Meta-Raps-ATC algorithm is implemented to create high quality solutions. Meta-RaPS (Meta-heuristic for Randomized Priority Search) is a recent and promising meta heuristic that is applied by introducing randomness to a construction heuristic. The Apparent Tardiness Rule (ATC), which is a good rule for scheduling problems with tardiness objective, is used to construct initial solutions which are improved by an exchanging operation. Results are presented for generated instances.

Shift schedules, work factors, and mental health among onshore and offshore workers in the Norwegian petroleum industry

PubMed Central

BERTHELSEN, Mona; PALLESEN, Ståle; BJORVATN, Bjørn; KNARDAHL, Stein

2015-01-01

The purpose of the present study was to answer the following research questions: (1) Do workers in different shift schedules differ in mental distress? (2) Do workers in different shift schedules differ in neuroticism? (3) Do shift schedules differ in psychosocial work exposures? (4) Do psychosocial work exposures contribute to mental distress among onshore- and offshore workers? (5) Does neuroticism confound the association between work exposures and mental distress? Workers on six shift-schedules answered a questionnaire (1,471 of 2,628 employees). Psychological and social work factors were measured by QPSNordic, mental distress was measured by HADS and neuroticism was measured by EPQ. The results showed 1) No differences in mental distress between workers in different shift schedules, 2) Revolving-shift workers reported higher neuroticism compared to day workers, 3) Swing-shift workers and revolving-shift workers reported lower job control compared to permanent-night and -day workers, 4) Job demands and role conflict were associated with more mental distress. Job control, role clarity, support, and leadership were associated with lower mental distress, 5) Neuroticism influenced the relationship between psychosocial work factors and mental distress. The present study did not find differences in mental distress between shift schedules. Job characteristics may be contributing factors when determining health effects of shift work. PMID:25740007

Shift schedules, work factors, and mental health among onshore and offshore workers in the Norwegian petroleum industry.

PubMed

Berthelsen, Mona; Pallesen, Ståle; Bjorvatn, Bjørn; Knardahl, Stein

2015-01-01

The purpose of the present study was to answer the following research questions: (1) Do workers in different shift schedules differ in mental distress? (2) Do workers in different shift schedules differ in neuroticism? (3) Do shift schedules differ in psychosocial work exposures? (4) Do psychosocial work exposures contribute to mental distress among onshore- and offshore workers? (5) Does neuroticism confound the association between work exposures and mental distress? Workers on six shift-schedules answered a questionnaire (1,471 of 2,628 employees). Psychological and social work factors were measured by QPSNordic, mental distress was measured by HADS and neuroticism was measured by EPQ. The results showed 1) No differences in mental distress between workers in different shift schedules, 2) Revolving-shift workers reported higher neuroticism compared to day workers, 3) Swing-shift workers and revolving-shift workers reported lower job control compared to permanent-night and -day workers, 4) Job demands and role conflict were associated with more mental distress. Job control, role clarity, support, and leadership were associated with lower mental distress, 5) Neuroticism influenced the relationship between psychosocial work factors and mental distress. The present study did not find differences in mental distress between shift schedules. Job characteristics may be contributing factors when determining health effects of shift work.

Developing optimal nurses work schedule using integer programming

NASA Astrophysics Data System (ADS)

Shahidin, Ainon Mardhiyah; Said, Mohd Syazwan Md; Said, Noor Hizwan Mohamad; Sazali, Noor Izatie Amaliena

2017-08-01

Time management is the art of arranging, organizing and scheduling one's time for the purpose of generating more effective work and productivity. Scheduling is the process of deciding how to commit resources between varieties of possible tasks. Thus, it is crucial for every organization to have a good work schedule for their staffs. The job of Ward nurses at hospitals runs for 24 hours every day. Therefore, nurses will be working using shift scheduling. This study is aimed to solve the nurse scheduling problem at an emergency ward of a private hospital. A 7-day work schedule for 7 consecutive weeks satisfying all the constraints set by the hospital will be developed using Integer Programming. The work schedule for the nurses obtained gives an optimal solution where all the constraints are being satisfied successfully.

Description of an Introductory Learning Strategies Course for the Job Skills Educational Program.

ERIC Educational Resources Information Center

Murphy, Debra Ann; Derry, Sharon J.

The Job Skills Educational Program (JSEP), currently under development for the Army Research Institute, embeds learner strategies training within the context of a basic skills computer-assisted instruction curriculum. The curriculum is designed for low-ability soldiers, and consists largely of instruction in the domain of intellectual skills. An…

Transit scheduling: Basic and advanced manuals. Final report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pine, R.; Niemeyer, J.; Chisholm, R.

1998-12-01

This manual will be of interest to new transit schedulers, experienced schedulers, transit planners, operating staff, and others who need to be conversant with the scheduling process. The materials clearly describe all steps in the bus and light rail scheduling process, under TCRP Project A-11, Transit Scheduling: A Manual with Materials, research was undertaken by Transportation Management and Design of Solana Beach, California, to prepare a transit scheduling manual that incorporates modern training techniques for bus and light rail transit scheduling. The manual consists of two sections: a basic treatment and an advanced section. The basic-level section is in anmore » instructional format designed primarily for novice schedulers and other transit staff. The advance section covers more complex scheduling requirements. Each section may be used sequentially or independently and is designed to integrate with agency apprenticeship and on-the-job training.« less

Job compensable factors and factor weights derived from job analysis data.

PubMed

Chi, Chia-Fen; Chang, Tin-Chang; Hsia, Ping-Ling; Song, Jen-Chieh

2007-06-01

Government data on 1,039 job titles in Taiwan were analyzed to assess possible relationships between job attributes and compensation. For each job title, 79 specific variables in six major classes (required education and experience, aptitude, interest, work temperament, physical demands, task environment) were coded to derive the statistical predictors of wage for managers, professionals, technical, clerical, service, farm, craft, operatives, and other workers. Of the 79 variables, only 23 significantly related to pay rate were subjected to a factor and multiple regression analysis for predicting monthly wages. Given the heterogeneous nature of collected job titles, a 4-factor solution (occupational knowledge and skills, human relations skills, work schedule hardships, physical hardships) explaining 43.8% of the total variance but predicting only 23.7% of the monthly pay rate was derived. On the other hand, multiple regression with 9 job analysis items (required education, professional training, professional certificate, professional experience, coordinating, leadership and directing, demand on hearing, proportion of shift working indoors, outdoors and others, rotating shift) better predicted pay and explained 32.5% of the variance. A direct comparison of factors and subfactors of job evaluation plans indicated mental effort and responsibility (accountability) had not been measured with the current job analysis data. Cross-validation of job evaluation factors and ratings with the wage rates is required to calibrate both.

Comparison of OPC job prioritization schemes to generate data for mask manufacturing

NASA Astrophysics Data System (ADS)

Lewis, Travis; Veeraraghavan, Vijay; Jantzen, Kenneth; Kim, Stephen; Park, Minyoung; Russell, Gordon; Simmons, Mark

2015-03-01

Delivering mask ready OPC corrected data to the mask shop on-time is critical for a foundry to meet the cycle time commitment for a new product. With current OPC compute resource sharing technology, different job scheduling algorithms are possible, such as, priority based resource allocation and fair share resource allocation. In order to maximize computer cluster efficiency, minimize the cost of the data processing and deliver data on schedule, the trade-offs of each scheduling algorithm need to be understood. Using actual production jobs, each of the scheduling algorithms will be tested in a production tape-out environment. Each scheduling algorithm will be judged on its ability to deliver data on schedule and the trade-offs associated with each method will be analyzed. It is now possible to introduce advance scheduling algorithms to the OPC data processing environment to meet the goals of on-time delivery of mask ready OPC data while maximizing efficiency and reducing cost.

Analyzing data flows of WLCG jobs at batch job level

NASA Astrophysics Data System (ADS)

Kuehn, Eileen; Fischer, Max; Giffels, Manuel; Jung, Christopher; Petzold, Andreas

2015-05-01

With the introduction of federated data access to the workflows of WLCG, it is becoming increasingly important for data centers to understand specific data flows regarding storage element accesses, firewall configurations, as well as the scheduling of batch jobs themselves. As existing batch system monitoring and related system monitoring tools do not support measurements at batch job level, a new tool has been developed and put into operation at the GridKa Tier 1 center for monitoring continuous data streams and characteristics of WLCG jobs and pilots. Long term measurements and data collection are in progress. These measurements already have been proven to be useful analyzing misbehaviors and various issues. Therefore we aim for an automated, realtime approach for anomaly detection. As a requirement, prototypes for standard workflows have to be examined. Based on measurements of several months, different features of HEP jobs are evaluated regarding their effectiveness for data mining approaches to identify these common workflows. The paper will introduce the actual measurement approach and statistics as well as the general concept and first results classifying different HEP job workflows derived from the measurements at GridKa.

Single machine scheduling with slack due dates assignment

NASA Astrophysics Data System (ADS)

Liu, Weiguo; Hu, Xiangpei; Wang, Xuyin

2017-04-01

This paper considers a single machine scheduling problem in which each job is assigned an individual due date based on a common flow allowance (i.e. all jobs have slack due date). The goal is to find a sequence for jobs, together with a due date assignment, that minimizes a non-regular criterion comprising the total weighted absolute lateness value and common flow allowance cost, where the weight is a position-dependent weight. In order to solve this problem, an ? time algorithm is proposed. Some extensions of the problem are also shown.

The Principal's Companion: Strategies and Hints To Make the Job Easier. Second Edition.

ERIC Educational Resources Information Center

Robbins, Pam; Alvy, Harvey B.

Despite the administrative leadership that most principals receive in university courses, their most useful learning occurs once they are on the job. The new knowledge--much of it the result of trial and error--is gained in relative isolation. This second edition provides ideas, approaches, strategies, resources, tools, techniques, and reflective…

Cloud computing task scheduling strategy based on differential evolution and ant colony optimization

NASA Astrophysics Data System (ADS)

Ge, Junwei; Cai, Yu; Fang, Yiqiu

2018-05-01

This paper proposes a task scheduling strategy DEACO based on the combination of Differential Evolution (DE) and Ant Colony Optimization (ACO), aiming at the single problem of optimization objective in cloud computing task scheduling, this paper combines the shortest task completion time, cost and load balancing. DEACO uses the solution of the DE to initialize the initial pheromone of ACO, reduces the time of collecting the pheromone in ACO in the early, and improves the pheromone updating rule through the load factor. The proposed algorithm is simulated on cloudsim, and compared with the min-min and ACO. The experimental results show that DEACO is more superior in terms of time, cost, and load.

Job stress and job satisfaction among new graduate nurses during the first year of employment in Taiwan.

PubMed

Cheng, Ching-Yu; Liou, Shwu-Ru; Tsai, Hsiu-Min; Chang, Chia-Hao

2015-08-01

Nurse graduates are leaving their first employment at an alarming rate. The purpose of this study was to explore the relationships between job stress, job satisfaction and related factors over time among these nurses. This study applied a longitudinal design with three follow-ups after nurse graduates' first employment began. Using convenience sampling, participants were 206 new graduates from a university. The Work Environment Nursing Satisfaction Survey and the Clinical Stress Scale were used in this study. Results indicated that job stress remained moderate across three time points. Participants working 12 h shifts exhibited less job stress. Job satisfaction significantly increased in the twelfth month. Participants working 12 h shifts had a higher degree of job satisfaction. Job stress was negatively correlated with job satisfaction. The 12 h work shifts were related to job stress and job satisfaction. These results implied that health-care administrators need to provide longer orientation periods and flexible shift schedules for new graduate nurses to adapt to their work environment. © 2014 Wiley Publishing Asia Pty Ltd.

On-Line Scheduling of Parallel Machines

DTIC Science & Technology

1990-11-01

machine without losing any work; this is referred to as the preemptive model. In contrast to the nonpreemptive model which we have considered in this paper...that there exists no schedule of length d. The 2-relaxed decision procedure is as follows. Put each job into the queue of the slowest machine Mk such...in their queues . If a machine’s queue is empty it takes jobs to process from the queue of the first machine that is slower than it and that has a

CMS Readiness for Multi-Core Workload Scheduling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perez-Calero Yzquierdo, A.; Balcas, J.; Hernandez, J.

In the present run of the LHC, CMS data reconstruction and simulation algorithms benefit greatly from being executed as multiple threads running on several processor cores. The complexity of the Run 2 events requires parallelization of the code to reduce the memory-per- core footprint constraining serial execution programs, thus optimizing the exploitation of present multi-core processor architectures. The allocation of computing resources for multi-core tasks, however, becomes a complex problem in itself. The CMS workload submission infrastructure employs multi-slot partitionable pilots, built on HTCondor and GlideinWMS native features, to enable scheduling of single and multi-core jobs simultaneously. This provides amore » solution for the scheduling problem in a uniform way across grid sites running a diversity of gateways to compute resources and batch system technologies. This paper presents this strategy and the tools on which it has been implemented. The experience of managing multi-core resources at the Tier-0 and Tier-1 sites during 2015, along with the deployment phase to Tier-2 sites during early 2016 is reported. The process of performance monitoring and optimization to achieve efficient and flexible use of the resources is also described.« less

CMS readiness for multi-core workload scheduling

NASA Astrophysics Data System (ADS)

Perez-Calero Yzquierdo, A.; Balcas, J.; Hernandez, J.; Aftab Khan, F.; Letts, J.; Mason, D.; Verguilov, V.

2017-10-01

In the present run of the LHC, CMS data reconstruction and simulation algorithms benefit greatly from being executed as multiple threads running on several processor cores. The complexity of the Run 2 events requires parallelization of the code to reduce the memory-per- core footprint constraining serial execution programs, thus optimizing the exploitation of present multi-core processor architectures. The allocation of computing resources for multi-core tasks, however, becomes a complex problem in itself. The CMS workload submission infrastructure employs multi-slot partitionable pilots, built on HTCondor and GlideinWMS native features, to enable scheduling of single and multi-core jobs simultaneously. This provides a solution for the scheduling problem in a uniform way across grid sites running a diversity of gateways to compute resources and batch system technologies. This paper presents this strategy and the tools on which it has been implemented. The experience of managing multi-core resources at the Tier-0 and Tier-1 sites during 2015, along with the deployment phase to Tier-2 sites during early 2016 is reported. The process of performance monitoring and optimization to achieve efficient and flexible use of the resources is also described.

[The role of job satisfaction in the person-organization fit relationship in terms of goal pursuit strategies, and mental health].

PubMed

Roczniewska, Marta; Retowski, Sylwiusz

2014-01-01

Person-organization (P-O) fit is a predictor of job satisfaction, and a misfit is a potential stressor. We aimed to examine the consequences of fit between a person and an organization in terms of goal pursuit strategies. We tested whether job satisfaction mediates the relationship between regulatory fit and mental health. Research was conducted in a group of 169 employees. They were asked to fill in questionnaires assessing their chronic work regulatory focus, organiza tional regulatory focus and job satisfaction. To measure mental well-being we administered the General Health Questionnaire (GHQ-28). We conducted mediation analysis in regression. The results of the mediation analysis confirmed the me- diating role of job satisfaction in the relation between regulatory focus misfit and physical and mental symptoms of distress. The results of this study point to the fact that P-O fit can relate to goal pursuit strategies. It influences not only job satisfaction, but also employees' health.The conclusions can be applied in the human resources management practices, e.g., it may serve as a useful argument to motivate employers to shape goals and strategies individually by managers, according to employees preferences. The results should be interpreted with caution because of non-random sampling.

The Impact of Job Stress and Job Satisfaction on Workforce Productivity in an Iranian Petrochemical Industry.

PubMed

Hoboubi, Naser; Choobineh, Alireza; Kamari Ghanavati, Fatemeh; Keshavarzi, Sareh; Akbar Hosseini, Ali

2017-03-01

Job stress and job satisfaction are important factors affecting workforce productivity. This study was carried out to investigate the job stress, job satisfaction, and workforce productivity levels, to examine the effects of job stress and job satisfaction on workforce productivity, and to identify factors associated with productivity decrement among employees of an Iranian petrochemical industry. In this study, 125 randomly selected employees of an Iranian petrochemical company participated. The data were collected using the demographic questionnaire, Osipow occupational stress questionnaire to investigate the level of job stress, Job Descriptive Index to examine job satisfaction, and Hersey and Goldsmith questionnaire to investigate productivity in the study population. The levels of employees' perceived job stress and job satisfaction were moderate-high and moderate, respectively. Also, their productivity was evaluated as moderate. Although the relationship between job stress and productivity indices was not statistically significant, the positive correlation between job satisfaction and productivity indices was statistically significant. The regression modeling demonstrated that productivity was significantly associated with shift schedule, the second and the third dimensions of job stress (role insufficiency and role ambiguity), and the second dimension of job satisfaction (supervision). Corrective measures are necessary to improve the shift work system. "Role insufficiency" and "role ambiguity" should be improved and supervisor support must be increased to reduce job stress and increase job satisfaction and productivity.

A random-key encoded harmony search approach for energy-efficient production scheduling with shared resources

NASA Astrophysics Data System (ADS)

Garcia-Santiago, C. A.; Del Ser, J.; Upton, C.; Quilligan, F.; Gil-Lopez, S.; Salcedo-Sanz, S.

2015-11-01

When seeking near-optimal solutions for complex scheduling problems, meta-heuristics demonstrate good performance with affordable computational effort. This has resulted in a gravitation towards these approaches when researching industrial use-cases such as energy-efficient production planning. However, much of the previous research makes assumptions about softer constraints that affect planning strategies and about how human planners interact with the algorithm in a live production environment. This article describes a job-shop problem that focuses on minimizing energy consumption across a production facility of shared resources. The application scenario is based on real facilities made available by the Irish Center for Manufacturing Research. The formulated problem is tackled via harmony search heuristics with random keys encoding. Simulation results are compared to a genetic algorithm, a simulated annealing approach and a first-come-first-served scheduling. The superior performance obtained by the proposed scheduler paves the way towards its practical implementation over industrial production chains.

Job-related resources and the pressures of working life.

PubMed

Schieman, Scott

2013-03-01

Data from a 2011 representative sample of Canadian workers are used to test the resource versus the stress of higher status hypotheses. Drawing on the Job Demands-Resources model (JD-R), the resource hypothesis predicts that job-related resources reduce job pressure. The stress of higher status hypothesis predicts that job-related resources increase job pressure. Findings tend to favor the resource hypothesis for job autonomy and schedule control, while supporting the stress of higher status for job authority and challenging work. These findings help elaborate on the "resource" concept in the JD-R model and identify unique ways that such resources might contribute to the pressures of working life. Copyright © 2012 Elsevier Inc. All rights reserved.

Selecting and implementing the PBS scheduler on an SGI Onyx 2/Orgin 2000.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bittner, S.

1999-06-28

In the Mathematics and Computer Science Division at Argonne, the demand for resources on the Onyx 2 exceeds the resources available for consumption. To distribute these scarce resources effectively, we need a scheduling and resource management package with multiple capabilities. In particular, it must accept standard interactive user logins, allow batch jobs, backfill the system based on available resources, and permit system activities such as accounting to proceed without interruption. The package must include a mechanism to treat the graphic pipes as a schedulable resource. Also required is the ability to create advance reservations, offer dedicated system modes for largemore » resource runs and benchmarking, and track the resources consumed for each job run. Furthermore, our users want to be able to obtain repeatable timing results on job runs. And, of course, package costs must be carefully considered. We explored several options, including NQE and various third-party products, before settling on the PBS scheduler.« less

Firefighter Shift Schedules Affect Sleep Quality.

PubMed

Billings, Joel; Focht, Will

2016-03-01

The aim of this study was to investigate the prevalence and severity of firefighter sleep quality across department shift schedules. Sleep quality was assessed using a Pittsburgh Sleep Quality Index in a sample of 109 male career firefighters from six fire departments in three Southwestern US states. The three shift schedules studied were 24on/48off, 48on/96off, and Kelly. Seventy-three percent of firefighters report poor sleep quality. The 24on/48off shift schedule is associated with the best sleep quality and Kelly is associated with the worst sleep quality. Firefighters working second jobs report significantly poorer sleep quality than those who do not. Shift schedules that disrupt normal circadian rhythms more result in poorer sleep quality, which can lead to less effective emergency response and increased risk to firefighter health and safety.

Resource-constrained scheduling with hard due windows and rejection penalties

NASA Astrophysics Data System (ADS)

Garcia, Christopher

2016-09-01

This work studies a scheduling problem where each job must be either accepted and scheduled to complete within its specified due window, or rejected altogether. Each job has a certain processing time and contributes a certain profit if accepted or penalty cost if rejected. There is a set of renewable resources, and no resource limit can be exceeded at any time. Each job requires a certain amount of each resource when processed, and the objective is to maximize total profit. A mixed-integer programming formulation and three approximation algorithms are presented: a priority rule heuristic, an algorithm based on the metaheuristic for randomized priority search and an evolutionary algorithm. Computational experiments comparing these four solution methods were performed on a set of generated benchmark problems covering a wide range of problem characteristics. The evolutionary algorithm outperformed the other methods in most cases, often significantly, and never significantly underperformed any method.

A novel downlink scheduling strategy for traffic communication system based on TD-LTE technology.

PubMed

Chen, Ting; Zhao, Xiangmo; Gao, Tao; Zhang, Licheng

2016-01-01

There are many existing classical scheduling algorithms which can obtain better system throughput and user equality, however, they are not designed for traffic transportation environment, which cannot consider whether the transmission performance of various information flows could meet comprehensive requirements of traffic safety and delay tolerance. This paper proposes a novel downlink scheduling strategy for traffic communication system based on TD-LTE technology, which can perform two classification mappings for various information flows in the eNodeB: firstly, associate every information flow packet with traffic safety importance weight according to its relevance to the traffic safety; secondly, associate every traffic information flow with service type importance weight according to its quality of service (QoS) requirements. Once the connection is established, at every scheduling moment, scheduler would decide the scheduling order of all buffers' head of line packets periodically according to the instant value of scheduling importance weight function, which calculated by the proposed algorithm. From different scenario simulations, it can be verified that the proposed algorithm can provide superior differentiated transmission service and reliable QoS guarantee to information flows with different traffic safety levels and service types, which is more suitable for traffic transportation environment compared with the existing popularity PF algorithm. With the limited wireless resource, information flow closed related to traffic safety will always obtain priority scheduling right timely, which can help the passengers' journey more safe. Moreover, the proposed algorithm cannot only obtain good flow throughput and user fairness which are almost equal to those of the PF algorithm without significant differences, but also provide better realtime transmission guarantee to realtime information flow.

Imaging Tasks Scheduling for High-Altitude Airship in Emergency Condition Based on Energy-Aware Strategy

PubMed Central

Zhimeng, Li; Chuan, He; Dishan, Qiu; Jin, Liu; Manhao, Ma

2013-01-01

Aiming to the imaging tasks scheduling problem on high-altitude airship in emergency condition, the programming models are constructed by analyzing the main constraints, which take the maximum task benefit and the minimum energy consumption as two optimization objectives. Firstly, the hierarchy architecture is adopted to convert this scheduling problem into three subproblems, that is, the task ranking, value task detecting, and energy conservation optimization. Then, the algorithms are designed for the sub-problems, and the solving results are corresponding to feasible solution, efficient solution, and optimization solution of original problem, respectively. This paper makes detailed introduction to the energy-aware optimization strategy, which can rationally adjust airship's cruising speed based on the distribution of task's deadline, so as to decrease the total energy consumption caused by cruising activities. Finally, the application results and comparison analysis show that the proposed strategy and algorithm are effective and feasible. PMID:23864822

Flight-Deck Strategies and Outcomes When Flying Schedule-Matching Descents

NASA Technical Reports Server (NTRS)

Kaneshige, John T.; Sharma, Shivanjli; Martin Lynne; Lozito, Sandra; Dulchinos, Victoria

2013-01-01

Recent studies at NASA Ames Research Center have investigated the development and use of ground-based (air traffic controller) tools to manage and schedule air traffic in future terminal airspace. An exploratory study was undertaken to investigate the impacts that such tools (and concepts) could have on the flight-deck. Ten Boeing 747-400 crews flew eight optimized profile descents in the Los Angeles terminal airspace, while receiving scripted current day and futuristic speed clearances, to ascertain their ability to fly schedulematching descents without prior training. Although the study was exploratory in nature, four variables were manipulated: route constraints, winds, speed changes, and clearance phraseology. Despite flying the same scenarios with the same events and timing, there were significant differences in the time it took crews to fly the approaches. This variation is the product of a number of factors but highlights potential difficulties for scheduling tools that would have to accommodate this amount of natural variation in descent times. The focus of this paper is the examination of the crews' aircraft management strategies and outcomes. This includes potentially problematic human-automation interaction issues that may negatively impact arrival times, speed and altitude constraint compliance, and energy management efficiency.

Job attitudes of airway facilities personnel.

DOT National Transportation Integrated Search

1977-08-01

A total of 2,366 employees of the Airway Facilities (AF) Service responded to a detailed questionnaire concerning job satisfaction and such factors as salary, shift schedule, workload, and geographic location. : In general, AF employees reported sati...

Job Grading Standard for Electric Power Controller WG-5407.

ERIC Educational Resources Information Center

Civil Service Commission, Washington, DC. Bureau of Policies and Standards.

The standard is used to grade nonsupervisory jobs involved in controlling the generation or distribution of electric power. The jobs are located at power generating plants, power distribution centers, and substations. The work requires ability to anticipate load changes due to work schedules, weather, and other variables, in order to engage or cut…

Dental Student Study Strategies: Are Self-Testing and Scheduling Related to Academic Performance?

PubMed

McAndrew, Maureen; Morrow, Christina S; Atiyeh, Lindsey; Pierre, Gaëlle C

2016-05-01

Self-testing, a strategy wherein a student actively engages in creating questions and answers from study materials to assist with studying, has been found to be especially advantageous because it enhances future retrieval of information. Studies have found correlations among students' grade point averages (GPAs), self-testing, and rereading study strategies, as well as the spacing of study sessions over time. The aim of this study was to assess relationships among dental students' study strategies, scheduling of study time, and academic achievement. A 16-item survey requesting information on study habits, study schedules, and GPAs was distributed to 358 second-year dental students at New York University College of Dentistry. Additionally, the survey asked students to report the average number of hours per week they devoted to studying for didactic courses and preparing for hands-on preclinical courses. Of the 358 students, 94 (26%) responded to the survey. The vast majority of the respondents reported utilizing self-testing and rereading study strategies. High performers (with higher GPAs) were more likely to use self-testing, especially with flashcards, and to space their studying over multiple sessions. Lower performing students were more likely to highlight or underline their notes and to mass their study sessions or cram. Longer hours devoted to studying and practicing for simulation courses were associated with stronger performance; lower performers reported spending significantly fewer hours practicing for simulation courses. Half of the dental students surveyed said that they felt their studying would be more productive in the morning, although 84% reported doing most of their studying in the evening or late night. Sound study decisions depend on accurate regulation of ongoing learning and appropriate use and timing of evidence-based study strategies, so these results suggest that dental students may require guidance in these areas.

The Experience of Emotions during the Job Search and Choice Process among Novice Job Seekers

ERIC Educational Resources Information Center

Bonaccio, Silvia; Gauvin, Natalie; Reeve, Charlie L.

2014-01-01

The authors investigate the role of emotions in the job search and choice process of novice job seekers. Results of qualitative analyses of the first-person accounts of 41 job seekers indicate that participants whose recollections of their job search contained emotional language were more likely to display a haphazard job search strategy than…

A response strategy predicts acquisition of schedule-induced polydipsia in rats.

PubMed

Gregory, James Gardner; Hawken, Emily R; Banasikowski, Tomek J; Dumont, Eric C; Beninger, Richard J

2015-08-03

Schedule-induced polydipsia (SIP) is excessive, non-regulatory drinking. We aimed to identify phenotypic learning traits representative of neural circuitry that underlies SIP and hypothesized that rats that are response-learners will be more susceptible in developing compulsive water drinking. Using the Y-maze, the rats were characterized as either place- or response-learners. They were exposed to the SIP protocol for a period of 21days. Subsequent histological staining for FosB/ΔFosB examined neuronal activation associated with SIP in several brain regions. The rats with a preference for a response-learning strategy were more likely to develop SIP than the rats using a place-learning strategy. Furthermore amphetamine sensitization, observed to increase SIP, also shifted learning strategy to a response-learning strategy. No differences were observed in FosB/ΔFosB expression between SIP and non-SIP rats in the dorsolateral striatum (DLS) and CA1 region of the hippocampus. However, SIP rats had greater FosB/ΔFosB expression in prefrontal cortex regions. The rats that develop SIP have a preference for response-learning strategies and increased neuronal activation in frontal cortical regions associated with habit formation and compulsion. Copyright © 2015 Elsevier Inc. All rights reserved.

Solving a Production Scheduling Problem by Means of Two Biobjective Metaheuristic Procedures

NASA Astrophysics Data System (ADS)

Toncovich, Adrián; Oliveros Colay, María José; Moreno, José María; Corral, Jiménez; Corral, Rafael

2009-11-01

Production planning and scheduling problems emphasize the need for the availability of management tools that can help to assure proper service levels to customers, maintaining, at the same time, the production costs at acceptable levels and maximizing the utilization of the production facilities. In this case, a production scheduling problem that arises in the context of the activities of a company dedicated to the manufacturing of furniture for children and teenagers is addressed. Two bicriteria metaheuristic procedures are proposed to solve the sequencing problem in a production equipment that constitutes the bottleneck of the production process of the company. The production scheduling problem can be characterized as a general flow shop with sequence dependant setup times and additional inventory constraints. Two objectives are simultaneously taken into account when the quality of the candidate solutions is evaluated: the minimization of completion time of all jobs, or makespan, and the minimization of the total flow time of all jobs. Both procedures are based on a local search strategy that responds to the structure of the simulated annealing metaheuristic. In this case, both metaheuristic approaches generate a set of solutions that provides an approximation to the optimal Pareto front. In order to evaluate the performance of the proposed techniques a series of experiments was conducted. After analyzing the results, it can be said that the solutions provided by both approaches are adequate from the viewpoint of the quality as well as the computational effort involved in their generation. Nevertheless, a further refinement of the proposed procedures should be implemented with the aim of facilitating a quasi-automatic definition of the solution parameters.

Research on Production Scheduling System with Bottleneck Based on Multi-agent

NASA Astrophysics Data System (ADS)

Zhenqiang, Bao; Weiye, Wang; Peng, Wang; Pan, Quanke

Aimed at the imbalance problem of resource capacity in Production Scheduling System, this paper uses Production Scheduling System based on multi-agent which has been constructed, and combines the dynamic and autonomous of Agent; the bottleneck problem in the scheduling is solved dynamically. Firstly, this paper uses Bottleneck Resource Agent to find out the bottleneck resource in the production line, analyses the inherent mechanism of bottleneck, and describes the production scheduling process based on bottleneck resource. Bottleneck Decomposition Agent harmonizes the relationship of job's arrival time and transfer time in Bottleneck Resource Agent and Non-Bottleneck Resource Agents, therefore, the dynamic scheduling problem is simplified as the single machine scheduling of each resource which takes part in the scheduling. Finally, the dynamic real-time scheduling problem is effectively solved in Production Scheduling System.

Community College Students Need Fair Job Scheduling Practices. Fact Sheet #C420

ERIC Educational Resources Information Center

Reichlin, Lindsey; Gault, Barbara

2014-01-01

This paper discusses the challenges that community college students face as a result of holding a job while pursuing a postsecondary education. Working is often critical to community college students' ability to pursue a postsecondary education, but holding a job while in school can threaten a student's success in college. For students to succeed…

Generating effective project scheduling heuristics by abstraction and reconstitution

NASA Technical Reports Server (NTRS)

Janakiraman, Bhaskar; Prieditis, Armand

1992-01-01

A project scheduling problem consists of a finite set of jobs, each with fixed integer duration, requiring one or more resources such as personnel or equipment, and each subject to a set of precedence relations, which specify allowable job orderings, and a set of mutual exclusion relations, which specify jobs that cannot overlap. No job can be interrupted once started. The objective is to minimize project duration. This objective arises in nearly every large construction project--from software to hardware to buildings. Because such project scheduling problems are NP-hard, they are typically solved by branch-and-bound algorithms. In these algorithms, lower-bound duration estimates (admissible heuristics) are used to improve efficiency. One way to obtain an admissible heuristic is to remove (abstract) all resources and mutual exclusion constraints and then obtain the minimal project duration for the abstracted problem; this minimal duration is the admissible heuristic. Although such abstracted problems can be solved efficiently, they yield inaccurate admissible heuristics precisely because those constraints that are central to solving the original problem are abstracted. This paper describes a method to reconstitute the abstracted constraints back into the solution to the abstracted problem while maintaining efficiency, thereby generating better admissible heuristics. Our results suggest that reconstitution can make good admissible heuristics even better.

Nontraditional work schedules for pharmacists.

PubMed

Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

2008-11-15

Nontraditional work schedules for pharmacists at three institutions are described. The demand for pharmacists and health care in general continues to increase, yet significant material changes are occurring in the pharmacy work force. These changing demographics, coupled with historical vacancy rates and turnover trends for pharmacy staff, require an increased emphasis on workplace changes that can improve staff recruitment and retention. At William S. Middleton Memorial Veterans Affairs Hospital in Madison, Wisconsin, creative pharmacist work schedules and roles are now mainstays to the recruitment and retention of staff. The major challenge that such scheduling presents is the 8 hours needed to prepare a six-week schedule. Baylor Medical Center at Grapevine in Dallas, Texas, has a total of 45 pharmacy employees, and slightly less than half of the 24.5 full-time-equivalent staff work full-time, with most preferring to work one, two, or three days per week. As long as the coverage needs of the facility are met, Envision Telepharmacy in Alpine, Texas, allows almost any scheduling arrangement preferred by individual pharmacists or the pharmacist group covering the facility. Staffing involves a great variety of shift lengths and intervals, with shifts ranging from 2 to 10 hours. Pharmacy leaders must be increasingly aware of opportunities to provide staff with unique scheduling and operational enhancements that can provide for a better work-life balance. Compressed workweeks, job-sharing, and team scheduling were the most common types of alternative work schedules implemented at three different institutions.

Block Scheduling in High Schools.

ERIC Educational Resources Information Center

Irmsher, Karen

1996-01-01

Block Scheduling has been considered a cure for a lengthy list of educational problems. This report reviews the literature on block schedules and describes some Oregon high schools that have integrated block scheduling. Major disadvantages included resistance to change and requirements that teachers change their teaching strategies. There is…

Integrated Dynamic Process Planning and Scheduling in Flexible Manufacturing Systems via Autonomous Agents

NASA Astrophysics Data System (ADS)

Nejad, Hossein Tehrani Nik; Sugimura, Nobuhiro; Iwamura, Koji; Tanimizu, Yoshitaka

Process planning and scheduling are important manufacturing planning activities which deal with resource utilization and time span of manufacturing operations. The process plans and the schedules generated in the planning phase shall be modified in the execution phase due to the disturbances in the manufacturing systems. This paper deals with a multi-agent architecture of an integrated and dynamic system for process planning and scheduling for multi jobs. A negotiation protocol is discussed, in this paper, to generate the process plans and the schedules of the manufacturing resources and the individual jobs, dynamically and incrementally, based on the alternative manufacturing processes. The alternative manufacturing processes are presented by the process plan networks discussed in the previous paper, and the suitable process plans and schedules are searched and generated to cope with both the dynamic status and the disturbances of the manufacturing systems. We initiatively combine the heuristic search algorithms of the process plan networks with the negotiation protocols, in order to generate suitable process plans and schedules in the dynamic manufacturing environment. A simulation software has been developed to carry out case studies, aimed at verifying the performance of the proposed multi-agent architecture.

Teacher Job Satisfaction in a Year-Round School.

ERIC Educational Resources Information Center

Haser, Shelly Gismondi; Nasser, Ilham

2003-01-01

Describes reasons for teacher job satisfaction at a year-round elementary school (Timber Lane) in Fairfax County, Virginia, such as flexible work schedules, reduced stress, and time for professional planning. (PKP)

Operational VGOS Scheduling

NASA Astrophysics Data System (ADS)

Searle, Anthony; Petrachenko, Bill

2016-12-01

The VLBI Global Observing System (VGOS) has been designed to take advantage of advances in data recording speeds and storage capacity, allowing for smaller and faster antennas, wider bandwidths, and shorter observation durations. Here, schedules for a ``realistic" VGOS network, frequency sequences, and expanded source lists are presented using a new source-based scheduling algorithm. The VGOS aim for continuous observations presents new operational challenges. As the source-based strategy is independent of the observing network, there are operational advantages which allow for more flexible scheduling of continuous VLBI observations. Using VieVS, simulations of several schedules are presented and compared with previous VGOS studies.

A note on resource allocation scheduling with group technology and learning effects on a single machine

NASA Astrophysics Data System (ADS)

Lu, Yuan-Yuan; Wang, Ji-Bo; Ji, Ping; He, Hongyu

2017-09-01

In this article, single-machine group scheduling with learning effects and convex resource allocation is studied. The goal is to find the optimal job schedule, the optimal group schedule, and resource allocations of jobs and groups. For the problem of minimizing the makespan subject to limited resource availability, it is proved that the problem can be solved in polynomial time under the condition that the setup times of groups are independent. For the general setup times of groups, a heuristic algorithm and a branch-and-bound algorithm are proposed, respectively. Computational experiments show that the performance of the heuristic algorithm is fairly accurate in obtaining near-optimal solutions.

Scheduling nurses’ shifts at PGI Cikini Hospital

NASA Astrophysics Data System (ADS)

Nainggolan, J. C. T.; Kusumastuti, R. D.

2018-03-01

Hospitals play an essential role in the community by providing medical services to the public. In order to provide high quality medical services, hospitals must manage their resources (including nurses) effectively and efficiently. Scheduling of nurses’ work shifts, in particular, is crucial, and must be conducted carefully to ensure availability and fairness. This research discusses the job scheduling system for nurses in PGI Cikini Hospital, Jakarta with Goal Programming approach. The research objectives are to identify nurse scheduling criteria and find the best schedule that can meet the criteria. The model has hospital regulations (including government regulations) as hard constraints, and nurses’ preferences as soft constraints. We gather primary data (hospital regulations and nurses’ preferences) through interviews with three Head Nurses and distributing questionnaires to fifty nurses. The results show that on the best schedule, all hard constraints can be satisfied. However, only two out of four soft constraints are satisfied. Compared to current scheduling practice, the resulting schedule ensures the availability of nurses as it satisfies all hospital’s regulations and it has a higher level of fairness as it can accommodate some of the nurses’ preferences.

Permutation flow-shop scheduling problem to optimize a quadratic objective function

NASA Astrophysics Data System (ADS)

Ren, Tao; Zhao, Peng; Zhang, Da; Liu, Bingqian; Yuan, Huawei; Bai, Danyu

2017-09-01

A flow-shop scheduling model enables appropriate sequencing for each job and for processing on a set of machines in compliance with identical processing orders. The objective is to achieve a feasible schedule for optimizing a given criterion. Permutation is a special setting of the model in which the processing order of the jobs on the machines is identical for each subsequent step of processing. This article addresses the permutation flow-shop scheduling problem to minimize the criterion of total weighted quadratic completion time. With a probability hypothesis, the asymptotic optimality of the weighted shortest processing time schedule under a consistency condition (WSPT-CC) is proven for sufficiently large-scale problems. However, the worst case performance ratio of the WSPT-CC schedule is the square of the number of machines in certain situations. A discrete differential evolution algorithm, where a new crossover method with multiple-point insertion is used to improve the final outcome, is presented to obtain high-quality solutions for moderate-scale problems. A sequence-independent lower bound is designed for pruning in a branch-and-bound algorithm for small-scale problems. A set of random experiments demonstrates the performance of the lower bound and the effectiveness of the proposed algorithms.

A hybrid flowshop scheduling model considering dedicated machines and lot-splitting for the solar cell industry

NASA Astrophysics Data System (ADS)

Wang, Li-Chih; Chen, Yin-Yann; Chen, Tzu-Li; Cheng, Chen-Yang; Chang, Chin-Wei

2014-10-01

This paper studies a solar cell industry scheduling problem, which is similar to traditional hybrid flowshop scheduling (HFS). In a typical HFS problem, the allocation of machine resources for each order should be scheduled in advance. However, the challenge in solar cell manufacturing is the number of machines that can be adjusted dynamically to complete the job. An optimal production scheduling model is developed to explore these issues, considering the practical characteristics, such as hybrid flowshop, parallel machine system, dedicated machines, sequence independent job setup times and sequence dependent job setup times. The objective of this model is to minimise the makespan and to decide the processing sequence of the orders/lots in each stage, lot-splitting decisions for the orders and the number of machines used to satisfy the demands in each stage. From the experimental results, lot-splitting has significant effect on shortening the makespan, and the improvement effect is influenced by the processing time and the setup time of orders. Therefore, the threshold point to improve the makespan can be identified. In addition, the model also indicates that more lot-splitting approaches, that is, the flexibility of allocating orders/lots to machines is larger, will result in a better scheduling performance.

Backfilling with guarantees granted upon job submission.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Leung, Vitus Joseph; Bunde, David P.; Lindsay, Alexander M.

2011-01-01

In this paper, we present scheduling algorithms that simultaneously support guaranteed starting times and favor jobs with system desired traits. To achieve the first of these goals, our algorithms keep a profile with potential starting times for every unfinished job and never move these starting times later, just as in Conservative Backfilling. To achieve the second, they exploit previously unrecognized flexibility in the handling of holes opened in this profile when jobs finish early. We find that, with one choice of job selection function, our algorithms can consistently yield a lower average waiting time than Conservative Backfilling while still providingmore » a guaranteed start time to each job as it arrives. In fact, in most cases, the algorithms give a lower average waiting time than the more aggressive EASY backfilling algorithm, which does not provide guaranteed start times. Alternately, with a different choice of job selection function, our algorithms can focus the benefit on the widest submitted jobs, the reason for the existence of parallel systems. In this case, these jobs experience significantly lower waiting time than Conservative Backfilling with minimal impact on other jobs.« less

Constraint-Based Scheduling System

NASA Technical Reports Server (NTRS)

Zweben, Monte; Eskey, Megan; Stock, Todd; Taylor, Will; Kanefsky, Bob; Drascher, Ellen; Deale, Michael; Daun, Brian; Davis, Gene

1995-01-01

Report describes continuing development of software for constraint-based scheduling system implemented eventually on massively parallel computer. Based on machine learning as means of improving scheduling. Designed to learn when to change search strategy by analyzing search progress and learning general conditions under which resource bottleneck occurs.

Scheduling Capacitated One-Way Vehicles on Paths with Deadlines

NASA Astrophysics Data System (ADS)

Uchida, Jun; Karuno, Yoshiyuki; Nagamochi, Hiroshi

In this paper, we deal with a scheduling problem of minimizing the number of employed vehicles on paths. Let G=(V,E) be a path with a set V={vi|i=1,2,...,n} of vertices and a set E={{vi,vi+1}|i=1,2,...,n-1} of edges. Vehicles with capacity b are initially situated at v1. There is a job i at each vertex vi∈V, which has its own handling time hi and deadline di. With each edge {vi,vi+1}∈E, a travel time wi,i+1 is associated. Each job is processed by exactly one vehicle, and the number of jobs processed by a vehicle does not exceed the capacity b. A routing of a vehicle is called one-way if the vehicle visits every edge {vi,vi+1} exactly once (i.e., it simply moves from v1 to vn on G). Any vehicle is assumed to follow the one-way routing constraint. The problem asks to find a schedule that minimizes the number of one-way vehicles, meeting the deadline and capacity constraints. A greedy heuristic is proposed, which repeats a dynamic programming procedure for a single one-way vehicle problem of maximizing the number of non-tardy jobs. We show that the greedy heuristic runs in O(n3) time, and the approximation ratio is at most ln b+1.

Job sharing as an employment alternative in group medical practice.

PubMed

Vanek, E P; Vanek, J A

2001-01-01

Although physicians discuss quality-of-life and employment issues with their patients, they often fail to consider flexible scheduling and reduced employment options to lessen their own job stress. We examined one of these options by surveying two community-based, private practice groups with a combined 13-year experience with job sharing. We found that a majority of respondents rated job sharing as successful, and most wanted it to continue. Job sharers derived considerable personal benefit from the arrangement and had significantly more positive attitudes toward work than full-time physicians. Job sharing appeared to have little impact on practice parameters. Dependability, flexibility and willingness to cooperate were the most important attributes in choosing a job-sharing partner. Job sharing is an employment alternative worth exploring to retain physicians in medical group practice.

Job adjustment as a means to reduce sickness absence during pregnancy.

PubMed

Strand, K; Wergeland, E; Bjerkedal, T

1997-10-01

This study examined the effect of job adjustment on sickness absence during pregnancy and also determined the conditions under which such adjustments are obtained. Data were derived from a nationally representative survey on work conditions during pregnancy in Norway in 1989. For employees (N = 2713) remaining in the same job throughout pregnancy, the percentage of women on sick leave immediately before delivery was determined according to the need for job adjustment and the obtainment of job adjustment. Those obtaining job adjustment were grouped according to workplace size, labor-market sector, co-worker gender, educational level, work schedules, weekly workhours, children under 16 years of age in the household, and age. All told, 1691 women (62.3%) needed job adjustment, among whom 936 (55.4%) obtained such adjustment. The proportions of those on sick leave before delivery were 45.2% for "no need", 67.9% for "need - adjustment obtained", and 79.2% for "need - adjustment not obtained". In the last category, the difference (versus "adjustment obtained") constituted 44.5% of the weeks lost because of sickness absence in the last half of pregnancy. The odds ratio (OR) for obtaining job adjustment was larger for workplaces with more than 50 employees (OR 1.4) and smaller for jobs with work schedules other than daytime or shift work (OR 0.5) and also for women living with children under 16 years of age (OR 0.8). Job adjustment is associated with reduced sickness absence during pregnancy. Further studies should explore workplace characteristics that make it difficult to obtain such adjustments, as required by law.

Job Superscheduler Architecture and Performance in Computational Grid Environments

NASA Technical Reports Server (NTRS)

Shan, Hongzhang; Oliker, Leonid; Biswas, Rupak

2003-01-01

Computational grids hold great promise in utilizing geographically separated heterogeneous resources to solve large-scale complex scientific problems. However, a number of major technical hurdles, including distributed resource management and effective job scheduling, stand in the way of realizing these gains. In this paper, we propose a novel grid superscheduler architecture and three distributed job migration algorithms. We also model the critical interaction between the superscheduler and autonomous local schedulers. Extensive performance comparisons with ideal, central, and local schemes using real workloads from leading computational centers are conducted in a simulation environment. Additionally, synthetic workloads are used to perform a detailed sensitivity analysis of our superscheduler. Several key metrics demonstrate that substantial performance gains can be achieved via smart superscheduling in distributed computational grids.

Burnout and job performance: the moderating role of selection, optimization, and compensation strategies.

PubMed

Demerouti, Evangelia; Bakker, Arnold B; Leiter, Michael

2014-01-01

The present study aims to explain why research thus far has found only low to moderate associations between burnout and performance. We argue that employees use adaptive strategies that help them to maintain their performance (i.e., task performance, adaptivity to change) at acceptable levels despite experiencing burnout (i.e., exhaustion, disengagement). We focus on the strategies included in the selective optimization with compensation model. Using a sample of 294 employees and their supervisors, we found that compensation is the most successful strategy in buffering the negative associations of disengagement with supervisor-rated task performance and both disengagement and exhaustion with supervisor-rated adaptivity to change. In contrast, selection exacerbates the negative relationship of exhaustion with supervisor-rated adaptivity to change. In total, 42% of the hypothesized interactions proved to be significant. Our study uncovers successful and unsuccessful strategies that people use to deal with their burnout symptoms in order to achieve satisfactory job performance. PsycINFO Database Record (c) 2014 APA, all rights reserved.

Relationship between job stress, occupational position and job satisfaction using a brief job stress questionnaire (BJSQ).

PubMed

Kawada, Tomoyuki; Otsuka, Toshiaki

2011-01-01

with clerical workers. Worsening of job satisfaction was related to poor job control and lack of support. Strategies to alleviate job stress are therefore urgently needed.

A distributed scheduling algorithm for heterogeneous real-time systems

NASA Technical Reports Server (NTRS)

Zeineldine, Osman; El-Toweissy, Mohamed; Mukkamala, Ravi

1991-01-01

Much of the previous work on load balancing and scheduling in distributed environments was concerned with homogeneous systems and homogeneous loads. Several of the results indicated that random policies are as effective as other more complex load allocation policies. The effects of heterogeneity on scheduling algorithms for hard real time systems is examined. A distributed scheduler specifically to handle heterogeneities in both nodes and node traffic is proposed. The performance of the algorithm is measured in terms of the percentage of jobs discarded. While a random task allocation is very sensitive to heterogeneities, the algorithm is shown to be robust to such non-uniformities in system components and load.

Associations between employees' work schedules and the vocational consequences of workplace injuries.

PubMed

Dembe, Allard E; Delbos, Rachel; Erickson, J Bianca; Banks, Steven M

2007-12-01

This study examines the effect of long-hour work schedules and nonstandard shift work (e.g., night and evening shifts) on the ability of injured workers to maintain productive employment following a workplace injury. Analyses were based on 13 years of data from the National Longitudinal Survey of Youth. Multivariate logistic regression analyses were performed with one of ten nonstandard schedules as the independent variable and a particular vocational consequences as the dependent variable. Vocational consequences included being unable to perform normal job duties, temporary job reassignment, working less than full time, filing a workers' compensation claim, and quitting or being fired because of the injury. Covariates in the regression model included age, gender, occupation, industry, and region. The most prominent effects of working a nonstandard schedule were a increased risk of being fired (OR = 1.81; 1.15-2.90 CI 95%), quitting (OR = 1.68; 1.20-2.36 CI 95%), or being unable to work full time (OR = 1.33; 1.08-1.64 CI 95%) following an injury, compared to injured workers in conventional schedules. Schedules involving overtime and long working hours generally had a greater impact on vocational consequences following a workplace injury than did schedules involving night, evening, and other nonstandard shift work. Occupational rehabilitation professionals need to consider the specific type of work schedule when developing effective return-to-work plans for injured workers. Special precautions need to be taken for workers returning to schedules that involve more than 12 h per day, 60 h per week, and long commutes.

Job Satisfaction of NAIA Head Coaches at Small Faith-Based Colleges: The Teacher-Coach Model

ERIC Educational Resources Information Center

Stiemsma, Craig L.

2010-01-01

The head coaches at smaller colleges usually have other job responsibilities that include teaching, along with the responsibilities of coaching, recruiting, scheduling, and other coaching-related jobs. There is often a dual role involved for these coaches who try to juggle two different jobs that sometimes require different skill sets and involve…

A transportation-scheduling system for managing silvicultural projects

Treesearch

Jorge F. Valenzuela; H. Hakan Balci; Timothy McDonald

2005-01-01

A silvicultural project encompasses tasks such as sitelevel planning, regeneration, harvestin, and stand-tending treatments. an essential problem in managing silvicultural projects is to efficiently schedule the operations while considering project task due dates and costs of moving scarce resources to specific job locations. Transportation costs represent a...

Economic Development Projects and Jobs: Lessons from the Targeted Jobs Demonstration Program.

ERIC Educational Resources Information Center

Van Horn, Carl; And Others

This guide, based on approaches for targeting jobs and business opportunities that were developed during the Targeted Jobs Demonstration Program (TJDP), contains strategies and techniques for ensuring that some of the benefits of economic development investments are directed to low-income individuals and small and minority businesses. Addressed in…

Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor Networks

PubMed Central

Guo, Wenzhong; Xiong, Naixue; Chao, Han-Chieh; Hussain, Sajid; Chen, Guolong

2011-01-01

In a wireless sensor network (WSN), the usage of resources is usually highly related to the execution of tasks which consume a certain amount of computing and communication bandwidth. Parallel processing among sensors is a promising solution to provide the demanded computation capacity in WSNs. Task allocation and scheduling is a typical problem in the area of high performance computing. Although task allocation and scheduling in wired processor networks has been well studied in the past, their counterparts for WSNs remain largely unexplored. Existing traditional high performance computing solutions cannot be directly implemented in WSNs due to the limitations of WSNs such as limited resource availability and the shared communication medium. In this paper, a self-adapted task scheduling strategy for WSNs is presented. First, a multi-agent-based architecture for WSNs is proposed and a mathematical model of dynamic alliance is constructed for the task allocation problem. Then an effective discrete particle swarm optimization (PSO) algorithm for the dynamic alliance (DPSO-DA) with a well-designed particle position code and fitness function is proposed. A mutation operator which can effectively improve the algorithm’s ability of global search and population diversity is also introduced in this algorithm. Finally, the simulation results show that the proposed solution can achieve significant better performance than other algorithms. PMID:22163971

An FMS Dynamic Production Scheduling Algorithm Considering Cutting Tool Failure and Cutting Tool Life

NASA Astrophysics Data System (ADS)

Setiawan, A.; Wangsaputra, R.; Martawirya, Y. Y.; Halim, A. H.

2016-02-01

This paper deals with Flexible Manufacturing System (FMS) production rescheduling due to unavailability of cutting tools caused either of cutting tool failure or life time limit. The FMS consists of parallel identical machines integrated with an automatic material handling system and it runs fully automatically. Each machine has a same cutting tool configuration that consists of different geometrical cutting tool types on each tool magazine. The job usually takes two stages. Each stage has sequential operations allocated to machines considering the cutting tool life. In the real situation, the cutting tool can fail before the cutting tool life is reached. The objective in this paper is to develop a dynamic scheduling algorithm when a cutting tool is broken during unmanned and a rescheduling needed. The algorithm consists of four steps. The first step is generating initial schedule, the second step is determination the cutting tool failure time, the third step is determination of system status at cutting tool failure time and the fourth step is the rescheduling for unfinished jobs. The approaches to solve the problem are complete-reactive scheduling and robust-proactive scheduling. The new schedules result differences starting time and completion time of each operations from the initial schedule.

Work-Life Benefits and Job Pursuit Intentions: The Role of Anticipated Organizational Support

ERIC Educational Resources Information Center

Casper, Wendy J.; Buffardi, Louis C.

2004-01-01

The current study examined the impact of two work-life benefits, work schedule flexibility, and dependent care assistance, on applicants' intentions to pursue jobs with potential employers. The study also explored whether anticipated organizational support would mediate the relationships between these two work-life benefits and job pursuit…

75 FR 28071 - Records Schedules; Availability and Request for Comments

Federal Register 2010, 2011, 2012, 2013, 2014

2010-05-19

... authorized for disposal or reduce the retention period of records already authorized for disposal. NARA... this accumulation, agency records managers prepare schedules proposing retention periods for records... information concerning evaluations of enlisted personnel. Included are job ratings as well as information...

Community Resources and Job Placement

ERIC Educational Resources Information Center

Preston, Jim

1977-01-01

In cooperation with the chamber of commerce, various businesses, associations, and other community agencies, the Sarasota schools (Florida) supplement their own job placement and follow-up efforts with community job development strategies for placing high school graduates. (JT)

Thread scheduling for GPU-based OPC simulation on multi-thread

NASA Astrophysics Data System (ADS)

Lee, Heejun; Kim, Sangwook; Hong, Jisuk; Lee, Sooryong; Han, Hwansoo

2018-03-01

As semiconductor product development based on shrinkage continues, the accuracy and difficulty required for the model based optical proximity correction (MBOPC) is increasing. OPC simulation time, which is the most timeconsuming part of MBOPC, is rapidly increasing due to high pattern density in a layout and complex OPC model. To reduce OPC simulation time, we attempt to apply graphic processing unit (GPU) to MBOPC because OPC process is good to be programmed in parallel. We address some issues that may typically happen during GPU-based OPC simulation in multi thread system, such as "out of memory" and "GPU idle time". To overcome these problems, we propose a thread scheduling method, which manages OPC jobs in multiple threads in such a way that simulations jobs from multiple threads are alternatively executed on GPU while correction jobs are executed at the same time in each CPU cores. It was observed that the amount of GPU peak memory usage decreases by up to 35%, and MBOPC runtime also decreases by 4%. In cases where out of memory issues occur in a multi-threaded environment, the thread scheduler was used to improve MBOPC runtime up to 23%.

Work-family conflict and enrichment from the perspective of psychosocial resources: comparing Finnish healthcare workers by working schedules.

PubMed

Mauno, Saija; Ruokolainen, Mervi; Kinnunen, Ulla

2015-05-01

We examined work-family conflict (WFC) and work-family enrichment (WFE) by comparing Finnish nurses, working dayshifts (non-shiftworkers, n = 874) and non-dayshifts. The non-dayshift employees worked either two different dayshifts (2-shiftworkers, n = 490) or three different shifts including nightshifts (3-shiftworkers, n = 270). Specifically, we investigated whether different resources, i.e. job control, managers' work-family support, co-workers' work-family support, control at home, personal coping strategies, and schedule satisfaction, predicted differently WFC and WFE in these three groups. Results showed that lower managers' work-family support predicted higher WFC only among 3-shiftworkers, whereas lower co-workers' support associated with increased WFC only in non-shiftworkers. In addition, shiftworkers reported higher WFC than non-shiftworkers. However, the level of WFE did not vary by schedule types. Moreover, the predictors of WFE varied only very little across schedule types. Shiftwork organizations should pay more attention to family-friendly management in order to reduce WFC among shiftworkers. Copyright © 2014 Elsevier Ltd and The Ergonomics Society. All rights reserved.

Job Strategies for Urban Youth. Sixteen Pilot Programs for Action.

ERIC Educational Resources Information Center

Work in America Inst., Scarsdale, NY.

Developed by a study concerned with urban youth unemployment, this report provides descriptions of sixteen pilot projects intended to find or create unsubsidized jobs for youth, help them prepare for these jobs, and bring youth and jobs together. Based on the theme that unemployment results not from lack of will to work but from lack of…

Job Management Requirements for NAS Parallel Systems and Clusters

NASA Technical Reports Server (NTRS)

Saphir, William; Tanner, Leigh Ann; Traversat, Bernard

1995-01-01

A job management system is a critical component of a production supercomputing environment, permitting oversubscribed resources to be shared fairly and efficiently. Job management systems that were originally designed for traditional vector supercomputers are not appropriate for the distributed-memory parallel supercomputers that are becoming increasingly important in the high performance computing industry. Newer job management systems offer new functionality but do not solve fundamental problems. We address some of the main issues in resource allocation and job scheduling we have encountered on two parallel computers - a 160-node IBM SP2 and a cluster of 20 high performance workstations located at the Numerical Aerodynamic Simulation facility. We describe the requirements for resource allocation and job management that are necessary to provide a production supercomputing environment on these machines, prioritizing according to difficulty and importance, and advocating a return to fundamental issues.

Focus of attention in an activity-based scheduler

NASA Technical Reports Server (NTRS)

Sadeh, Norman; Fox, Mark S.

1989-01-01

Earlier research in job shop scheduling has demonstrated the advantages of opportunistically combining order-based and resource-based scheduling techniques. An even more flexible approach is investigated where each activity is considered a decision point by itself. Heuristics to opportunistically select the next decision point on which to focus attention (i.e., variable ordering heuristics) and the next decision to be tried at this point (i.e., value ordering heuristics) are described that probabilistically account for both activity precedence and resource requirement interactions. Preliminary experimental results indicate that the variable ordering heuristic greatly increases search efficiency. While least constraining value ordering heuristics have been advocated in the literature, the experimental results suggest that other value ordering heuristics combined with our variable-ordering heuristic can produce much better schedules without significantly increasing search.

Developing algorithm for the critical care physician scheduling

NASA Astrophysics Data System (ADS)

Lee, Hyojun; Pah, Adam; Amaral, Luis; Northwestern Memorial Hospital Collaboration

Understanding the social network has enabled us to quantitatively study social phenomena such as behaviors in adoption and propagation of information. However, most work has been focusing on networks of large heterogeneous communities, and little attention has been paid to how work-relevant information spreads within networks of small and homogeneous groups of highly trained individuals, such as physicians. Within the professionals, the behavior patterns and the transmission of information relevant to the job are dependent not only on the social network between the employees but also on the schedules and teams that work together. In order to systematically investigate the dependence of the spread of ideas and adoption of innovations on a work-environment network, we sought to construct a model for the interaction network of critical care physicians at Northwestern Memorial Hospital (NMH) based on their work schedules. We inferred patterns and hidden rules from past work schedules such as turnover rates. Using the characteristics of the work schedules of the physicians and their turnover rates, we were able to create multi-year synthetic work schedules for a generic intensive care unit. The algorithm for creating shift schedules can be applied to other schedule dependent networks ARO1.

Genetic programming for evolving due-date assignment models in job shop environments.

PubMed

Nguyen, Su; Zhang, Mengjie; Johnston, Mark; Tan, Kay Chen

2014-01-01

Due-date assignment plays an important role in scheduling systems and strongly influences the delivery performance of job shops. Because of the stochastic and dynamic nature of job shops, the development of general due-date assignment models (DDAMs) is complicated. In this study, two genetic programming (GP) methods are proposed to evolve DDAMs for job shop environments. The experimental results show that the evolved DDAMs can make more accurate estimates than other existing dynamic DDAMs with promising reusability. In addition, the evolved operation-based DDAMs show better performance than the evolved DDAMs employing aggregate information of jobs and machines.

A Job Pause Service under LAM/MPI+BLCR for Transparent Fault Tolerance

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wang, Chao; Mueller, Frank; Engelmann, Christian

2007-01-01

Checkpoint/restart (C/R) has become a requirement for long-running jobs in large-scale clusters due to a meantime- to-failure (MTTF) in the order of hours. After a failure, C/R mechanisms generally require a complete restart of an MPI job from the last checkpoint. A complete restart, however, is unnecessary since all but one node are typically still alive. Furthermore, a restart may result in lengthy job requeuing even though the original job had not exceeded its time quantum. In this paper, we overcome these shortcomings. Instead of job restart, we have developed a transparent mechanism for job pause within LAM/MPI+BLCR. This mechanismmore » allows live nodes to remain active and roll back to the last checkpoint while failed nodes are dynamically replaced by spares before resuming from the last checkpoint. Our methodology includes LAM/MPI enhancements in support of scalable group communicationwith fluctuating number of nodes, reuse of network connections, transparent coordinated checkpoint scheduling and a BLCR enhancement for job pause. Experiments in a cluster with the NAS Parallel Benchmark suite show that our overhead for job pause is comparable to that of a complete job restart. A minimal overhead of 5.6% is only incurred in case migration takes place while the regular checkpoint overhead remains unchanged. Yet, our approach alleviates the need to reboot the LAM run-time environment, which accounts for considerable overhead resulting in net savings of our scheme in the experiments. Our solution further provides full transparency and automation with the additional benefit of reusing existing resources. Executing continues after failures within the scheduled job, i.e., the application staging overhead is not incurred again in contrast to a restart. Our scheme offers additional potential for savings through incremental checkpointing and proactive diskless live migration, which we are currently working on.« less

Burnout among psychosocial oncologists in Israel: The direct and indirect effects of job demands and job resources.

PubMed

Shinan-Altman, Shiri; Cohen, Miri; Rasmussen, Victoria; Turnell, Adrienne; Butow, Phyllis

2017-12-19

Psychosocial oncologists may be particularly vulnerable to burnout. This study aimed to assess burnout among Israeli psychosocial oncologists in relation to the Job Demands-Resources model and the coping strategies model. Participants included 85 of 128 listed psychosocial oncologists currently working with cancer patients. They completed a questionnaire assessing emotional exhaustion, depersonalization, job demands, job resources, work engagement, overcommitment, and perceived value of work. The mean level of burnout was low, whereas 16.3% experienced high levels of emotional exhaustion and only 2.4% experienced high levels of depersonalization. According to mediation analysis, overcommitment, partially mediated job demands-burnout associations, and work engagement mediated the perceived value-burnout association. Job resources and burnout were not related, either directly or indirectly. Significance of results The study extended the Job Demands-Resources model to include perceived value as an additional resource, and work-engagement and overcommitment as coping strategies. Two distinct patterns of associations were found between work characteristics and burnout: the positive-protective pattern (perceived value and work engagement) and the negative pattern (job demands and overcommitment). These two patterns should be considered for further research and for implementing preventive interventions to reduce burnout in the workplace setting.

Optimal recombination in genetic algorithms for flowshop scheduling problems

NASA Astrophysics Data System (ADS)

Kovalenko, Julia

2016-10-01

The optimal recombination problem consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We prove NP-hardness of the optimal recombination for various variants of the flowshop scheduling problem with makespan criterion and criterion of maximum lateness. An algorithm for solving the optimal recombination problem for permutation flowshop problems is built, using enumeration of prefect matchings in a special bipartite graph. The algorithm is adopted for the classical flowshop scheduling problem and for the no-wait flowshop problem. It is shown that the optimal recombination problem for the permutation flowshop scheduling problem is solvable in polynomial time for almost all pairs of parent solutions as the number of jobs tends to infinity.

Goal orientation, self-regulation strategies, and job-seeking intensity in unemployed adults.

PubMed

Creed, Peter A; King, Vivien; Hood, Michelle; McKenzie, Robert

2009-05-01

At Time 1 (T1), the authors surveyed 277 unemployed adults using measures of human capital, goal orientation, self-regulation (emotion control, motivation control, work commitment), and job-seeking intensity. At Time 2 (T2), 4 months later, 155 participants indicated their reemployment outcomes in number of job interviews and number of job offers. Using T1 data, the authors tested the predictors of job-seeking intensity and whether self-regulation mediated between goal orientation and job-seeking intensity. Using T1 and T2 data, they tested for predictors of reemployment outcomes and whether job-seeking intensity mediated the relationship between T1 antecedent variables and the reemployment outcomes. Learning goal orientation and self-regulation predicted job-seeking intensity, and self-regulation mediated between learning goal orientation and job-seeking intensity. Job-seeking intensity did not mediate the relationship among human capital, goal orientation, and self-regulation variables and reemployment outcomes. (c) 2009 APA, all rights reserved.

Peregrine Job Queues and Scheduling Policies | High-Performance Computing |

Science.gov Websites

batch batch-h long bigmem data-transfer feature Max wall time 1 hour 4 hours 2 days 2 days 10 days 10 # nodes per job 2 8 288 576 120 46 1 # of 24 core 64 GB Haswell nodes 2 8 0 1228 0 0 0 haswell # of 24core 32 GB nodes 2 16 576 0 126 0 0 24core # of 16core 32 GB nodes 2 8 195 0 162 0 5 16core, # of 24core

Job decision latitude, job demands, and cardiovascular disease: a prospective study of Swedish men.

PubMed Central

Karasek, R; Baker, D; Marxer, F; Ahlbom, A; Theorell, T

1981-01-01

The association between specific job characteristics and subsequent cardiovascular disease was tested using a large random sample of the male working Swedish population. The prospective development of coronary heart disease (CHD) symptoms and signs was analyzed using a multivariate logistic regression technique. Additionally, a case-controlled study was used to analyze all cardiovascular-cerebrovascular (CHD-CVD) deaths during a six-year follow-up. The indicator of CHD symptoms and signs was validated in a six-year prospective study of CHD deaths (standardized mortality ratio 5.0; p less than or equal to .001). A hectic and psychologically demanding job increases the risk of developing CHD symptoms and signs (standardized odds ratio 1.29, p less than 0.25) and premature CHD-CVD death (relative risk 4.0, p less than .01). Low decision latitude-expressed as low intellectual discretion and low personal schedule freedom-is also associated with increased risk of cardiovascular disease. Low intellectual discretion predicts the development of CHD symptoms and signs (SOR 1.44, p less than .01), while low personal schedule freedom among the majority of workers with the minimum statutory education increases the risk of CHD-CVD death (RR 6.6, p less than .0002). The associations exist after controlling for age, education, smoking, and overweight. PMID:7246835

Job decision latitude, job demands, and cardiovascular disease: a prospective study of Swedish men.

PubMed

Karasek, R; Baker, D; Marxer, F; Ahlbom, A; Theorell, T

1981-07-01

The association between specific job characteristics and subsequent cardiovascular disease was tested using a large random sample of the male working Swedish population. The prospective development of coronary heart disease (CHD) symptoms and signs was analyzed using a multivariate logistic regression technique. Additionally, a case-controlled study was used to analyze all cardiovascular-cerebrovascular (CHD-CVD) deaths during a six-year follow-up. The indicator of CHD symptoms and signs was validated in a six-year prospective study of CHD deaths (standardized mortality ratio 5.0; p less than or equal to .001). A hectic and psychologically demanding job increases the risk of developing CHD symptoms and signs (standardized odds ratio 1.29, p less than 0.25) and premature CHD-CVD death (relative risk 4.0, p less than .01). Low decision latitude-expressed as low intellectual discretion and low personal schedule freedom-is also associated with increased risk of cardiovascular disease. Low intellectual discretion predicts the development of CHD symptoms and signs (SOR 1.44, p less than .01), while low personal schedule freedom among the majority of workers with the minimum statutory education increases the risk of CHD-CVD death (RR 6.6, p less than .0002). The associations exist after controlling for age, education, smoking, and overweight.

Analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times

NASA Astrophysics Data System (ADS)

Sharma, Pankaj; Jain, Ajai

2014-12-01

Stochastic dynamic job shop scheduling problem with consideration of sequence-dependent setup times are among the most difficult classes of scheduling problems. This paper assesses the performance of nine dispatching rules in such shop from makespan, mean flow time, maximum flow time, mean tardiness, maximum tardiness, number of tardy jobs, total setups and mean setup time performance measures viewpoint. A discrete event simulation model of a stochastic dynamic job shop manufacturing system is developed for investigation purpose. Nine dispatching rules identified from literature are incorporated in the simulation model. The simulation experiments are conducted under due date tightness factor of 3, shop utilization percentage of 90% and setup times less than processing times. Results indicate that shortest setup time (SIMSET) rule provides the best performance for mean flow time and number of tardy jobs measures. The job with similar setup and modified earliest due date (JMEDD) rule provides the best performance for makespan, maximum flow time, mean tardiness, maximum tardiness, total setups and mean setup time measures.

A strategy to load balancing for non-connectivity MapReduce job

NASA Astrophysics Data System (ADS)

Zhou, Huaping; Liu, Guangzong; Gui, Haixia

2017-09-01

MapReduce has been widely used in large scale and complex datasets as a kind of distributed programming model. Original Hash partitioning function in MapReduce often results the problem of data skew when data distribution is uneven. To solve the imbalance of data partitioning, we proposes a strategy to change the remaining partitioning index when data is skewed. In Map phase, we count the amount of data which will be distributed to each reducer, then Job Tracker monitor the global partitioning information and dynamically modify the original partitioning function according to the data skew model, so the Partitioner can change the index of these partitioning which will cause data skew to the other reducer that has less load in the next partitioning process, and can eventually balance the load of each node. Finally, we experimentally compare our method with existing methods on both synthetic and real datasets, the experimental results show our strategy can solve the problem of data skew with better stability and efficiency than Hash method and Sampling method for non-connectivity MapReduce task.

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

NASA Astrophysics Data System (ADS)

Nouri, Houssem Eddine; Belkahla Driss, Olfa; Ghédira, Khaled

2018-03-01

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based clustered holonic multiagent model. First, a neighborhood-based genetic algorithm (NGA) is applied by a scheduler agent for a global exploration of the search space. Second, a local search technique is used by a set of cluster agents to guide the research in promising regions of the search space and to improve the quality of the NGA final population. The efficiency of our approach is explained by the flexible selection of the promising parts of the search space by the clustering operator after the genetic algorithm process, and by applying the intensification technique of the tabu search allowing to restart the search from a set of elite solutions to attain new dominant scheduling solutions. Computational results are presented using four sets of well-known benchmark literature instances. New upper bounds are found, showing the effectiveness of the presented approach.

Reach of Individuals at Risk for Cardiovascular Disease by Proactive Recruitment Strategies in General Practices, Job Centers, and Health Insurance.

PubMed

Guertler, Diana; Meyer, Christian; Dörr, Marcus; Braatz, Janina; Weymar, Franziska; John, Ulrich; Freyer-Adam, Jennis; Ulbricht, Sabina

2017-02-01

Reach of individuals at risk for cardiovascular disease (CVD) constitutes a major determinant of the population impact of preventive effort. This study compares three proactive recruitment strategies regarding their reach of individuals with CVD risk factors. Individuals aged 40-65 years were invited to a two-stage cardio-preventive program including an on-site health screening and a cardiovascular examination program (CEP) using face-to-face recruitment in general practices (n = 671), job centers (n = 1049), and mail invitations from health insurance (n = 894). The recruitment strategies were compared regarding the following: (1) participation rate; (2) participants' characteristics, i.e., socio-demographics, self-reported health, and CVD risk factors (smoking, physical activity, fruit/vegetable consumption, body mass index, blood pressure, high-density lipoprotein, triglycerides, and glycated hemoglobin); and (3) participation factors, i.e., differences between participants and non-participants. Screening participation rates were 56.0, 32.8, and 23.5 % for the general practices, the job centers, and the health insurance, respectively. Among eligible individuals for the CEP, respectively, 80.3, 65.5, and 96.1 % participated in the CEP. Job center clients showed the lowest socio-economic status and the most adverse CVD risk pattern. Being female predicted screening participation across all strategies (OR = 1.45, 95 % CI 1.07-1.98; OR = 1.34, 95 % CI 1.04-1.74; OR = 1.62, 95 % CI 1.16-2.27). Age predicted screening participation only within health insurance (OR = 1.04, 95 % CI 1.01-1.06). Within the general practices and the job centers, CEP participants were less likely to be smokers than non-participants (OR = 0.49, 95 % CI 0.26-0.94; OR = 0.42, 95 % CI 0.20-0.89). The recruitment in general practices yielded the highest reach. However, job centers may be useful to reduce health inequalities induced by social gradient.

A parallel-machine scheduling problem with two competing agents

NASA Astrophysics Data System (ADS)

Lee, Wen-Chiung; Chung, Yu-Hsiang; Wang, Jen-Ya

2017-06-01

Scheduling with two competing agents has become popular in recent years. Most of the research has focused on single-machine problems. This article considers a parallel-machine problem, the objective of which is to minimize the total completion time of jobs from the first agent given that the maximum tardiness of jobs from the second agent cannot exceed an upper bound. The NP-hardness of this problem is also examined. A genetic algorithm equipped with local search is proposed to search for the near-optimal solution. Computational experiments are conducted to evaluate the proposed genetic algorithm.

A Micro-Computer Based Employee Scheduling System for the Palo Alto Veterans Administration Medical Center

DTIC Science & Technology

1988-09-01

scheduler’s knowledge of available employees ’ experience levels. If the scheduler lacks first-hand knowledge of employee experience levels, then assistance ...to start a new system of rotating primary employees and asked that this capability be included in the program . Yet he had only a vague idea 29 about...competitive with the DBASE prototype. The LOTUS 123 program was based around a spreadsheet that contained all the job, employee and schedule form data in a

Decomposition of timed automata for solving scheduling problems

NASA Astrophysics Data System (ADS)

Nishi, Tatsushi; Wakatake, Masato

2014-03-01

A decomposition algorithm for scheduling problems based on timed automata (TA) model is proposed. The problem is represented as an optimal state transition problem for TA. The model comprises of the parallel composition of submodels such as jobs and resources. The procedure of the proposed methodology can be divided into two steps. The first step is to decompose the TA model into several submodels by using decomposable condition. The second step is to combine individual solution of subproblems for the decomposed submodels by the penalty function method. A feasible solution for the entire model is derived through the iterated computation of solving the subproblem for each submodel. The proposed methodology is applied to solve flowshop and jobshop scheduling problems. Computational experiments demonstrate the effectiveness of the proposed algorithm compared with a conventional TA scheduling algorithm without decomposition.

Scoping the common antecedents of job stress and job satisfaction for nurses (2000-2013) using the job demands-resources model of stress.

PubMed

McVicar, Andrew

2016-03-01

To identify core antecedents of job stress and job satisfaction, and to explore the potential of stress interventions to improve job satisfaction. Decreased job satisfaction for nurses is strongly associated with increased job stress. Stress management strategies might have the potential to improve job satisfaction. Comparative scoping review of studies (2000-2013) and location of their outcomes within the 'job demands-job resources' (JD-R) model of stress to identify commonalities and trends. Many, but not all, antecedents of both phenomena appeared consistently suggesting they are common mediators. Others were more variable but the appearance of 'emotional demands' as a common antecedent in later studies suggests an evolving influence of the changing work environment. The occurrence of 'shift work' as a common issue in later studies points to further implications for nurses' psychosocial well-being. Job satisfaction problems in nursing might be co-responsive to stress management intervention. Improving the buffering effectiveness of increased resilience and of prominent perceived job resource issues are urgently required. Participatory, psychosocial methods have the potential to raise job resources but will require high-level collaboration by stakeholders, and participative leadership and facilitation by managers to enable better decision-latitude, support for action planning and responsive changes. © 2015 John Wiley & Sons Ltd.

Approximation algorithms for scheduling unrelated parallel machines with release dates

NASA Astrophysics Data System (ADS)

Avdeenko, T. V.; Mesentsev, Y. A.; Estraykh, I. V.

2017-01-01

In this paper we propose approaches to optimal scheduling of unrelated parallel machines with release dates. One approach is based on the scheme of dynamic programming modified with adaptive narrowing of search domain ensuring its computational effectiveness. We discussed complexity of the exact schedules synthesis and compared it with approximate, close to optimal, solutions. Also we explain how the algorithm works for the example of two unrelated parallel machines and five jobs with release dates. Performance results that show the efficiency of the proposed approach have been given.

Job sharing: a viable option for the clinical nurse specialist.

PubMed

Haibeck, S V; Howard, J L

1991-01-01

NUMEROUS WORK TIME options have been developed to attract, retain and meet the various needs of nurses. Job sharing, a work option little known to nurses, can be a successful alternative for balancing professional and personal lifestyle. The business literature supports job sharing and other innovative work options as successful mechanisms in retaining quality employees in their respective professions. After exploring the literature in this area, a proposal for job sharing the oncology clinical nurse specialist (CNS) position was presented to the Personnel Director and Vice President of Nursing at our institution. The proposal addressed the advantages and disadvantages of the concept. These included: (1) scheduling flexibility, (2) reduced absenteeism and turnover, (3) increased productivity, (4) handling fringe benefits, and (5) job satisfaction. The proposal was accepted, and the job sharing position has been successfully implemented for more than 2 years now. This paper describes issues relevant to designing and implementing job sharing in a CNS position.

Donning the mask: effects of emotional labour strategies on burnout and job satisfaction in community healthcare.

PubMed

Pandey, Jatin; Singh, Manjari

2016-06-01

Emotional labour involves management of one's emotions to match the demands of their roles. This emotion display involves just expression (surface-level emotional labour) or experience in addition to expression (deep-level emotional labour) of the desired emotions. Emotional labour is required in the effective, efficient and successful healthcare service delivery. Burnout associated with emotional labour is an important factor that decides how satisfied frontline service providers with their job are. This empirical study investigates the link between surface and deep-level emotional labour, burnout and job satisfaction in women community health workers from India. Our results from the structural equation modelling of 177 accredited social health activists (ASHAs) indicate a negative relation between surface and deep-level emotional labour, clearly demarcating them as two different strategies for performance of emotional labour in community health care setting. Surface-level emotional labour is associated with higher job satisfaction, and burnout partially mediates this relation. Deep-level emotional labour is associated with lower job satisfaction; burnout fully mediates this relation. Qualitative post hoc analysis based on interviews of 10 ASHAs was done to understand the findings of the quantitative study. Surface-level emotional labour was found to be a more desirable strategy for community health care workers for the effective and efficient performance of their work roles. Our results have a significant contribution to design, redesign, and improvement of employment practices in community healthcare. This study brings forth the neglected issues of emotions and their implications for these healthcare workers in low and middle-income countries who are a vital link that delivers healthcare to weaker section of the society. The findings have relevance not merely for the individual providing this service but the beneficiary and the organization that facilitates this

Relationships among organizational family support, job autonomy, perceived control, and employee well-being.

PubMed

Thompson, Cynthia A; Prottas, David J

2006-01-01

The authors analyzed data from the 2002 National Study of the Changing Workforce (N = 3,504) to investigate relationships among availability of formal organizational family support (family benefits and alternative schedules), job autonomy, informal organizational support (work-family culture, supervisor support, and coworker support), perceived control, and employee attitudes and well-being. Using hierarchical regression, the authors found that the availability of family benefits was associated with stress, life satisfaction, and turnover intentions, and the availability of alternative schedules was not related to any of the outcomes. Job autonomy and informal organizational support were associated with almost all the outcomes, including positive spillover. Perceived control mediated most of the relationships. Copyright 2006 APA.

The skill-divide in job quality: a cross-national analysis of 28 countries.

PubMed

Stier, Haya

2015-01-01

This study focuses on the skill divide in job quality and the role of social institutions in structuring the relation of workers' qualifications to the attributes of their jobs. Four measures of job quality are examined: job security, job achievement, job content and work schedule flexibility. The study is based on the 2005 ISSP module on work orientations and encompasses 28 countries. Obtained through multilevel modeling, the findings show that low-skilled workers are disadvantaged in all aspects of job quality. However, skill inequality in the quality of employment depends on countries' characteristics, with declining inequality in countries at higher levels of technological development and to some extent also in times of technological growth. At times of high unemployment, skill disparities in job security widen while on other measures of job quality they decline. Under high market regulation, the low skilled enjoy better job security but on other measures, skill inequalities increase. Copyright © 2014 Elsevier Inc. All rights reserved.

Static Scheduler for Hard Real-Time Tasks on Multiprocessor Systems

DTIC Science & Technology

1992-09-01

Foundation of Computer Science, 1980 . [SIM83] Simons, B., "Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines", SIAM...Research Office Attn: Dr. David Hislop P. O. Box 12211 Research Triangle Park, NC 27709-2211 31. Persistent Data Systems 75 W. Chapel Ridge Road Attn: Dr

Physical and Organizational Job Stressors in Pregnancy and Associations With Primary Cesarean Deliveries.

PubMed

Guendelman, Sylvia; Gemmill, Alison; Hosang, Nap; MacDonald, Leslie A

2017-06-01

The aim of this study was to assess the relationship between exposure to physical and organizational job stressors during pregnancy and cesarean delivery. We sampled 580 employed women in California who participated in a nested population-based case-control study of birth outcomes. Adjusted multivariate regression analyses estimated associations between heavy lifting, frequent bending, high noise, extreme temperature, prolonged standing and organizational stressors (shift work, inflexible schedules, effort-reward ratio), and primary cesarean (vs vaginal) delivery, controlling for covariates. Women occupationally exposed had higher odds of cesarean. Those exposed to daily manual lifting more than 15 pounds [adjusted odds ratio = 2.54; 95% confidence interval (95% CI) 1.21 to 5.32] and at least four physical job stressors (adjusted odds ratio = 3.49; 95% CI 1.21 to 10.09) had significantly elevated odds of cesarean delivery. Exposed morbid women experienced greater risk; risk was lower among those with schedule flexibility. Associations were found between modifiable exposure to physical job stressors during pregnancy and cesarean delivery.

Research on schedulers for astronomical observatories

NASA Astrophysics Data System (ADS)

Colome, Josep; Colomer, Pau; Guàrdia, Josep; Ribas, Ignasi; Campreciós, Jordi; Coiffard, Thierry; Gesa, Lluis; Martínez, Francesc; Rodler, Florian

2012-09-01

The main task of a scheduler applied to astronomical observatories is the time optimization of the facility and the maximization of the scientific return. Scheduling of astronomical observations is an example of the classical task allocation problem known as the job-shop problem (JSP), where N ideal tasks are assigned to M identical resources, while minimizing the total execution time. A problem of higher complexity, called the Flexible-JSP (FJSP), arises when the tasks can be executed by different resources, i.e. by different telescopes, and it focuses on determining a routing policy (i.e., which machine to assign for each operation) other than the traditional scheduling decisions (i.e., to determine the starting time of each operation). In most cases there is no single best approach to solve the planning system and, therefore, various mathematical algorithms (Genetic Algorithms, Ant Colony Optimization algorithms, Multi-Objective Evolutionary algorithms, etc.) are usually considered to adapt the application to the system configuration and task execution constraints. The scheduling time-cycle is also an important ingredient to determine the best approach. A shortterm scheduler, for instance, has to find a good solution with the minimum computation time, providing the system with the capability to adapt the selected task to varying execution constraints (i.e., environment conditions). We present in this contribution an analysis of the task allocation problem and the solutions currently in use at different astronomical facilities. We also describe the schedulers for three different projects (CTA, CARMENES and TJO) where the conclusions of this analysis are applied to develop a suitable routine.

Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems

NASA Technical Reports Server (NTRS)

Smith, Stephen F.; Pathak, Dhiraj K.

1991-01-01

In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.

Parental Work Schedules and Adolescent Risky Behaviors

PubMed Central

Han, Wen-Jui; Miller, Daniel P.; Waldfogel, Jane

2013-01-01

Using a large contemporary data set, the National Longitudinal Survey of Youth-Child Supplement (NLSY-CS), this paper examines the effects of parental work schedules on adolescent risky behaviors at age 13 or 14 and the mechanisms that might explain them. Structural equation modeling suggests mothers who worked more often at night spent significantly less time with children and had lower quality home environments, and these mediators were significantly linked to adolescent risky behaviors. Similar effects were not found for evening work schedules, while other types of maternal and paternal nonstandard work schedules were linked to higher parental knowledge of children’s whereabouts, which led to lower levels of adolescent risky behaviors. Subgroup analyses revealed that males, those in families with low incomes, and those whose mothers never worked at professional jobs may particularly be affected by mothers working at nights, due to spending less time together, having a lower degree of maternal closeness, and experiencing lower quality home environments. In addition, the effects of maternal night shifts were particularly pronounced if children were in the preschool or middle-childhood years when their mothers worked those schedules. Implications and avenues for future research are discussed. PMID:20822236

The role of self-determined motivation in job search: A dynamic approach.

PubMed

da Motta Veiga, Serge P; Gabriel, Allison S

2016-03-01

Job search is a dynamic self-regulated process during which job seekers need to stay motivated to secure a job. However, past research has taken a relatively static approach to examining motivation during the job search, in addition to ignoring how the quality of one's motivation--ranging from autonomous to controlled--can influence job search processes. Adopting a within-person perspective, the current study extends self-determination theory (SDT) to the job search context to investigate (a) when autonomous and controlled motivations are more or less prevalent and (b) whether they influence job search effort through metacognitive strategies in differing ways depending upon the amount of time elapsed in the search. In a weekly study of new labor market entrants (Level-2 n = 149; Level-1 n = 691), results indicated that autonomous motivation decreased until the midpoint of the job search and then plateaued, whereas controlled motivation remained stable. Results also showed that autonomous motivation had a consistent, positive relation with metacognitive strategies, whereas the relation between controlled motivation and such strategies was negative early in the job search, but became positive as the job search progressed. Finally, the effects of motivation on job search effort occurred via metacognitive strategies differentially depending upon the time elapsed in the search. Combined, we provide a first glimpse into the dynamics of self-determined motivation on job search processes. (c) 2016 APA, all rights reserved).

How do employees prioritise when they schedule their own shifts?

PubMed

Nabe-Nielsen, Kirsten; Lund, Henrik; Ajslev, Jeppe Z; Hansen, Åse Marie; Albertsen, Karen; Hvid, Helge; Garde, Anne Helene

2013-01-01

We investigated how employees prioritised when they scheduled their own shifts and whether priorities depended on age, gender, educational level, cohabitation and health status. We used cross-sectional questionnaire data from the follow-up survey of an intervention study investigating the effect of self-scheduling (n = 317). Intervention group participants were asked about their priorities when scheduling their own shifts succeeded by 17 items covering family/private life, economy, job content, health and sleep. At least half of the participants reported that they were giving high priority to their family life, having consecutive time off, leisure-time activities, rest between shifts, sleep, regularity of their everyday life, health and that the work schedule balanced. Thus, employees consider both their own and the workplace's needs when they have the opportunity to schedule their own shifts. Age, gender, cohabitation and health status were all significantly associated with at least one of these priorities. Intervention studies report limited health effects of self-scheduling. Therefore, we investigated to what extent employees prioritise their health and recuperation when scheduling their own shifts. We found that employees not only consider both their health and family but also the workplace's needs when they schedule their own shifts.

Teaching strategies and student achievement in high school block scheduled biology classes

NASA Astrophysics Data System (ADS)

Louden, Cynthia Knapp

The objectives of this study included determining whether teachers in block or traditionally scheduled biology classes (1) implement inquiry-based instruction more often or with different methods, (2) understand the concept of inquiry-based instruction as it is described in the National Science Standards, (3) have classes with significantly different student achievement, and (4) believe that their school schedule facilitates their use of inquiry-based instruction in the classroom. Biology teachers in block and non-block scheduled classes were interviewed, surveyed, and observed to determine the degree to which they implement inquiry-based instructional practices in their classrooms. State biology exams were used to indicate student achievement. Teachers in block scheduled and traditional classes used inquiry-based instruction with nearly the same frequency. Approximately 30% of all teachers do not understand the concept of inquiry-based instruction as described by the National Science Standards. No significant achievement differences between block and traditionally scheduled biology classes were found using ANCOVA analyses and a nonequivalent control-group quasi-experimental design. Using the same analysis techniques, significant achievement differences were found between biology classes with teachers who used inquiry-based instruction frequently and infrequently. Teachers in block schedules believed that their schedules facilitated inquiry-based instruction more than teachers in traditional schedules.

Dawn Usage, Scheduling, and Governance Model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Louis, S

2009-11-02

This document describes Dawn use, scheduling, and governance concerns. Users started running full-machine science runs in early April 2009 during the initial open shakedown period. Scheduling Dawn while in the Open Computing Facility (OCF) was controlled and coordinated via phone calls, emails, and a small number of controlled banks. With Dawn moving to the Secure Computing Facility (SCF) in fall of 2009, a more detailed scheduling and governance model is required. The three major objectives are: (1) Ensure Dawn resources are allocated on a program priority-driven basis; (2) Utilize Dawn resources on the job mixes for which they were intended;more » and (3) Minimize idle cycles through use of partitions, banks and proper job mix. The SCF workload for Dawn will be inherently different than Purple or BG/L, and therefore needs a different approach. Dawn's primary function is to permit adequate access for tri-lab code development in preparation for Sequoia, and in particular for weapons multi-physics codes in support of UQ. A second purpose is to provide time allocations for large-scale science runs and for UQ suite calculations to advance SSP program priorities. This proposed governance model will be the basis for initial time allocation of Dawn computing resources for the science and UQ workloads that merit priority on this class of resource, either because they cannot be reasonably attempted on any other resources due to size of problem, or because of the unavailability of sizable allocations on other ASC capability or capacity platforms. This proposed model intends to make the most effective use of Dawn as possible, but without being overly constrained by more formal proposal processes such as those now used for Purple CCCs.« less

Job-sharing in nuclear medicine: an 8-year experience (1998-2006).

PubMed

Als, Claudine; Brautigam, Peter

2006-01-01

Job-sharing is generally defined as a situation in which a single professional position is held in common by two separate individuals, who alternatively, on a timely basis, deal with the workload and the responsibilities. The aim of the present paper is to discuss prerequisites and characteristics of job-sharing by medical doctors and implications in a department of nuclear medicine. Job-sharing facilitates the combination of family life with professional occupation and prevents burnout. The time schedule applied by job-sharers is relevant: will both partners work for half-days, half-weeks, or rather alternatively during one to two consecutive weeks? This crucial choice, depending on personal as well as on professional circumstances, certainly influences the workflow of the department.

Effects on Teachers' Self-Efficacy and Job Satisfaction: Teacher Gender, Years of Experience, and Job Stress

ERIC Educational Resources Information Center

Klassen, Robert M.; Chiu, Ming Ming

2010-01-01

The authors of this study sought to examine the relationships among teachers' years of experience, teacher characteristics (gender and teaching level), three domains of self-efficacy (instructional strategies, classroom management, and student engagement), two types of job stress (workload and classroom stress), and job satisfaction with a sample…

Personality Characteristics, Job Stressors, and Job Satisfaction: Main and Interaction Effects on Psychological and Physical Health Conditions of Italian Schoolteachers.

PubMed

Zurlo, Maria Clelia; Pes, Daniela; Capasso, Roberto

2016-08-01

The study proposed an application of the transactional model of stress in teaching elaborated by Travers and Cooper in 1996, and aimed to investigate the influence of personality characteristics (coping strategies, type A behaviors), situational characteristics (sources of pressure), and perceived job satisfaction in the prediction of teachers' psychophysical health conditions. The Italian version of the Teacher Stress Questionnaire was administered to 621 teachers. Logistic regression was used to evaluate significant main and interaction effects of personality characteristics, situational characteristics, and perceived job satisfaction on teachers' self-reported psychophysical health conditions. The findings highlighted specific coping strategies (focused on the problem, on innovation, and on hobbies and pastimes) and dimensions of job satisfaction (related to intrinsic aspects of job and to employee relations) buffering the negative effects of several job stressors. Type A behaviors and coping strategies focused on mobilized social support, suppression of stress, and not confronting the situation had main and interactions with negative effects on psychophysical health. Findings confirmed the necessity to run multi-factor research to analyze the different combinations of individual and situational variables implicated in negative health outcomes and to highlight the most significant buffering or increasing associations. © The Author(s) 2016.

Empowering leadership and job crafting: The role of employee optimism.

PubMed

Thun, Sylvi; Bakker, Arnold B

2018-06-08

The objective of this study was to test the relationship between empowering leadership and job crafting and to examine the moderating role of optimism as a personal resource. We hypothesized that the association between empowering leadership and job crafting would be stronger for employees with high (vs. low) levels of optimism. A total of 331 Norwegian workers from a variety of occupations participated in our study. Results of structural equation modelling analysis generally supported our hypotheses. Empowering leadership was positively related to 3 of the 4 job crafting strategies investigated (increasing structural job resources, increasing social job resources, and increasing challenging job demands; but not reducing hindrance job demands). Moreover, as hypothesized, optimism strengthened the empowering leadership-job crafting relationship for increasing structural resources and increasing challenging demands. The results suggest that empowering leadership is an important antecedent of job crafting strategies, except for reducing hindrance demands. The implications of these findings are discussed. Copyright © 2018 John Wiley & Sons, Ltd.

Working multiple jobs over a day or a week: Short-term effects on sleep duration

PubMed Central

Marucci-Wellman, Helen R.; Lombardi, David A.; Willetts, Joanna L.

2016-01-01

ABSTRACT Approximately 10% of the employed population in the United States works in multiple jobs. They are more likely to work long hours and in nonstandard work schedules, factors known to impact sleep duration and quality, and increase the risk of injury. In this study we used multivariate regression models to compare the duration of sleep in a 24-hour period between workers working in multiple jobs (MJHs) with single job holders (SJHs) controlling for other work schedule and demographic factors. We used data from the Bureau of Labor Statistics US American Time Use Survey (ATUS) pooled over a 9-year period (2003–2011). We found that MJHs had significantly reduced sleep duration compared with SJHs due to a number of independent factors, such as working longer hours and more often late at night. Male MJHs, working in their primary job or more than one job on the diary day, also had significantly shorter sleep durations (up to 40 minutes less on a weekend day) than male SJHs, even after controlling for all other factors. Therefore, duration of work hours, time of day working and duration of travel for work may not be the only factors to consider when understanding if male MJHs are able to fit in enough recuperative rest from their busy schedule. Work at night had the greatest impact on sleep duration for females, reducing sleep time by almost an hour compared with females who did not work at night. We also hypothesize that the high frequency or fragmentation of non-leisure activities (e.g. work and travel for work) throughout the day and between jobs may have an additional impact on the duration and quality of sleep for MJHs. PMID:27092404

Working multiple jobs over a day or a week: Short-term effects on sleep duration.

PubMed

Marucci-Wellman, Helen R; Lombardi, David A; Willetts, Joanna L

Approximately 10% of the employed population in the United States works in multiple jobs. They are more likely to work long hours and in nonstandard work schedules, factors known to impact sleep duration and quality, and increase the risk of injury. In this study we used multivariate regression models to compare the duration of sleep in a 24-hour period between workers working in multiple jobs (MJHs) with single job holders (SJHs) controlling for other work schedule and demographic factors. We used data from the Bureau of Labor Statistics US American Time Use Survey (ATUS) pooled over a 9-year period (2003-2011). We found that MJHs had significantly reduced sleep duration compared with SJHs due to a number of independent factors, such as working longer hours and more often late at night. Male MJHs, working in their primary job or more than one job on the diary day, also had significantly shorter sleep durations (up to 40 minutes less on a weekend day) than male SJHs, even after controlling for all other factors. Therefore, duration of work hours, time of day working and duration of travel for work may not be the only factors to consider when understanding if male MJHs are able to fit in enough recuperative rest from their busy schedule. Work at night had the greatest impact on sleep duration for females, reducing sleep time by almost an hour compared with females who did not work at night. We also hypothesize that the high frequency or fragmentation of non-leisure activities (e.g. work and travel for work) throughout the day and between jobs may have an additional impact on the duration and quality of sleep for MJHs.

Enhanced round robin CPU scheduling with burst time based time quantum

NASA Astrophysics Data System (ADS)

Indusree, J. R.; Prabadevi, B.

2017-11-01

Process scheduling is a very important functionality of Operating system. The main-known process-scheduling algorithms are First Come First Serve (FCFS) algorithm, Round Robin (RR) algorithm, Priority scheduling algorithm and Shortest Job First (SJF) algorithm. Compared to its peers, Round Robin (RR) algorithm has the advantage that it gives fair share of CPU to the processes which are already in the ready-queue. The effectiveness of the RR algorithm greatly depends on chosen time quantum value. Through this research paper, we are proposing an enhanced algorithm called Enhanced Round Robin with Burst-time based Time Quantum (ERRBTQ) process scheduling algorithm which calculates time quantum as per the burst-time of processes already in ready queue. The experimental results and analysis of ERRBTQ algorithm clearly indicates the improved performance when compared with conventional RR and its variants.

Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm

NASA Astrophysics Data System (ADS)

Pei, Jun; Liu, Xinbao; Pardalos, Panos M.; Fan, Wenjuan; Wang, Ling; Yang, Shanlin

2016-03-01

Motivated by applications in manufacturing industry, we consider a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times. The objective is to minimise the makespan by making batching and sequencing decisions. The problem is formalised as a mixed integer programming model and proved to be strongly NP-hard. Some structural properties are presented for both the general case and a special case. Based on these properties, a lower bound is derived, and a novel two-phase heuristic (TP-H) is developed to solve the problem, which guarantees to obtain a worst case performance ratio of ?. Computational experiments with a set of different sizes of random instances are conducted to evaluate the proposed approach TP-H, which is superior to another two heuristics proposed in the literature. Furthermore, the experimental results indicate that TP-H can effectively and efficiently solve large-size problems in a reasonable time.

Rethinking the Clockwork of Work: Why Schedule Control May Pay Off at Work and at Home.

PubMed

Kelly, Erin L; Moen, Phyllis

2007-11-01

Many employees face work-life conflicts and time deficits that negatively affect their health, well-being, effectiveness on the job, and organizational commitment. Many organizations have adopted flexible work arrangements but not all of them increase schedule control, that is, employees' control over when, where, and how much they work. This article describes some limitations of flexible work policies, proposes a conceptual model of how schedule control impacts work-life conflicts, and describes specific ways to increase employees' schedule control, including best practices for implementing common flexible work policies and Best Buy's innovative approach to creating a culture of schedule control.

Toward an Autonomous Telescope Network: the TBT Scheduler

NASA Astrophysics Data System (ADS)

Racero, E.; Ibarra, A.; Ocaña, F.; de Lis, S. B.; Ponz, J. D.; Castillo, M.; Sánchez-Portal, M.

2015-09-01

Within the ESA SSA program, it is foreseen to deploy several robotic telescopes to provide surveillance and tracking services for hazardous objects. The TBT project will procure a validation platform for an autonomous optical observing system in a realistic scenario, consisting of two telescopes located in Spain and Australia, to collect representative test data for precursor SSA services. In this context, the planning and scheduling of the night consists of two software modules, the TBT Scheduler, that will allow the manual and autonomous planning of the night, and the control of the real-time response of the system, done by the RTS2 internal scheduler. The TBT Scheduler allocates tasks for both telescopes without human intervention. Every night it takes all the inputs needed and prepares the schedule following some predefined rules. The main purpose of the scheduler is the distribution of the time for follow-up of recently discovered targets and surveys. The TBT Scheduler considers the overall performance of the system, and combine follow-up with a priori survey strategies for both kind of objects. The strategy is defined according to the expected combined performance for both systems the upcoming night (weather, sky brightness, object accessibility and priority). Therefore, TBT Scheduler defines the global approach for the network and relies on the RTS2 internal scheduler for the final detailed distribution of tasks at each sensor.

Looking for a New Sport That Pays Well? Consider the Game of Federal Job Search.

ERIC Educational Resources Information Center

Troutman, Kathryn Kraemer

This paper compares searching for a Federal Job to taking up a new sport. Becoming good at a sport takes lessons and coaching, study of the rules, practice, investment in equipment and special clothes, time to play, scheduling, and ongoing interest with friend who enjoy the same sport. An Expert Player/Jobseeker in the Federal Job Search System…

Job rotation and internal marketing for increased job satisfaction and organisational commitment in hospital nursing staff.

PubMed

Chen, Su-Yueh; Wu, Wen-Chuan; Chang, Ching-Sheng; Lin, Chia-Tzu

2015-04-01

To develop or enhance the job satisfaction and organisational commitment of nurses by implementing job rotation and internal marketing practices. No studies in the nursing management literature have addressed the integrated relationships among job rotation, internal marketing, job satisfaction and organisational commitment. This cross-sectional study included 266 registered nurses (response rate 81.8%) in two southern Taiwan hospitals. Software used for data analysis were SPSS 14.0 and AMOS 14.0 (structural equation modelling). Job rotation and internal marketing positively affect the job satisfaction and organisational commitment of nurses, and their job satisfaction positively affects their organisational commitment. Job rotation and internal marketing are effective strategies for improving nursing workforce utilisation in health-care organisations because they help to achieve the ultimate goals of increasing the job satisfaction of nurses and encouraging them to continue working in the field. This in turn limits the vicious cycle of high turnover and low morale in organisations, which wastes valuable human resources. Job rotation and internal marketing help nursing personnel acquire knowledge, skills and insights while simultaneously improving their job satisfaction and organisational commitment. © 2013 John Wiley & Sons Ltd.

Canadian nurse practitioner job satisfaction.

PubMed

LaMarche, Kimberley; Tullai-McGuinness, Susan

2009-01-01

To examine the level of job satisfaction and its association with extrinsic and intrinsic job satisfaction characteristics among Canadian primary healthcare nurse practitioners (NPs). A descriptive correlational design was used to collect data on NPs' job satisfaction and on the factors that influence their job satisfaction. A convenience sample of licensed Canadian NPs was recruited from established provincial associations and special-interest groups. Data about job satisfaction were collected using two valid and reliable instruments, the Misener Nurse Practitioner Job Satisfaction Survey and the Minnesota Satisfaction Questionnaire. Descriptive statistics, Pearson correlation and regression analysis were used to describe the results. The overall job satisfaction for this sample ranged from satisfied to highly satisfied. The elements that had the most influence on overall job satisfaction were the extrinsic category of partnership/collegiality and the intrinsic category of challenge/autonomy. These findings were consistent with Herzberg's Dual Factor Theory of Job Satisfaction. The outcomes of this study will serve as a foundation for designing effective human health resource retention and recruitment strategies that will assist in enhancing the implementation and the successful preservation of the NP's role.

Job Satisfaction: Insights from Home Support Care Workers in Three Canadian Jurisdictions.

PubMed

Panagiotoglou, Dimitra; Fancey, Pamela; Keefe, Janice; Martin-Matthews, Anne

2017-03-01

This mixed-methods study identified the personal and workplace characteristics that drive the job satisfaction of home support workers (HSWs) providing assistance to elderly clients. Data were based on a standardized measure of job satisfaction, along with in-depth qualitative interviews with 176 home support workers from three Canadian provincial jurisdictions (British Columbia, n = 108; Ontario, n = 28; Nova Scotia, n = 40). We anticipated that variability in demographic profiles between the three groups of workers and different job descriptions would be associated with differences in perceived job satisfaction. This was not the case. Results from the qualitative analysis highlight key areas that contributed to job satisfaction. These are job (scheduling, travel, and safety), economic (income security), and organizational (communication, support, and respect) factors. Given these findings, we recommend improvements to workplace communication, increased travel time allowance between clients, and wage parity with equivalent positions in long-term care facilities.

Open shop scheduling problem to minimize total weighted completion time

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai; Zhang, Qiang; Tang, Mengqian

2017-01-01

A given number of jobs in an open shop scheduling environment must each be processed for given amounts of time on each of a given set of machines in an arbitrary sequence. This study aims to achieve a schedule that minimizes total weighted completion time. Owing to the strong NP-hardness of the problem, the weighted shortest processing time block (WSPTB) heuristic is presented to obtain approximate solutions for large-scale problems. Performance analysis proves the asymptotic optimality of the WSPTB heuristic in the sense of probability limits. The largest weight block rule is provided to seek optimal schedules in polynomial time for a special case. A hybrid discrete differential evolution algorithm is designed to obtain high-quality solutions for moderate-scale problems. Simulation experiments demonstrate the effectiveness of the proposed algorithms.

Job-mix modeling and system analysis of an aerospace multiprocessor.

NASA Technical Reports Server (NTRS)

Mallach, E. G.

1972-01-01

An aerospace guidance computer organization, consisting of multiple processors and memory units attached to a central time-multiplexed data bus, is described. A job mix for this type of computer is obtained by analysis of Apollo mission programs. Multiprocessor performance is then analyzed using: 1) queuing theory, under certain 'limiting case' assumptions; 2) Markov process methods; and 3) system simulation. Results of the analyses indicate: 1) Markov process analysis is a useful and efficient predictor of simulation results; 2) efficient job execution is not seriously impaired even when the system is so overloaded that new jobs are inordinately delayed in starting; 3) job scheduling is significant in determining system performance; and 4) a system having many slow processors may or may not perform better than a system of equal power having few fast processors, but will not perform significantly worse.

Evaluation of Scheduling Methods for Multiple Runways

NASA Technical Reports Server (NTRS)

Bolender, Michael A.; Slater, G. L.

1996-01-01

Several scheduling strategies are analyzed in order to determine the most efficient means of scheduling aircraft when multiple runways are operational and the airport is operating at different utilization rates. The study compares simulation data for two and three runway scenarios to results from queuing theory for an M/D/n queue. The direction taken, however, is not to do a steady-state, or equilibrium, analysis since this is not the case during a rush period at a typical airport. Instead, a transient analysis of the delay per aircraft is performed. It is shown that the scheduling strategy that reduces the delay depends upon the density of the arrival traffic. For light traffic, scheduling aircraft to their preferred runways is sufficient; however, as the arrival rate increases, it becomes more important to separate traffic by weight class. Significant delay reduction is realized when aircraft that belong to the heavy and small weight classes are sent to separate runways with large aircraft put into the 'best' landing slot.

Changing jobs: strategies for finding the best fit for you.

PubMed

Henry, Lydia

2012-01-01

The field of nursing offers a wide variety of roles and opportunities. Nurses seek to change jobs for several reasons, including burnout, work/life balance and personal growth. This article offers suggestions for making a smooth transition to a new job, including how to research the market, network and write an effective resume. © 2012 AWHONN.

Using Storytelling as a Job-Search Strategy

ERIC Educational Resources Information Center

Smart, Karl L.; DiMaria, Jerry

2018-01-01

This article demonstrates and reinforces the role that well-told stories play in the success of the job-search process. Building on narrative theory, impression management, and an increased use of behavioral-based questions in interviews, well-crafted stories about work and educational experiences demonstrate skills applicants possess and convey…

The Special Educator and Job Stress.

ERIC Educational Resources Information Center

Dedrick, Charles V. L.; Raschke, Donna B.

This monograph examines stressors encountered by special educators, ways of coping with professional demands, and reasons why some teachers handle job stress better than others. It is intended to help special education teachers take a more objective look at what they do and identify strategies and techniques to alleviate some job-related stress…

An ant colony optimization heuristic for an integrated production and distribution scheduling problem

NASA Astrophysics Data System (ADS)

Chang, Yung-Chia; Li, Vincent C.; Chiang, Chia-Ju

2014-04-01

Make-to-order or direct-order business models that require close interaction between production and distribution activities have been adopted by many enterprises in order to be competitive in demanding markets. This article considers an integrated production and distribution scheduling problem in which jobs are first processed by one of the unrelated parallel machines and then distributed to corresponding customers by capacitated vehicles without intermediate inventory. The objective is to find a joint production and distribution schedule so that the weighted sum of total weighted job delivery time and the total distribution cost is minimized. This article presents a mathematical model for describing the problem and designs an algorithm using ant colony optimization. Computational experiments illustrate that the algorithm developed is capable of generating near-optimal solutions. The computational results also demonstrate the value of integrating production and distribution in the model for the studied problem.

What keeps Melbourne GPs satisfied in their jobs?

PubMed

Walker, Kate Anne; Pirotta, Marie

2007-10-01

Workforce shortages make it important to promote job satisfaction and career longevity in general practitioners. We aimed to investigate strategies that maintain and improve Melbourne (Victoria) GP job satisfaction. A postal survey of a random selection of The Royal Australian College of General Practitioners vocationally recognised GPs (N=860). Open ended answers were coded according to themes and compared between genders. Thirty-eight percent of surveyed GPs responded. The mean satisfaction score was 50 out of 70 (SD 9). Women GPs were more satisfied than men with life-work balance (p<0.01). Most frequently nominated themes for satisfaction were job variety, longitudinal patient relationships, belief in the value of the work and intellectual stimulation. Strategies to improve GP satisfaction were increased pay, reduced paperwork, and improved administrative systems. General practitioners were satisfied with their jobs due to the intrinsic qualities of their work and workplace. Decreasing the administrative burden, increasing remuneration and improving practice supports may improve metropolitan GP job satisfaction.

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Mirabi, Mohammad; Fatemi Ghomi, S. M. T.; Jolai, F.

2014-04-01

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this paper develops a novel hybrid genetic algorithm (HGA) with three genetic operators. Proposed HGA applies a modified approach to generate a pool of initial solutions, and also uses an improved heuristic called the iterated swap procedure to improve the initial solutions. We consider the make-to-order production approach that some sequences between jobs are assumed as tabu based on maximum allowable setup cost. In addition, the results are compared to some recently developed heuristics and computational experimental results show that the proposed HGA performs very competitively with respect to accuracy and efficiency of solution.

Rethinking the Clockwork of Work: Why Schedule Control May Pay Off at Work and at Home

PubMed Central

Kelly, Erin L.; Moen, Phyllis

2014-01-01

The problem and the solution Many employees face work–life conflicts and time deficits that negatively affect their health, well-being, effectiveness on the job, and organizational commitment. Many organizations have adopted flexible work arrangements but not all of them increase schedule control, that is, employees’ control over when, where, and how much they work. This article describes some limitations of flexible work policies, proposes a conceptual model of how schedule control impacts work–life conflicts, and describes specific ways to increase employees’ schedule control, including best practices for implementing common flexible work policies and Best Buy’s innovative approach to creating a culture of schedule control. PMID:25598711

A Study on Real-Time Scheduling Methods in Holonic Manufacturing Systems

NASA Astrophysics Data System (ADS)

Iwamura, Koji; Taimizu, Yoshitaka; Sugimura, Nobuhiro

Recently, new architectures of manufacturing systems have been proposed to realize flexible control structures of the manufacturing systems, which can cope with the dynamic changes in the volume and the variety of the products and also the unforeseen disruptions, such as failures of manufacturing resources and interruptions by high priority jobs. They are so called as the autonomous distributed manufacturing system, the biological manufacturing system and the holonic manufacturing system. Rule-based scheduling methods were proposed and applied to the real-time production scheduling problems of the HMS (Holonic Manufacturing System) in the previous report. However, there are still remaining problems from the viewpoint of the optimization of the whole production schedules. New procedures are proposed, in the present paper, to select the production schedules, aimed at generating effective production schedules in real-time. The proposed methods enable the individual holons to select suitable machining operations to be carried out in the next time period. Coordination process among the holons is also proposed to carry out the coordination based on the effectiveness values of the individual holons.

The R-Shell approach - Using scheduling agents in complex distributed real-time systems

NASA Technical Reports Server (NTRS)

Natarajan, Swaminathan; Zhao, Wei; Goforth, Andre

1993-01-01

Large, complex real-time systems such as space and avionics systems are extremely demanding in their scheduling requirements. The current OS design approaches are quite limited in the capabilities they provide for task scheduling. Typically, they simply implement a particular uniprocessor scheduling strategy and do not provide any special support for network scheduling, overload handling, fault tolerance, distributed processing, etc. Our design of the R-Shell real-time environment fcilitates the implementation of a variety of sophisticated but efficient scheduling strategies, including incorporation of all these capabilities. This is accomplished by the use of scheduling agents which reside in the application run-time environment and are responsible for coordinating the scheduling of the application.

78 FR 49359 - Pay Under the General Schedule and Recruitment, Relocation, and Retention Incentives

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-14

.... Agencies may, in their agency retention incentive plans, require documentation of private-sector job offers... Schedule and Recruitment, Relocation, and Retention Incentives AGENCY: U.S. Office of Personnel Management... to improve oversight of recruitment and retention incentive determinations; add succession planning...

Flexible work schedules, older workers, and retirement.

PubMed

Siegenthaler, J K; Brenner, A M

2000-01-01

Older workers in the United States indicate that they would prefer flexible work arrangements rather than abrupt retirement, yet management has done very little to make this possible. A review of two bodies of literature from the late 1980s is presented: social science writings including sociological, gerontological, and economic literature, and business and management literature. There is a clash between the way jobs are traditionally scheduled and the needs of growing numbers of older workers. Workers continue to be subject to obstacles to phased retirement due to the structuring of health care and pension benefits, downsizing, organizational inflexibility, and "corporate culture." Thus, general views among social scientists regarding the desirability of flexible schedules toward retirement will not produce real changes unless management becomes committed to such changes and they are securely embedded in company policies.

Implementation of Compressed Work Schedules: Participation and Job Redesign as Critical Factors for Employee Acceptance.

ERIC Educational Resources Information Center

Latack, Janina C.; Foster, Lawrence W.

1985-01-01

Analyzes the effects of an implementation of a three-day/thirty-eight hour (3/38) work schedule among information systems personnel (N=84). Data showed that 18 months after implementation, 3/38 employees still strongly favor the compressed schedule. Data also suggest substantial organizational payoffs including reductions in sick time, overtime,…

An analysis of iterated local search for job-shop scheduling.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitley, L. Darrell; Howe, Adele E.; Watson, Jean-Paul

2003-08-01

Iterated local search, or ILS, is among the most straightforward meta-heuristics for local search. ILS employs both small-step and large-step move operators. Search proceeds via iterative modifications to a single solution, in distinct alternating phases. In the first phase, local neighborhood search (typically greedy descent) is used in conjunction with the small-step operator to transform solutions into local optima. In the second phase, the large-step operator is applied to generate perturbations to the local optima obtained in the first phase. Ideally, when local neighborhood search is applied to the resulting solution, search will terminate at a different local optimum, i.e.,more » the large-step perturbations should be sufficiently large to enable escape from the attractor basins of local optima. ILS has proven capable of delivering excellent performance on numerous N P-Hard optimization problems. [LMS03]. However, despite its implicity, very little is known about why ILS can be so effective, and under what conditions. The goal of this paper is to advance the state-of-the-art in the analysis of meta-heuristics, by providing answers to this research question. They focus on characterizing both the relationship between the structure of the underlying search space and ILS performance, and the dynamic behavior of ILS. The analysis proceeds in the context of the job-shop scheduling problem (JSP) [Tai94]. They begin by demonstrating that the attractor basins of local optima in the JSP are surprisingly weak, and can be escaped with high probaiblity by accepting a short random sequence of less-fit neighbors. this result is used to develop a new ILS algorithms for the JSP, I-JAR, whose performance is competitive with tabu search on difficult benchmark instances. They conclude by developing a very accurate behavioral model of I-JAR, which yields significant insights into the dynamics of search. The analysis is based on a set of 100 random 10 x 10 problem instances, in

Comparative Study of Job Burnout Among Critical Care Nurses With Fixed and Rotating Shift Schedules

PubMed Central

Shamali, Mahdi; Shahriari, Mohsen; Babaii, Atye; Abbasinia, Mohammad

2015-01-01

Background: Nurses, as health care providers, are insurmountably obliged to the practice of shift work. Literature has reported shift working as one of the inducing factors of burnout. Despite numerous studies in this area, there are inconsistencies on the relationship between shift working and burnout among nurses, especially in those who work in critical care settings. Objectives: The aim of this study was to compare the occupational burnout in critical care nurses with and without fixed shift schedules. Patients and Methods: In this comparative study, 130 nurses with rotating shift schedule and 130 nurses with fixed shift schedule from six university hospitals were selected using stratified random sampling. Maslach burnout inventory was used for data collection. Independent samples t-test, chi-square and one-way ANOVA tests were used to analyze the data. Results: Most of the participants were females (62.7%), aged between 22 - 29 years (38.5%), married (59.2%), and had a bachelor degree (86.9%). The mean score of emotional exhaustion was significantly higher in nurses with fixed shift schedules (P < 0.001). However, no significant difference was found between the mean scores of the two groups in the personal accomplishment and depersonalization subscales (P > 0.05). Moreover, no significant difference was found in burnout mean scores between nurses with fixed morning and fixed night shifts (P > 0.05). The means of the emotional exhaustion subscale were significantly different in nurses with different characteristics (P < 0.05) except the gender and working unit. Conclusions: As a result of this study, it was found that critical care nurses with fixed shift schedules display more burnout in emotional exhaustion dimension, compared to those working with rotating shift schedules. PMID:26576442

Heuristic methods for the single machine scheduling problem with different ready times and a common due date

NASA Astrophysics Data System (ADS)

Birgin, Ernesto G.; Ronconi, Débora P.

2012-10-01

The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, the application of constructive heuristics that exploit specific characteristics of the problem to improve their performance is investigated. The proposed approaches are examined through a computational comparative study on a set of 280 benchmark test problems with up to 1000 jobs.

A Question of Justice: Disparities in Employees' Access to Flexible Schedule Arrangements

ERIC Educational Resources Information Center

Swanberg, Jennifer E.; Pitt-Catsouphes, Marcie; Drescher-Burke, Krista

2005-01-01

Within an organizational justice framework, this article investigates which group of employees are less likely to have access to flexible schedule options. Using data from the 1997 National Study of the Changing Workforce, logistical regressions were conducted to identify the employee, job, and workplace factors associated with limited access to…

Behavioral Analysis of Physical Security Job Analyses. Volume 1.

DTIC Science & Technology

1980-10-01

Job Analyses Personnel Reliability Program Junior Officers Physical Security Morale Motivation 20. ABSTRACT (Continue an reverese ode It neceearly and...internal motivation factors. Assignment of some auxiliary duties to enlisted personnel is possibly conducive to lowered efficiency in physical...subordinates; scheduling pressures; operational alerts and emergencies; relative lack of extrinsic rewards; constant necessity to prove credibility and

Stress Coping Strategies among Guidance Counsellors in the Performance of Their Jobs in Secondary Schools Delta North Senatorial District

ERIC Educational Resources Information Center

Onoyase, Anna

2015-01-01

The study was set out to investigate stress coping strategies among Guidance Counsellors in the performance of their jobs. One research question and four hypotheses were formulated to guide the study. Two instruments were used to collect data for the study. One hundred and ten copies of the instruments were administered on one hundred and ten…

Guidelines for successful self-scheduling on nursing units.

PubMed

Russell, Elizabeth; Hawkins, Jenna; Arnold, Kara A

2012-09-01

Self-scheduling programs are an increasingly popular strategy utilized by employers to address the individual and organizational challenges resulting from employee work-life imbalance among the nursing workforce. Certain key components will ensure buy-in and support from staff when self-scheduling programs are developed.

An investigation of coping strategies associated with job stress in teachers.

PubMed

Griffith, J; Steptoe, A; Cropley, M

1999-12-01

School teaching is regarded as a stressful occupation, but the perception of the job as stressful may be influenced by coping responses and social support. To assess the associations between teacher stress, psychological coping responses and social support, taking into account the plaintive set engendered by negative affectivity. Questionnaire survey of 780 primary and secondary school teachers (53.5% response rate). In stepwise multiple regression, social support at work and the coping responses behavioural disengagement and suppression of competing activities predicted job stress independently of age, gender, class size, occupational grade and negative affectivity. High job stress was associated with low social support at work and greater use of coping by disengagement and suppression of competing activities. It is suggested that behavioural disengagement and suppression of competing activities are maladaptive responses in a teaching environment and may actually contribute to job stress. Coping and social support not only moderate the impact of stressors on well-being but influence the appraisal of environmental demands as stressful.

Development of deficit irrigation scheduling strategies for 'Prime Giant' sweet cherry

NASA Astrophysics Data System (ADS)

Blanco, Víctor; Domingo, Rafael; Torres, Roque; Pérez Pastor, Alejandro; García, Manuel; López, Juan Antonio

2016-04-01

.27 MPa, during the preharvest period, respectively. The deficit irrigation strategies tested, T85 and T100-55, corresponded to equivalent signal intensities of Ys, 1.1 and 1.05, and of MDS 1.40 and 1.25, respectively, which would denote that the treatment irrigated to satisfy 100% of ETc during preharvest (T100-55) was slightly stressed. Our results show that the water regime applied generated statistically significance differences between treatments both in plant (Ys, Yf, MDS, TGR, gs, Pn, E) and soil (Ym, Ov) water relations. There were no differences in vegetative growth, trunk cross-sectional area or summer pruning values. The irrigation strategies followed did not cause any difference in total production (16.1 t ha-1). Moreover, fruit quality at harvest did not differ between treatments, except for the solid soluble content and unitary cherry weight, when significant differences were obtained. The results confirm the usefulness of support deficit irrigation scheduling in sweet cherry trees. However, these good results need to be followed up in subsequent growing seasons. This study was funded by the Spanish Ministry for Economy and Competitiveness (MINECO) and the European Agricultural Funds for Rural Development. Reference: AGL2013-49047-C2-1-R.

Learning to improve iterative repair scheduling

NASA Technical Reports Server (NTRS)

Zweben, Monte; Davis, Eugene

1992-01-01

This paper presents a general learning method for dynamically selecting between repair heuristics in an iterative repair scheduling system. The system employs a version of explanation-based learning called Plausible Explanation-Based Learning (PEBL) that uses multiple examples to confirm conjectured explanations. The basic approach is to conjecture contradictions between a heuristic and statistics that measure the quality of the heuristic. When these contradictions are confirmed, a different heuristic is selected. To motivate the utility of this approach we present an empirical evaluation of the performance of a scheduling system with respect to two different repair strategies. We show that the scheduler that learns to choose between the heuristics outperforms the same scheduler with any one of two heuristics alone.

Advancing Air Force Scheduling through Modeling Problem Topologies

DTIC Science & Technology

2006-08-03

Merrill on August 23, 2005 and corresponded with Major David Van Veldhuizen in Fall 2005 about obtaining data. 3.4.3 Transitions Analytical Graphics and...observation satellite orbit. Technical Report CRT-2003-27, Centre de recherche sur les transports, July 2003. [5] Van -Dat Cung. ROADEF 2003: Results of the...collaborateurs/etd/default.htm. January, 2004. [15] P.J.M van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job shop scheduling by simulated annealing

A synergetic combination of small and large neighborhood schemes in developing an effective procedure for solving the job shop scheduling problem.

PubMed

Amirghasemi, Mehrdad; Zamani, Reza

2014-01-01

This paper presents an effective procedure for solving the job shop problem. Synergistically combining small and large neighborhood schemes, the procedure consists of four components, namely (i) a construction method for generating semi-active schedules by a forward-backward mechanism, (ii) a local search for manipulating a small neighborhood structure guided by a tabu list, (iii) a feedback-based mechanism for perturbing the solutions generated, and (iv) a very large-neighborhood local search guided by a forward-backward shifting bottleneck method. The combination of shifting bottleneck mechanism and tabu list is used as a means of the manipulation of neighborhood structures, and the perturbation mechanism employed diversifies the search. A feedback mechanism, called repeat-check, detects consequent repeats and ignites a perturbation when the total number of consecutive repeats for two identical makespan values reaches a given threshold. The results of extensive computational experiments on the benchmark instances indicate that the combination of these four components is synergetic, in the sense that they collectively make the procedure fast and robust.

A multiprocessor computer simulation model employing a feedback scheduler/allocator for memory space and bandwidth matching and TMR processing

NASA Technical Reports Server (NTRS)

Bradley, D. B.; Irwin, J. D.

1974-01-01

A computer simulation model for a multiprocessor computer is developed that is useful for studying the problem of matching multiprocessor's memory space, memory bandwidth and numbers and speeds of processors with aggregate job set characteristics. The model assumes an input work load of a set of recurrent jobs. The model includes a feedback scheduler/allocator which attempts to improve system performance through higher memory bandwidth utilization by matching individual job requirements for space and bandwidth with space availability and estimates of bandwidth availability at the times of memory allocation. The simulation model includes provisions for specifying precedence relations among the jobs in a job set, and provisions for specifying precedence execution of TMR (Triple Modular Redundant and SIMPLEX (non redundant) jobs.

Prioritizing sleep for healthy work schedules.

PubMed

Takahashi, Masaya

2012-03-13

Good sleep is advantageous to the quality of life. Sleep-related benefits are particularly helpful for the working class, since poor or inadequate amounts of sleep degrade work productivity and overall health. This review paper explores the essential role of sleep in healthy work schedules and primarily focuses on the timing of sleep in relation to the work period (that is, before, during and after work). Data from laboratory, field and modeling studies indicate that consistent amounts of sleep prior to work are fundamental to improved performance and alertness in the workplace. In addition, planned naps taken during work maintain appropriate levels of waking function for both daytime and night-time work. Clearly, sufficient sleep after work is vital in promoting recovery from fatigue. Recent data also suggest that the time interval between shifts should be adjusted according to the biological timing of sleep. Although sleep is more likely to be replaced by job and other activities in the real life, research shows that it is worthwhile to revise the work schedules in order to optimize sleep before, sometime during and after the work period. Therefore, we suggest establishing work-sleep balance, similar to work-life balance, as a principle for designing and improving work schedules.

Prioritizing sleep for healthy work schedules

PubMed Central

2012-01-01

Good sleep is advantageous to the quality of life. Sleep-related benefits are particularly helpful for the working class, since poor or inadequate amounts of sleep degrade work productivity and overall health. This review paper explores the essential role of sleep in healthy work schedules and primarily focuses on the timing of sleep in relation to the work period (that is, before, during and after work). Data from laboratory, field and modeling studies indicate that consistent amounts of sleep prior to work are fundamental to improved performance and alertness in the workplace. In addition, planned naps taken during work maintain appropriate levels of waking function for both daytime and night-time work. Clearly, sufficient sleep after work is vital in promoting recovery from fatigue. Recent data also suggest that the time interval between shifts should be adjusted according to the biological timing of sleep. Although sleep is more likely to be replaced by job and other activities in the real life, research shows that it is worthwhile to revise the work schedules in order to optimize sleep before, sometime during and after the work period. Therefore, we suggest establishing work-sleep balance, similar to work-life balance, as a principle for designing and improving work schedules. PMID:22738292

A Novel Framework Based on the Improved Job Demands-Resources (JD-R) Model to Understand the Impact of Job Characteristics on Job Burnout from the View of Emotion Regulation Theory.

PubMed

Yang, Naiding; Lu, Jintao; Ye, Jinfu

2018-03-01

It has been suggested that individual job characteristics have a significant impact on job burnout, and the process is subject to the regulation of demographic variables. However, the influence path of job characteristics on job burnout is still a "black box". On the basis of a systematic literature review by employing Pub Med, Science Direct, Web of Science, Google Scholar, CNKI and Scopus for required information with the several keywords "Job burnout", "Emotion regulation", "Personality traits", and "Psychological stress", in this study, an improved mine rescue workers-oriented job demands-resources (JD-R) model was put forward. Then, a novel analysis framework, to explore the impact of job characteristics on job burnout from the view of emotion regulation theory, was proposed combining the personality trait theory. This study argues that job burnout is influenced by job demands through expressive suppression and by job resources through cognitive reappraisal respectively. Further more, job demands and job resources have the opposite effects on job burnout through the "loss-path" caused by job pressure and the "gain-path" arised from job motivation, respectively. Extrovert personality traits can affect the way the individual processes the information of work environment and then how individual further adopts emotion regulation strategies, finally resulting in indirectly affecting the influence path of mine rescue workers' job characteristics on job burnout. This present study can help managers to realize the importance of employees' psychological stress and job burnout problems. The obtained conclusions provide significant decision-making references for managers in intervening job burnout, managing emotional stress and mental health of employees.

Flexible Staffing and Scheduling in U.S. Corporations. Research Bulletin No. 240.

ERIC Educational Resources Information Center

Christensen, Kathleen

A national survey in 1988 probed the use of flexible staffing and scheduling alternatives in 521 of the largest U.S. corporations. Company executives indicated they expected their companies to decrease their rate of growth of contingent staffing and increase their use of flextime, job sharing, and home-based work. Several specifics stood out…

Job Stress and Coping Strategies of Elementary Principals: A Statewide Study

ERIC Educational Resources Information Center

Boyland, Lori

2011-01-01

The purpose of this exploratory study is to gather and examine data regarding the job-related stress of elementary public school principals in Indiana. Specific job issues that principals perceive as stressful are explored, as well as self-reported changes in the stress levels of experienced principals. Objectives of this research are to deepen…

Emotional labour strategies as mediators of the relationship between public service motivation and job satisfaction in Chinese teachers.

PubMed

Li, Mingjun; Wang, Zhenhong

2016-06-01

The purpose of this study was to examine the relationship between teachers' public service motivation (PSM) and their job satisfaction levels and to investigate the mediating effects of surface acting (SA) and deep acting (DA) on that relationship. The teacher PSM scale, as well as emotional labour strategies and intrinsic satisfaction (IS) and extrinsic satisfaction (ES) scales, were administered to 317 primary and middle school teachers. Results indicated that PSM among Chinese teachers was significantly and positively related to both IS and ES. Furthermore, structural equation modelling analysis showed that SA and DA played mediating roles in the PSM-IS and PSM-ES relationships, respectively. These findings provide a new perspective that explains the mechanism underlying the association between PSM among teachers and their job satisfaction levels. Finally, the possible explanations and implications are discussed. © 2014 International Union of Psychological Science.

Experiments with a decision-theoretic scheduler

NASA Technical Reports Server (NTRS)

Hansson, Othar; Holt, Gerhard; Mayer, Andrew

1992-01-01

This paper describes DTS, a decision-theoretic scheduler designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems, and using probabilistic inference to aggregate this information in light of features of a given problem. BPS, the Bayesian Problem-Solver, introduced a similar approach to solving single-agent and adversarial graph search problems, yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.

Job-Grading System Manual for Nonappropriated Fund Instrumentalities

DTIC Science & Technology

1981-10-01

rationale for use and forwarded through designated channels to the office of DoD NAF Personnel Policy. E. USE OF OPM POSITION CLASSIFICATION AND JOB...marking, building and control of campfires, and identification of hazardous plants and animals. Schedules day or longer "camp-outs," publicizes the...Merchandisers PS-5 decorate designated areas, including showcases, ledges, and fixtures. Incumbents set up focal displays near entrances to attract cus

Scheduling Algorithms for Maximizing Throughput with Zero-Forcing Beamforming in a MIMO Wireless System

NASA Astrophysics Data System (ADS)

Foronda, Augusto; Ohta, Chikara; Tamaki, Hisashi

Dirty paper coding (DPC) is a strategy to achieve the region capacity of multiple input multiple output (MIMO) downlink channels and a DPC scheduler is throughput optimal if users are selected according to their queue states and current rates. However, DPC is difficult to implement in practical systems. One solution, zero-forcing beamforming (ZFBF) strategy has been proposed to achieve the same asymptotic sum rate capacity as that of DPC with an exhaustive search over the entire user set. Some suboptimal user group selection schedulers with reduced complexity based on ZFBF strategy (ZFBF-SUS) and proportional fair (PF) scheduling algorithm (PF-ZFBF) have also been proposed to enhance the throughput and fairness among the users, respectively. However, they are not throughput optimal, fairness and throughput decrease if each user queue length is different due to different users channel quality. Therefore, we propose two different scheduling algorithms: a throughput optimal scheduling algorithm (ZFBF-TO) and a reduced complexity scheduling algorithm (ZFBF-RC). Both are based on ZFBF strategy and, at every time slot, the scheduling algorithms have to select some users based on user channel quality, user queue length and orthogonality among users. Moreover, the proposed algorithms have to produce the rate allocation and power allocation for the selected users based on a modified water filling method. We analyze the schedulers complexity and numerical results show that ZFBF-RC provides throughput and fairness improvements compared to the ZFBF-SUS and PF-ZFBF scheduling algorithms.

Work stress, health behaviours and coping strategies of dentists from Cluj-Napoca, Romania.

PubMed

Miron, Cristian; Colosi, Horaţiu Alexandru

2018-06-01

The recognition of work stressors and their links to sociodemographic characteristics, health behaviours and coping strategies is important for enhancing the working conditions of dentists. The aim of our study was to identify and rank work stressors in dentists from Cluj-Napoca, Romania, and to investigate their potential links to sociodemographic characteristics, health behaviours and coping strategies. A questionnaire based on the Work Stress Inventory for Dentists (WSID) was delivered to a cross-sectional sample of 250 dentists working in six neighborhoods across Cluj-Napoca, Romania, as well as at the local Faculty of Dentistry. We collected and analysed information on sociodemographic characteristics, work stressors, health behaviours and coping strategies. Time and scheduling pressure, concerns about the future and pay-related work stressors were found to rank highest among the categories of work stressors investigated. Higher work stress was significantly linked to higher workloads, lower job satisfaction, poorer eating and exercise habits, higher work pain and discomfort, lower perceived health and less sleep. Job satisfaction was the single best predictor variable of work stress scores. The most frequently used coping strategy to deal with work stress was resting and taking breaks. Only one-quarter of respondents used active coping strategies. Our findings suggest that work stress is linked to a number of detrimental attitudes in dentists and that there is room for dentists to make lifestyle improvements. © 2018 FDI World Dental Federation.

Effects of job rotation and role stress among nurses on job satisfaction and organizational commitment

PubMed Central

Ho, Wen-Hsien; Chang, Ching Sheng; Shih, Ying-Ling; Liang, Rong-Da

2009-01-01

Background The motivation for this study was to investigate how role stress among nurses could affect their job satisfaction and organizational commitment, and whether the job rotation system might encourage nurses to understand, relate to and share the vision of the organization, consequently increasing their job satisfaction and stimulating them to willingly remain in their jobs and commit themselves to the organization. Despite the fact that there have been plenty of studies on job satisfaction, none was specifically addressed to integrate the relational model of job rotation, role stress, job satisfaction, and organizational commitment among nurses. Methods With top managerial hospital administration's consent, questionnaires were only distributed to those nurses who had had job rotation experience. 650 copies of the questionnaire in two large and influential hospitals in southern Taiwan were distributed, among which 532 valid copies were retrieved with a response rate of 81.8%. Finally, the SPSS 11.0 and LISREL 8.54 (Linear Structural Relationship Model) statistical software packages were used for data analysis and processing. Results According to the nurses' views, the findings are as follows: (1) job rotation among nurses could have an effect on their job satisfaction; (2) job rotation could have an effect on organizational commitment; (3) job satisfaction could have a positive effect on organizational commitment; (4) role stress among nurses could have a negative effect on their job satisfaction; and (5) role stress could have a negative effect on their organizational commitment. Conclusion As a practical and excellent strategy for manpower utilization, a hospital could promote the benefits of job rotation to both individuals and the hospital while implementing job rotation periodically and fairly. And when a medical organization attempts to enhance nurses' commitment to the organization, the findings suggest that reduction of role ambiguity in role stress

Effects of job rotation and role stress among nurses on job satisfaction and organizational commitment.

PubMed

Ho, Wen-Hsien; Chang, Ching Sheng; Shih, Ying-Ling; Liang, Rong-Da

2009-01-12

The motivation for this study was to investigate how role stress among nurses could affect their job satisfaction and organizational commitment, and whether the job rotation system might encourage nurses to understand, relate to and share the vision of the organization, consequently increasing their job satisfaction and stimulating them to willingly remain in their jobs and commit themselves to the organization. Despite the fact that there have been plenty of studies on job satisfaction, none was specifically addressed to integrate the relational model of job rotation, role stress, job satisfaction, and organizational commitment among nurses. With top managerial hospital administration's consent, questionnaires were only distributed to those nurses who had had job rotation experience. 650 copies of the questionnaire in two large and influential hospitals in southern Taiwan were distributed, among which 532 valid copies were retrieved with a response rate of 81.8%. Finally, the SPSS 11.0 and LISREL 8.54 (Linear Structural Relationship Model) statistical software packages were used for data analysis and processing. According to the nurses' views, the findings are as follows: (1) job rotation among nurses could have an effect on their job satisfaction; (2) job rotation could have an effect on organizational commitment; (3) job satisfaction could have a positive effect on organizational commitment; (4) role stress among nurses could have a negative effect on their job satisfaction; and (5) role stress could have a negative effect on their organizational commitment. As a practical and excellent strategy for manpower utilization, a hospital could promote the benefits of job rotation to both individuals and the hospital while implementing job rotation periodically and fairly. And when a medical organization attempts to enhance nurses' commitment to the organization, the findings suggest that reduction of role ambiguity in role stress has the best effect on enhancing

Evaluation of an open-rota system in a Danish psychiatric hospital: a mechanism for improving job satisfaction and work-life balance.

PubMed

Pryce, Joanna; Albertsen, Karen; Nielsen, Karina

2006-05-01

To evaluate the impact of an open-rota scheduling system on the health, work-life balance and job satisfaction of nurses working in a psychiatric ward in Denmark. The effects of shift rotation and scheduling are well known; however, little is known about the wider benefits of open-rota systems. Method A structured questionnaire was distributed to control and intervention groups preintervention and postintervention (20 months). Nurses within the intervention group trialed an open-rota system in which nurses designed their own work-rest schedules. Nurses in the intervention group reported that they were more satisfied with their work hours, less likely to swap their shift when working within the open-rota system and reported significant increases in work-life balance, job satisfaction, social support and community spirit when compared with nurses in the control groups. The ownership and choice over work-rest schedules has benefits for nurses, and potentially the hospital.

Job satisfaction and work related variables in Chinese cardiac critical care nurses.

PubMed

Liu, Yun-E; While, Alison; Li, Shu-Jun; Ye, Wen-Qin

2015-05-01

To explore critical care nurses' views of their job satisfaction and the relationship with job burnout, practice environment, coping style, social support, intention to stay in current employment and other work-related variables. Nurse shortage is a global issue, especially in critical care. Job satisfaction is the most frequently cited factor linked to nurses' turnover. A convenience sample of cardiac critical care nurses (n = 215; 97.7% response rate) from 12 large general hospitals in Shanghai was surveyed from December 2010 to March 2011. Over half of the sample reported satisfaction with their jobs. Nurses with 10-20 years of professional experience and those who had taken all their holiday entitlement reported higher levels of job satisfaction. The independent variables of practice environment, intention to stay, emotional exhaustion, personal accomplishment and positive coping style explained about 55% of the variance in job satisfaction. Chinese cardiac critical care nurses' job satisfaction was related to work related variables, which are amenable to managerial action. Our findings highlight the imperative of improving intrinsic and extrinsic rewards, together with the flexibility of work schedules to promote job satisfaction and staff retention. A clinical ladder system is needed to provide promotion opportunities for Chinese nurses. © 2013 John Wiley & Sons Ltd.

An Efficient Downlink Scheduling Strategy Using Normal Graphs for Multiuser MIMO Wireless Systems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh; Wu, Cheng-Hsuan; Lee, Yao-Nan; Wen, Chao-Kai

Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-input multiple-output scheduling problem into an LDPC-like problem using the normal graph. Based on the normal graph framework, soft information, which indicates the probability that each user will be scheduled to transmit packets at the access point through a specified angle-frequency sub-channel, is exchanged among the local processors to iteratively optimize the multiuser transmission schedule. Computer simulations show that the proposed algorithm can efficiently schedule simultaneous multiuser transmission which then increases the overall channel utilization and reduces the average packet delay.

Rural Clinician Scarcity and Job Preferences of Doctors and Nurses in India: A Discrete Choice Experiment

PubMed Central

Rao, Krishna D.; Ryan, Mandy; Shroff, Zubin; Vujicic, Marko; Ramani, Sudha; Berman, Peter

2013-01-01

The scarcity of rural doctors has undermined the ability of health systems in low and middle-income countries like India to provide quality services to rural populations. This study examines job preferences of doctors and nurses to inform what works in terms of rural recruitment strategies. Job acceptance of different strategies was compared to identify policy options for increasing the availability of clinical providers in rural areas. In 2010 a Discrete Choice Experiment was conducted in India. The study sample included final year medical and nursing students, and in-service doctors and nurses serving at Primary Health Centers. Eight job attributes were identified and a D-efficient fractional factorial design was used to construct pairs of job choices. Respondent acceptance of job choices was analyzed using multi-level logistic regression. Location mattered; jobs in areas offering urban amenities had a high likelihood of being accepted. Higher salary had small effect on doctor, but large effect on nurse, acceptance of rural jobs. At five times current salary levels, 13% (31%) of medical students (doctors) were willing to accept rural jobs. At half this level, 61% (52%) of nursing students (nurses) accepted a rural job. The strategy of reserving seats for specialist training in exchange for rural service had a large effect on job acceptance among doctors, nurses and nursing students. For doctors and nurses, properly staffed and equipped health facilities, and housing had small effects on job acceptance. Rural upbringing was not associated with rural job acceptance. Incentivizing doctors for rural service is expensive. A broader strategy of substantial salary increases with improved living, working environment, and education incentives is necessary. For both doctors and nurses, the usual strategies of moderate salary increases, good facility infrastructure, and housing will not be effective. Non-physician clinicians like nurse-practitioners offer an affordable

Benefits and work-schedule options in hospital pharmacy practice.

PubMed

Gaither, C A; Mason, N A; Diokno, D A; Hoffman, E J

1994-03-15

Hospital pharmacy directors were surveyed to determine whether their departments offered specific family-related benefits and work-schedule options and how their attitudes about these options compared with those of female hospital pharmacists. Questionnaires were mailed to 300 randomly selected hospital pharmacy directors to collect the following information: vacancy rates and male:female ratios in hospital pharmacy positions, which of 13 selected benefits and work-schedule options were offered, barriers that prevented the other options from being offered, and attitudes about the listed options. The options included in the survey were selected because they represent ways of balancing home and work (e.g., maternity leave, job sharing, day care). The pharmacy directors' responses were compared with those from a similar survey of female hospital pharmacists. The usable response rate was 50.3%. Position vacancy rates ranged from 5.5% for directors to 35.8% for clinical supervisors. All full-time positions had an even distribution of men and women except for director and assistant or associate director positions. Of 13 options, only maternity leave, part-time schedules, and flexible schedules were offered by more than half of the hospitals. These three were also the only listed options that the respondents considered important in recruiting and retaining pharmacists. Barriers to offering other options included the perception that current benefits and work-schedule options were adequate, lack of staff coverage, lack of funds, and the perception that some positions are not compatible with alternative schedules. Respondents' ratings of the importance of the listed benefits and work-schedule options were significantly lower than ratings given by female hospital pharmacists in a separate survey.(ABSTRACT TRUNCATED AT 250 WORDS)

Artificial intelligence for the CTA Observatory scheduler

NASA Astrophysics Data System (ADS)

Colomé, Josep; Colomer, Pau; Campreciós, Jordi; Coiffard, Thierry; de Oña, Emma; Pedaletti, Giovanna; Torres, Diego F.; Garcia-Piquer, Alvaro

2014-08-01

The Cherenkov Telescope Array (CTA) project will be the next generation ground-based very high energy gamma-ray instrument. The success of the precursor projects (i.e., HESS, MAGIC, VERITAS) motivated the construction of this large infrastructure that is included in the roadmap of the ESFRI projects since 2008. CTA is planned to start the construction phase in 2015 and will consist of two arrays of Cherenkov telescopes operated as a proposal-driven open observatory. Two sites are foreseen at the southern and northern hemispheres. The CTA observatory will handle several observation modes and will have to operate tens of telescopes with a highly efficient and reliable control. Thus, the CTA planning tool is a key element in the control layer for the optimization of the observatory time. The main purpose of the scheduler for CTA is the allocation of multiple tasks to one single array or to multiple sub-arrays of telescopes, while maximizing the scientific return of the facility and minimizing the operational costs. The scheduler considers long- and short-term varying conditions to optimize the prioritization of tasks. A short-term scheduler provides the system with the capability to adapt, in almost real-time, the selected task to the varying execution constraints (i.e., Targets of Opportunity, health or status of the system components, environment conditions). The scheduling procedure ensures that long-term planning decisions are correctly transferred to the short-term prioritization process for a suitable selection of the next task to execute on the array. In this contribution we present the constraints to CTA task scheduling that helped classifying it as a Flexible Job-Shop Problem case and finding its optimal solution based on Artificial Intelligence techniques. We describe the scheduler prototype that uses a Guarded Discrete Stochastic Neural Network (GDSN), for an easy representation of the possible long- and short-term planning solutions, and Constraint

Planning for distributed workflows: constraint-based coscheduling of computational jobs and data placement in distributed environments

NASA Astrophysics Data System (ADS)

Makatun, Dzmitry; Lauret, Jérôme; Rudová, Hana; Šumbera, Michal

2015-05-01

When running data intensive applications on distributed computational resources long I/O overheads may be observed as access to remotely stored data is performed. Latencies and bandwidth can become the major limiting factor for the overall computation performance and can reduce the CPU/WallTime ratio to excessive IO wait. Reusing the knowledge of our previous research, we propose a constraint programming based planner that schedules computational jobs and data placements (transfers) in a distributed environment in order to optimize resource utilization and reduce the overall processing completion time. The optimization is achieved by ensuring that none of the resources (network links, data storages and CPUs) are oversaturated at any moment of time and either (a) that the data is pre-placed at the site where the job runs or (b) that the jobs are scheduled where the data is already present. Such an approach eliminates the idle CPU cycles occurring when the job is waiting for the I/O from a remote site and would have wide application in the community. Our planner was evaluated and simulated based on data extracted from log files of batch and data management systems of the STAR experiment. The results of evaluation and estimation of performance improvements are discussed in this paper.

Biomonitoring of physiological status and cognitive performance of underway submariners undergoing a novel watch-standing schedule

NASA Astrophysics Data System (ADS)

Duplessis, C. A.; Cullum, M. E.; Crepeau, L. J.

2005-05-01

Submarine watch-standers adhere to a 6 hour-on, 12 hour-off (6/12) watch-standing schedule, yoking them to an 18-hr day, engendering circadian desynchronization and chronic sleep deprivation. Moreover, the chronic social crowding, shift work, and confinement of submarine life provide additional stressors known to correlate with elevated secretory immunoglobulin A (sIgA) and cortisol levels, reduced performance, immunologic dysfunction, malignancies, infections, gastrointestinal illness, coronary disease, anxiety, and depression. We evaluated an alternative, compressed, fixed work schedule designed to enhance circadian rhythm entrainment, sleep hygiene, performance, and health on 10 underway submariners, who followed the alternative and 6/12 schedules for approximately 2 weeks each. We measured subjects" sleep, cognitive performance, and salivary biomarker levels. Pilot analysis of the salivary data on one subject utilizing ELISA suggests elevated biomarker levels of stress. Average PM cortisol levels were 0.2 μg/L (normal range: nondetectable - 0.15 μg/L), and mean sIgA levels were 562 μg/ml (normal range: 100-500 μg/ml). Future research exploiting real-time salivary bioassays, via fluorescent polarimetry technology, identified by the Office of Naval Research (ONR) as a future Naval requirement, allows researchers to address correlations between stress-induced elaboration of salivary biomarkers with physiological and performance decrements, thereby fostering insight into the underway submariner"s psychoimmunological status. This may help identify strategies that enhance resilience to stressors. Specifically, empirically-based modeling can identify optimal watch-standing schedules and stress-mitigating procedures -- within the operational constraints of the submarine milieu and the mission --that foster improved circadian entrainment and reduced stress reactivity, enhancing physiological health, operational performance, safety, and job satisfaction.

Rural Transition Strategies That Work.

ERIC Educational Resources Information Center

Schwartz, Phebe

Successful rural transition strategies which assist disabled rural secondary students in the transition from school to employment and community integration are described. Effective programs and specific strategies touch on such topic areas as job/career exploration, on-site job exploration, career planning, prevocational training, transition…

Traditional/Block Scheduling, Gender, and Test Scores in College Biology Course

ERIC Educational Resources Information Center

Huelskamp, Diana

2014-01-01

Block scheduling is the reallocation of a school day into longer class sessions to allow for more active teaching strategies and active engagement of students, in the effort to increase student performance. Various types of block scheduling exist. Traditional scheduling is when the school day is divided into six to eight sessions, with each…

Job-Searching Expectations, Expectancy Violations, and Communication Strategies of Recent College Graduates

ERIC Educational Resources Information Center

Smith, Stephanie A.

2017-01-01

Expectancy violations theory, a communicative framework, is applied in this study to understand how recent college graduates form, evaluate, and respond to violated job-searching expectations. In-depth interviews of college seniors (N = 20) who were currently job searching helped answer the three research questions posed. Using a thematic…

An Online Scheduling Algorithm with Advance Reservation for Large-Scale Data Transfers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Balman, Mehmet; Kosar, Tevfik

Scientific applications and experimental facilities generate massive data sets that need to be transferred to remote collaborating sites for sharing, processing, and long term storage. In order to support increasingly data-intensive science, next generation research networks have been deployed to provide high-speed on-demand data access between collaborating institutions. In this paper, we present a practical model for online data scheduling in which data movement operations are scheduled in advance for end-to-end high performance transfers. In our model, data scheduler interacts with reservation managers and data transfer nodes in order to reserve available bandwidth to guarantee completion of jobs that aremore » accepted and confirmed to satisfy preferred time constraint given by the user. Our methodology improves current systems by allowing researchers and higher level meta-schedulers to use data placement as a service where theycan plan ahead and reserve the scheduler time in advance for their data movement operations. We have implemented our algorithm and examined possible techniques for incorporation into current reservation frameworks. Performance measurements confirm that the proposed algorithm is efficient and scalable.« less

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

PubMed

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path

PubMed Central

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective. PMID:27490901

A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times

NASA Astrophysics Data System (ADS)

Li, Xin; Fung, Richard Y. K.

2018-02-01

This article presents a dynamic algorithm for job scheduling in two-cluster tools producing multi-type wafers with flexible processing times. Flexible processing times mean that the actual times for processing wafers should be within given time intervals. The objective of the work is to minimize the completion time of the newly inserted wafer. To deal with this issue, a two-cluster tool is decomposed into three reduced single-cluster tools (RCTs) in a series based on a decomposition approach proposed in this article. For each single-cluster tool, a dynamic scheduling algorithm based on temporal constraints is developed to schedule the newly inserted wafer. Three experiments have been carried out to test the dynamic scheduling algorithm proposed, comparing with the results the 'earliest starting time' heuristic (EST) adopted in previous literature. The results show that the dynamic algorithm proposed in this article is effective and practical.

At the MLA, a Ph.D. Candidate Navigates the Jobs Gantlet

ERIC Educational Resources Information Center

Patton, Stacey

2012-01-01

It's the night before one of Javier Jimenez's big job interviews at the Modern Language Association (MLA) meeting. The 35-year-old graduate student, who is scheduled to earn his Ph.D. in comparative literature this spring from the University of California at Berkeley, is trying to ward off anxiety and abdominal pains. The mystique of the MLA, the…

The New CETA; A Sensible Approach to Making the Jobs Program Work.

ERIC Educational Resources Information Center

Employment and Training Administration (DOL), Washington, DC.

This booklet describes specific proposed and/or implemented strategies for dealing with some of the problems encountered in the CETA program. These strategies are directed toward four goals: (1) helping those who need help most; (2) creating a jobs program that goes where the jobs are: the private sector; (3) better management, delivering more job…

Job Hunting, Introduction

NASA Astrophysics Data System (ADS)

Goldin, Ed; Stringer, Susan

1998-05-01

The AAS is again sponsoring a career workshop for Astronomers seeking employment. The workshop will cover a wide range of tools needed by a job seeker with a background in astronomy. There are increasingly fewer job opportunities in the academic areas. Today, astronomers need placement skills and career information to compete strongly in a more diversified jobs arena. The workshop will offer practical training on preparing to enter the job market. Topics covered include resume and letter writing as well as how to prepare for an interview. Advice is given on resources for jobs in astronomy, statistics of employment and education, and networking strategies. Workshop training also deals with a diverse range of career paths for astronomers. The workshop will consist of an two approximately three-hour sessions. The first (1-4pm) will be on the placement tools and job-search skills described above. The second session will be for those who would like to stay and receive personalized information on individual resumes, job search problems, and interview questions and practice. The individual appointments with Ed Goldin and Susan Stringer that will take place during the second session (6-9pm) will be arranged on-site during the first session. A career development and job preparation manual "Preparing Physicists for Work" will be on sale at the workshop for \\9.00. TOPICS FOR DISCUSSION: How to prepare an effective resume How to research prospective employers Interviewing skills Networking to uncover employment Job prospects present and future Traditional and non-traditional positions for astronomers This workshop will be presented by Ed Goldin and Susan Stringer of the American Institute of Physics. The cost of the workshop is \\15.00 which includes a packet of resource materials supporting the workshop presentation. Please send your request for attendance by 8 May 1998 to the Executive Office along with a check, payable to the AAS, for the fee. Credit cards will not be

Job sharing: impact on the general well-being of female nurses.

PubMed

Kane, D; Kartha, A

1992-01-01

Women today have more life choices than ever before: career, marriage, motherhood, or any combination of the three. Unfortunately little has been done to make up for the competing demands of these roles. Job sharing may be the alternative choice which allows working women to cope with the multiple stressors of having it all--career and family without having to sacrifice their sense of well-being. Nursing administrators stand to benefit from a work schedule alternative which promotes a healthy balance between work and family. Job sharing may offer a solution to the loss of valued staff nurses who require less than full-time employment. In order to compare the general well-being of female nurses who are employed in full-time, casual part-time, and job sharing positions a descriptive correlation study was conducted. One hundred female nurses between the ages of 22 and 40 who have their children living at home with them completed the 18-Item General Well-Being Questionnaire. Additional questions regarding job satisfaction, physical health status, and demographic data were also included. The results of the analyses of variances revealed there were no statistical differences between the general well-being scores of women working full-time, casual part-time, or job sharing. However, crosstabulations showed the job sharing nurses had the highest ratings for job satisfaction and physical health status.

Scheduling multimedia services in cloud computing environment

NASA Astrophysics Data System (ADS)

Liu, Yunchang; Li, Chunlin; Luo, Youlong; Shao, Yanling; Zhang, Jing

2018-02-01

Currently, security is a critical factor for multimedia services running in the cloud computing environment. As an effective mechanism, trust can improve security level and mitigate attacks within cloud computing environments. Unfortunately, existing scheduling strategy for multimedia service in the cloud computing environment do not integrate trust mechanism when making scheduling decisions. In this paper, we propose a scheduling scheme for multimedia services in multi clouds. At first, a novel scheduling architecture is presented. Then, We build a trust model including both subjective trust and objective trust to evaluate the trust degree of multimedia service providers. By employing Bayesian theory, the subjective trust degree between multimedia service providers and users is obtained. According to the attributes of QoS, the objective trust degree of multimedia service providers is calculated. Finally, a scheduling algorithm integrating trust of entities is proposed by considering the deadline, cost and trust requirements of multimedia services. The scheduling algorithm heuristically hunts for reasonable resource allocations and satisfies the requirement of trust and meets deadlines for the multimedia services. Detailed simulated experiments demonstrate the effectiveness and feasibility of the proposed trust scheduling scheme.

Stochastic Modeling of Airlines' Scheduled Services Revenue

NASA Technical Reports Server (NTRS)

Hamed, M. M.

1999-01-01

Airlines' revenue generated from scheduled services account for the major share in the total revenue. As such, predicting airlines' total scheduled services revenue is of great importance both to the governments (in case of national airlines) and private airlines. This importance stems from the need to formulate future airline strategic management policies, determine government subsidy levels, and formulate governmental air transportation policies. The prediction of the airlines' total scheduled services revenue is dealt with in this paper. Four key components of airline's scheduled services are considered. These include revenues generated from passenger, cargo, mail, and excess baggage. By addressing the revenue generated from each schedule service separately, air transportation planners and designers arc able to enhance their ability to formulate specific strategies for each component. Estimation results clearly indicate that the four stochastic processes (scheduled services components) are represented by different Box-Jenkins ARIMA models. The results demonstrate the appropriateness of the developed models and their ability to provide air transportation planners with future information vital to the planning and design processes.

Stochastic Modeling of Airlines' Scheduled Services Revenue

NASA Technical Reports Server (NTRS)

Hamed, M. M.

1999-01-01

Airlines' revenue generated from scheduled services account for the major share in the total revenue. As such, predicting airlines' total scheduled services revenue is of great importance both to the governments (in case of national airlines) and private airlines. This importance stems from the need to formulate future airline strategic management policies, determine government subsidy levels, and formulate governmental air transportation policies. The prediction of the airlines' total scheduled services revenue is dealt with in this paper. Four key components of airline's scheduled services are considered. These include revenues generated from passenger, cargo, mail, and excess baggage. By addressing the revenue generated from each schedule service separately, air transportation planners and designers are able to enhance their ability to formulate specific strategies for each component. Estimation results clearly indicate that the four stochastic processes (scheduled services components) are represented by different Box-Jenkins ARIMA models. The results demonstrate the appropriateness of the developed models and their ability to provide air transportation planners with future information vital to the planning and design processes.

Moderating effects of coping on work stress and job performance for nurses in tertiary hospitals: a cross-sectional survey in China.

PubMed

Li, Li; Ai, Hua; Gao, Lei; Zhou, Hao; Liu, Xinyan; Zhang, Zhong; Sun, Tao; Fan, Lihua

2017-06-12

Work stress is a major problem for nurses and it can negatively influence job performance. Therefore, it is critical to explore variables that can reduce or buffer the negative effects of work stress. This study explores the moderating effects of coping strategies on the relationship between work stress and job performance for nurses in China. A cross-sectional survey of 852 nurses from four tertiary hospitals in Heilongjiang Province, China, was conducted in 2013. Descriptive statistics were reported for socioeconomic status and demographic characteristics, level of work stress, coping strategies, and job performance. Regression analysis was conducted to test the interaction between work stress and coping strategies on job performance. Three subscales of work stress were negatively related to job performance. Positive coping strategies moderated Patient Care and job performance while negative coping strategies moderated Workload and Time and performance, and between Working Environment and Resources and performance. Positive coping strategies reduce or buffer the negative effects of work stress on job performance and negative coping strategies increased the negative effects.

Job retention and breast cancer: employee perspectives and implications for rehabilitation planning.

PubMed

Rumrill, P D; Nutter, D L; Hennessey, M; Ware, M E

1998-01-01

The article presents four case studies of employed women who have had breast cancer. Specifically, the authors examine respondents' career maintenance concerns in the areas of (a) worksite accessibility, (b) performance of essential job functions, (c) job mastery, and (d) job satisfaction. Post-employment strategies are presented to assist rehabilitation professionals in meeting the on-the-job needs of women with breast cancer.

Counting (green) jobs in Queensland's waste and recycling sector.

PubMed

Davis, Georgina

2013-09-01

The waste and recycling sector has been identified as a green industry and, as such, jobs within this sector may be classed as 'green jobs'. Many governments have seen green jobs as a way of increasing employment, particularly during the global financial crisis. However, the methods used to define and quantify green jobs directly affect the quantification of these green jobs. In December 2010, Queensland introduced a waste strategy that stated intent to increase green jobs within the waste sector. This article discusses the milieu and existing issues associated with quantifying green jobs within Queensland's waste and recycling sector, and provides a review of the survey that has sought to quantify the true size of the Queensland industry sector. This research has identified nearly 5500 jobs in Queensland's private waste management and recycling sector, which indicates that official data do not accurately reflect the true size of the sector.

Decision-theoretic control of EUVE telescope scheduling

NASA Technical Reports Server (NTRS)

Hansson, Othar; Mayer, Andrew

1993-01-01

This paper describes a decision theoretic scheduler (DTS) designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems and using probabilistic inference to aggregate this information in light of the features of a given problem. The Bayesian Problem-Solver (BPS) introduced a similar approach to solving single agent and adversarial graph search patterns yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.

Job satisfaction and burnout among paediatric nurses.

PubMed

Akman, Ozlem; Ozturk, Candan; Bektas, Murat; Ayar, Dijle; Armstrong, Merry A

2016-10-01

This study aims to determine factors of job satisfaction and burnout levels of paediatric nurses. A total of 165 nurses working in paediatric clinics completed the Minnesota job satisfaction scale and the Maslach burnout scale. Average scores of the emotional exhaustion and depersonalisation score were low, while personal accomplishment scores were high. A high level of job satisfaction, being married, increased age and a decreased number of assigned patients were significantly associated with a low level of burnout. Paediatric nurses experience burnout at significant levels. The most important variable that affected job satisfaction was income. The results of the study could guide development of strategies that might prevent or alleviate burnout of paediatric nurses. © 2016 John Wiley & Sons Ltd.

Social Networks in the Labour Market--The Sociology of Job Search.

ERIC Educational Resources Information Center

Carson, Edgar

1989-01-01

Reviews literature on nature of social networks in labor market and their implications for job search strategies of dislocated workers. Suggests issues for further research: (1) how the job search changes as unemployment increases; (2) the role of social networks in the labor market; and (3) claims about security and conditions of jobs found…

Community Job Initiatives: Readiness, Training, Creation and Retention.

ERIC Educational Resources Information Center

Shabecoff, Alice; And Others

1993-01-01

A community-based approach can excel at putting people back to work. The community-based strategy for helping people find and keep jobs needs to provide comprehensive and integrated services. Collaboration is likely to be the most practical means to round up those services. Community groups usually have a dual purpose in pursuing a jobs program:…

Factors that influence nurses' job satisfaction.

PubMed

Ma, Chen-Chung; Samuels, Michael E; Alexander, Judith W

2003-05-01

To examine factors affecting the job satisfaction of registered nurses (RNs). A growing recognition of job dissatisfaction among RNs in South Carolina hospitals has contributed to current problems with recruitment and retention. If administrators identify factors influencing RNs' job satisfaction in hospitals and implement strategies to address these factors, RN turnover rates will decrease and recruiting and retention rates will increase. A cross-sectional study of secondary data was designed to identify the individual, work, and geographic factors that impact nursing job satisfaction at the state level. A 27-question self-administered survey was sent to 17,500 RNs in South Carolina with postage-paid envelopes for their responses. Surveys from 3472 nurses were completed anonymously. Univariate statistics were used to describe the study sample. One-way and multivariable Analysis of Variance were used to determine which variables contributed the most to job satisfaction. For about two thirds of the RNs, job satisfaction remained the same or had lessened over the past 2 years. In addition, statistically significant differences were found between job satisfaction and years of service, job position, hospital retirement plan, and geographic area. The findings have implications for nurse managers and hospital administrators for planning and implementing effective health policies that will meet the unique needs of their staffs and organizations. Such research is particularly relevant in this difficult time of nursing shortages throughout the healthcare industry.

[Relationship between job satisfaction and occupational stress in the workers of a thermal power plant].

PubMed

Gu, Gui-zhen; Yu, Shan-fa; Zhou, Wen-hui

2011-12-01

To explore the relationship between job satisfaction and occupational stress in the workers of a thermal power plant. The cluster sampling method was used to investigate 875 workers in a thermal power plant. The job satisfaction, occupational stressors, strains, personalities, meeting strategy and social support were measured using occupational stress instruments, job content questionnaire and effort-reward imbalance questionnaire. There were no significant differences of job satisfaction scores between different groups according to sex, educational level, marriage status, smoking and drinking (P > 0.05). But there were significant differences of job satisfaction scores between different age groups or between different service length groups (P < 0.01). The correlation analysis revealed that job satisfaction scores were related positively to responsibility for persons and things, promotion opportunity, job control, job stabilization, rewards, mental health, positive affectivity, self-esteem, superior support and coworker support scores (P < 0.05 or P < 0.01), negatively to role ambiguity and conflict, job future ambiguity, job demands, negative affectivity, depressive symptoms, patience, and mental locus of work control(P < 0.05 or P < 0.01). The results of variance analysis indicated that the job relationship, responsibility for persons and things, promotion opportunity, job control, job stabilization, reward, mental health, positive affectivity, self-esteem and buffer scores of the workers with high job satisfaction scores were significantly higher than those of workers with moderate and lower job satisfaction scores (P < 0.01), but the role ambiguity and conflict, job future ambiguity, job demands, and depressive symptoms scores and mental locus of work control of the workers with high job satisfaction scores were significantly lower than those of workers with moderate and lower job satisfaction scores (P < 0.05 or P < 0.01). The results of multivariate logistic

Prescribed Travel Schedules for Fatigue Management

NASA Technical Reports Server (NTRS)

Whitmire, Alexandra; Johnston, Smith; Lockley, Steven

2011-01-01

The NASA Fatigue Management Team is developing recommendations for managing fatigue during travel and for shift work operations, as Clinical Practice Guidelines for the Management of Circadian Desynchrony in ISS Operations. The Guidelines provide the International Space Station (ISS ) flight surgeons and other operational clinicians with evidence-based recommendations for mitigating fatigue and other factors related to sleep loss and circadian desynchronization. As much international travel is involved both before and after flight, the guidelines provide recommendations for: pre-flight training, in-flight operations, and post-flight rehabilitation. The objective of is to standardize the process by which care is provided to crewmembers, ground controllers, and other support personnel such as trainers, when overseas travel or schedule shifting is required. Proper scheduling of countermeasures - light, darkness, melatonin, diet, exercise, and medications - is the cornerstone for facilitating circadian adaptation, improving sleep, enhancing alertness, and optimizing performance. The Guidelines provide, among other things, prescribed travel schedules that outline the specific implementation of these mitigation strategies. Each travel schedule offers evidence based protocols for properly using the NASA identified countermeasures for fatigue. This presentation will describe the travel implementation schedules and how these can be used to alleviate the effects of jet lag and/or schedule shifts.

An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Xu, Ye; Wang, Ling; Wang, Shengyao; Liu, Min

2014-09-01

In this article, an effective hybrid immune algorithm (HIA) is presented to solve the distributed permutation flow-shop scheduling problem (DPFSP). First, a decoding method is proposed to transfer a job permutation sequence to a feasible schedule considering both factory dispatching and job sequencing. Secondly, a local search with four search operators is presented based on the characteristics of the problem. Thirdly, a special crossover operator is designed for the DPFSP, and mutation and vaccination operators are also applied within the framework of the HIA to perform an immune search. The influence of parameter setting on the HIA is investigated based on the Taguchi method of design of experiment. Extensive numerical testing results based on 420 small-sized instances and 720 large-sized instances are provided. The effectiveness of the HIA is demonstrated by comparison with some existing heuristic algorithms and the variable neighbourhood descent methods. New best known solutions are obtained by the HIA for 17 out of 420 small-sized instances and 585 out of 720 large-sized instances.

Knowledge Translation in Job Development: Strategies for Involving Families

ERIC Educational Resources Information Center

Hall, Allison; Bose, Jennifer; Winsor, Jean; Migliore, Alberto

2014-01-01

Background: Although United States employment policies have increased support for people with disabilities working in community settings, the unemployment rate for this population remains very high, particularly for people with intellectual or developmental disabilities. Research shows that job developers (direct support professionals who assist…

Job loss, human capital job feature, and work condition job feature as distinct job insecurity constructs.

PubMed

Blau, Gary; Tatum, Donna Surges; McCoy, Keith; Dobria, Lidia; Ward-Cook, Kory

2004-01-01

The projected growth of new technologies, increasing use of automation, and continued consolidation of health-related services suggest that continued study of job insecurity is needed for health care professionals. Using a sample of 178 medical technologists over a 5-year period, this study's findings extend earlier work by Blau and Sharp (2000) and suggest that job loss insecurity, human capital job feature insecurity, and work condition job feature insecurity are related but distinct types of job insecurity. A seven-item measure of job loss insecurity, a four-item measure of human capital job feature insecurity, and a four-item measure of work condition job feature insecurity were analyzed. Confirmatory factor analysis using a more heterogeneous sample of 447 working adults supported this three-factor structure. Using correlation and path analysis, different significant relationships of antecedent variables and subsequent organizational withdrawal cognitions to these three types of job insecurity were found.

Predictors of career commitment and job performance of Jordanian nurses.

PubMed

Mrayyan, Majd T; Al-Faouri, Ibrahim

2008-04-01

Few studies focused on nurses' career commitment and nurses' job performance. This research aimed at studying variables of nurses' career commitment and job performance, and assessing the relationship between the two concepts as well as their predictors. A survey was used to collect data from a convenient sample of 640 Registered Nurses employed in 24 hospitals. Nurses 'agreed' to be committed to their careers and they were performing their jobs 'well'. As a part of career commitment, nurses were willing to be involved, in their own time, in projects that would benefit patient care. The highest and lowest means of nurses' job performance were reported for the following aspects: leadership, critical care, teaching/collaboration, planning/evaluation, interpersonal relations/communications and professional development. Correlating of total scores of nurses' career commitment and job performance revealed the presence of a significant and positive relationship between the two concepts. Stepwise regression models revealed that the explained variance in nurses' career commitment was 23.9% and that in nurses' job performance was 29.9%. Nurse managers should promote nursing as a career and they should develop and implement various strategies to increase nurses' career commitment and nurses' job performance. These strategies should focus on nurse retention, staff development and quality of care. Nurses' career commitment and job performance are inter-related complex concepts that require further studies to understand, promote and maintain these positive factors in work environments.

Nonstandard Work Schedules and Developmentally Generative Parenting Practices: An Application of Propensity Score Techniques

ERIC Educational Resources Information Center

Grzywacz, Joseph G.; Daniel, Stephanie S.; Tucker, Jenna; Walls, Jill; Leerkes, Esther

2011-01-01

Data from the National Institute for Child Health and Human Development Study of Early Child Care (Phase I) and propensity score techniques were used to determine whether working full time in a nonstandard schedule job during the child's first year predicted parenting practices over 3 years. Results indicated that women who worked full time in a…

Genetic algorithm parameters tuning for resource-constrained project scheduling problem

NASA Astrophysics Data System (ADS)

Tian, Xingke; Yuan, Shengrui

2018-04-01

Project Scheduling Problem (RCPSP) is a kind of important scheduling problem. To achieve a certain optimal goal such as the shortest duration, the smallest cost, the resource balance and so on, it is required to arrange the start and finish of all tasks under the condition of satisfying project timing constraints and resource constraints. In theory, the problem belongs to the NP-hard problem, and the model is abundant. Many combinatorial optimization problems are special cases of RCPSP, such as job shop scheduling, flow shop scheduling and so on. At present, the genetic algorithm (GA) has been used to deal with the classical RCPSP problem and achieved remarkable results. Vast scholars have also studied the improved genetic algorithm for the RCPSP problem, which makes it to solve the RCPSP problem more efficiently and accurately. However, for the selection of the main parameters of the genetic algorithm, there is no parameter optimization in these studies. Generally, we used the empirical method, but it cannot ensure to meet the optimal parameters. In this paper, the problem was carried out, which is the blind selection of parameters in the process of solving the RCPSP problem. We made sampling analysis, the establishment of proxy model and ultimately solved the optimal parameters.

Spike: Artificial intelligence scheduling for Hubble space telescope

NASA Technical Reports Server (NTRS)

Johnston, Mark; Miller, Glenn; Sponsler, Jeff; Vick, Shon; Jackson, Robert

1990-01-01

Efficient utilization of spacecraft resources is essential, but the accompanying scheduling problems are often computationally intractable and are difficult to approximate because of the presence of numerous interacting constraints. Artificial intelligence techniques were applied to the scheduling of the NASA/ESA Hubble Space Telescope (HST). This presents a particularly challenging problem since a yearlong observing program can contain some tens of thousands of exposures which are subject to a large number of scientific, operational, spacecraft, and environmental constraints. New techniques were developed for machine reasoning about scheduling constraints and goals, especially in cases where uncertainty is an important scheduling consideration and where resolving conflicts among conflicting preferences is essential. These technique were utilized in a set of workstation based scheduling tools (Spike) for HST. Graphical displays of activities, constraints, and schedules are an important feature of the system. High level scheduling strategies using both rule based and neural network approaches were developed. While the specific constraints implemented are those most relevant to HST, the framework developed is far more general and could easily handle other kinds of scheduling problems. The concept and implementation of the Spike system are described along with some experiments in adapting Spike to other spacecraft scheduling domains.

Single Machine Scheduling and Due Date Assignment with Past-Sequence-Dependent Setup Time and Position-Dependent Processing Time

PubMed Central

Zhao, Chuan-Li; Hsu, Hua-Feng

2014-01-01

This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the cost of due date assignment. We analyze these problems with two different due date assignment methods. We first consider the model with job-dependent position effects. For each case, by converting the problem to a series of assignment problems, we proved that the problems can be solved in O(n 4) time. For the model with job-independent position effects, we proved that the problems can be solved in O(n 3) time by providing a dynamic programming algorithm. PMID:25258727

Single machine scheduling and due date assignment with past-sequence-dependent setup time and position-dependent processing time.

PubMed

Zhao, Chuan-Li; Hsu, Chou-Jung; Hsu, Hua-Feng

2014-01-01

This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the cost of due date assignment. We analyze these problems with two different due date assignment methods. We first consider the model with job-dependent position effects. For each case, by converting the problem to a series of assignment problems, we proved that the problems can be solved in O(n(4)) time. For the model with job-independent position effects, we proved that the problems can be solved in O(n(3)) time by providing a dynamic programming algorithm.

Swarm satellite mission scheduling & planning using Hybrid Dynamic Mutation Genetic Algorithm

NASA Astrophysics Data System (ADS)

Zheng, Zixuan; Guo, Jian; Gill, Eberhard

2017-08-01

Space missions have traditionally been controlled by operators from a mission control center. Given the increasing number of satellites for some space missions, generating a command list for multiple satellites can be time-consuming and inefficient. Developing multi-satellite, onboard mission scheduling & planning techniques is, therefore, a key research field for future space mission operations. In this paper, an improved Genetic Algorithm (GA) using a new mutation strategy is proposed as a mission scheduling algorithm. This new mutation strategy, called Hybrid Dynamic Mutation (HDM), combines the advantages of both dynamic mutation strategy and adaptive mutation strategy, overcoming weaknesses such as early convergence and long computing time, which helps standard GA to be more efficient and accurate in dealing with complex missions. HDM-GA shows excellent performance in solving both unconstrained and constrained test functions. The experiments of using HDM-GA to simulate a multi-satellite, mission scheduling problem demonstrates that both the computation time and success rate mission requirements can be met. The results of a comparative test between HDM-GA and three other mutation strategies also show that HDM has outstanding performance in terms of speed and reliability.

Productive and counterproductive job crafting: A daily diary study.

PubMed

Demerouti, Evangelia; Bakker, Arnold B; Halbesleben, Jonathon R B

2015-10-01

The present study aims to uncover the way daily job crafting influences daily job performance (i.e., task performance, altruism, and counterproductive work behavior). Job crafting was conceptualized as "seeking resources," "seeking challenges," and "reducing demands" and viewed as strategies individuals use to optimize their job characteristics. We hypothesized that daily job crafting relates to daily job demands and resources (work pressure and autonomy), which consequently relate to daily work engagement and exhaustion and ultimately to job performance. A sample of 95 employees filled in a quantitative diary for 5 consecutive working days (n occasions = 475). We predicted and found that daily seeking resources was positively associated with daily task performance because daily autonomy and work engagement increased. In contrast, daily reducing demands was detrimental for daily task performance and altruism, because employees lower their daily workload and consequently their engagement and exhaustion, respectively. Only daily seeking challenges was positively (rather than negatively) associated with daily counterproductive behavior. We conclude that employee job crafting can have both beneficial and detrimental effects on job performance. (c) 2015 APA, all rights reserved).

"Can't Afford To Lose a Bad Job": Latino Workers in Dane County.

ERIC Educational Resources Information Center

Wisconsin Univ., Madison. Center on Wisconsin Strategy.

A study explored the quality of life of Latinos living in Dane County, Wisconsin. Data collection included door-to-door surveys, in-depth interviews, and analysis of government reports. Findings indicated Latinos often work in bad jobs, characterized by poverty-level wages, rare and inconsistent overtime pay, erratic and inflexible schedules, few…

Sustainable employability in shiftwork: related to types of work schedule rather than age.

PubMed

Peters, Velibor; Engels, Josephine A; de Rijk, Angelique E; Nijhuis, Frans J N

2015-10-01

There is scarce research on age and sustainable employability of nurses working in various types of work schedules. Earlier research showed that nurses working in work schedules differ regarding age. Different operationalisations of age might explain variations in sustainable employability. Therefore, the aim of this study was to investigate how nurses working in various types of work schedule differ regarding sustainable employability, and the role that age plays in these differences. Age was defined as chronological age, organisational age, life-span age, and functional age. Questionnaires were distributed to 974 Dutch nurses in residential elder care (response rate 51 %) with questions about the type of work schedule, aspects of sustainable employability, various operationalisations of age, and registered sickness absence data were used. Nurses working in various types of work schedules differed regarding aspects of sustainable employability, also when operationalisations of age were added. The 'life-span age' was directly related to aspects of sustainable employability. Statistically, work ability and job satisfaction were only explained by varying operationalisations of age. Nurses' sustainable employability appeared to be mainly related to differences between the types of work schedule rather than age. Fixed early shifts are characterised by the most positive aspects of sustainable employability, and three rotating schedules score worst. To improve sustainable employability, organisations should implement a system in which nurses with different types of work schedule are monitored in combination with their life-span perspective.

Modeling and distributed gain scheduling strategy for load frequency control in smart grids with communication topology changes.

PubMed

Liu, Shichao; Liu, Xiaoping P; El Saddik, Abdulmotaleb

2014-03-01

In this paper, we investigate the modeling and distributed control problems for the load frequency control (LFC) in a smart grid. In contrast with existing works, we consider more practical and real scenarios, where the communication topology of the smart grid changes because of either link failures or packet losses. These topology changes are modeled as a time-varying communication topology matrix. By using this matrix, a new closed-loop power system model is proposed to integrate the communication topology changes into the dynamics of a physical power system. The globally asymptotical stability of this closed-loop power system is analyzed. A distributed gain scheduling LFC strategy is proposed to compensate for the potential degradation of dynamic performance (mean square errors of state vectors) of the power system under communication topology changes. In comparison to conventional centralized control approaches, the proposed method can improve the robustness of the smart grid to the variation of the communication network as well as to reduce computation load. Simulation results show that the proposed distributed gain scheduling approach is capable to improve the robustness of the smart grid to communication topology changes. © 2013 ISA. Published by ISA. All rights reserved.

Classroom Strategies for Handling Women's Issues.

ERIC Educational Resources Information Center

Pereira, Carolyn

1981-01-01

Suggests some strategies which educators can use to help high school students understand women's issues. The strategies focus on finding stereotypes, discussing the restrictive nature of women's clothing, analyzing traditional male/female roles and jobs, simulating job interviews, and discussing rights of government in abortion cases. (DB)

A FairShare Scheduling Service for OpenNebula

NASA Astrophysics Data System (ADS)

Bagnasco, S.; Vallero, S.; Zaccolo, V.

2017-10-01

In the ideal limit of infinite resources, multi-tenant applications are able to scale in/out on a Cloud driven only by their functional requirements. While a large Public Cloud may be a reasonable approximation of this condition, small scientific computing centres usually work in a saturated regime. In this case, an advanced resource allocation policy is needed in order to optimize the use of the data centre. The general topic of advanced resource scheduling is addressed by several components of the EU-funded INDIGO-DataCloud project. In this contribution, we describe the FairShare Scheduler Service (FaSS) for OpenNebula (ONE). The service must satisfy resource requests according to an algorithm which prioritizes tasks according to an initial weight and to the historical resource usage of the project. The software was designed to be less intrusive as possible in the ONE code. We keep the original ONE scheduler implementation to match requests to available resources, but the queue of pending jobs to be processed is the one ordered according to priorities as delivered by the FaSS. The FaSS implementation is still being finalized and in this contribution we describe the functional and design requirements the module should satisfy, as well as its high-level architecture.

Scheduling of hybrid types of machines with two-machine flowshop as the first type and a single machine as the second type

NASA Astrophysics Data System (ADS)

Hsiao, Ming-Chih; Su, Ling-Huey

2018-02-01

This research addresses the problem of scheduling hybrid machine types, in which one type is a two-machine flowshop and another type is a single machine. A job is either processed on the two-machine flowshop or on the single machine. The objective is to determine a production schedule for all jobs so as to minimize the makespan. The problem is NP-hard since the two parallel machines problem was proved to be NP-hard. Simulated annealing algorithms are developed to solve the problem optimally. A mixed integer programming (MIP) is developed and used to evaluate the performance for two SAs. Computational experiments demonstrate the efficiency of the simulated annealing algorithms, the quality of the simulated annealing algorithms will also be reported.

Evaluating Pharmacists' Motivation and Job Satisfaction Factors in Saudi Hospitals.

PubMed

Benslimane, Nabila; Khalifa, Mohamed

2016-01-01

High turnover rate among healthcare professionals is a very expensive price that healthcare organizations might pay if they don't have the proper strategies for motivating and satisfying their employees. Healthcare organizations should be able to identify areas that require more attention. Many studies discussed the vital link that bonds job satisfaction with motivation, which has a major impact on productivity, innovation, and overall organizational performance. Our study explored the level of job satisfaction and factors that motivate pharmacists in Saudi hospitals using mixed quantitative and qualitative methods. From pharmacy managers' point of view; financial rewards are more important than non-financial incentives and benefits. This contradicts with pharmacists' opinions; who ranked recognition, promotion, job satisfaction, job feedback, autonomy and task significance among the most influential motivators to pharmacists. These results show that managers need to revise their plans and provide further attention to ensure that effective motivation and retention strategies are put in place.

Job Offers to Individuals With Severe Mental Illness After Participation in Virtual Reality Job Interview Training.

PubMed

Smith, Matthew J; Fleming, Michael F; Wright, Michael A; Jordan, Neil; Humm, Laura Boteler; Olsen, Dale; Bell, Morris D

2015-11-01

Individuals with severe mental illness have low employment rates, and the job interview presents a critical barrier for them to obtain competitive employment. Prior randomized controlled trials (RCTs) indicated that virtual reality job interview training (VR-JIT) improved job interviewing skills among trainees. This study assessed whether VR-JIT participation was associated with greater odds of receiving job offers in the six-months after completion of training. To assess the efficacy of VR-JIT, trainees (N=39) in the method and a comparison group (N=12) completed a brief survey approximately six months after participating in the RCTs. Primary vocational outcome measures included receiving a job offer and number of weeks searching for employment. A larger proportion of trainees than comparison participants received a job offer (51% versus 25%, respectively). Trainees were more likely to receive a job offer than comparison participants (odds ratio=9.64, p=.02) after analyses accounted for cognition, recency of last job, and diagnosis. Trainees had greater odds of receiving a job offer for each completed VR-JIT trial (odds ratio=1.41, p=.04), and a greater number of completed VR-JIT trials predicted fewer weeks of searching for employment (β=-.74, p=.02). Results provide preliminary support that VR-JIT is a promising intervention associated with enhanced vocational outcomes among individuals with severe mental illness. Given that participants had minimal access to standardized vocational services, future research could evaluate the effectiveness of VR-JIT among individuals with and without access to standardized vocational services as well as evaluate strategies to implement VR-JIT within a large community mental health service provider.