Name
Abstract | ||
|---|---|---|
Flowshop is an example of a classic hard combinatorial problem. Branch-and-bound is a technique commonly used for solving such hard problems. Together, the two can be used as a benchmark of maturity of parallel processing environment. Grid systems pose a number of hurdles which must be overcome in practical applications. We give a report on applying parallel branch-and-bound for flowshop in grid environment. Methods dealing with the complexities of the environment and the application are proposed, and evaluated. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-31500-8_3 | PPAM (2) |
Keywords | Field | DocType |
parallel branch-and-bound,hard problem,practical application,grid system,classic hard combinatorial problem,grid environment,grid branch-and-bound,parallel processing environment,permutation flowshop,grid computing,branch and bound | Branch and bound,Grid computing,Computer science,Permutation,Parallel processing,Grid system,Grid,Distributed computing | Conference |
Volume | ISSN | Citations |
7204 | 0302-9743 | 2 |
PageRank | References | Authors |
0.44 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Drozdowski | 1 | 483 | 45.17 |
| Paweł Marciniak | 2 | 25 | 1.55 |
| Grzegorz Pawlak | 3 | 18 | 3.17 |
| Maciej Płaza | 4 | 7 | 0.91 |