乐胖代购免代理版

{"id":"https://openalex.org/W3142088347","doi":"https://doi.org/10.1109/ipdps.2006.1639525","title":"A parallel exact hybrid approach for solving multi-objective problems on the computational grid","display_name":"A parallel exact hybrid approach for solving multi-objective problems on the computational grid","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W3142088347","doi":"https://doi.org/10.1109/ipdps.2006.1639525","mag":"3142088347"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://www.cecs.uci.edu/~papers/ipdps06/pdfs/013-NIDISC-paper-1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108102186","display_name":"Mohand Mezmaz","orcid":"https://orcid.org/0000-0002-0705-5907"},"institutions":[{"id":"https://openalex.org/I174424907","display_name":"Laboratoire d'Informatique Fondamentale de Lille","ror":"https://ror.org/05rhg0h08","country_code":"FR","type":"facility","lineage":["https://openalex.org/I174424907"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. Mezmaz","raw_affiliation_strings":["Laboratoire dInformatique Fondamentale de Lille, INRIA-Futurs-DOLPHIN Project, Villeneuve d'Ascq, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire dInformatique Fondamentale de Lille, INRIA-Futurs-DOLPHIN Project, Villeneuve d'Ascq, France","institution_ids":["https://openalex.org/I174424907","https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112866837","display_name":"Nouredine Melab","orcid":null},"institutions":[{"id":"https://openalex.org/I174424907","display_name":"Laboratoire d'Informatique Fondamentale de Lille","ror":"https://ror.org/05rhg0h08","country_code":"FR","type":"facility","lineage":["https://openalex.org/I174424907"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"N. Melab","raw_affiliation_strings":["Laboratoire dInformatique Fondamentale de Lille, INRIA-Futurs-DOLPHIN Project, Villeneuve d'Ascq, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire dInformatique Fondamentale de Lille, INRIA-Futurs-DOLPHIN Project, Villeneuve d'Ascq, France","institution_ids":["https://openalex.org/I174424907","https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107857046","display_name":"El\u2010Ghazali Talbi","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I174424907","display_name":"Laboratoire d'Informatique Fondamentale de Lille","ror":"https://ror.org/05rhg0h08","country_code":"FR","type":"facility","lineage":["https://openalex.org/I174424907"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"E.-G. Talbi","raw_affiliation_strings":["Laboratoire dInformatique Fondamentale de Lille, INRIA-Futurs-DOLPHIN Project, Villeneuve d'Ascq, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire dInformatique Fondamentale de Lille, INRIA-Futurs-DOLPHIN Project, Villeneuve d'Ascq, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I174424907"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.21758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":61,"max":68},"biblio":{"volume":null,"issue":null,"first_page":"8 pp.","last_page":"8 pp."},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9973,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.5556608},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.46122107}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7229216},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.63280857},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.61149865},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.60672647},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.5556608},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.47972384},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.46122107},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.45763353},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4498875},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.44854257},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43590856},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4257645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3406874},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21682972},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.085997075},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.420.5747","pdf_url":"http://www.cecs.uci.edu/~papers/ipdps06/pdfs/013-NIDISC-paper-1.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.420.5747","pdf_url":"http://www.cecs.uci.edu/~papers/ipdps06/pdfs/013-NIDISC-paper-1.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[{"score":0.54,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":8,"referenced_works":["https://openalex.org/W1585573806","https://openalex.org/W2060032012","https://openalex.org/W2093815829","https://openalex.org/W2150834164","https://openalex.org/W2156391157","https://openalex.org/W2161307885","https://openalex.org/W4236435395","https://openalex.org/W60370213"],"related_works":["https://openalex.org/W68587524","https://openalex.org/W4243392960","https://openalex.org/W4205193211","https://openalex.org/W3196925172","https://openalex.org/W3091613133","https://openalex.org/W3034364924","https://openalex.org/W2794361564","https://openalex.org/W2789681586","https://openalex.org/W2010336970","https://openalex.org/W1835156121"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,14,19,28,71,116],"parallel":[4,83,100],"hybrid":[5,75],"exact":[6,25],"multi-objective":[7],"approach":[8,35,122],"which":[9],"combines":[10],"two":[11],"metaheuristics":[12],"-":[13,27,85,136],"genetic":[15],"algorithm":[16,21],"(GA)":[17],"and":[18,30,51,98,113],"memetic":[20],"(MA),":[22],"with":[23,61],"an":[24,131],"method":[26,76,109],"branch":[29],"bound":[31],"(B&B)":[32],"algorithm.":[33],"Such":[34],"profits":[36],"from":[37],"both":[38],"the":[39,43,45,49,52,55,68,74,86,90,92,96,99,105,128,134,154],"exploration":[40,102],"power":[41],"of":[42,48,54,63,70,133],"GA,":[44,91],"intensification":[46],"capability":[47],"MA":[50,97],"ability":[53],"B&B":[56],"to":[57,80,124,147,153],"provide":[58],"optimal":[59],"solutions":[60],"proof":[62],"optimality.":[64],"To":[65],"fully":[66],"exploit":[67],"resources":[69],"computational":[72],"grid,":[73],"is":[77],"parallelized":[78],"according":[79],"three":[81],"well-known":[82],"models":[84],"island":[87],"model":[88,94,103],"for":[89,95,104,127],"multi-start":[93],"tree":[101],"B&B.":[106],"The":[107,121],"obtained":[108],"has":[110],"been":[111],"experimented":[112],"validated":[114],"on":[115,139],"bi-objective":[117],"flow-shop":[118],"scheduling":[119],"problem.":[120],"allowed":[123],"solve":[125],"exactly":[126],"first":[129],"time":[130],"instance":[132],"problem":[135],"50":[137],"jobs":[138],"5":[140],"machines.":[141],"More":[142],"than":[143,159],"400":[144],"processors":[145],"belonging":[146],"4":[148],"administrative":[149],"domains":[150],"have":[151],"contributed":[152],"resolution":[155],"process":[156],"during":[157],"more":[158],"6":[160],"days":[161]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3142088347","counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2024-12-11T08:00:57.129262","created_date":"2021-04-13"}