{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:59:16Z","timestamp":1772276356999,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T00:00:00Z","timestamp":1547856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00521-019-04027-w","type":"journal-article","created":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T10:30:06Z","timestamp":1547893806000},"page":"2989-3003","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Semi-permutation-based genetic algorithm for order acceptance and scheduling in two-stage assembly problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Mohammad","family":"Yavari","sequence":"first","affiliation":[]},{"given":"Mozhgan","family":"Marvi","sequence":"additional","affiliation":[]},{"given":"Amir Hosein","family":"Akbari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,19]]},"reference":[{"issue":"17","key":"4027_CR1","doi-asserted-by":"crossref","first-page":"7796","DOI":"10.1016\/j.apm.2016.03.037","volume":"40","author":"A Allahverdi","year":"2016","unstructured":"Allahverdi A, Aydilek H, Aydilek A (2016) Two-stage assembly scheduling problem for minimizing total tardiness with setup times. Appl Math Model 40(17):7796\u20137815","journal-title":"Appl Math Model"},{"issue":"5","key":"4027_CR2","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","volume":"39","author":"CY Lee","year":"1993","unstructured":"Lee CY, Cheng TC, Lin BM (1993) Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Manag Sci 39(5):616\u2013625","journal-title":"Manag Sci"},{"issue":"2","key":"4027_CR3","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.43.2.346","volume":"43","author":"CN Potts","year":"1995","unstructured":"Potts CN, Sevast\u2019Janov SV, Strusevich VA, Van Wassenhove LN, Zwaneveld CM (1995) The two-stage assembly scheduling problem: complexity and approximation. Oper Res 43(2):346\u2013355","journal-title":"Oper Res"},{"issue":"2","key":"4027_CR4","first-page":"109","volume":"3","author":"FS Al-Anzi","year":"2006","unstructured":"Al-Anzi FS, Allahverdi A (2006) A hybrid tabu search heuristic for the two-stage assembly scheduling problem. Int J Oper Res 3(2):109\u2013119","journal-title":"Int J Oper Res"},{"issue":"7","key":"4027_CR5","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/S0305-0548(00)00004-6","volume":"28","author":"C Koulamas","year":"2001","unstructured":"Koulamas C, Kyparisis GJ (2001) The three-stage assembly flowshop scheduling problem. Comput Oper Res 28(7):689\u2013704","journal-title":"Comput Oper Res"},{"issue":"12","key":"4027_CR6","doi-asserted-by":"crossref","first-page":"3625","DOI":"10.1080\/00207543.2012.756151","volume":"51","author":"A Mozdgir","year":"2013","unstructured":"Mozdgir A, Fatemi Ghomi SM, Jolai F, Navaei J (2013) Two-stage assembly flow-shop scheduling problem with non-identical assembly machines considering setup times. Int J Prod Res 51(12):3625\u20133642","journal-title":"Int J Prod Res"},{"issue":"2","key":"4027_CR7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0305-0548(95)00015-E","volume":"23","author":"SA Slotnick","year":"1996","unstructured":"Slotnick SA, Morton TE (1996) Selecting jobs for a heavily loaded shop with lateness penalties. Comput Oper Res 23(2):131\u2013140","journal-title":"Comput Oper Res"},{"issue":"2","key":"4027_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0305-0548(96)00045-7","volume":"24","author":"JB Ghosh","year":"1997","unstructured":"Ghosh JB (1997) Job selection in a heavily loaded shop. Comput Oper Res 24(2):141\u2013145","journal-title":"Comput Oper Res"},{"issue":"10","key":"4027_CR9","doi-asserted-by":"crossref","first-page":"3029","DOI":"10.1016\/j.cor.2005.11.012","volume":"34","author":"SA Slotnick","year":"2007","unstructured":"Slotnick SA, Morton TE (2007) Order acceptance with weighted tardiness. Comput Oper Res 34(10):3029\u20133042","journal-title":"Comput Oper Res"},{"issue":"6","key":"4027_CR10","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1016\/j.cor.2008.04.010","volume":"36","author":"WO Rom","year":"2009","unstructured":"Rom WO, Slotnick SA (2009) Order acceptance using genetic algorithms. Comput Oper Res 36(6):1758\u20131767","journal-title":"Comput Oper Res"},{"issue":"3","key":"4027_CR11","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0377-2217(96)00312-8","volume":"103","author":"AM Hariri","year":"1997","unstructured":"Hariri AM, Potts CN (1997) A branch and bound algorithm for the two-stage assembly scheduling problem. Eur J Oper Res 103(3):547\u2013556","journal-title":"Eur J Oper Res"},{"issue":"1\u20134","key":"4027_CR12","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s00170-012-4343-5","volume":"66","author":"Y Tian","year":"2013","unstructured":"Tian Y, Liu D, Yuan D, Wang K (2013) A discrete PSO for two-stage assembly scheduling problem. Int J Adv Manuf Technol 66(1\u20134):481\u2013499","journal-title":"Int J Adv Manuf Technol"},{"issue":"104","key":"4027_CR13","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.cie.2016.12.030","volume":"1","author":"S Jung","year":"2017","unstructured":"Jung S, Woo YB, Kim BS (2017) Two-stage assembly scheduling problem for processing products with dynamic component-sizes and a setup time. Comput Ind Eng 1(104):98\u2013113","journal-title":"Comput Ind Eng"},{"issue":"2","key":"4027_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0305-0548(01)00098-3","volume":"30","author":"A Tozkapan","year":"2003","unstructured":"Tozkapan A, K\u0131rca \u00d6, Chung CS (2003) A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Comput Oper Res 30(2):309\u2013320","journal-title":"Comput Oper Res"},{"issue":"10","key":"4027_CR15","doi-asserted-by":"crossref","first-page":"2740","DOI":"10.1016\/j.cor.2008.12.001","volume":"36","author":"A Allahverdi","year":"2009","unstructured":"Allahverdi A, Al-Anzi FS (2009) The two-stage assembly scheduling problem to minimize total completion time with setup times. Comput Oper Res 36(10):2740\u20132747","journal-title":"Comput Oper Res"},{"issue":"46","key":"4027_CR16","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.jmsy.2017.12.002","volume":"31","author":"M Yavari","year":"2018","unstructured":"Yavari M, Isvandi S (2018) Integrated decision making for parts ordering and scheduling of jobs on two-stage assembly problem in three level supply chain. J Manuf Syst 31(46):137\u2013151","journal-title":"J Manuf Syst"},{"issue":"10","key":"4027_CR17","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1016\/j.advengsoft.2010.06.004","volume":"41","author":"E Torabzadeh","year":"2010","unstructured":"Torabzadeh E, Zandieh M (2010) Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop. Adv Eng Softw 41(10):1238\u20131243","journal-title":"Adv Eng Softw"},{"issue":"1","key":"4027_CR18","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.cie.2012.02.006","volume":"63","author":"D Terekhov","year":"2012","unstructured":"Terekhov D, Do\u011fru MK, \u00d6zen U, Beck JC (2012) Solving two-machine assembly scheduling problems with inventory constraints. Comput Ind Eng 63(1):120\u2013134","journal-title":"Comput Ind Eng"},{"key":"4027_CR19","first-page":"2016","volume":"18","author":"JY Lee","year":"2016","unstructured":"Lee JY, Bang JY (2016) A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness. Math Probl Eng 18:2016","journal-title":"Math Probl Eng"},{"issue":"9\u201312","key":"4027_CR20","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1007\/s00170-010-2579-5","volume":"50","author":"S Hatami","year":"2010","unstructured":"Hatami S, Ebrahimnejad S, Tavakkoli-Moghaddam R, Maboudian Y (2010) Two meta-heuristics for three-stage assembly flowshop scheduling with sequence-dependent setup times. Int J Adv Manuf Technol 50(9\u201312):1153\u20131164","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"4027_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/2251-712X-8-26","volume":"8","author":"A Maleki-Darounkolaei","year":"2012","unstructured":"Maleki-Darounkolaei A, Modiri M, Tavakkoli-Moghaddam R, Seyyedi I (2012) A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times. J Ind Eng Int 8(1):1\u20137","journal-title":"J Ind Eng Int"},{"issue":"1","key":"4027_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick SA (2011) Order acceptance and scheduling: a taxonomy and review. Eur J Oper Res 212(1):1\u201311","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4027_CR23","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.cor.2010.06.003","volume":"38","author":"FT Nobibon","year":"2011","unstructured":"Nobibon FT, Leus R (2011) Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment. Comput Oper Res 38(1):367\u2013378","journal-title":"Comput Oper Res"},{"issue":"6","key":"4027_CR24","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1016\/j.cor.2010.09.018","volume":"39","author":"B Cesaret","year":"2012","unstructured":"Cesaret B, O\u011fuz C, Salman FS (2012) A tabu search algorithm for order acceptance and scheduling. Comput Oper Res 39(6):1197\u20131205","journal-title":"Comput Oper Res"},{"key":"4027_CR25","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/367152","author":"C Chen","year":"2014","unstructured":"Chen C, Yang Z, Tan Y, He R (2014) Diversity controlling genetic algorithm for order acceptance and scheduling problem. Math Probl Eng. \nhttps:\/\/doi.org\/10.1155\/2014\/367152","journal-title":"Math Probl Eng"},{"issue":"4","key":"4027_CR26","first-page":"312","volume":"34","author":"M Zandieh","year":"2017","unstructured":"Zandieh M, Roumani M (2017) A biogeography-based optimization algorithm for order acceptance and scheduling. J Ind Prod Eng 34(4):312\u2013321","journal-title":"J Ind Prod Eng"},{"issue":"52","key":"4027_CR27","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1016\/j.asoc.2016.09.051","volume":"1","author":"SN Chaurasia","year":"2017","unstructured":"Chaurasia SN, Singh A (2017) Hybrid evolutionary approaches for the single machine order acceptance and scheduling problem. Appl Soft Comput 1(52):725\u2013747","journal-title":"Appl Soft Comput"},{"issue":"90","key":"4027_CR28","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.cor.2017.09.006","volume":"1","author":"YL Silva","year":"2018","unstructured":"Silva YL, Subramanian A, Pessoa AA (2018) Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times. Comput Oper Res 1(90):142\u2013160","journal-title":"Comput Oper Res"},{"issue":"1","key":"4027_CR29","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1057\/s41274-016-0007-4","volume":"68","author":"S Geramipour","year":"2017","unstructured":"Geramipour S, Moslehi G, Reisi-Nafchi M (2017) Maximizing the profit in customer\u2019s order acceptance and scheduling problem with weighted tardiness penalty. J Oper Res Soc 68(1):89\u2013101","journal-title":"J Oper Res Soc"},{"issue":"11","key":"4027_CR30","doi-asserted-by":"crossref","first-page":"3413","DOI":"10.1007\/s00521-016-2249-0","volume":"28","author":"A Memari","year":"2017","unstructured":"Memari A, Rahim AR, Hassan A, Ahmad R (2017) A tuned NSGA-II to optimize the total cost and service level for a just-in-time distribution network. Neural Comput Appl 28(11):3413\u20133427","journal-title":"Neural Comput Appl"},{"issue":"97","key":"4027_CR31","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.cie.2016.04.015","volume":"1","author":"A Memari","year":"2016","unstructured":"Memari A, Rahim AR, Absi N, Ahmad R, Hassan A (2016) Carbon-capped distribution planning: a JIT perspective. Comput Ind Eng 1(97):111\u2013127","journal-title":"Comput Ind Eng"},{"issue":"6","key":"4027_CR32","first-page":"1","volume":"4","author":"A Memari","year":"2017","unstructured":"Memari A, Ahmad R, Rahim AR (2017) Metaheuristic algorithms: guidelines for implementation. J Soft Comput Decis Support Syst 4(6):1\u20136","journal-title":"J Soft Comput Decis Support Syst"},{"key":"4027_CR33","doi-asserted-by":"crossref","unstructured":"Gen M, Cheng R, Wang D (1997) Genetic algorithms for solving shortest path problems. In: Evolutionary computation, IEEE international conference on. IEEE, pp 401\u2013406","DOI":"10.1109\/ICEC.1997.592343"},{"issue":"3","key":"4027_CR34","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du J, Leung JY (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15(3):483\u2013495","journal-title":"Math Oper Res"},{"issue":"1","key":"4027_CR35","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1504\/EJIE.2018.089879","volume":"12","author":"SH Zegordi","year":"2018","unstructured":"Zegordi SH, Yavari M (2018) A branch and bound algorithm for solving large-scale single-machine scheduling problems with non-identical release dates. Eur J Ind Eng 12(1):24\u201342","journal-title":"Eur J Ind Eng"},{"issue":"2","key":"4027_CR36","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/j.ejor.2017.11.070","volume":"269","author":"A Allahverdi","year":"2018","unstructured":"Allahverdi A, Aydilek H, Aydilek A (2018) No-wait flowshop scheduling problem with two criteria; total tardiness and makespan. Eur J Oper Res 269(2):590\u2013601","journal-title":"Eur J Oper Res"},{"issue":"30","key":"4027_CR37","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.asoc.2015.01.069","volume":"1","author":"SW Lin","year":"2015","unstructured":"Lin SW, Ying KC (2015) Order acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardiness. Appl Soft Comput 1(30):462\u2013474","journal-title":"Appl Soft Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04027-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04027-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04027-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T08:20:58Z","timestamp":1586161258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04027-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,19]]},"references-count":37,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4027"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04027-w","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,19]]},"assertion":[{"value":"1 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}