Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Job_shop_scheduling> ?p ?o }
Showing triples 1 to 88 of
88
with 100 triples per page.
- Job_shop_scheduling abstract "Job shop scheduling (or job-shop problem) is an optimization problem in computer science and operations research in which ideal jobs are assigned to resources at particular times. The most basic version is as follows:We are given n jobs J1, J2, ..., Jn of varying sizes, which need to be scheduled on m identical machines, while trying to minimize the makespan. The makespan is the total length of the schedule (that is, when all the jobs have finished processing). Nowadays, the problem is presented as an online problem (dynamic scheduling), that is, each job is presented, and the online algorithm needs to make a decision about that job before the next job is presented.This problem is one of the best known online problems, and was the first problem for which competitive analysis was presented, by Graham in 1966.Best problem instances for basic model with makespan objective are due to Taillard.".
- Job_shop_scheduling wikiPageExternalLink best_lb_up.txt.
- Job_shop_scheduling wikiPageExternalLink software_g.html.
- Job_shop_scheduling wikiPageID "16384086".
- Job_shop_scheduling wikiPageLength "15227".
- Job_shop_scheduling wikiPageOutDegree "38".
- Job_shop_scheduling wikiPageRevisionID "669092880".
- Job_shop_scheduling wikiPageWikiLink AMPL.
- Job_shop_scheduling wikiPageWikiLink Bin_packing_problem.
- Job_shop_scheduling wikiPageWikiLink Category:Combinatorial_optimization.
- Job_shop_scheduling wikiPageWikiLink Category:Mathematical_optimization.
- Job_shop_scheduling wikiPageWikiLink Category:Operations_research.
- Job_shop_scheduling wikiPageWikiLink Category:Optimization_algorithms_and_methods.
- Job_shop_scheduling wikiPageWikiLink Coffman–Graham_algorithm.
- Job_shop_scheduling wikiPageWikiLink Competitive_analysis_(online_algorithm).
- Job_shop_scheduling wikiPageWikiLink Computer_science.
- Job_shop_scheduling wikiPageWikiLink David_Shmoys.
- Job_shop_scheduling wikiPageWikiLink Deadlock.
- Job_shop_scheduling wikiPageWikiLink Disjunctive_graph.
- Job_shop_scheduling wikiPageWikiLink Dorit_S._Hochbaum.
- Job_shop_scheduling wikiPageWikiLink Dynamic_programming.
- Job_shop_scheduling wikiPageWikiLink Finite_set.
- Job_shop_scheduling wikiPageWikiLink Flow_shop_scheduling.
- Job_shop_scheduling wikiPageWikiLink Genetic_algorithm.
- Job_shop_scheduling wikiPageWikiLink Genetic_algorithm_scheduling.
- Job_shop_scheduling wikiPageWikiLink Linear_programming.
- Job_shop_scheduling wikiPageWikiLink List_of_NP-complete_problems.
- Job_shop_scheduling wikiPageWikiLink Lp_space.
- Job_shop_scheduling wikiPageWikiLink NP-complete.
- Job_shop_scheduling wikiPageWikiLink NP-completeness.
- Job_shop_scheduling wikiPageWikiLink NP-hard.
- Job_shop_scheduling wikiPageWikiLink NP-hardness.
- Job_shop_scheduling wikiPageWikiLink Online_algorithm.
- Job_shop_scheduling wikiPageWikiLink Online_problem.
- Job_shop_scheduling wikiPageWikiLink Open-shop_scheduling.
- Job_shop_scheduling wikiPageWikiLink Open_shop_scheduling.
- Job_shop_scheduling wikiPageWikiLink Operations_Research.
- Job_shop_scheduling wikiPageWikiLink Operations_research.
- Job_shop_scheduling wikiPageWikiLink Optimal_control.
- Job_shop_scheduling wikiPageWikiLink P=NP.
- Job_shop_scheduling wikiPageWikiLink P_versus_NP_problem.
- Job_shop_scheduling wikiPageWikiLink Polynomial-time_approximation_scheme.
- Job_shop_scheduling wikiPageWikiLink Scheduling_(production_processes).
- Job_shop_scheduling wikiPageWikiLink Sequence-dependent_setup.
- Job_shop_scheduling wikiPageWikiLink Set_(mathematics).
- Job_shop_scheduling wikiPageWikiLink Travelling_salesman_problem.
- Job_shop_scheduling wikiPageWikiLink Workflow.
- Job_shop_scheduling wikiPageWikiLinkText "Job Shop Scheduling".
- Job_shop_scheduling wikiPageWikiLinkText "Job sequencing".
- Job_shop_scheduling wikiPageWikiLinkText "Job shop scheduling problem".
- Job_shop_scheduling wikiPageWikiLinkText "Job shop scheduling".
- Job_shop_scheduling wikiPageWikiLinkText "Job shop scheduling#Offline_makespan_minimisation".
- Job_shop_scheduling wikiPageWikiLinkText "Scheduling".
- Job_shop_scheduling wikiPageWikiLinkText "job shop scheduling".
- Job_shop_scheduling wikiPageWikiLinkText "scheduling problems".
- Job_shop_scheduling wikiPageWikiLinkText "scheduling".
- Job_shop_scheduling hasPhotoCollection Job_shop_scheduling.
- Job_shop_scheduling wikiPageUsesTemplate Template:Generalize.
- Job_shop_scheduling wikiPageUsesTemplate Template:Math.
- Job_shop_scheduling wikiPageUsesTemplate Template:Other_uses.
- Job_shop_scheduling wikiPageUsesTemplate Template:Reflist.
- Job_shop_scheduling wikiPageUsesTemplate Template:See_also.
- Job_shop_scheduling subject Category:Combinatorial_optimization.
- Job_shop_scheduling subject Category:Mathematical_optimization.
- Job_shop_scheduling subject Category:Operations_research.
- Job_shop_scheduling subject Category:Optimization_algorithms_and_methods.
- Job_shop_scheduling hypernym Problem.
- Job_shop_scheduling type Area.
- Job_shop_scheduling type Article.
- Job_shop_scheduling type Disease.
- Job_shop_scheduling type Algorithm.
- Job_shop_scheduling type Area.
- Job_shop_scheduling type Article.
- Job_shop_scheduling type Discipline.
- Job_shop_scheduling type Field.
- Job_shop_scheduling type Thing.
- Job_shop_scheduling comment "Job shop scheduling (or job-shop problem) is an optimization problem in computer science and operations research in which ideal jobs are assigned to resources at particular times. The most basic version is as follows:We are given n jobs J1, J2, ..., Jn of varying sizes, which need to be scheduled on m identical machines, while trying to minimize the makespan. The makespan is the total length of the schedule (that is, when all the jobs have finished processing).".
- Job_shop_scheduling label "Job shop scheduling".
- Job_shop_scheduling seeAlso Johnsons_rule.
- Job_shop_scheduling seeAlso Multiprocessor_scheduling.
- Job_shop_scheduling sameAs Job_Shop.
- Job_shop_scheduling sameAs زمانبندی_مغازه_کارها.
- Job_shop_scheduling sameAs Job_sequencing.
- Job_shop_scheduling sameAs m.03wj731.
- Job_shop_scheduling sameAs Q6206757.
- Job_shop_scheduling sameAs Q6206757.
- Job_shop_scheduling wasDerivedFrom Job_shop_scheduling?oldid=669092880.
- Job_shop_scheduling isPrimaryTopicOf Job_shop_scheduling.