{"id":"https://openalex.org/W2338430224","doi":"https://doi.org/10.1080/03155986.2016.1166795","title":"Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints","display_name":"Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints","publication_year":2016,"publication_date":"2016-03-31","ids":{"openalex":"https://openalex.org/W2338430224","doi":"https://doi.org/10.1080/03155986.2016.1166795","mag":"2338430224"},"language":"en","primary_location":{"id":"doi:10.1080/03155986.2016.1166795","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03155986.2016.1166795","pdf_url":null,"source":{"id":"https://openalex.org/S155959304","display_name":"INFOR Information Systems and Operational Research","issn_l":"0315-5986","issn":["0315-5986","1916-0615"],"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":"INFOR: Information Systems and Operational 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/A5083726840","display_name":"Clifford Beaton","orcid":null},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"education","lineage":["https://openalex.org/I129902397"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Clifford Beaton","raw_affiliation_strings":["Department of Industrial Engineering, Dalhousie University, Halifax, Nova Scotia, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Dalhousie University, Halifax, Nova Scotia, Canada","institution_ids":["https://openalex.org/I129902397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015913962","display_name":"Claver Diallo","orcid":"https://orcid.org/0000-0002-7381-2187"},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"education","lineage":["https://openalex.org/I129902397"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Claver Diallo","raw_affiliation_strings":["Department of Industrial Engineering, Dalhousie University, Halifax, Nova Scotia, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Dalhousie University, Halifax, Nova Scotia, Canada","institution_ids":["https://openalex.org/I129902397"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084837843","display_name":"Eldon A. Gunn","orcid":null},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"education","lineage":["https://openalex.org/I129902397"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Eldon Gunn","raw_affiliation_strings":["Department of Industrial Engineering, Dalhousie University, Halifax, Nova Scotia, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Dalhousie University, Halifax, Nova Scotia, Canada","institution_ids":["https://openalex.org/I129902397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015913962"],"corresponding_institution_ids":["https://openalex.org/I129902397"],"apc_list":null,"apc_paid":null,"fwci":0.4101,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.67550399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"54","issue":"4","first_page":"305","last_page":"316"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9977999925613403,"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.991599977016449,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8653979301452637},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7502864599227905},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.667949378490448},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6550240516662598},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6307437419891357},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6265361905097961},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5997461080551147},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5282463431358337},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43361276388168335},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4165205955505371},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22822904586791992},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21968191862106323},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10138791799545288}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8653979301452637},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7502864599227905},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.667949378490448},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6550240516662598},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6307437419891357},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6265361905097961},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5997461080551147},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5282463431358337},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43361276388168335},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4165205955505371},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22822904586791992},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21968191862106323},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10138791799545288},{"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.1080/03155986.2016.1166795","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03155986.2016.1166795","pdf_url":null,"source":{"id":"https://openalex.org/S155959304","display_name":"INFOR Information Systems and Operational Research","issn_l":"0315-5986","issn":["0315-5986","1916-0615"],"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":"INFOR: Information Systems and Operational Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1994566591","https://openalex.org/W2005299742","https://openalex.org/W2036301822","https://openalex.org/W2043070684","https://openalex.org/W2048135710","https://openalex.org/W2063400071","https://openalex.org/W2067937546","https://openalex.org/W2068647239","https://openalex.org/W2104680817","https://openalex.org/W4244592547"],"related_works":["https://openalex.org/W4206466499","https://openalex.org/W4213379045","https://openalex.org/W3190401582","https://openalex.org/W2789293570","https://openalex.org/W4205832532","https://openalex.org/W1974309933","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2074319831"],"abstract_inverted_index":{"The":[0,24,67],"problem":[1,28,49,68,100],"of":[2,26,36,47,121],"makespan":[3],"minimization":[4],"for":[5,13,82,115],"parallel":[6],"machine":[7,54],"scheduling":[8],"with":[9,39,55,62,85],"multiple":[10,56,86],"non-availability":[11,57,65],"periods":[12,58],"non-resumable,":[14],"semi-resumable":[15],"and":[16,77,118],"resumable":[17],"jobs":[18],"is":[19,29,69,125],"considered":[20],"in":[21,32],"this":[22,27],"paper.":[23],"discussion":[25],"very":[30],"limited":[31],"the":[33,37,48,99,108,119,122],"current":[34],"state":[35],"literature,":[38],"most":[40],"cases":[41],"only":[42,63],"considering":[43],"a":[44,52,72],"small":[45,83],"subset":[46],"such":[50],"as":[51,71],"single":[53],"or":[59],"several":[60,116],"machines":[61],"one":[64],"period.":[66],"formulated":[70],"mixed-integer":[73],"linear":[74],"programming":[75],"model":[76],"solved":[78],"optimally":[79],"using":[80],"CPLEX":[81],"problems":[84],"availability":[87],"constraints":[88],"on":[89],"all":[90],"machines.":[91],"Several":[92],"heuristic":[93,123],"approaches":[94],"are":[95,113],"then":[96],"applied":[97],"to":[98,101],"provide":[102],"near-optimal":[103],"solutions":[104],"while":[105],"significantly":[106],"reducing":[107],"computation":[109],"time.":[110],"Numerical":[111],"results":[112],"obtained":[114],"experiments":[117],"performance":[120],"methods":[124],"analysed.":[126]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}