@inproceedings{84902485236,
    abstract = "This work presents a comparison between a Parallel Genetic Algorithm (PGA) and a Parallel Tabu Search (PTS) algorithm. Both are used for solving a scheduling problem on 45 tests based on the same parallel model, (Synchronous Network Concurrency Model) and testing sequential algorithms with 2, 4 and 8 processors. The results show that the PTS algorithm obtains better results, and covers a smaller portion of the solution space. © 2004 Springer Science + Business Media, Inc.",
    year = "2004",
    title = "Using Genetic Algorithms and Tabu search parallel models to solve the scheduling problem",
    volume = "154",
    keywords = "Genetic algorithms , Parallelism , Scheduling , Tabu search",
    pages = "343-357",
    booktitle = "IFIP Advances in Information and Communication Technology",
    author = "Solar, Mauricio and Pinacho, Pedro and Muñoz, Rosa and Inostroza, Mario"
}

{"_id":"YSKBbhSdRDvSMPtxs","bibbaseid":"solar-pinacho-muoz-inostroza-usinggeneticalgorithmsandtabusearchparallelmodelstosolvetheschedulingproblem-2004","downloads":0,"creationDate":"2017-04-03T15:16:25.906Z","title":"Using Genetic Algorithms and Tabu search parallel models to solve the scheduling problem","author_short":["Solar, M.","Pinacho, P.","Muñoz, R.","Inostroza, M."],"year":2004,"bibtype":"inproceedings","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"This work presents a comparison between a Parallel Genetic Algorithm (PGA) and a Parallel Tabu Search (PTS) algorithm. Both are used for solving a scheduling problem on 45 tests based on the same parallel model, (Synchronous Network Concurrency Model) and testing sequential algorithms with 2, 4 and 8 processors. The results show that the PTS algorithm obtains better results, and covers a smaller portion of the solution space. © 2004 Springer Science + Business Media, Inc.","year":"2004","title":"Using Genetic Algorithms and Tabu search parallel models to solve the scheduling problem","volume":"154","keywords":"Genetic algorithms , Parallelism , Scheduling , Tabu search","pages":"343-357","booktitle":"IFIP Advances in Information and Communication Technology","author":[{"propositions":[],"lastnames":["Solar"],"firstnames":["Mauricio"],"suffixes":[]},{"propositions":[],"lastnames":["Pinacho"],"firstnames":["Pedro"],"suffixes":[]},{"propositions":[],"lastnames":["Muñoz"],"firstnames":["Rosa"],"suffixes":[]},{"propositions":[],"lastnames":["Inostroza"],"firstnames":["Mario"],"suffixes":[]}],"bibtex":"@inproceedings{84902485236,\n abstract = \"This work presents a comparison between a Parallel Genetic Algorithm (PGA) and a Parallel Tabu Search (PTS) algorithm. Both are used for solving a scheduling problem on 45 tests based on the same parallel model, (Synchronous Network Concurrency Model) and testing sequential algorithms with 2, 4 and 8 processors. The results show that the PTS algorithm obtains better results, and covers a smaller portion of the solution space. © 2004 Springer Science + Business Media, Inc.\",\n year = \"2004\",\n title = \"Using Genetic Algorithms and Tabu search parallel models to solve the scheduling problem\",\n volume = \"154\",\n keywords = \"Genetic algorithms , Parallelism , Scheduling , Tabu search\",\n pages = \"343-357\",\n booktitle = \"IFIP Advances in Information and Communication Technology\",\n author = \"Solar, Mauricio and Pinacho, Pedro and Muñoz, Rosa and Inostroza, Mario\"\n}\n\n","author_short":["Solar, M.","Pinacho, P.","Muñoz, R.","Inostroza, M."],"key":"84902485236","id":"84902485236","bibbaseid":"solar-pinacho-muoz-inostroza-usinggeneticalgorithmsandtabusearchparallelmodelstosolvetheschedulingproblem-2004","role":"author","urls":{},"keyword":["Genetic algorithms","Parallelism","Scheduling","Tabu search"],"downloads":0},"search_terms":["using","genetic","algorithms","tabu","search","parallel","models","solve","scheduling","problem","solar","pinacho","muñoz","inostroza"],"keywords":["genetic algorithms","parallelism","scheduling","tabu search"],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}