|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 7 keywords
|
|
|
Results
Found 11 publication records. Showing 11 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
35 | Shi Ping Chen, Yong He, En-Yu Yao |
Three-Partitioning Containing Kernels: Complexity and Heuristic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 57(3), pp. 255-272, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
k-partitioning containing kernels, LPT-algorithm, NP-complete, worst case analysis |
29 | Oliver Braun, Fan Chung, Ron Graham 0001 |
Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR Spectr. ![In: OR Spectr. 38(2), pp. 531-540, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
29 | Christos Koulamas, George J. Kyparisis |
A modified LPT algorithm for the two uniform parallel machine makespan minimization problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 196(1), pp. 61-68, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Christos Koulamas, George J. Kyparisis |
An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 187(2), pp. 660-666, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Bang Ye Wu |
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 349(3), pp. 407-419, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Hans Kellerer |
Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 46(3), pp. 183-191, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
29 | Tien Y. Kao, Elsayed A. Elsayed |
Performance of the LPT algorithm in multiprocessor scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 17(4), pp. 365-373, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia |
On truthfulness and approximation for scheduling selfish tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(5), pp. 437-445, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, Approximation algorithms, Game theory, Truthfulness |
22 | Tzung-Pei Hong, Tzu-Ting Wang, Shyue-Liang Wang |
A palmer-based continuous fuzzy flexible flow-shop scheduling algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 5(6), pp. 426-433, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Flexible flow shop, LPT, Palmer algorithm, Scheduling, Fuzzy set |
21 | Oscar H. Ibarra, Chul E. Kim |
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 24(2), pp. 280-289, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
21 | Dominic Dumrauf, Burkhard Monien |
On the Road to -Completeness: 8 Agents in a Singleton Congestion Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, pp. 94-108, 2008, Springer, 978-3-540-92184-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #11 of 11 (100 per page; Change: )
|
|