{"id":"https://openalex.org/W3013774948","doi":"https://doi.org/10.3390/a13030074","title":"Bi-Objective Dynamic Multiprocessor Open Shop Scheduling: An Exact Algorithm","display_name":"Bi-Objective Dynamic Multiprocessor Open Shop Scheduling: An Exact Algorithm","publication_year":2020,"publication_date":"2020-03-24","ids":{"openalex":"https://openalex.org/W3013774948","doi":"https://doi.org/10.3390/a13030074","mag":"3013774948"},"language":"en","primary_location":{"id":"doi:10.3390/a13030074","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13030074","pdf_url":"https://www.mdpi.com/1999-4893/13/3/74/pdf?version=1585059310","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/3/74/pdf?version=1585059310","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082994748","display_name":"Tamer F. Abdelmaguid","orcid":"https://orcid.org/0000-0003-1516-6057"},"institutions":[{"id":"https://openalex.org/I145487455","display_name":"Cairo University","ror":"https://ror.org/03q21mh05","country_code":"EG","type":"education","lineage":["https://openalex.org/I145487455"]}],"countries":["EG"],"is_corresponding":true,"raw_author_name":"Tamer F. Abdelmaguid","raw_affiliation_strings":["Department of Mechanical Design and Production, Faculty of Engineering, Cairo University, Giza 12613, Egypt"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Design and Production, Faculty of Engineering, Cairo University, Giza 12613, Egypt","institution_ids":["https://openalex.org/I145487455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082994748"],"corresponding_institution_ids":["https://openalex.org/I145487455"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.7133,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76212263,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":"13","issue":"3","first_page":"74","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9945999979972839,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.732958972454071},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7217625379562378},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6305254101753235},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5438095331192017},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5358335375785828},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5247095823287964},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5125267505645752},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49398142099380493},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.4931327998638153},{"id":"https://openalex.org/keywords/open-shop","display_name":"Open shop","score":0.48818331956863403},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4731158912181854},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4629574418067932},{"id":"https://openalex.org/keywords/testbed","display_name":"Testbed","score":0.459115207195282},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4282294511795044},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.38447195291519165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3642072081565857},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.200776606798172},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1392747163772583}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.732958972454071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7217625379562378},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6305254101753235},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5438095331192017},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5358335375785828},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5247095823287964},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5125267505645752},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49398142099380493},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.4931327998638153},{"id":"https://openalex.org/C2776484797","wikidata":"https://www.wikidata.org/wiki/Q7096412","display_name":"Open shop","level":5,"score":0.48818331956863403},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4731158912181854},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4629574418067932},{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.459115207195282},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4282294511795044},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.38447195291519165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3642072081565857},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.200776606798172},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1392747163772583},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a13030074","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13030074","pdf_url":"https://www.mdpi.com/1999-4893/13/3/74/pdf?version=1585059310","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:3254d23ecbe54255873a2ad804a3466e","is_oa":true,"landing_page_url":"https://doaj.org/article/3254d23ecbe54255873a2ad804a3466e","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 3, p 74 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/3/74/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a13030074","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13030074","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13030074","pdf_url":"https://www.mdpi.com/1999-4893/13/3/74/pdf?version=1585059310","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3013774948.pdf","grobid_xml":"https://content.openalex.org/works/W3013774948.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1483613066","https://openalex.org/W1488422606","https://openalex.org/W1543403517","https://openalex.org/W1973445991","https://openalex.org/W1987975943","https://openalex.org/W2002917695","https://openalex.org/W2017159556","https://openalex.org/W2020130199","https://openalex.org/W2026662237","https://openalex.org/W2028651280","https://openalex.org/W2039632218","https://openalex.org/W2043057347","https://openalex.org/W2043727712","https://openalex.org/W2061005265","https://openalex.org/W2061950072","https://openalex.org/W2064972727","https://openalex.org/W2070197544","https://openalex.org/W2072298242","https://openalex.org/W2081123989","https://openalex.org/W2093229192","https://openalex.org/W2093824221","https://openalex.org/W2117182850","https://openalex.org/W2134098988","https://openalex.org/W2166928920","https://openalex.org/W2172122411","https://openalex.org/W2189731345","https://openalex.org/W2518264398","https://openalex.org/W2786776401","https://openalex.org/W2794520504","https://openalex.org/W2809530692","https://openalex.org/W2894175156","https://openalex.org/W2899091276","https://openalex.org/W2945403926","https://openalex.org/W2997656693","https://openalex.org/W3001565730","https://openalex.org/W4233757421","https://openalex.org/W4248522169","https://openalex.org/W4255654664","https://openalex.org/W6629144528"],"related_works":["https://openalex.org/W3094194260","https://openalex.org/W2283291034","https://openalex.org/W4244289241","https://openalex.org/W2804958010","https://openalex.org/W2050053691","https://openalex.org/W1998948241","https://openalex.org/W2186708011","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W2563053295"],"abstract_inverted_index":{"An":[0,124],"important":[1],"element":[2],"in":[3,68,76,117,184],"the":[4,7,12,31,57,89,92,95,109,113,136,139,147,209,212,217],"integration":[5],"of":[6,14,33,48,56,88,94,108,166,211,216],"fourth":[8],"industrial":[9],"revolution":[10],"is":[11,63,127,142,158,197],"development":[13],"efficient":[15,106],"algorithms":[16],"to":[17,104,153,178,189,199,207],"deal":[18],"with":[19],"dynamic":[20,24,54],"scheduling":[21,61],"problems.":[22],"In":[23,50],"scheduling,":[25],"jobs":[26],"can":[27,150,174],"be":[28,151,176,200],"admitted":[29],"during":[30],"execution":[32],"a":[34,45,53,119,164],"given":[35],"schedule,":[36],"which":[37],"necessitates":[38],"appropriately":[39],"planned":[40],"rescheduling":[41],"decisions":[42],"for":[43,129,144,194,223],"maintaining":[44,118],"high":[46,120],"level":[47],"performance.":[49],"this":[51],"paper,":[52],"case":[55,185],"multiprocessor":[58],"open":[59],"shop":[60],"problem":[62,66,141],"addressed.":[64],"This":[65,157],"appears":[67],"different":[69],"contexts,":[70],"particularly":[71],"those":[72],"involving":[73],"diagnostic":[74],"operations":[75],"maintenance":[77],"and":[78,91],"health":[79],"care":[80],"industries.":[81],"Two":[82],"objectives":[83],"are":[84,205,227],"considered":[85],"simultaneously\u2014the":[86],"minimization":[87,93],"makespan":[90],"mean":[96],"weighted":[97],"flow":[98],"time.":[99],"The":[100,171],"former":[101],"objective":[102,115],"aims":[103],"sustain":[105],"utilization":[107],"available":[110],"resources,":[111],"while":[112],"latter":[114],"helps":[116],"customer":[121],"satisfaction":[122],"level.":[123],"exact":[125],"algorithm":[126,149,173],"presented":[128,148,172],"generating":[130],"optimal":[131,192,213],"Pareto":[132,181,214],"front":[133,182,215],"solutions.":[134],"Despite":[135],"fact":[137],"that":[138],"studied":[140,218],"NP-hard":[143],"both":[145],"objectives,":[146],"used":[152,177,206],"solve":[154],"small":[155],"instances.":[156,170],"demonstrated":[159],"through":[160],"computational":[161,186,203],"experiments":[162],"on":[163],"testbed":[165],"30":[167],"randomly":[168],"generated":[169,195],"also":[175],"generate":[179],"approximate":[180],"solutions":[183,193],"time":[187],"needed":[188],"find":[190],"proven":[191],"sub-problems":[196],"found":[198],"excessive.":[201],"Furthermore,":[202],"results":[204],"investigate":[208],"characteristics":[210],"problem.":[219],"Accordingly,":[220],"some":[221],"insights":[222],"future":[224],"metaheuristic":[225],"developments":[226],"drawn.":[228]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}