This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n8http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Nurse_scheduling_problem
rdf:type
dbo:Disease
rdfs:label
Nurse scheduling problem
rdfs:comment
The nurse scheduling problem (NSP), also called the nurse rostering problem (NRP), is the operations research problem of finding an optimal way to assign nurses to shifts, typically with a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of valid solutions. Solutions to the nurse scheduling problem can be applied to constrained scheduling problems in other fields. The nurse scheduling problem has been studied since before 1969, and is known to have NP-hard complexity.
owl:sameAs
yago-res:Nurse_scheduling_problem freebase:m.0_qhd7n
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Short_description dbt:Webarchive
dct:subject
dbc:Constraint_programming dbc:Optimal_scheduling dbc:Time_management dbc:Nursing_informatics
gold:hypernym
dbr:Problem
prov:wasDerivedFrom
n8:Nurse_scheduling_problem?oldid=1070868301&ns=0
dbo:wikiPageID
41948238
dbo:wikiPageLength
9100
dbo:wikiPageRevisionID
1070868301
dbo:wikiPageWikiLink
dbr:NP-hardness dbr:Parallel_computing dbr:Constraint_programming dbr:Operations_research dbr:Ant_colony_optimization_algorithms dbr:Constrained_optimization dbc:Nursing_informatics dbr:Assignment_problem dbc:Time_management dbr:Simulated_annealing dbr:Genetic_algorithm dbr:Nursing_management dbr:Shift_work dbr:Stochastic_optimization dbr:Decomposition_(computer_science) dbc:Optimal_scheduling dbr:Tabu_search dbr:Employee_scheduling_software dbr:Coordinate_descent dbc:Constraint_programming dbr:Nursing
dbo:abstract
The nurse scheduling problem (NSP), also called the nurse rostering problem (NRP), is the operations research problem of finding an optimal way to assign nurses to shifts, typically with a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of valid solutions. Solutions to the nurse scheduling problem can be applied to constrained scheduling problems in other fields. The nurse scheduling problem has been studied since before 1969, and is known to have NP-hard complexity.
foaf:isPrimaryTopicOf
n8:Nurse_scheduling_problem