{"id":"https://openalex.org/W2803371904","doi":"https://doi.org/10.1080/00207543.2018.1471242","title":"Scheduling on uniform parallel machines with periodic unavailability constraints","display_name":"Scheduling on uniform parallel machines with periodic unavailability constraints","publication_year":2018,"publication_date":"2018-05-25","ids":{"openalex":"https://openalex.org/W2803371904","doi":"https://doi.org/10.1080/00207543.2018.1471242","mag":"2803371904"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2018.1471242","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2018.1471242","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-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/A5031601362","display_name":"Jihene Kaabi","orcid":"https://orcid.org/0000-0002-9677-9607"},"institutions":[{"id":"https://openalex.org/I106663880","display_name":"University of Bahrain","ror":"https://ror.org/0317ekv86","country_code":"BH","type":"education","lineage":["https://openalex.org/I106663880"]},{"id":"https://openalex.org/I8541234","display_name":"University College of Bahrain","ror":"https://ror.org/00m2z1b30","country_code":"BH","type":"education","lineage":["https://openalex.org/I8541234"]}],"countries":["BH"],"is_corresponding":true,"raw_author_name":"Jihene Kaabi","raw_affiliation_strings":["Department of Information Systems, College of Information Technology, University of Bahrain , Zallaq, Kingdom of Bahrain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Systems, College of Information Technology, University of Bahrain , Zallaq, Kingdom of Bahrain","institution_ids":["https://openalex.org/I106663880","https://openalex.org/I8541234"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038742903","display_name":"Youssef Harrath","orcid":"https://orcid.org/0000-0001-6784-6199"},"institutions":[{"id":"https://openalex.org/I106663880","display_name":"University of Bahrain","ror":"https://ror.org/0317ekv86","country_code":"BH","type":"education","lineage":["https://openalex.org/I106663880"]},{"id":"https://openalex.org/I8541234","display_name":"University College of Bahrain","ror":"https://ror.org/00m2z1b30","country_code":"BH","type":"education","lineage":["https://openalex.org/I8541234"]}],"countries":["BH"],"is_corresponding":false,"raw_author_name":"Youssef Harrath","raw_affiliation_strings":["Department of Computer Science, College of Information Technology, University of Bahrain , Zallaq, Kingdom of Bahrain"],"raw_orcid":"https://orcid.org/0000-0001-6784-6199","affiliations":[{"raw_affiliation_string":"Department of Computer Science, College of Information Technology, University of Bahrain , Zallaq, Kingdom of Bahrain","institution_ids":["https://openalex.org/I106663880","https://openalex.org/I8541234"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031601362"],"corresponding_institution_ids":["https://openalex.org/I106663880","https://openalex.org/I8541234"],"apc_list":null,"apc_paid":null,"fwci":2.1456,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.89027996,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"57","issue":"1","first_page":"216","last_page":"227"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9886000156402588,"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"}},{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9882000088691711,"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.9713204503059387},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7441408634185791},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6771674156188965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6676396131515503},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6103026270866394},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4739501476287842},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44146114587783813},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41284337639808655},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34693771600723267},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2372877597808838},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2245180606842041},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.11656421422958374}],"concepts":[{"id":"https://openalex.org/C2780505938","wikidata":"https://www.wikidata.org/wiki/Q17093282","display_name":"Unavailability","level":2,"score":0.9713204503059387},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7441408634185791},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6771674156188965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6676396131515503},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6103026270866394},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4739501476287842},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44146114587783813},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41284337639808655},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34693771600723267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2372877597808838},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2245180606842041},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.11656421422958374},{"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":2,"locations":[{"id":"doi:10.1080/00207543.2018.1471242","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2018.1471242","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:57:y:2019:i:1:p:216-227","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2018.1471242","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G3887900913","display_name":null,"funder_award_id":"Research grant no. 2015/22","funder_id":"https://openalex.org/F4320321167","funder_display_name":"University of Bahrain"}],"funders":[{"id":"https://openalex.org/F4320321167","display_name":"University of Bahrain","ror":"https://ror.org/0317ekv86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1971411704","https://openalex.org/W1994970597","https://openalex.org/W2031847401","https://openalex.org/W2043070684","https://openalex.org/W2043605162","https://openalex.org/W2046874576","https://openalex.org/W2077711297","https://openalex.org/W2092449143","https://openalex.org/W2094570939","https://openalex.org/W2122967269","https://openalex.org/W2263946527","https://openalex.org/W4255654664"],"related_works":["https://openalex.org/W4237235066","https://openalex.org/W2026539069","https://openalex.org/W207884067","https://openalex.org/W3127016596","https://openalex.org/W2365973415","https://openalex.org/W3146085540","https://openalex.org/W2587727662","https://openalex.org/W1581805909","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"Scheduling":[0],"problems":[1,136],"under":[2,49],"unavailability":[3,59],"constraints":[4],"has":[5],"become":[6],"a":[7,108,128,145],"popular":[8],"research":[9],"topic":[10],"in":[11,20],"the":[12,21,24,31,43,64,67,75,83,88,111,114,122,155,171,178],"last":[13],"few":[14],"years.":[15],"Despite":[16],"it\u2019s":[17],"important":[18],"application":[19],"real":[22],"world,":[23],"uniform":[25,44],"parallel":[26,45],"machine":[27,46,54],"scheduling":[28,47],"problem":[29,48,65,123,156,181],"was":[30,147],"least":[32],"studied":[33],"due":[34],"to":[35,57,106,110,149,154],"its":[36],"complexity.":[37],"In":[38],"this":[39,132],"paper,":[40],"we":[41,98,119],"investigated":[42],"deterministic":[50],"availability":[51],"constraints.":[52],"Each":[53],"is":[55,124,174],"subject":[56],"one":[58],"period.":[60],"Different":[61],"versions":[62],"of":[63,69,90,116,141,162,180],"regarding":[66],"type":[68],"jobs":[70,92,142,163],"(identical":[71],"and":[72,74,82,93,103,126,143,164],"non-identical)":[73],"performance":[76,96,173],"measures":[77],"(the":[78],"total":[79],"completion":[80],"times":[81],"makespan)":[84],"were":[85],"studied.":[86],"For":[87,113],"case":[89,115],"identical":[91],"for":[94],"both":[95],"measures,":[97],"developed":[99,148],"linear":[100],"programming":[101],"models":[102],"optimal":[104,152],"algorithms":[105],"provide":[107],"solution":[109],"problem.":[112],"non-identical":[117],"jobs,":[118],"proved":[120],"that":[121,170],"NP-hard":[125],"propose":[127],"quadratic":[129],"program.":[130],"Because,":[131],"later":[133],"cannot":[134],"solve":[135],"with":[137,158],"very":[138,159,175],"large":[139,160],"number":[140,161],"machines,":[144],"heuristic":[146],"find":[150],"near":[151],"solutions":[153],"especially":[157],"machines.":[165],"The":[166],"computational":[167],"results":[168],"showed":[169],"heuristic\u2019s":[172],"high":[176],"regardless":[177],"dimensions":[179],"instances.":[182]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}