{"id":"https://openalex.org/W3128925444","doi":"https://doi.org/10.1108/k-08-2020-0521","title":"Mathematical modeling and two efficient branch and bound algorithms for job shop scheduling problem followed by an assembly stage","display_name":"Mathematical modeling and two efficient branch and bound algorithms for job shop scheduling problem followed by an assembly stage","publication_year":2021,"publication_date":"2021-01-22","ids":{"openalex":"https://openalex.org/W3128925444","doi":"https://doi.org/10.1108/k-08-2020-0521","mag":"3128925444"},"language":"en","primary_location":{"id":"doi:10.1108/k-08-2020-0521","is_oa":false,"landing_page_url":"https://doi.org/10.1108/k-08-2020-0521","pdf_url":null,"source":{"id":"https://openalex.org/S168682784","display_name":"Kybernetes","issn_l":"0368-492X","issn":["0368-492X","1758-7883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319811","host_organization_name":"Emerald Publishing Limited","host_organization_lineage":["https://openalex.org/P4310319811"],"host_organization_lineage_names":["Emerald Publishing Limited"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kybernetes","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/A5010482664","display_name":"Fatemeh Daneshamooz","orcid":null},"institutions":[{"id":"https://openalex.org/I167694869","display_name":"Bu-Ali Sina University","ror":"https://ror.org/04ka8rx28","country_code":"IR","type":"education","lineage":["https://openalex.org/I167694869"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Fatemeh Daneshamooz","raw_affiliation_strings":["Department of Industrial Engineering, Bu-Ali Sina University, Hamedan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Bu-Ali Sina University, Hamedan, Iran","institution_ids":["https://openalex.org/I167694869"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022632838","display_name":"Parviz Fattahi","orcid":"https://orcid.org/0000-0003-3039-2220"},"institutions":[{"id":"https://openalex.org/I67080706","display_name":"Alzahra University","ror":"https://ror.org/013cdqc34","country_code":"IR","type":"education","lineage":["https://openalex.org/I67080706"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Parviz Fattahi","raw_affiliation_strings":["Department of Industrial Engineering, Alzahra University, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Alzahra University, Tehran, Iran","institution_ids":["https://openalex.org/I67080706"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030615775","display_name":"Seyed Mohammad Hassan Hosseini","orcid":"https://orcid.org/0000-0002-6164-3179"},"institutions":[{"id":"https://openalex.org/I176861719","display_name":"University of Shahrood","ror":"https://ror.org/00yqvtm78","country_code":"IR","type":"education","lineage":["https://openalex.org/I176861719"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Seyed Mohammad Hassan Hosseini","raw_affiliation_strings":["Department of Industrial Engineering and Management, Shahrood University of Technology, Shahrood, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Shahrood University of Technology, Shahrood, Iran","institution_ids":["https://openalex.org/I176861719"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3605,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.83406919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"50","issue":"12","first_page":"3222","last_page":"3245"},"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.9987999796867371,"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.9976000189781189,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6634153127670288},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6335940361022949},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5887810587882996},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5880299806594849},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5534440279006958},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5495464205741882},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46835675835609436},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4511047601699829},{"id":"https://openalex.org/keywords/flexible-manufacturing-system","display_name":"Flexible manufacturing system","score":0.4258146286010742},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41987162828445435},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.41283226013183594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40383821725845337},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27809596061706543}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6634153127670288},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6335940361022949},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5887810587882996},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5880299806594849},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5534440279006958},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5495464205741882},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46835675835609436},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4511047601699829},{"id":"https://openalex.org/C2777869240","wikidata":"https://www.wikidata.org/wiki/Q1424398","display_name":"Flexible manufacturing system","level":3,"score":0.4258146286010742},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41987162828445435},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.41283226013183594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40383821725845337},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27809596061706543},{"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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1108/k-08-2020-0521","is_oa":false,"landing_page_url":"https://doi.org/10.1108/k-08-2020-0521","pdf_url":null,"source":{"id":"https://openalex.org/S168682784","display_name":"Kybernetes","issn_l":"0368-492X","issn":["0368-492X","1758-7883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319811","host_organization_name":"Emerald Publishing Limited","host_organization_lineage":["https://openalex.org/P4310319811"],"host_organization_lineage_names":["Emerald Publishing Limited"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kybernetes","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W200054702","https://openalex.org/W1745101836","https://openalex.org/W1964701734","https://openalex.org/W1981456243","https://openalex.org/W1991044249","https://openalex.org/W1991758057","https://openalex.org/W2016563850","https://openalex.org/W2028653550","https://openalex.org/W2037808394","https://openalex.org/W2042261753","https://openalex.org/W2042478858","https://openalex.org/W2043301754","https://openalex.org/W2047278767","https://openalex.org/W2059573430","https://openalex.org/W2077019623","https://openalex.org/W2081580328","https://openalex.org/W2127894277","https://openalex.org/W2166928920","https://openalex.org/W2170006013","https://openalex.org/W2314569335","https://openalex.org/W2334219176","https://openalex.org/W2485457262","https://openalex.org/W2516402824","https://openalex.org/W2607709232","https://openalex.org/W2791416164","https://openalex.org/W2804878893","https://openalex.org/W2809689752","https://openalex.org/W2886902684","https://openalex.org/W2888354397","https://openalex.org/W2947041009","https://openalex.org/W2989902167","https://openalex.org/W2996941601","https://openalex.org/W3045574728","https://openalex.org/W4240374930"],"related_works":["https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W2140584489"],"abstract_inverted_index":{"Purpose":[0],"Two-stage":[1],"production":[2,41,242],"systems":[3,243],"including":[4,43,117,244],"a":[5,39,44,152],"processing":[6],"shop":[7,46,246],"and":[8,47,60,87,109,121,157,175,212,256],"an":[9,48,249],"assembly":[10,49,250],"stage":[11,251],"are":[12,22,55,75,82,115,168,178,190],"widely":[13],"used":[14,92,191],"in":[15,101],"various":[16],"manufacturing":[17],"industries.":[18],"These":[19],"two":[20,113],"stages":[21],"usually":[23,76],"studied":[24],"independently":[25],"which":[26],"may":[27],"not":[28,163],"lead":[29],"to":[30,36,64,93,106,151,192,202,231,259],"ideal":[31],"results.":[32],"This":[33,263],"paper":[34],"aims":[35],"deal":[37],"with":[38,229],"two-stage":[40,241],"system":[42],"job":[45,245],"stage.":[50],"Design/methodology/approach":[51],"Some":[52,187],"exact":[53,270],"methods":[54,271],"proposed":[56,130,198,216],"based":[57,272],"on":[58,273],"branch":[59],"bound":[61,97],"(B&B)":[62,274],"approach":[63],"minimize":[65],"the":[66,85,99,118,122,129,134,141,147,158,165,171,183,194,197,209,215,223,226,237,261,265],"total":[67],"completion":[68],"time":[69,177],"of":[70,98,128,173,196,214,225],"products.":[71],"As":[72],"B&B":[73],"approaches":[74],"time-consuming,":[77],"three":[78],"efficient":[79],"lower":[80],"bounds":[81],"developed":[83],"for":[84,240],"problem":[86,148],"variable":[88],"neighborhood":[89],"search":[90,110,120,124,135],"is":[91,132,137,264],"provide":[94],"proper":[95],"upper":[96],"solution":[100],"each":[102],"branch.":[103],"In":[104,144,218],"addition,":[105,219],"create":[107],"branches":[108,160],"new":[111],"nodes,":[112],"strategies":[114],"applied":[116],"best-first":[119],"depth-first":[123],"(DFS).":[125],"Another":[126],"feature":[127],"algorithms":[131,258],"that":[133,161,268],"space":[136],"reduced":[138,180],"by":[139,248],"releasing":[140],"precedence":[142,166],"constraint.":[143],"this":[145],"case,":[146],"becomes":[149],"equivalent":[150],"parallel":[153],"machine":[154],"scheduling":[155,238],"problem,":[156],"redundant":[159],"do":[162],"consider":[164],"constraint":[167],"removed.":[169],"Therefore,":[170],"number":[172],"nodes":[174],"computational":[176,220],"significantly":[179],"without":[181],"eliminating":[182],"optimal":[184],"solution.":[185],"Findings":[186],"numerical":[188],"examples":[189],"evaluate":[193],"performance":[195,210],"methods.":[199,217],"Comparison":[200],"result":[201],"mathematical":[203],"model":[204],"(mixed-integer":[205],"linear":[206],"programming)":[207],"validates":[208],"accuracy":[211],"efficiency":[213],"results":[221],"indicate":[222],"superiority":[224],"DFS":[227],"strategy":[228],"regard":[230],"CPU":[232],"time.":[233],"Originality/value":[234],"Studies":[235],"about":[236],"problems":[239],"followed":[247],"traditionally":[252],"present":[253],"approximate":[254],"method":[255],"metaheuristic":[257],"solve":[260],"problem.":[262],"first":[266],"study":[267],"introduces":[269],"approach.":[275]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}