Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Job-shop_problem> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Job-shop_problem abstract "The job-shop problem (JSP) is a problem in discrete or combinatorial optimization, and is a generalization of the famous travelling salesman problem. It is a prominent illustration of a class of problems in computational complexity theory which are hard to solve.".
- Job-shop_problem wikiPageID "2515583".
- Job-shop_problem wikiPageRevisionID "600447557".
- Job-shop_problem hasPhotoCollection Job-shop_problem.
- Job-shop_problem subject Category:Combinatorial_optimization.
- Job-shop_problem subject Category:Mathematical_optimization.
- Job-shop_problem subject Category:NP-complete_problems.
- Job-shop_problem subject Category:Operations_research.
- Job-shop_problem type Abstraction100002137.
- Job-shop_problem type Attribute100024264.
- Job-shop_problem type Condition113920835.
- Job-shop_problem type Difficulty114408086.
- Job-shop_problem type NP-completeProblems.
- Job-shop_problem type Problem114410605.
- Job-shop_problem type State100024720.
- Job-shop_problem comment "The job-shop problem (JSP) is a problem in discrete or combinatorial optimization, and is a generalization of the famous travelling salesman problem. It is a prominent illustration of a class of problems in computational complexity theory which are hard to solve.".
- Job-shop_problem label "Job-shop problem".
- Job-shop_problem label "Ordonnancement d'atelier".
- Job-shop_problem label "Теория расписаний".
- Job-shop_problem label "ジョブショップ・スケジューリング問題".
- Job-shop_problem sameAs Ordonnancement_d'atelier.
- Job-shop_problem sameAs ジョブショップ・スケジューリング問題.
- Job-shop_problem sameAs m.03wj731.
- Job-shop_problem sameAs Q4386048.
- Job-shop_problem sameAs Q4386048.
- Job-shop_problem sameAs Job-shop_problem.
- Job-shop_problem wasDerivedFrom Job-shop_problem?oldid=600447557.
- Job-shop_problem isPrimaryTopicOf Job-shop_problem.