{"id":"https://openalex.org/W2508154987","doi":"https://doi.org/10.4018/ijisscm.2016070101","title":"An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints","display_name":"An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2508154987","doi":"https://doi.org/10.4018/ijisscm.2016070101","mag":"2508154987"},"language":"en","primary_location":{"id":"doi:10.4018/ijisscm.2016070101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijisscm.2016070101","pdf_url":null,"source":{"id":"https://openalex.org/S62270215","display_name":"International Journal of Information Systems and Supply Chain Management","issn_l":"1935-5726","issn":["1935-5726","1935-5734"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Information Systems and Supply Chain Management","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/A5032926666","display_name":"Fay\u00e7al Belkaid","orcid":"https://orcid.org/0000-0003-3531-3931"},"institutions":[{"id":"https://openalex.org/I233209018","display_name":"University of Abou Bekr Belka\u00efd","ror":"https://ror.org/00jsjm362","country_code":"DZ","type":"education","lineage":["https://openalex.org/I233209018"]},{"id":"https://openalex.org/I4387155471","display_name":"Laboratoire de G\u00e9nie Informatique, de Production et de Maintenance","ror":"https://ror.org/04xykxd72","country_code":null,"type":"facility","lineage":["https://openalex.org/I4210150706","https://openalex.org/I4387155471","https://openalex.org/I90183372","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["DZ","FR"],"is_corresponding":false,"raw_author_name":"Fay\u00e7al Belkaid","raw_affiliation_strings":["Manufacturing Engineering Laboratory of Tlemcen (MELT), University of Tlemcen, Tlemcen, Algeria & LGIPM, University of Lorraine, Metz, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Manufacturing Engineering Laboratory of Tlemcen (MELT), University of Tlemcen, Tlemcen, Algeria & LGIPM, University of Lorraine, Metz, France","institution_ids":["https://openalex.org/I233209018","https://openalex.org/I4387155471","https://openalex.org/I90183372"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079174269","display_name":"Farouk Yalaoui","orcid":"https://orcid.org/0000-0001-7360-2932"},"institutions":[{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Farouk Yalaoui","raw_affiliation_strings":["ICD -LOSI, University of Technology of Troyes, Troyes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ICD -LOSI, University of Technology of Troyes, Troyes, France","institution_ids":["https://openalex.org/I140494188"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021421696","display_name":"Zaki Sari","orcid":"https://orcid.org/0000-0003-2338-4193"},"institutions":[{"id":"https://openalex.org/I233209018","display_name":"University of Abou Bekr Belka\u00efd","ror":"https://ror.org/00jsjm362","country_code":"DZ","type":"education","lineage":["https://openalex.org/I233209018"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Zaki Sari","raw_affiliation_strings":["Manufacturing Engineering Laboratory of Tlemcen (MELT), University of Tlemcen, Tlemcen, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Manufacturing Engineering Laboratory of Tlemcen (MELT), University of Tlemcen, Tlemcen, Algeria","institution_ids":["https://openalex.org/I233209018"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.515,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84978199,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":"3","first_page":"1","last_page":"25"},"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.9983000159263611,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9962999820709229,"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/computer-science","display_name":"Computer science","score":0.7184761166572571},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6753845810890198},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6435133218765259},{"id":"https://openalex.org/keywords/reentrancy","display_name":"Reentrancy","score":0.59807950258255},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5308272242546082},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5194699168205261},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4151005148887634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1360737383365631},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1184166669845581}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7184761166572571},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6753845810890198},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6435133218765259},{"id":"https://openalex.org/C161406801","wikidata":"https://www.wikidata.org/wiki/Q963635","display_name":"Reentrancy","level":2,"score":0.59807950258255},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5308272242546082},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5194699168205261},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4151005148887634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1360737383365631},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1184166669845581},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.4018/ijisscm.2016070101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijisscm.2016070101","pdf_url":null,"source":{"id":"https://openalex.org/S62270215","display_name":"International Journal of Information Systems and Supply Chain Management","issn_l":"1935-5726","issn":["1935-5726","1935-5734"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Information Systems and Supply Chain Management","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-02490422v1","is_oa":false,"landing_page_url":"https://utt.hal.science/hal-02490422","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Information Systems and Supply Chain Management, 2016, 9 (3), pp.1-25. ⟨10.4018/IJISSCM.2016070101⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:igg:jisscm:v:9:y:2016:i:3:p:1-25","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISSCM.2016070101","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W129851918","https://openalex.org/W1545626978","https://openalex.org/W1558121634","https://openalex.org/W1964342831","https://openalex.org/W1967670019","https://openalex.org/W1968644008","https://openalex.org/W1978931881","https://openalex.org/W2000155750","https://openalex.org/W2002131242","https://openalex.org/W2002526830","https://openalex.org/W2002915309","https://openalex.org/W2004021175","https://openalex.org/W2007943264","https://openalex.org/W2009582381","https://openalex.org/W2011039300","https://openalex.org/W2016740242","https://openalex.org/W2018779732","https://openalex.org/W2021649916","https://openalex.org/W2022424208","https://openalex.org/W2024742034","https://openalex.org/W2033739616","https://openalex.org/W2040009672","https://openalex.org/W2042312329","https://openalex.org/W2048590589","https://openalex.org/W2050562010","https://openalex.org/W2053353459","https://openalex.org/W2056710981","https://openalex.org/W2058879498","https://openalex.org/W2063959439","https://openalex.org/W2066329092","https://openalex.org/W2066917713","https://openalex.org/W2067860534","https://openalex.org/W2068716035","https://openalex.org/W2072845043","https://openalex.org/W2076258869","https://openalex.org/W2078710139","https://openalex.org/W2100529342","https://openalex.org/W2108967685","https://openalex.org/W2138459382","https://openalex.org/W2146543244","https://openalex.org/W2158400788","https://openalex.org/W2161004316","https://openalex.org/W2216600070"],"related_works":["https://openalex.org/W3104715250","https://openalex.org/W2789681586","https://openalex.org/W2517736439","https://openalex.org/W2794361564","https://openalex.org/W2031128795","https://openalex.org/W1620537324","https://openalex.org/W2055851110","https://openalex.org/W2146297781","https://openalex.org/W3204654320","https://openalex.org/W2788695490"],"abstract_inverted_index":{"In":[0],"present":[1],"manufacturing":[2],"environment,":[3],"the":[4,11,16,36,39,117,135,141,197,201,207,221,247,250],"reentrant":[5,72],"scheduling":[6,75],"problem":[7,76,136,146],"is":[8,45,125,147,162,210,224],"one":[9],"of":[10,20,49,56,96,119,193,206,249],"most":[12],"important":[13],"issues":[14],"in":[15,92,137,191],"planning":[17],"and":[18,32,59,85,105,110,113,150,180,200,234],"operation":[19],"production":[21,66],"systems.":[22],"It":[23],"has":[24],"a":[25,46,71,93,122,159,238],"large":[26,154],"scope":[27],"such":[28,195],"as":[29,62,196],"capacity":[30],"distribution":[31],"inventory":[33],"control.":[34],"On":[35,116],"other":[37],"hand,":[38],"markets":[40],"are":[41,111,156,178,189],"very":[42],"competitive;":[43],"it":[44],"critical":[47],"requirement":[48],"operational":[50],"management":[51,55],"to":[52,63,139,164,182,226,245],"have":[53],"effective":[54],"resources":[57,101],"(consumable":[58],"renewable)":[60],"so":[61],"achieve":[64],"optimal":[65,151,229,240],"plan.":[67],"This":[68],"study":[69],"considers":[70],"parallel":[73,98],"machines":[74],"with":[77],"consumable":[78],"resources.":[79],"Each":[80],"job":[81],"consumes":[82],"several":[83],"components":[84],"must":[86],"be":[87,132],"processed":[88],"more":[89],"than":[90],"once":[91],"stage":[94],"composed":[95],"identical":[97],"machines.":[99],"The":[100,186,204,216],"availability,":[102],"jobs":[103],"assignment":[104],"sequencing":[106],"at":[107],"each":[108],"cycle":[109],"considered":[112,251],"optimized":[114],"simultaneously.":[115],"basis":[118],"this":[120,145],"representation,":[121],"MILP":[123,129],"model":[124,130],"developed.":[126],"Thus,":[127],"that":[128,220],"can":[131,235],"used":[133],"for":[134,153,231,242],"order":[138],"find":[140,227,237],"exact":[142],"solution.":[143,167],"Since,":[144],"clearly":[148],"NP-hard,":[149],"solutions":[152],"instances":[155],"highly":[157],"intractable,":[158],"genetic":[160],"algorithm":[161,223],"developed":[163],"obtain":[165],"near-optimal":[166],"Then,":[168],"an":[169,228],"improvement":[170],"phase":[171],"based":[172,212],"on":[173,213],"different":[174],"local":[175],"search":[176],"procedures":[177],"performed":[179],"examined":[181,211],"generate":[183],"better":[184],"solutions.":[185],"system":[187],"performances":[188],"assessed":[190],"terms":[192],"measures":[194],"solution":[198,230,241],"quality":[199],"execution":[202],"time.":[203],"effectiveness":[205],"proposed":[208],"metaheuristic":[209],"comparative":[214],"study.":[215],"simulation":[217],"results":[218],"demonstrate":[219],"presented":[222],"able":[225],"small-sized":[232],"problems":[233,244],"effectively":[236],"near":[239],"large-sized":[243],"minimize":[246],"makespan":[248],"problem.":[252]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}