{"id":"https://openalex.org/W2128267807","doi":"https://doi.org/10.1109/ipdps.2009.5161118","title":"New sequential and parallel algorithm for Dynamic Resource Constrained Project Scheduling Problem","display_name":"New sequential and parallel algorithm for Dynamic Resource Constrained Project Scheduling Problem","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2128267807","doi":"https://doi.org/10.1109/ipdps.2009.5161118","mag":"2128267807"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2009.5161118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2009.5161118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Parallel & Distributed Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011455755","display_name":"Andr\u00e9 Renato Villela da Silva","orcid":null},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Andre Renato Villela da Silva","raw_affiliation_strings":["Computing Institute, Federal Fluminense University, Niteroi, Brazil","[Computing Institute, Federal Fluminense University, Niteroi, Brazil]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computing Institute, Federal Fluminense University, Niteroi, Brazil","institution_ids":["https://openalex.org/I161127581"]},{"raw_affiliation_string":"[Computing Institute, Federal Fluminense University, Niteroi, Brazil]","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016430153","display_name":"Luiz Satoru Ochi","orcid":"https://orcid.org/0000-0002-5007-4513"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luiz Satoru Ochi","raw_affiliation_strings":["Computing Institute, Federal Fluminense University, Niteroi, Brazil","[Computing Institute, Federal Fluminense University, Niteroi, Brazil]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computing Institute, Federal Fluminense University, Niteroi, Brazil","institution_ids":["https://openalex.org/I161127581"]},{"raw_affiliation_string":"[Computing Institute, Federal Fluminense University, Niteroi, Brazil]","institution_ids":["https://openalex.org/I161127581"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6658,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.85850086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"189","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9970999956130981,"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/T11006","display_name":"BIM and Construction Integration","score":0.9620000123977661,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7954717874526978},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6002966165542603},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5674107074737549},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.5532766580581665},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4753306210041046},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4693026840686798},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4635296165943146},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45982861518859863},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.45832881331443787},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4224543869495392},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.41571956872940063},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.4140357971191406},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38763171434402466},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3268882632255554},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.1573992669582367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10329616069793701}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7954717874526978},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6002966165542603},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5674107074737549},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.5532766580581665},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4753306210041046},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4693026840686798},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4635296165943146},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45982861518859863},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.45832881331443787},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4224543869495392},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.41571956872940063},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4140357971191406},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38763171434402466},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3268882632255554},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.1573992669582367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10329616069793701},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2009.5161118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2009.5161118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Parallel & Distributed Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.47999998927116394,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1993791184","https://openalex.org/W2027907028","https://openalex.org/W2038345112","https://openalex.org/W2070975460","https://openalex.org/W2086657554","https://openalex.org/W2090275183","https://openalex.org/W2140129201","https://openalex.org/W2142296204","https://openalex.org/W2142326369","https://openalex.org/W2152999180","https://openalex.org/W2170428215","https://openalex.org/W2547756493","https://openalex.org/W2997776631","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2128523353","https://openalex.org/W2291648581","https://openalex.org/W3010706721","https://openalex.org/W2059290792","https://openalex.org/W1971053635","https://openalex.org/W4311616277","https://openalex.org/W1980996541","https://openalex.org/W2080809038","https://openalex.org/W2170544909","https://openalex.org/W1781596060"],"abstract_inverted_index":{"This":[0,15],"paper":[1],"proposes":[2],"a":[3,43],"new":[4,18],"Evolutionary":[5],"Algorithm":[6],"for":[7],"the":[8,40,79],"Dynamic":[9],"Resource":[10],"Constrained":[11],"Project":[12],"Scheduling":[13],"Problem.":[14],"algorithm":[16],"has":[17],"features":[19],"that":[20],"get":[21],"around":[22],"some":[23],"problems":[24],"like":[25],"premature":[26],"convergence":[27],"and":[28,68],"other":[29],"ones.":[30],"The":[31,64],"indirect":[32],"representation":[33],"approach":[34],"was":[35],"used":[36],"because":[37],"it":[38],"allows":[39],"construction":[41],"of":[42,59,66],"feasible":[44],"solution":[45],"from":[46],"any":[47],"input":[48],"priorities.":[49],"A":[50],"parallel":[51,69],"version":[52],"is":[53],"also":[54],"proposed,":[55],"making":[56],"good":[57],"use":[58],"multicore":[60],"processors":[61],"available":[62],"nowadays.":[63],"results":[65,81],"sequential":[67],"versions":[70],"were":[71],"very":[72],"significant,":[73],"improving":[74],"in":[75,83],"almost":[76],"all":[77],"ways":[78],"best":[80],"present":[82],"literature.":[84]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}