Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Open-shop_scheduling> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Open-shop_scheduling abstract "In theoretical computer science and operations research, the open-shop scheduling problem (OSSP) is a scheduling problem in which a given set of jobs must each be processed for given amounts of time at each of a given set of workstations, in an arbitrary order, and the goal is to determine the time at which each job is to be processed at each workstation.".
- Open-shop_scheduling wikiPageID "31340342".
- Open-shop_scheduling wikiPageRevisionID "593660273".
- Open-shop_scheduling hasPhotoCollection Open-shop_scheduling.
- Open-shop_scheduling subject Category:Mathematical_optimization.
- Open-shop_scheduling subject Category:Operations_research.
- Open-shop_scheduling comment "In theoretical computer science and operations research, the open-shop scheduling problem (OSSP) is a scheduling problem in which a given set of jobs must each be processed for given amounts of time at each of a given set of workstations, in an arbitrary order, and the goal is to determine the time at which each job is to be processed at each workstation.".
- Open-shop_scheduling label "Open-shop scheduling".
- Open-shop_scheduling sameAs m.0gk_p4v.
- Open-shop_scheduling sameAs Q7095711.
- Open-shop_scheduling sameAs Q7095711.
- Open-shop_scheduling wasDerivedFrom Open-shop_scheduling?oldid=593660273.
- Open-shop_scheduling isPrimaryTopicOf Open-shop_scheduling.