{"id":"https://openalex.org/W2557418835","doi":"https://doi.org/10.1109/cec.2016.7744118","title":"A new computationally efficient dynamic scheduling for multiple resource constrained procedures","display_name":"A new computationally efficient dynamic scheduling for multiple resource constrained procedures","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2557418835","doi":"https://doi.org/10.1109/cec.2016.7744118","mag":"2557418835"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2016.7744118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","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/A5090866493","display_name":"Mohammadali Shahriari","orcid":"https://orcid.org/0000-0002-2402-7174"},"institutions":[{"id":"https://openalex.org/I79817857","display_name":"University of Guelph","ror":"https://ror.org/01r7awg59","country_code":"CA","type":"education","lineage":["https://openalex.org/I79817857"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Mohammadali Shahriari","raw_affiliation_strings":["University of Guelph, Guelph, Canada"],"affiliations":[{"raw_affiliation_string":"University of Guelph, Guelph, Canada","institution_ids":["https://openalex.org/I79817857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029127152","display_name":"Mohammad Biglarbegian","orcid":"https://orcid.org/0000-0002-6576-0647"},"institutions":[{"id":"https://openalex.org/I79817857","display_name":"University of Guelph","ror":"https://ror.org/01r7awg59","country_code":"CA","type":"education","lineage":["https://openalex.org/I79817857"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mohammad Biglarbegian","raw_affiliation_strings":["University of Guelph, Guelph, Canada"],"affiliations":[{"raw_affiliation_string":"University of Guelph, Guelph, Canada","institution_ids":["https://openalex.org/I79817857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112658778","display_name":"William Melek","orcid":"https://orcid.org/0009-0002-5616-0268"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"William Melek","raw_affiliation_strings":["Univrsity of Waterloo, Waterloo, Canada"],"affiliations":[{"raw_affiliation_string":"Univrsity of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079909589","display_name":"Kurian Joseph","orcid":"https://orcid.org/0000-0003-3514-2183"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph Kurian","raw_affiliation_strings":["Alpha-IT, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"Alpha-IT, Toronto, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5090866493"],"corresponding_institution_ids":["https://openalex.org/I79817857"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17439516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":null,"first_page":"2633","last_page":"2640"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9990000128746033,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.7754072546958923},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.7596246004104614},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6719887256622314},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.6542801856994629},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.6269078850746155},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5902391076087952},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5857001543045044},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5781456232070923},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.545446515083313},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5128396153450012},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45568418502807617},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4486503601074219},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.43099987506866455},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.4249635338783264},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0867571234703064}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7754072546958923},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.7596246004104614},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6719887256622314},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.6542801856994629},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.6269078850746155},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5902391076087952},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5857001543045044},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5781456232070923},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.545446515083313},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5128396153450012},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45568418502807617},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4486503601074219},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.43099987506866455},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4249635338783264},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0867571234703064},{"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/cec.2016.7744118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1588020177","https://openalex.org/W1964625775","https://openalex.org/W1969874447","https://openalex.org/W1979095232","https://openalex.org/W1994806929","https://openalex.org/W1998408808","https://openalex.org/W2009906775","https://openalex.org/W2010074552","https://openalex.org/W2016078187","https://openalex.org/W2021219736","https://openalex.org/W2021743472","https://openalex.org/W2028444861","https://openalex.org/W2029006739","https://openalex.org/W2034725401","https://openalex.org/W2043729629","https://openalex.org/W2045141534","https://openalex.org/W2052509829","https://openalex.org/W2068003474","https://openalex.org/W2084446444","https://openalex.org/W2108197659","https://openalex.org/W2140742285","https://openalex.org/W2165758382","https://openalex.org/W2170628759","https://openalex.org/W6649750331"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W4300092030","https://openalex.org/W2372008037","https://openalex.org/W4386128920","https://openalex.org/W2167574351","https://openalex.org/W1545991362","https://openalex.org/W4386580182","https://openalex.org/W2741059494","https://openalex.org/W2895871327","https://openalex.org/W2134269501"],"abstract_inverted_index":{"Scheduling":[0,24],"of":[1,22,30,40,48,64,82,105,122],"multiple":[2,65,83],"resource":[3,6,66,84],"systems":[4],"with":[5,18,119],"constraints":[7,63],"is":[8,16,58,103,117],"a":[9,19,41,53,92,98,112],"computationally":[10,59],"expensive":[11],"task":[12],"especially":[13],"when":[14],"one":[15],"dealing":[17],"large":[20],"number":[21],"procedures.":[23,67,123],"through":[25],"assessing":[26],"the":[27,38,46],"specific":[28],"order":[29],"tasks":[31],"for":[32],"each":[33],"procedure":[34],"not":[35],"only":[36],"minimizes":[37],"makespan":[39],"schedule":[42,80],"but":[43],"also":[44,96],"maximizes":[45],"utilization":[47],"resources.":[49],"This":[50],"paper":[51],"develops":[52],"new":[54,108],"scheduling":[55,100,115],"formulation":[56],"that":[57,70,102],"efficient":[60],"and":[61],"enforces":[62],"We":[68,95],"showed":[69],"by":[71],"applying":[72],"genetic":[73],"algorithm":[74],"to":[75],"this":[76],"method":[77],"we":[78],"can":[79],"100":[81],"procedures":[85,109],"in":[86,111],"less":[87],"than":[88],"2":[89],"minutes":[90],"on":[91],"personal":[93],"computer.":[94],"developed":[97],"dynamic":[99],"technique":[101],"capable":[104],"re-scheduling":[106],"as":[107],"arrive":[110],"system.":[113],"The":[114],"performance":[116],"consistent":[118],"different":[120],"numbers":[121]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}