{"id":"https://openalex.org/W2083615347","doi":"https://doi.org/10.1051/ro/2015013","title":"Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods","display_name":"Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods","publication_year":2015,"publication_date":"2015-04-29","ids":{"openalex":"https://openalex.org/W2083615347","doi":"https://doi.org/10.1051/ro/2015013","mag":"2083615347"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2015013","is_oa":false,"landing_page_url":"http://doi.org/10.1051/ro/2015013","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro/2015013.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112532079","display_name":"Rachid Zitouni","orcid":null},"institutions":[{"id":"https://openalex.org/I40193446","display_name":"University Ferhat Abbas of Setif","ror":"https://ror.org/02rzqza52","country_code":"DZ","type":"education","lineage":["https://openalex.org/I40193446"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Rachid zitouni","raw_affiliation_strings":["Department of Mathematics, Ferhat Abbas University of Setif 1, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Ferhat Abbas University of Setif 1, Algeria","institution_ids":["https://openalex.org/I40193446"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025274127","display_name":"Omar Selt","orcid":null},"institutions":[{"id":"https://openalex.org/I4210145508","display_name":"University Mohamed Boudiaf of M'sila","ror":"https://ror.org/055rz8d64","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210145508"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Omar selt","raw_affiliation_strings":["Department of Mathematics, University of M\u2019sila, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of M\u2019sila, Algeria","institution_ids":["https://openalex.org/I4210145508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":0,"currency":"EUR","value_usd":0},"apc_paid":null,"fwci":0.5124,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72748582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"50","issue":"1","first_page":"83","last_page":"90"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9987000226974487,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/unavailability","display_name":"Unavailability","score":0.9738138318061829},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7402722835540771},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.718564510345459},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5845562815666199},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46099498867988586},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40255609154701233},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3960287272930145},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35645782947540283},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19466006755828857},{"id":"https://openalex.org/keywords/reliability-engineering","display_name":"Reliability engineering","score":0.18572455644607544},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.153725266456604},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10875928401947021},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10146763920783997}],"concepts":[{"id":"https://openalex.org/C2780505938","wikidata":"https://www.wikidata.org/wiki/Q17093282","display_name":"Unavailability","level":2,"score":0.9738138318061829},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7402722835540771},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.718564510345459},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5845562815666199},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46099498867988586},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40255609154701233},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3960287272930145},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35645782947540283},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19466006755828857},{"id":"https://openalex.org/C200601418","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability engineering","level":1,"score":0.18572455644607544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.153725266456604},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10875928401947021},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10146763920783997},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro/2015013","is_oa":false,"landing_page_url":"http://doi.org/10.1051/ro/2015013","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2016__50_1_83_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2015013/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2015013.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2016__50_1_83_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2015013/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2015013.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.44999998807907104,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2083615347.pdf","grobid_xml":"https://content.openalex.org/works/W2083615347.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W201412769","https://openalex.org/W1966208092","https://openalex.org/W1983471329","https://openalex.org/W1994429799","https://openalex.org/W1994566591","https://openalex.org/W1995313677","https://openalex.org/W2005470065","https://openalex.org/W2007919031","https://openalex.org/W2026190248","https://openalex.org/W2063400071","https://openalex.org/W2067831246","https://openalex.org/W2071126781","https://openalex.org/W2073922730","https://openalex.org/W2086172248","https://openalex.org/W2093936460","https://openalex.org/W2109759743","https://openalex.org/W2121732487"],"related_works":["https://openalex.org/W4237235066","https://openalex.org/W207884067","https://openalex.org/W3127016596","https://openalex.org/W2026539069","https://openalex.org/W2365973415","https://openalex.org/W1482423459","https://openalex.org/W3146085540","https://openalex.org/W2996457675","https://openalex.org/W2587727662","https://openalex.org/W3204654320"],"abstract_inverted_index":{"In":[0],"this":[1,34,59,130,146],"paper,":[2],"we":[3,36,61],"introduce":[4],"an":[5,28],"approach":[6],"for":[7],"scheduling":[8],"problems":[9],"of":[10,45,58,73,77,136,140],"n":[11],"tasks":[12,114],"on":[13,64,82,101],"m":[14],"identical":[15,103],"parallel":[16,104],"machines":[17,105],"with":[18,50,70,106],"unavailability":[19],"periods.This":[20],"problem":[21,131,147],"is":[22,132],"strongly":[23],"NP-complete":[24],"which":[25,42],"makes":[26],"finding":[27],"optimal":[29],"solution":[30,79],"looks":[31],"impossible":[32],"task.In":[33],"frame,":[35],"suggest":[37],"a":[38],"novel":[39],"heuristic":[40],"in":[41,129,145],"availability":[43,108],"periods":[44],"each":[46],"machine":[47,120],"are":[48,148],"filled":[49],"the":[51,56,71,78,83,133,137],"highest":[52],"weighted":[53,134],"tasks.To":[54],"improve":[55],"performance":[57,125],"heuristic,":[60],"have":[62],"used,":[63],"one":[65,119],"hand,":[66,85],"different":[67,107,123],"diversification":[68],"strategies":[69],"aim":[72],"exploring":[74],"unvisited":[75],"regions":[76],"space,":[80],"and":[81,92,150],"other":[84],"two":[86],"well-known":[87],"neighborhoods":[88],"(neighborhood":[89],"by":[90,94],"swapping":[91],"neighborhood":[93],"insertion).The":[95],"computational":[96],"experiment":[97],"was":[98],"carried":[99],"out":[100],"three":[102],"periods.It":[109],"must":[110],"be":[111,117],"mentioned":[112],"that":[113,142],"movement":[115],"can":[116],"within":[118],"or":[121],"between":[122],"machines.The":[124],"criterion":[126],"to":[127],"optimize":[128],"sum":[135],"end":[138],"dates":[139],"tasks.Note":[141],"all":[143],"data":[144],"integer":[149],"deterministic.":[151]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2025-10-10T00:00:00"}