This paper deals with the load-balancing of machines in a real-world job-shop scheduling problem, with identical machines. The load-balancing algorithm allocates jobs, split into lots, on identical machines, with objectives to reduce job total throughput time and to improve machine utilization. A genetic algorithm is developed, whose fitness function evaluates the load-balancing in the generate...

Background Medication errors are known as a preventable cause of idiopathic damage in pediatrics. These errors could entail serious direct and indirect outcomes that often lead to disruptions in the health care system. The present study aimed to determine the relationship between medication errors with job satisfa...

We study a natural generalization of the problem of minimizing makespan on unrelated machines in which jobs may be split into parts. The different parts of a job can be (simultaneously) processed on different machines, but each part requires a setup time before it can be processed. First we show that a natural adaptation of the seminal approximation algorithm for unrelated machine scheduling [1...

In recent years Google’s MapReduce has emerged as a leading large-scale data processing architecture. Adopted by companies such as Amazon, Facebook, Google, IBM and Yahoo! in daily use, and more recently put in use by several universities, it allows parallel processing of huge volumes of data over cluster of machines. Hadoop is a free Java implementation of MapReduce. In Hadoop, files are split...

We consider the dispatching problem in a sizeand state-aware multi-queue system with Poisson arrivals and queue-specific job sizes. By sizeand state-awareness, we mean that the dispatcher knows the size of an arriving job and the remaining service times of the jobs in each queue. By queue-specific job sizes, we mean that the time to process a job may depend on the chosen server. We focus on min...

This paper proposes an even-split Smart-OSPF (S-OSPF) scheme to reduce network congestion more than the conventional non-split S-OSPF and to distribute traffic more easily than the conventional split S-OSPF. In split S-OSPF, source edge nodes distribute traffic unevenly to their neighbor nodes, but the implementation becomes involved to split traffic with different distribution. In non-split S-...

A motivational, self-regulatory conceptualization of job search was used to organize and investigate the relationships between personality, expectancies, self, social, motive, and biographical variables and individual differences in job search behavior and employment outcomes. Meta-analytic results indicated that all antecedent variables, except optimism, were significantly related to job searc...

T split i = T base i si , (A.9) and we add a prime to any variable to indicate the version that accounts for overheads. Aside from the modifications described below, we model split tasks as full tasks with worst-case execution time C i and period T split i , so that subjobs function as jobs. As discussed in Sec. 5, several overheads cannot be incurred by all subjobs. The event latency ∆ appears...