We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) distance between near-optimal schedules, and (3) makespan of random schedules vary as a function of the job to machine ratio ( M ). For the limiting cases N M → 0 and N M →∞ we provide analytical results, while for inte...

Job Matching, Social Network and Word-of-Mouth Communication Workers are embedded within a network of social relationships and can communicate through word-of-mouth. They can find a job either directly or through personal contacts. From this micro scenario, we derive an aggregate matching function that has the standard properties but fails to be homogeneous of degree one because of coordination...

We develop a new metric for job scheduling that includes the effects of memory contention amongst simultaneouslyexecuting jobs that share a given level of memory. Rather than assuming each job or process has a fixed, static memory requirement, we consider a general scenario wherein a process’ performance monotonically increases as a function of allocated memory, as defined by a miss-rate versus...

This paper proposes new scheduling policies for clustered servers, which are based on job size. The proposed algorithms are shown to be efficient, simple and easy to implement. They differ from traditional methods in the way jobs are assigned to back-end servers. The main idea is to defer scheduling as much as possible in order to make better use of the accumulated information on job sizes. Fur...

We studied the efficiency of different implementations of the split-step Fourier method for solving the nonlinear Schrödinger equation that employ different step size selection criteria. We compared the performance of the different implementations for a variety of pulse formats and systems including higher-order solitons, collisions of soliton pulses, a single-channel periodically-stationary di...

This scheduling model is derived from the real problem of scheduling looms in a textile industry. Jobs may be independently split over several specified machines and preemption is allowed. Deadlines are specified for each job and jobs are assumed to be available. It is shown that minimizing maximum weighted tardiness can be done in polynomial time. The case of uniform machines (as in the consid...

Multicore shared cache processors pose a challenge for designers of embedded systems who try to achieve minimal and predictable execution time of workloads consisting of several jobs. One way in which this challenge was addressed is by statically partitioning the cache among the cores and assigning the jobs to the cores with the goal of minimizing the makespan. Several heuristic algorithms have...

BACKGROUND The impact of high physician workload and job stress on quality and outcomes of healthcare delivery is not clear. Our study explored whether high workload and job stress were associated with lower performance in general practices in the Netherlands. METHODS Secondary analysis of data from 239 general practices, collected in practice visits between 2003 to 2006 in the Netherlands us...

This paper addresses a bi-criteria two-machine flowshop scheduling problem when the learning effect is present. The objective is to find a sequence that minimizes a weighted sum of the total completion time and the maximum tardiness. In this article, a branch-and-bound method, incorporating several dominance properties and a lower bound, is presented to search for the exact solution for small j...

We develop a new metric for job scheduling that includes the eeects of memory contention amongst simultaneously-executing jobs that share a given level of memory. Rather than assuming each job or process has a xed, static memory requirement, we consider a general scenario wherein a process' performance monotonically increases as a function of allocated memory, as deened by a miss-rate versus me...