Identical-machines scheduling is an optimization problem in computer science and operations research. We are given n jobs J1, J2, ..., Jn of varying processing...

completion time. A special case of uniform machine scheduling is identical-machines scheduling, in which all machines have the same speed. This variant is denoted...

Unrelated-machines scheduling is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. We need...

analyzed by Ronald Graham in the 1960s in the context of the identical-machines scheduling problem. Later, it was applied to many other variants of the...

Optimal job scheduling is a class of optimization problems related to scheduling. The inputs to such problems are a list of jobs (also called processes...

scheduling is a special case of identical-machines scheduling, which is itself a special case of optimal job scheduling. Many problems, which are NP-hard...

first presented by Ronald Graham in 1969 in the context of the identical-machines scheduling problem.: sec.5  The problem is parametrized by a positive integer...

be processed on any machine of a given set (the machines in each set are identical). The name originally came from the scheduling of jobs in a job shop...

parallel. See identical-machines scheduling. Single-machine scheduling is also a very similar problem. Kolen, A. (2007). "Interval scheduling: A survey"...

List scheduling is a greedy algorithm for Identical-machines scheduling. The input to this algorithm is a list of jobs that should be executed on a set...

number partitioning, originally developed for the problem of identical-machines scheduling. It was developed by Coffman, Garey and Johnson. Its novelty...

as similar as possible. An example application is identical-machines scheduling where each machine has a job-queue that can hold at most k jobs. The problem...

Parallel task scheduling (also called parallel job scheduling or parallel processing scheduling) is an optimization problem in computer science and operations...

of early machines have been superseded by random number generators, and most are now operated using buttons and touchscreens. Slot machines include one...

first-fit decreasing. Multifit algorithm - an algorithm for identical-machines scheduling, which uses FFD as a subroutine. Johnson, David S (1973). "Near-optimal...

quality-of-service. Scheduling is fundamental to computation itself, and an intrinsic part of the execution model of a computer system; the concept of scheduling makes...

Stochastic scheduling concerns scheduling problems involving random attributes, such as random processing times, random due dates, random weights, and...

above theorem. 1. Multiway number partitioning (equivalently, Identical-machines scheduling) with the goal of minimizing the largest sum is extremely-benevolent...

Project Scheduling Problems. Constraints An Int. J. 5(1/2): 119-139 (2000) Philippe Baptiste: Scheduling equal-length jobs on identical parallel machines. Discret...

Online job scheduling is a variant of the optimal job scheduling problem, in which the jobs are not all available at the beginning, but come one after...

is equivalent to the online version of min-max identical-machines scheduling; see Online job scheduling. When the valuations are positive, this case is...

algorithm can be seen as a generalization of the LPT algorithm for identical-machines scheduling. Huang and Lu prove that a 11/9-fraction MMS-fair allocation...

Fractional job scheduling is a variant of optimal job scheduling in which it is allowed to break jobs into parts and process each part separately on the...

(no constraints) and the m weight-functions are identical corresponds to identical-machines scheduling, also known as multiway number partitioning. The...

cipher machines. An estimated 40,000 Enigma machines were constructed. After the end of World War II, the Allies sold captured Enigma machines, still...

register machine has instructions which circumvent the stack interface. Register machines routinely outperform stack machines, and stack machines have remained...

with identical valuations, which is equivalent to Identical-machines scheduling, and also the more general setting of Uniform-machines scheduling. They...

can be adapted to other problems, such as Identical-machines scheduling and unrelated-machines scheduling with various constraints. Several approximation...

fantasy. Meanwhile, the twins' mother brings them a gift that evening: identical rings cut from the same stone, said to bring happiness. Later that evening...

rate-monotonic scheduling (RMS) is a priority assignment algorithm used in real-time operating systems (RTOS) with a static-priority scheduling class. The...