About: Single-machine scheduling

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

About: Single-machine scheduling Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Election, within Data Space : el.dbpedia.org associated with source document(s)

Single-machine scheduling or single-resource scheduling is an optimization problem in computer science and operations research. We are given n jobs J1, J2, ..., Jn of varying processing times, which need to be scheduled on a single machine, in a way that optimizes a certain objective, such as the throughput. Single-machine 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 in general, can be solved in polynomial time in the single-machine case.

Attributes	Values
rdf:type	Election
rdfs:label	Single-machine scheduling (en)
rdfs:comment	Single-machine scheduling or single-resource scheduling is an optimization problem in computer science and operations research. We are given n jobs J1, J2, ..., Jn of varying processing times, which need to be scheduled on a single machine, in a way that optimizes a certain objective, such as the throughput. Single-machine 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 in general, can be solved in polynomial time in the single-machine case. (en)
sameAs	Single-machine scheduling
dbp:wikiPageUsesTemplate	dbt:Scheduling_problems dbt:Reflist dbt:Rp
Subject	Optimal scheduling
gold:hypernym	Process
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Single-machine_scheduling?oldid=1045354103&ns=0
Wikipage page ID	3650205 (xsd:integer)
page length (characters) of wiki page	7650 (xsd:nonNegativeInteger)
Wikipage revision ID	1045354103 (xsd:integer)
has abstract	Single-machine scheduling or single-resource scheduling is an optimization problem in computer science and operations research. We are given n jobs J1, J2, ..., Jn of varying processing times, which need to be scheduled on a single machine, in a way that optimizes a certain objective, such as the throughput. Single-machine 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 in general, can be solved in polynomial time in the single-machine case. In the standard three-field notation for optimal job scheduling problems, the single-machine variant is denoted by 1 in the first field. For example, " 1\|\|" is an identical machine scheduling problem with no constraints, where the goal is to minimize the sum of completion times. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Single-machine_scheduling
is Wikipage redirect of	Earliest Due - Date First Earliest due date Single machine scheduling
is Link from a Wikipage to another Wikipage of	Edd List of acronyms: E Identical-machines scheduling Interval scheduling Modified due-date scheduling heuristic Earliest Due - Date First Earliest due date Memetic algorithm Lawler's algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software