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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n5http://dbpedia.org/resource/File:
n9https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n12http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Talent_Scheduling
dbo:wikiPageWikiLink
dbr:Talent_scheduling
dbo:wikiPageRedirects
dbr:Talent_scheduling
Subject Item
dbr:Talent_scheduling
rdfs:label
Talent scheduling
rdfs:comment
Talent scheduling is an optimization problem in computer science and operations research, and it is also a problem in combinatorial optimization. Suppose we need to make films, and each film contains several scenes. Each scene needs to be shot by one or more actors. And suppose you can only shoot one scene a day. The salaries of these actors are calculated by the day. In this problem, we can only hire each actor consecutively. For example, we can't hire an actor on the first and third days, but not the second day. During the hiring period, the producers still need to pay the actors even if they are not involved in the filming assignment. The purpose of talent scheduling is to minimize the actors' total salary by adjusting the sequence of scenes.
foaf:depiction
n12:A_example_of_talent_scheduling.png
dcterms:subject
dbc:Optimal_scheduling
dbo:wikiPageID
71570180
dbo:wikiPageRevisionID
1117899312
dbo:wikiPageWikiLink
n5:A_example_of_talent_scheduling.png dbr:Operations_research dbr:Combinatorial_optimization dbc:Optimal_scheduling dbr:Optimization_problem dbr:Pseudo-polynomial_time dbr:Integer_programming dbr:Computer_science
owl:sameAs
n9:GqCU9 wikidata:Q113714764
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:thumbnail
n12:A_example_of_talent_scheduling.png?width=300
dbo:abstract
Talent scheduling is an optimization problem in computer science and operations research, and it is also a problem in combinatorial optimization. Suppose we need to make films, and each film contains several scenes. Each scene needs to be shot by one or more actors. And suppose you can only shoot one scene a day. The salaries of these actors are calculated by the day. In this problem, we can only hire each actor consecutively. For example, we can't hire an actor on the first and third days, but not the second day. During the hiring period, the producers still need to pay the actors even if they are not involved in the filming assignment. The purpose of talent scheduling is to minimize the actors' total salary by adjusting the sequence of scenes.
prov:wasDerivedFrom
wikipedia-en:Talent_scheduling?oldid=1117899312&ns=0
dbo:wikiPageLength
5917
foaf:isPrimaryTopicOf
wikipedia-en:Talent_scheduling
Subject Item
wikipedia-en:Talent_scheduling
foaf:primaryTopic
dbr:Talent_scheduling