The job shop scheduling problem (JSSP) has attracted much attention in the field of both information sciences and operations research. This paper considers the permutation Job shop scheduling problem with the objective of minimizing make span. Artificial Bee Colony algorithm (ABC) is one of the search heuristics used to solve global optimization problems in complex search spaces. It is observed...

A train scheduling problem in a single-track railway can be modeled as a job-shop scheduling problem. We use a mixed graph model for such a job-shop problem with appropriate criteria. There are several performance evaluations for a train schedule. Optimizing a train schedule subtends minimizing total tardiness of the trains, minimizing the sum of train transit times, minimizing the makespan for...

job satisfaction of nurses working in hospitals in zahedan purgaz a , nastiezaie n , hezare mogadam m received: 15 april, 2010 accepted: 27july, 2010 abstract background & aims: one of the most important elements of any organization especially health organizations is human resources. job satisfaction leads to being interested or disinterested. the present study aimed to determine the job satisf...

BACKGROUND In recent decades, the increasing crowdedness of the emergency departments has posed various problems for patients and healthcare systems worldwide. These problems include prolonged hospital stay, patient dissatisfaction and nurse burnout or job dissatisfaction. OBJECTIVES The aim of this study was to investigate the effect of emergency department (ED) nurses' job specialization on...

Grid computing is a high performance computing environment to solve larger scale computational applications. Grid computing contains resource management, job scheduling, security problems, information management and so on. Job scheduling is a fundamental and important issue in achieving high performance in grid computing systems. However, it is a big challenge to design an efficient scheduler a...

We study the short-run effect of involuntary job loss on comprehensive measures of public health costs. We focus on job loss induced by plant closure, thereby addressing the reverse causality problem as job displacements due to plant closure are unlikely caused by workers' health status, but potentially have important effects on individual workers' health and associated public health costs. Our...

Flexible job-shop scheduling problem derived from the job-shop scheduling problem, and is more realistic than the job-shop scheduling problem in the manufacturing enterprise. It should be utilized with high efficiency. But it is a multi-objective optimal problem. Three minimization objectives (Maximum completion time (makespan), Total workload of machines and Workload of the critical machine) a...

The flexible job shop scheduling problem (FJSP) is one of the most difficult NP-hard combinatorial optimization problems. It is extremely difficult to solve the FJSP with the disturbances of manufacturing environment, which is always regarded as the flexible job shop online scheduling problem. This paper proposes a new method based on Process-Tree to solve this type of scheduling problem. Proce...

This paper investigates single-machine scheduling problems with piece-rate machine maintenance and interval constrained actual processing time. The actual processing time of a job is a general function of the normal job processing time and the position in job sequence, and it is required to restrict in given interval otherwise earliness or tardiness penalty should be paid. The maintenance durat...

The assumption of classical shop scheduling problems that each job visits each machine only once (Baker, 1974) is often violated in practice. A new type of manufacturing shop, the reentrant shop has recently attracted attention. The basic characteristic of a re-entrant shop is that a job visits certain machines more than once. For example, in semiconductor manufacturing, consequently, each wafe...