{"id":"https://openalex.org/W2587727662","doi":"https://doi.org/10.1109/smc.2016.7844306","title":"Makespan minimization for two parallel machines with unavailability constraints","display_name":"Makespan minimization for two parallel machines with unavailability constraints","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2587727662","doi":"https://doi.org/10.1109/smc.2016.7844306","mag":"2587727662"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2016.7844306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2016.7844306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5044366157","display_name":"Khaoula Ben Abdellafou","orcid":"https://orcid.org/0000-0002-4691-5121"},"institutions":[{"id":"https://openalex.org/I8636806","display_name":"University of Sousse","ror":"https://ror.org/00dmpgj58","country_code":"TN","type":"education","lineage":["https://openalex.org/I8636806"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Khaoula Ben Abdellafou","raw_affiliation_strings":["UR MARS, Sousse University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UR MARS, Sousse University","institution_ids":["https://openalex.org/I8636806"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085758758","display_name":"Ouajdi Korbaa","orcid":"https://orcid.org/0000-0003-4462-1805"},"institutions":[{"id":"https://openalex.org/I8636806","display_name":"University of Sousse","ror":"https://ror.org/00dmpgj58","country_code":"TN","type":"education","lineage":["https://openalex.org/I8636806"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Ouajdi Korbaa","raw_affiliation_strings":["UR MARS, Sousse University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UR MARS, Sousse University","institution_ids":["https://openalex.org/I8636806"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I8636806"],"apc_list":null,"apc_paid":null,"fwci":0.5169,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65980338,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"000601","last_page":"000606"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/unavailability","display_name":"Unavailability","score":0.9621672034263611},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8688281774520874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6748260855674744},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.638374388217926},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5996591448783875},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5212229490280151},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4550933837890625},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33673542737960815},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32537001371383667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19341176748275757},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.12807726860046387},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08252015709877014}],"concepts":[{"id":"https://openalex.org/C2780505938","wikidata":"https://www.wikidata.org/wiki/Q17093282","display_name":"Unavailability","level":2,"score":0.9621672034263611},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8688281774520874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6748260855674744},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.638374388217926},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5996591448783875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5212229490280151},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4550933837890625},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33673542737960815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32537001371383667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19341176748275757},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.12807726860046387},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08252015709877014},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","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},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc.2016.7844306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2016.7844306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1971872799","https://openalex.org/W2073703487","https://openalex.org/W2346182334"],"related_works":["https://openalex.org/W4237235066","https://openalex.org/W2026539069","https://openalex.org/W2587727662","https://openalex.org/W4206466499","https://openalex.org/W4213379045","https://openalex.org/W3204654320","https://openalex.org/W3190401582","https://openalex.org/W2162001022","https://openalex.org/W4205832532","https://openalex.org/W2074319831"],"abstract_inverted_index":{"This":[0],"paper":[1,79],"considers":[2],"the":[3,12,27,81,87,108,112,115,118,121,126,132,140,143],"two-parallel-machine":[4],"scheduling":[5,28],"problem":[6],"with":[7,96],"precedence":[8,57],"constraints.":[9],"One":[10],"of":[11,114,120,142],"machines":[13],"may":[14],"not":[15],"always":[16],"be":[17],"available":[18],"due":[19],"to":[20,106,130],"machine":[21],"breakdowns":[22],"or":[23],"preventive":[24],"maintenance":[25],"during":[26],"period.":[29],"All":[30],"execution":[31],"and":[32,40,117,136],"communication":[33],"times":[34],"between":[35,111,125],"tasks":[36,53],"are":[37,44,54,145],"considered":[38,49,74],"unitary":[39],"all":[41],"unavailability":[42],"dates":[43],"known":[45],"in":[46,77,123,128],"advance.":[47],"The":[48,73,102],"task":[50,64],"graph":[51],"(since":[52],"related":[55],"by":[56],"constraints)":[58],"is":[59,80,100,105],"an":[60],"intree,":[61],"where":[62],"each":[63],"can":[65],"have":[66],"many":[67],"predecessors":[68],"but":[69],"only":[70],"one":[71],"successor.":[72],"objective":[75],"function":[76],"this":[78],"makespan":[82],"denoted":[83],"Cmax.":[84],"To":[85],"solve":[86],"problem,":[88],"a":[89],"new":[90],"optimal":[91],"algorithm":[92,144],"entitled":[93],"Scheduling":[94],"Intrees":[95],"Unavailability":[97],"constraints":[98],"(SIwUC)":[99],"proposed.":[101],"used":[103],"strategy":[104],"find":[107],"best":[109],"trade-off":[110],"minimization":[113,119],"communications":[116],"difference":[122],"load":[124],"processors":[127],"order":[129],"minimize":[131],"makespan.":[133],"Algorithm":[134],"details":[135],"key":[137],"ideas":[138],"proving":[139],"optimality":[141],"described.":[146]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}