{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:49:10Z","timestamp":1761598150807,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:00:00Z","timestamp":1575590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:00:00Z","timestamp":1575590400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 108-2410-H-035-046"],"award-info":[{"award-number":["MOST 108-2410-H-035-046"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00500-019-04561-8","type":"journal-article","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T18:02:34Z","timestamp":1575655354000},"page":"10515-10533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A two-stage three-machine assembly scheduling problem with a truncation position-based learning effect"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9869-2727","authenticated-orcid":false,"given":"Ameni","family":"Azzouz","sequence":"first","affiliation":[]},{"given":"Po-An","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Peng-Hsiang","family":"Hsu","sequence":"additional","affiliation":[]},{"given":"Win-Chin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Shangchia","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Lamjed","family":"Ben Said","sequence":"additional","affiliation":[]},{"given":"Chin-Chia","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,6]]},"reference":[{"key":"4561_CR1","series-title":"Studies in computational intelligence","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-030-10674-4","volume-title":"Feature selection and enhanced Krill Herd algorithm for text document clustering","author":"LMQ Abualigah","year":"2019","unstructured":"Abualigah LMQ (2019) Feature selection and enhanced Krill Herd algorithm for text document clustering, vol 816. Studies in computational intelligence. Springer, Berlin, pp 1\u2013165"},{"issue":"1","key":"4561_CR2","first-page":"19","volume":"5","author":"LMQ Abualigah","year":"2015","unstructured":"Abualigah LMQ, Hanandeh ES (2015) Applying genetic algorithms to information retrieval using vector space model. Int J Comput Sci Eng Appl 5(1):19","journal-title":"Int J Comput Sci Eng Appl"},{"issue":"11","key":"4561_CR3","doi-asserted-by":"crossref","first-page":"4773","DOI":"10.1007\/s11227-017-2046-2","volume":"73","author":"LM Abualigah","year":"2017","unstructured":"Abualigah LM, Khader AT (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J Supercomput 73(11):4773\u20134795","journal-title":"J Supercomput"},{"key":"4561_CR4","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.jocs.2017.07.018","volume":"25","author":"LM Abualigah","year":"2018","unstructured":"Abualigah LM, Khader AT, Hanandeh ES (2018) A new feature selection method to improve the document clustering using particle swarm optimization algorithm. J Comput Sci 25:456\u2013466","journal-title":"J Comput Sci"},{"key":"4561_CR5","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1016\/j.cor.2004.09.002","volume":"33","author":"A Allahverdi","year":"2006","unstructured":"Allahverdi A, Al-Anzi FS (2006) A PSO and a Tabu search heuristics for assembly scheduling problem of the two-stage distributed database application. Comput Oper Res 33:1056\u20131080","journal-title":"Comput Oper Res"},{"key":"4561_CR6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.engappai.2018.10.012","volume":"77","author":"JEC Arroyo","year":"2019","unstructured":"Arroyo JEC, Leung JYT, Tavares RG (2019) An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times. Eng Appl Artif Intell 77:239\u2013254","journal-title":"Eng Appl Artif Intell"},{"issue":"4","key":"4561_CR7","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","volume":"56","author":"A Azzouz","year":"2018","unstructured":"Azzouz A, Ennigrou M, Ben Said L (2018) Scheduling problems under learning effects: classification and cartography. Int J Prod Res 56(4):1642\u20131661","journal-title":"Int J Prod Res"},{"issue":"1","key":"4561_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115(1):173\u2013178","journal-title":"Eur J Oper Res"},{"issue":"9","key":"4561_CR10","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1057\/palgrave.jors.2602095","volume":"57","author":"P Chen","year":"2006","unstructured":"Chen P, Chin-Chia W, Lee W-C (2006) A bi-criteria two-machine flowshop scheduling problem with a learning effect. J Oper Res Soc 57(9):1113\u20131125","journal-title":"J Oper Res Soc"},{"issue":"1","key":"4561_CR102","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.ijpe.2012.03.027","volume":"141","author":"TCE Cheng","year":"2013","unstructured":"Cheng TCE, Wu CC, Chen JC, Wu WH, Cheng SR (2013) Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. Int J Prod Econ 141(1):79\u201386","journal-title":"Int J Prod Econ"},{"key":"4561_CR11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1080\/03610929108830487","volume":"20","author":"DE Critchlow","year":"1991","unstructured":"Critchlow DE, Fligner MA (1991) On distribution-free multiple comparisons in one-way analysis of variance. Commun Stat Theory Methods 20:127\u2013139","journal-title":"Commun Stat Theory Methods"},{"key":"4561_CR12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","volume":"90","author":"F Della Croce","year":"1996","unstructured":"Della Croce F, Narayan V, Tadei R (1996) The two-machine total completion time flow shop problem. Eur J Oper Res 90:227\u2013237","journal-title":"Eur J Oper Res"},{"key":"4561_CR13","volume-title":"Nonparametric statistical methods","author":"MD Hollander","year":"2014","unstructured":"Hollander MD, Wolfe A, Chicken E (2014) Nonparametric statistical methods, 3rd edn. Wiley, Hoboken","edition":"3"},{"issue":"5\u20138","key":"4561_CR14","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1007\/s00170-012-4216-y","volume":"65","author":"N Hosseini","year":"2013","unstructured":"Hosseini N, Tavakkoli-Moghaddam R (2013) Two meta-heuristics for solving a new two-machine flowshop scheduling problem with the learning effect and dynamic arrivals. Int J Adv Manuf Technol 65(5\u20138):771\u2013786","journal-title":"Int J Adv Manuf Technol"},{"issue":"7","key":"4561_CR15","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M","volume":"42","author":"LW Jacobs","year":"1995","unstructured":"Jacobs LW, Brusco MJ (1995) A local search heuristic for large set-covering problems. Naval Res Logist Q 42(7):1129\u20131140","journal-title":"Naval Res Logist Q"},{"issue":"1","key":"4561_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0925-5273(03)00179-8","volume":"88","author":"W-C Lee","year":"2004","unstructured":"Lee W-C, Wu C-C (2004) Minimizing total completion time in a two-machine flowshop with a learning effect. Int J Prod Econ 88(1):85\u201393","journal-title":"Int J Prod Econ"},{"key":"4561_CR18","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 TCE, Lin BMT (1993) Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Manag Sci 39:616\u2013625","journal-title":"Manag Sci"},{"key":"4561_CR19","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s00236-003-0132-9","volume":"40","author":"W-C Lee","year":"2004","unstructured":"Lee W-C, Wu C-C, Sung H-J (2004) A bi-criterion single-machine scheduling problem with learning considerations. Acta Inform 40:303\u2013315","journal-title":"Acta Inform"},{"issue":"3","key":"4561_CR20","doi-asserted-by":"crossref","first-page":"221","DOI":"10.5391\/IJFIS.2017.17.3.221","volume":"17","author":"MKK Mahalleh","year":"2017","unstructured":"Mahalleh MKK, Ashjari B, Yousefi F, Saberi M (2017) A robust solution to resource-constraint project scheduling problem. Int J Fuzzy Logic Intell Syst 17(3):221\u2013227","journal-title":"Int J Fuzzy Logic Intell Syst"},{"doi-asserted-by":"crossref","unstructured":"Marchiori E, Steenbeek A (2000) An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. In: Workshops on real-world applications of evolutionary computation. Springer, Berlin, pp 370\u2013384","key":"4561_CR21","DOI":"10.1007\/3-540-45561-2_36"},{"issue":"1","key":"4561_CR23","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"issue":"12","key":"4561_CR24","doi-asserted-by":"crossref","first-page":"3501","DOI":"10.1080\/00207543.2012.750771","volume":"51","author":"V Nouri","year":"2013","unstructured":"Nouri V, Behdin P, Ramezanian R (2013) Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities. Int J Prod Res 51(12):3501\u20133515","journal-title":"Int J Prod Res"},{"issue":"2","key":"4561_CR25","doi-asserted-by":"crossref","first-page":"135","DOI":"10.5391\/IJFIS.2018.18.2.135","volume":"18","author":"JH Park","year":"2018","unstructured":"Park JH, Yu JS, Geem ZW (2018) Genetic algorithm-based optimal investment scheduling for public rental housing projects in South Korea. Int J Fuzzy Logic Intell Syst 18(2):135\u2013145","journal-title":"Int J Fuzzy Logic Intell Syst"},{"key":"4561_CR26","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:346\u2013355","journal-title":"Oper Res"},{"issue":"3","key":"4561_CR27","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"39","author":"I Ribas","year":"2011","unstructured":"Ribas I, Companys R, Tort-Martorell X (2011) An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega 39(3):293\u2013301","journal-title":"Omega"},{"issue":"3","key":"4561_CR28","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, St\u00fctzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177(3):2033\u20132049","journal-title":"Eur J Oper Res"},{"issue":"3","key":"4561_CR29","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R Ruiz","year":"2008","unstructured":"Ruiz R, St\u00fctzle T (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187(3):1143\u20131159","journal-title":"Eur J Oper Res"},{"key":"4561_CR30","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz R, Pan QK, Naderi B (2019) Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega 83:213\u2013222","journal-title":"Omega"},{"key":"4561_CR32","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1016\/j.cie.2015.05.032","volume":"87","author":"Y-R Shiau","year":"2015","unstructured":"Shiau Y-R, Tsai M-S, Lee W-C, Cheng TCE (2015) Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time. Comput Ind Eng 87:580\u2013589","journal-title":"Comput Ind Eng"},{"issue":"7","key":"4561_CR35","doi-asserted-by":"crossref","first-page":"4905","DOI":"10.1016\/j.apm.2012.09.044","volume":"37","author":"X-Y Wang","year":"2013","unstructured":"Wang X-Y, Wang J-J (2013) Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning. Appl Math Model 37(7):4905\u20134914","journal-title":"Appl Math Model"},{"issue":"12","key":"4561_CR36","doi-asserted-by":"crossref","first-page":"2906","DOI":"10.1016\/j.cor.2013.07.001","volume":"40","author":"X-Y Wang","year":"2013","unstructured":"Wang X-Y, Zhou Z, Zhang X, Ji P, Wang J-B (2013) Several flow shop scheduling problems with truncated position-based learning effect. Comput Oper Res 40(12):2906\u20132929","journal-title":"Comput Oper Res"},{"issue":"4","key":"4561_CR37","doi-asserted-by":"crossref","first-page":"122","DOI":"10.2514\/8.155","volume":"3","author":"TP Wright","year":"1936","unstructured":"Wright TP (1936) Factors affecting the cost of airplanes. J Aeronaut Sci (Inst Aeronaut Sci) 3(4):122\u2013128","journal-title":"J Aeronaut Sci (Inst Aeronaut Sci)"},{"issue":"1","key":"4561_CR100","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1057\/jors.2012.46","volume":"64","author":"CC Wu","year":"2013","unstructured":"Wu CC, Yin Y, Cheng SR  (2013) Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions. J Oper Res Soc 64(1):147\u2013156","journal-title":"J Oper Res Soc"},{"issue":"9","key":"4561_CR38","doi-asserted-by":"crossref","first-page":"3064","DOI":"10.1080\/00207543.2017.1401243","volume":"56","author":"CC Wu","year":"2018","unstructured":"Wu CC, Wang DJ, Cheng SR, Chung IH, Lin WC (2018) A two-stage three-machine assembly scheduling problem with a position-based learning effect. Int J Prod Res 56(9):3064\u20133079","journal-title":"Int J Prod Res"},{"key":"4561_CR39","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.swevo.2018.10.003","volume":"44","author":"CC Wu","year":"2019","unstructured":"Wu CC, Yang TH, Zhang X, Kang CC, Chung IH, Lin WC (2019) Using heuristic and iterative greedy algorithms for the total weighted completion time order scheduling with release times. Swarm Evol Comput 44:913\u2013926","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"4561_CR40","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1111\/j.1540-5915.1979.tb00026.x","volume":"10","author":"LE Yele","year":"1979","unstructured":"Yele LE (1979) The learning curve: historical review and comprehensive survey. Decis Sci 10(2):302\u2013328","journal-title":"Decis Sci"},{"key":"4561_CR41","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.ins.2013.07.026","volume":"256","author":"Y Yin","year":"2014","unstructured":"Yin Y, Wu W-H, Wu W-H, Wu C-C (2014) A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Inf Sci 256:91\u2013108","journal-title":"Inf Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04561-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04561-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04561-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T00:30:44Z","timestamp":1607128244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04561-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,6]]},"references-count":37,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["4561"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04561-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2019,12,6]]},"assertion":[{"value":"6 December 2019","order":1,"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"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}