Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Job_shop_scheduling> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items 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 most well 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[citation needed].".
- Job_shop_scheduling wikiPageExternalLink best_lb_up.txt.
- Job_shop_scheduling wikiPageExternalLink software_g.html.
- Job_shop_scheduling wikiPageID "16384086".
- Job_shop_scheduling wikiPageRevisionID "600448389".
- Job_shop_scheduling hasPhotoCollection Job_shop_scheduling.
- 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 type Abstraction100002137.
- Job_shop_scheduling type Act100030358.
- Job_shop_scheduling type Activity100407535.
- Job_shop_scheduling type Algorithm105847438.
- Job_shop_scheduling type Event100029378.
- Job_shop_scheduling type OptimizationAlgorithmsAndMethods.
- Job_shop_scheduling type Procedure101023820.
- Job_shop_scheduling type PsychologicalFeature100023100.
- Job_shop_scheduling type Rule105846932.
- Job_shop_scheduling type YagoPermanentlyLocatedEntity.
- 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 sequencing".
- Job_shop_scheduling label "Job shop scheduling".
- 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 sameAs Job_shop_scheduling.
- Job_shop_scheduling wasDerivedFrom Job_shop_scheduling?oldid=600448389.
- Job_shop_scheduling isPrimaryTopicOf Job_shop_scheduling.