[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tse/Al-Mouhamed90>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Mayez_A._Al-Mouhamed>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F32.62447>
foaf:homepage <https://doi.org/10.1109/32.62447>
dc:identifier DBLP journals/tse/Al-Mouhamed90 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F32.62447 (xsd:string)
dcterms:issued 1990 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tse>
rdfs:label Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Mayez_A._Al-Mouhamed>
swrc:number 12 (xsd:string)
swrc:pages 1390-1401 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tse/Al-Mouhamed90/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tse/Al-Mouhamed90>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tse/tse16.html#Al-Mouhamed90>
rdfs:seeAlso <https://doi.org/10.1109/32.62447>
dc:subject scheduling; precedence graphs; communication costs; earliest starting time; lower bounds; completion time; task delay; time interval; finish time; task graph; minimum time increase; interprocessor communication links; optimum performance; small graphs; graph theory; scheduling (xsd:string)
dc:title Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 16 (xsd:string)