Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Notation_for_theoretic_scheduling_problems> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- Notation_for_theoretic_scheduling_problems abstract "A convenient notation for theoretic scheduling problems was introduced by Ronald Graham, Eugene Lawler, Jan Karel Lenstra and Alexander Rinnooy Kan in. It consists of three fields: α, β and γ. Each field may be a comma separated list of words. The α field describes the machine environment, β the job characteristics, and γ the objective function.".
- Notation_for_theoretic_scheduling_problems wikiPageExternalLink class.
- Notation_for_theoretic_scheduling_problems wikiPageID "5498479".
- Notation_for_theoretic_scheduling_problems wikiPageRevisionID "602088114".
- Notation_for_theoretic_scheduling_problems hasPhotoCollection Notation_for_theoretic_scheduling_problems.
- Notation_for_theoretic_scheduling_problems subject Category:Scheduling_(computing).
- Notation_for_theoretic_scheduling_problems subject Category:Theoretical_computer_science.
- Notation_for_theoretic_scheduling_problems comment "A convenient notation for theoretic scheduling problems was introduced by Ronald Graham, Eugene Lawler, Jan Karel Lenstra and Alexander Rinnooy Kan in. It consists of three fields: α, β and γ. Each field may be a comma separated list of words. The α field describes the machine environment, β the job characteristics, and γ the objective function.".
- Notation_for_theoretic_scheduling_problems label "Notation for theoretic scheduling problems".
- Notation_for_theoretic_scheduling_problems sameAs m.0dpjv4.
- Notation_for_theoretic_scheduling_problems sameAs Q7062516.
- Notation_for_theoretic_scheduling_problems sameAs Q7062516.
- Notation_for_theoretic_scheduling_problems wasDerivedFrom Notation_for_theoretic_scheduling_problems?oldid=602088114.
- Notation_for_theoretic_scheduling_problems isPrimaryTopicOf Notation_for_theoretic_scheduling_problems.