{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T17:33:54Z","timestamp":1772645634686,"version":"3.50.1"},"reference-count":33,"publisher":"Emerald","issue":"12","license":[{"start":{"date-parts":[[2021,1,22]],"date-time":"2021-01-22T00:00:00Z","timestamp":1611273600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["K"],"published-print":{"date-parts":[[2021,11,15]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>Two-stage production systems including a processing shop and an assembly stage are widely used in various manufacturing industries. These two stages are usually studied independently which may not lead to ideal results. This paper aims to deal with a two-stage production system including a job shop and an assembly stage.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>Some exact methods are proposed based on branch and bound (B&amp;B) approach to minimize the total completion time of products. As B&amp;B approaches are usually time-consuming, three efficient lower bounds are developed for the problem and variable neighborhood search is used to provide proper upper bound of the solution in each branch. In addition, to create branches and search new nodes, two strategies are applied including the best-first search and the depth-first search (DFS). Another feature of the proposed algorithms is that the search space is reduced by releasing the precedence constraint. In this case, the problem becomes equivalent to a parallel machine scheduling problem, and the redundant branches that do not consider the precedence constraint are removed. Therefore, the number of nodes and computational time are significantly reduced without eliminating the optimal solution.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>Some numerical examples are used to evaluate the performance of the proposed methods. Comparison result to mathematical model (mixed-integer linear programming) validates the performance accuracy and efficiency of the proposed methods. In addition, computational results indicate the superiority of the DFS strategy with regard to CPU time.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>Studies about the scheduling problems for two-stage production systems including job shop followed by an assembly stage traditionally present approximate method and metaheuristic algorithms to solve the problem. This is the first study that introduces exact methods based on (B&amp;B) approach.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/k-08-2020-0521","type":"journal-article","created":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T05:18:29Z","timestamp":1613193509000},"page":"3222-3245","source":"Crossref","is-referenced-by-count":14,"title":["Mathematical modeling and two efficient branch and bound algorithms for job shop scheduling problem followed by an assembly stage"],"prefix":"10.1108","volume":"50","author":[{"given":"Fatemeh","family":"Daneshamooz","sequence":"first","affiliation":[]},{"given":"Parviz","family":"Fattahi","sequence":"additional","affiliation":[]},{"given":"Seyed Mohammad Hassan","family":"Hosseini","sequence":"additional","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2021,1,22]]},"reference":[{"issue":"3","key":"key2021112310582595600_ref001","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.ejor.2004.07.074","article-title":"A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times","volume":"169","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"key2021112310582595600_ref002","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.cie.2008.11.017","article-title":"An evolutionary algorithm for assembly job shop with part sharing","volume":"57","year":"2009","journal-title":"Computers and Industrial Engineering"},{"key":"key2021112310582595600_ref003","first-page":"68","article-title":"Minimizing production flow time in a process and assembly job shop","volume-title":"Proceedings of the International Seminar on Industrial engineering and Management","year":"2007"},{"key":"key2021112310582595600_ref004","article-title":"A hybrid algorithm based on particle swarm optimization and artificial immune for an assembly job shop scheduling problem","volume":"2016","year":"2016","journal-title":"Mathematical Problems in Engineering"},{"issue":"1","key":"key2021112310582595600_ref005","first-page":"119","article-title":"Solving flexible job shop scheduling problem with an assembly stage and sequence dependent setup time","volume":"34","year":"2019","journal-title":"Industrial Engineering and Management Sharif (SHARIF: ENGINEERING)"},{"key":"key2021112310582595600_ref006","first-page":"92","article-title":"Hybrid algorithms for jobshop scheduling problem with lot streaming and a parallel assembly stage","volume":"10","year":"2017","journal-title":"Journal of Industrial and Systems Engineering"},{"issue":"1","key":"key2021112310582595600_ref007","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.apm.2013.06.005","article-title":"A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations","volume":"38","year":"2014","journal-title":"Applied Mathematical Modelling"},{"key":"key2021112310582595600_ref008","first-page":"13","article-title":"A two-phase variable neighborhood search for solving nonlinear optimal control problems","volume":"5","year":"2015","journal-title":"Iranian Journal of Numerical Analysis and Optimization"},{"key":"key2021112310582595600_ref009","first-page":"63","article-title":"Modelling and solving the job shop scheduling problem followed by an assembly stage considering maintenance operations and access restrictions to machines","volume":"12","year":"2019","journal-title":"Journal of Optimization in Industrial Engineering"},{"issue":"3","key":"key2021112310582595600_ref010","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","article-title":"An automatic method of solving discrete programming problems","volume":"28","year":"1960","journal-title":"Econometrica"},{"issue":"5","key":"key2021112310582595600_ref011","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","article-title":"Minimizing the makespan in the 3-machine assembly-type flow shop scheduling problem","volume":"39","year":"1993","journal-title":"Management Science"},{"issue":"22","key":"key2021112310582595600_ref012","doi-asserted-by":"crossref","first-page":"4731","DOI":"10.1080\/0020754041233127044","article-title":"A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness","volume":"42","year":"2004","journal-title":"International Journal of Production Research"},{"key":"key2021112310582595600_ref013","first-page":"6409321","article-title":"A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness","volume":"2016","year":"2016","journal-title":"Mathematical Problems in Engineering"},{"key":"key2021112310582595600_ref014","first-page":"1","article-title":"An effective algorithm for flexible assembly job shop scheduling with tight job constraints","year":"2020","journal-title":"International Transactions in Operational Research"},{"key":"key2021112310582595600_ref015","first-page":"1","article-title":"Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect","volume":"2018","year":"2018","journal-title":"Discrete Dynamics in Nature and Society"},{"issue":"5","key":"key2021112310582595600_ref016","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1080\/00207543.2018.1489156","article-title":"Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times","volume":"57","year":"2019","journal-title":"International Journal of Production Research"},{"issue":"2","key":"key2021112310582595600_ref017","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/opre.8.2.219","article-title":"On the job shop scheduling problem","volume":"8","year":"1960","journal-title":"Operations Research"},{"issue":"3","key":"key2021112310582595600_ref018","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/S0377-2217(99)00108-3","article-title":"A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints","volume":"123","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"key2021112310582595600_ref019","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.ijpe.2005.08.002","article-title":"An algorithm for minimizing weighted earliness penalty in assembly job shops","volume":"103","year":"2006","journal-title":"International Journal of Production Economics"},{"issue":"9","key":"key2021112310582595600_ref020","doi-asserted-by":"crossref","first-page":"2604","DOI":"10.1080\/00207543.2019.1622052","article-title":"Hybrid algorithm based on improved extended shifting bottleneck procedure and GA for assembly job shop scheduling problem","volume":"58","year":"2020","journal-title":"International Journal of Production Research"},{"issue":"2","key":"key2021112310582595600_ref021","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1016\/j.ijpe.2007.12.007","article-title":"A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times","volume":"113","year":"2008","journal-title":"International Journal of Production Economics"},{"key":"key2021112310582595600_ref022","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.cie.2005.06.005","article-title":"Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flow time of jobs","volume":"49","year":"2005","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"key2021112310582595600_ref023","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0305-0548(01)00098-3","article-title":"A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem","volume":"30","year":"2003","journal-title":"Computers and Operations Research"},{"key":"key2021112310582595600_ref024","first-page":"1","article-title":"Adaptive scheduling for assembly job shop with uncertain assembly times based on dual Q-learning","year":"2020","journal-title":"International Journal of Production Research"},{"issue":"3","key":"key2021112310582595600_ref025","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1016\/j.asoc.2012.04.007","article-title":"A comparison of hybrid genetic algorithm and hybrid particle swarm optimization to minimize makespan for assembly job shop","volume":"13","year":"2013","journal-title":"Applied Soft Computing"},{"key":"key2021112310582595600_ref026","first-page":"357","article-title":"Multiple-lot lot streaming in a two-stage assembly system","year":"2014","journal-title":"Essays in Production, Project Planning and Scheduling"},{"key":"key2021112310582595600_ref027","doi-asserted-by":"crossref","first-page":"2063","DOI":"10.1016\/S0305-0548(03)00165-5","article-title":"Scheduling for two-stage production system with setup and assembly operations","volume":"31","year":"2004","journal-title":"Computers and Operations Research"},{"issue":"3","key":"key2021112310582595600_ref028","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1016\/j.ejor.2006.06.067","article-title":"Flow-shop scheduling with setup and assembly operations","volume":"187","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"key2021112310582595600_ref029","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.ejor.2003.09.016","article-title":"Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times","volume":"161","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"key2021112310582595600_ref030","doi-asserted-by":"crossref","first-page":"132","DOI":"10.4156\/ijact.vol3.issue10.17","article-title":"Simulation-based genetic algorithm for job shop scheduling with assembly operations","volume":"3","year":"2011","journal-title":"International Journal of Advancements in Computing Technology"},{"issue":"2","key":"key2021112310582595600_ref031","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.ejor.2019.11.016","article-title":"Multi-objective optimizations in flexible assembly job shop scheduling using a distributed ant colony system","volume":"283","year":"2020","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"key2021112310582595600_ref032","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1109\/TEM.2017.2785774","article-title":"Flexible assembly job-shop scheduling with sequence-dependent setup times and part sharing in a dynamic environment: constraint programming model, mixed-integer programming model, and dispatching rules","volume":"65","year":"2018","journal-title":"IEEE Transactions on Engineering Management"},{"issue":"5\/8","key":"key2021112310582595600_ref033","first-page":"787","article-title":"A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem","volume":"65","year":"2013","journal-title":"The International Journal of Advanced Manufacturing Technology"}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-08-2020-0521\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-08-2020-0521\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:49:45Z","timestamp":1753393785000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/50\/12\/3222-3245\/451536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,22]]},"references-count":33,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2021,1,22]]},"published-print":{"date-parts":[[2021,11,15]]}},"alternative-id":["10.1108\/K-08-2020-0521"],"URL":"https:\/\/doi.org\/10.1108\/k-08-2020-0521","relation":{},"ISSN":["0368-492X","0368-492X"],"issn-type":[{"value":"0368-492X","type":"print"},{"value":"0368-492X","type":"print"}],"subject":[],"published":{"date-parts":[[2021,1,22]]}}}