About: Unrelated-machines scheduling

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Unrelated-machines scheduling Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/3pPVhKjHeF

Unrelated-machines scheduling is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. We need to schedule n jobs J1, J2, ..., Jn on m different machines, such that a certain objective function is optimized (usually, the makespan should be minimized). The time that machine i needs in order to process job j is denoted by pi,j. The term unrelated emphasizes that there is no relation between values of pi,j for different i and j. This is in contrast to two special cases of this problem: uniform-machines scheduling - in which pi,j = pi / sj (where sj is the speed of machine j), and identical-machines scheduling - in which pi,j = pi (the same run-time on all machines).

Attributes	Values
rdfs:label	Unrelated-machines scheduling (en)
rdfs:comment	Unrelated-machines scheduling is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. We need to schedule n jobs J1, J2, ..., Jn on m different machines, such that a certain objective function is optimized (usually, the makespan should be minimized). The time that machine i needs in order to process job j is denoted by pi,j. The term unrelated emphasizes that there is no relation between values of pi,j for different i and j. This is in contrast to two special cases of this problem: uniform-machines scheduling - in which pi,j = pi / sj (where sj is the speed of machine j), and identical-machines scheduling - in which pi,j = pi (the same run-time on all machines). (en)
dct:subject	Optimal scheduling
Wikipage page ID	68032323 (xsd:integer)
Wikipage revision ID	1087923205 (xsd:integer)
Link from a Wikipage to another Wikipage	Max-min item allocation Egalitarian item allocation Genetic algorithm Configuration linear program Optimal job scheduling Simulated annealing Computer science Identical-machines scheduling Partition problem Makespan Tabu search Optimal scheduling Weighted arithmetic mean Local search (optimization) Dynamic programming Polynomial-time approximation scheme FPTAS Operations Research Optimization problem Knapsack problem Randomized rounding Uniform-machines scheduling Truthful job scheduling
Link from a Wikipage to an external page	http://www2.informatik.uni-osnabrueck.de/knust/class/dateien/classes/pqr_nop/pqr_nop/
sameAs	Unrelated-machines scheduling Unrelated-machines scheduling
dbp:wikiPageUsesTemplate	dbt:Main dbt:Scheduling_problems
has abstract	Unrelated-machines scheduling is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. We need to schedule n jobs J1, J2, ..., Jn on m different machines, such that a certain objective function is optimized (usually, the makespan should be minimized). The time that machine i needs in order to process job j is denoted by pi,j. The term unrelated emphasizes that there is no relation between values of pi,j for different i and j. This is in contrast to two special cases of this problem: uniform-machines scheduling - in which pi,j = pi / sj (where sj is the speed of machine j), and identical-machines scheduling - in which pi,j = pi (the same run-time on all machines). In the standard three-field notation for optimal job scheduling problems, the unrelated-machines variant is denoted by R in the first field. For example, the problem denoted by " R\|\|" is an unrelated-machines scheduling problem with no constraints, where the goal is to minimize the maximum completion time. In some variants of the problem, instead of minimizing the maximum completion time, it is desired to minimize the average completion time (averaged over all n jobs); it is denoted by R\|\|. More generally, when some jobs are more important than others, it may be desired to minimize a weighted average of the completion time, where each job has a different weight. This is denoted by R\|\|. In a third variant, the goal is to maximize the minimum completion time, " R\|\|" . This variant corresponds to the problem of Egalitarian item allocation. (en)
prov:wasDerivedFrom	wikipedia-en:Unrelated-machines_scheduling?oldid=1087923205&ns=0
page length (characters) of wiki page	13331 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Unrelated-machines_scheduling
is Link from a Wikipage to another Wikipage of	Egalitarian item allocation Configuration linear program Optimal job scheduling Fully polynomial-time approximation scheme Matroid-constrained number partitioning High-multiplicity bin packing
is foaf:primaryTopic of	wikipedia-en:Unrelated-machines_scheduling

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 51 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software