Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase minimum finish time schedule (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1976 (1) 1993 (1)
Publication types (Num. hits)
article(2)
Venues (Conferences, Journals, ...)
IEEE Trans. Parallel Distrib. ...(1) J. ACM(1)
Authors
Mohan Ahuja(1) Sartaj Sahni(1) Teofilo F. Gonzalez(1) Yahui Zhu(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 9 occurrences of 9 keywords
Results
Found 2 publication records. Showing 2 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
2Yahui Zhu, Mohan Ahuja On Job Scheduling on a Hypercube. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF LDF algorithm, job preemption, minimum finish time schedule, list scheduling algorithm, absolute bound, scheduling, computational complexity, distributed algorithms, lower bound, NP-complete, hypercube, hypercube networks, scheduling algorithms, job scheduling
1Teofilo F. Gonzalez, Sartaj Sahni Open Shop Scheduling to Minimize Finish Time. Search on Bibsonomy J. ACM The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #2 of 2 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.