advocate job rotation claim that work motivation can be kept reasonably high by rotating individuals through several different jobs, even though each of the jobs would become monotonous and boring if one were to remain on it for a long period of time. If future research can identify ways to maintain

Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could

Direct observations of the jobs of 370 workers were used to explain perceptions-of monotony and feelings of boredom associated with work. Of the several observational measures of task characteristics that were constructed, the most efficient predictOr of monotony and boredom was the number of times

We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines. The processing time of any job is dependent on the usage of a discrete renewable resource, e.g. personnel. An amount of k units of that resource can be allocated to the jobs at any time

with deferred deadlines: each job is assigned two priorities, the higher one for old requests and the lower one for the current request. This algorithm is called the modified rate-monotonic algorithm and is based on the wellknown rate-monotonic algorithm. We show that the modified rate-monotonic algorithm

We study a simple model of assigning indivisible objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. We completely describe all rules satisfying efficiency, independence of irrelevant objects, and resource-monotonicity

(m)-approximation truthful mechanisms [22, 20]. We study a well-motivated special case of this problem, where the processing time of a job on each machine may either be “low ” or “high”, and the low and high values are public and job-dependent. This preserves the multidimensionality of the domain, and generalizes

We consider single processor preemptive scheduling with job-dependent setup times. In this model, a job-dependent setup time is incurred when a job is started for the first time, and each time it is restarted after preemption. This model is a common generalization of preemptive scheduling

Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match curricula and job profiles. In such open environments, the objective of a matchmak-ing process is to discover best

form of this decline has yet been provided. Using a standard job search model, it is shown that monotonicity of the reservation wage function, a restriction imposed by several empirical studies, only holds under certain (rather restrictive) conditions on the variables in the model. The test from above