{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T10:28:22Z","timestamp":1745836102040},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T00:00:00Z","timestamp":1567555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T00:00:00Z","timestamp":1567555200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00500-019-04301-y","type":"journal-article","created":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T20:04:27Z","timestamp":1567627467000},"page":"5445-5462","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect"],"prefix":"10.1007","volume":"24","author":[{"given":"Yunqing","family":"Zou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dujuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Win-Chin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Yang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pay-Wen","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Hsiang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan-Po","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Chia","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,4]]},"reference":[{"key":"4301_CR1","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 Op Res 3:109\u2013119","journal-title":"Int J Op Res"},{"key":"4301_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ejor.2006.09.011","volume":"182","author":"FS Al-Anzi","year":"2007","unstructured":"Al-Anzi FS, Allahverdi A (2007) A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. Eur J Oper Res 182:80\u201394","journal-title":"Eur J Oper Res"},{"key":"4301_CR3","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1016\/j.cor.2004.09.002","volume":"33","author":"A Allahverdi","year":"2006","unstructured":"Allahverdi A, Al-Anzi FS (2006a) A PSO and a Tabu search heuristics for assembly scheduling problem of the two-stage distributed database application. Comput Op Res 33:1056\u20131080","journal-title":"Comput Op Res"},{"key":"4301_CR4","doi-asserted-by":"publisher","first-page":"4713","DOI":"10.1080\/00207540600621029","volume":"44","author":"A Allahverdi","year":"2006","unstructured":"Allahverdi A, Al-Anzi FS (2006b) Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times. Int J Prod Res 44:4713\u20134735","journal-title":"Int J Prod Res"},{"key":"4301_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s00170-007-0950-y","volume":"37","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Al-Anzi FS (2008) The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time. Int J Adv Manuf Technol 37:166\u2013177","journal-title":"Int J Adv Manuf Technol"},{"key":"4301_CR6","doi-asserted-by":"publisher","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 Op Res 36:2740\u20132747","journal-title":"Comput Op Res"},{"key":"4301_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10845-013-0775-5","volume":"26","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi A, Aydilek H (2015) The two stage assembly flowshop scheduling problem to minimize total tardiness. J Intell Manuf 26:225\u2013237","journal-title":"J Intell Manuf"},{"issue":"4","key":"4301_CR8","doi-asserted-by":"publisher","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\u20134","key":"4301_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00170-013-5252-y","volume":"70","author":"M Babaei","year":"2014","unstructured":"Babaei M, Mohammadi M, Ghomi SMTF (2014) A genetic algorithm for the simultaneous lot sizing and scheduling problem in capacitated flow shop with complex setups and backlogging. Int J Adv Manuf Technol 70(1\u20134):125\u2013134","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"4301_CR10","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/ijoc.2016.0742","volume":"29","author":"A Bettinelli","year":"2017","unstructured":"Bettinelli A, Cacchiani V, Malaguti E (2017) A branch-and-bound algorithm for the knapsack problem with conflict graph. INFORMS J Comput 29(3):457\u2013473","journal-title":"INFORMS J Comput"},{"key":"4301_CR11","doi-asserted-by":"publisher","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 Op Res 115:173\u2013178","journal-title":"Eur J Op Res"},{"key":"4301_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","volume":"188","author":"D Biskup","year":"2008","unstructured":"Biskup D (2008) A state-of-the-art review on scheduling with learning effect. Eur J Op Res 188:315\u2013329","journal-title":"Eur J Op Res"},{"key":"4301_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1007512501565","volume":"31","author":"TCE Cheng","year":"1999","unstructured":"Cheng TCE, Wang Q (1999) Scheduling the fabrication and assembly of components in a two-machine flowshop. IIE Trans 31:135\u2013148","journal-title":"IIE Trans"},{"key":"4301_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1019216726076","volume":"98","author":"TCE Cheng","year":"2000","unstructured":"Cheng TCE, Wang G (2000) Single machine scheduling with learning effect considerations. Ann Op Res 98:273\u2013290","journal-title":"Ann Op Res"},{"issue":"1","key":"4301_CR15","doi-asserted-by":"publisher","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 W-H, 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":"4301_CR16","doi-asserted-by":"publisher","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 Op Res 90:227\u2013237","journal-title":"Eur J Op Res"},{"key":"4301_CR17","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/S0377-2217(97)00070-2","volume":"105","author":"VR Dondeti","year":"1998","unstructured":"Dondeti VR, Mohanty BB (1998) Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs. Eur J Op Res 105:509\u2013524","journal-title":"Eur J Op Res"},{"key":"4301_CR18","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1057\/palgrave.jors.2601766","volume":"55","author":"O Etiler","year":"2004","unstructured":"Etiler O, Toklu B, Atak M, Wilson J (2004) A genetic algorithm for flow shop scheduling problems. J Op Res Soc 55:830\u2013835","journal-title":"J Op Res Soc"},{"key":"4301_CR19","unstructured":"Falkenauer E, Bouffoix S, (1991) A genetic algorithm for job shop. In: Proceedings of the 1991 IEEE international conference on robotics and automation"},{"key":"4301_CR20","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1016\/j.asoc.2017.12.009","volume":"68","author":"Y Fu","year":"2018","unstructured":"Fu Y, Ding J, Wang H, Wang J (2018) Two-objective stochastic flow-shop scheduling with deteriorating and learning effect in Industry 4.0-based manufacturing system. Appl Soft Comput 68:847\u2013855","journal-title":"Appl Soft Comput"},{"issue":"5","key":"4301_CR21","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1007\/s10845-017-1385-4","volume":"30","author":"Y Fu","year":"2019","unstructured":"Fu Y, Wang H, Tian G, Li Z, Hu H (2019) Two-agent stochastic flow shop deteriorating scheduling via a hybrid multi-objective evolutionary algorithm. J Intell Manuf 30(5):2257\u20132272","journal-title":"J Intell Manuf"},{"issue":"2","key":"4301_CR22","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1287\/ijoc.12.2.150.11893","volume":"12","author":"JND Gupta","year":"2000","unstructured":"Gupta JND, Sexton RS, Tunc EA (2000) Selecting scheduling heuristics using neural networks. INFORMS J Comput 12(2):150\u2013162","journal-title":"INFORMS J Comput"},{"key":"4301_CR23","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/S0377-2217(96)00312-8","volume":"103","author":"AMA Hariri","year":"1997","unstructured":"Hariri AMA, Potts CN (1997) A branch and bound algorithm for the two-stage assembly scheduling problem. Eur J Op Res 103:547\u2013556","journal-title":"Eur J Op Res"},{"key":"4301_CR24","volume-title":"Manufacturing planning and control-beyond MRP II","author":"P Higgins","year":"1996","unstructured":"Higgins P, Le Roy P, Tierney L (1996) Manufacturing planning and control-beyond MRP II. Chapman & Hall, London"},{"key":"4301_CR25","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"13","author":"E Ignall","year":"1965","unstructured":"Ignall E, Schrage LE (1965) Application of the branch and bound technique to some flowshop scheduling problems. Op Res 13:400\u2013412","journal-title":"Op Res"},{"key":"4301_CR26","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/S0305-0548(03)00016-9","volume":"31","author":"SK Iyer","year":"2004","unstructured":"Iyer SK, Saxena BS (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comput Op Res 31:593\u2013606","journal-title":"Comput Op Res"},{"issue":"1\u20132","key":"4301_CR27","first-page":"19","volume":"5","author":"A Janiak","year":"2011","unstructured":"Janiak A, Krysiak T, Trela R (2011) Scheduling problems with learning and ageing effects: a survey. Decis Mak Manuf 5(1\u20132):19\u201336","journal-title":"Decis Mak Manuf"},{"issue":"7","key":"4301_CR28","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1057\/jors.2016.40","volume":"68","author":"Z Jiang","year":"2017","unstructured":"Jiang Z, Chen F, Zhang X (2017) Single-machine scheduling with times-based and job-dependent learning effect. J Op Res Soc 68(7):809\u2013815","journal-title":"J Op Res Soc"},{"issue":"2","key":"4301_CR29","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1111\/j.1937-5956.2002.tb00492.x","volume":"11","author":"ZH Jin","year":"2002","unstructured":"Jin ZH, Ohno K, Ito T, Elmaghrabry SE (2002) Scheduling hybrid flowshop in printed circuited board assembly line. Prod Op Manag 11(2):216\u2013230","journal-title":"Prod Op Manag"},{"key":"4301_CR30","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times. Naval Res Logist Q 1:61\u201368","journal-title":"Naval Res Logist Q"},{"key":"4301_CR31","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gellat CD, Vecchi MP (1983) Optimization by simulated annealing algorithm. Science 220:671\u2013680","journal-title":"Science"},{"issue":"4","key":"4301_CR32","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1080\/00207543.2015.1035815","volume":"54","author":"GM Komaki","year":"2016","unstructured":"Komaki GM, Teymourian E, Kayvanfar V (2016) Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems. Int J Prod Res 54(4):963\u2013983","journal-title":"Int J Prod Res"},{"key":"4301_CR33","doi-asserted-by":"publisher","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 Op Res 28:689\u2013704","journal-title":"Comput Op Res"},{"key":"4301_CR34","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.ejor.2006.07.027","volume":"182","author":"C Koulamas","year":"2007","unstructured":"Koulamas C, Kyparisis GJ (2007a) A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines. Eur J Op Res 182:945\u2013951","journal-title":"Eur J Op Res"},{"key":"4301_CR35","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.ejor.2006.01.030","volume":"178","author":"C Koulamas","year":"2007","unstructured":"Koulamas C, Kyparisis GJ (2007b) Single-machine and two-machine flowshop scheduling with general learning functions. Eur J Op Res 178:402\u2013407","journal-title":"Eur J Op Res"},{"key":"4301_CR36","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1016\/j.ejor.2005.03.020","volume":"174","author":"WH Kuo","year":"2006","unstructured":"Kuo WH, Yang DL (2006) Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. Eur J Op Res 174:1184\u20131190","journal-title":"Eur J Op Res"},{"issue":"2","key":"4301_CR37","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1002\/hfm.20365","volume":"24","author":"K Lai","year":"2014","unstructured":"Lai K, Hsu PH, Ting PH, Wu CC (2014) A truncated sum of processing- times-based learning model for a two-machine flowshop scheduling problem. Hum Factors Ergon Manuf Serv Ind 24(2):152\u2013160","journal-title":"Hum Factors Ergon Manuf Serv Ind"},{"key":"4301_CR38","doi-asserted-by":"publisher","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":"4301_CR39","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00236-003-0132-9","volume":"40","author":"WC Lee","year":"2004","unstructured":"Lee WC, Wu C-C, Sung HJ (2004) A bi-criterion single-machine scheduling problem with learning considerations. Acta Inform 40:303\u2013315","journal-title":"Acta Inform"},{"issue":"1","key":"4301_CR40","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ijpe.2012.10.015","volume":"142","author":"G Li","year":"2013","unstructured":"Li G, Wang XY, Wang JB, Sun LY (2013a) Worst case analysis of flow shop scheduling problems with a time-dependent learning effect. Int J Prod Econ 142(1):98\u2013104","journal-title":"Int J Prod Econ"},{"issue":"1","key":"4301_CR41","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00170-013-4772-9","volume":"67","author":"L Li","year":"2013","unstructured":"Li L, Yang SW, Wu YB, Huo Y, Ji P (2013b) Single machine scheduling jobs with a truncated sum-of-processing-times-based learning effect. Int J Adv Manuf Technol 67(1):261\u2013267","journal-title":"Int J Adv Manuf Technol"},{"key":"4301_CR42","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.engappai.2014.09.015","volume":"37","author":"JQ Li","year":"2015","unstructured":"Li JQ, Pan QK, Mao K (2015) A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems. Eng Appl Artif Intell 37:279\u2013292","journal-title":"Eng Appl Artif Intell"},{"key":"4301_CR43","first-page":"1015","volume":"34","author":"BMT Lin","year":"2002","unstructured":"Lin BMT, Cheng TCE (2002) Fabrication and assembly scheduling in a two-machine flowshop. IIE Trans 34:1015\u20131020","journal-title":"IIE Trans"},{"issue":"5","key":"4301_CR44","first-page":"603","volume":"8","author":"A Maleki-Darounkolaei","year":"2013","unstructured":"Maleki-Darounkolaei A, Seyyedi I (2013) Taguchi method for three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times. J Eng Sci Technol 8(5):603\u2013622","journal-title":"J Eng Sci Technol"},{"issue":"26","key":"4301_CR45","first-page":"1","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(26):1\u20137","journal-title":"J Ind Eng Int"},{"key":"4301_CR46","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/00207546308947818","volume":"2","author":"D Nadler","year":"1963","unstructured":"Nadler D, Smith WD (1963) Manufacturing progress functions for types of processes. Int J Prod Res 2:115\u2013135","journal-title":"Int J Prod Res"},{"key":"4301_CR47","doi-asserted-by":"publisher","first-page":"1550001","DOI":"10.1142\/S0217595915500013","volume":"32","author":"YP Niu","year":"2015","unstructured":"Niu YP, Wan L, Wang JB (2015) A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect. Asia Pac J Op Res 32:1550001","journal-title":"Asia Pac J Op Res"},{"issue":"4","key":"4301_CR48","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10951-005-1640-y","volume":"8","author":"C O\u011duz","year":"2005","unstructured":"O\u011duz C, Ercan MF (2005) A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. J Sched 8(4):323\u2013351","journal-title":"J Sched"},{"key":"4301_CR49","doi-asserted-by":"publisher","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, VanWassenhove LN, Zwaneveld CM (1995) The two-stage assembly scheduling problem: complexity and approximation. Op Res 43:346\u2013355","journal-title":"Op Res"},{"key":"4301_CR50","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0377-2217(93)E0290-E","volume":"80","author":"C Reeves","year":"1995","unstructured":"Reeves C (1995) Heuristics for scheduling a single machine subject to unequal job release times. Eur J Op Res 80:397\u2013403","journal-title":"Eur J Op Res"},{"issue":"8","key":"4301_CR51","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1057\/jors.2013.19","volume":"65","author":"R Rudek","year":"2014","unstructured":"Rudek R (2014) Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning. J Op Res Soc 65(8):1170\u20131176","journal-title":"J Op Res Soc"},{"issue":"4","key":"4301_CR52","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s10898-017-0509-x","volume":"68","author":"R Rudek","year":"2017","unstructured":"Rudek R (2017) Parallel machine scheduling with general sum of processing time based models. J Global Optim 68(4):799\u2013814","journal-title":"J Global Optim"},{"key":"4301_CR53","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s10845-009-0370-y","volume":"22","author":"EL Solano-Charris","year":"2011","unstructured":"Solano-Charris EL, Montoya-Torres JR, Paternina-Arboleda CD (2011) Ant colony optimization algorithm for a bi-criteria 2-stage hybrid flowshop scheduling problem. J Intell Manuf 22:815\u2013822","journal-title":"J Intell Manuf"},{"key":"4301_CR54","doi-asserted-by":"crossref","unstructured":"Sorensen K, Sevaux M, Glover F (2017) A history of metaheuristics. In: Handbook of heuristics. Springer","DOI":"10.1007\/978-3-319-07153-4_4-1"},{"issue":"1","key":"4301_CR55","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10479-013-1481-6","volume":"211","author":"LH Sun","year":"2013","unstructured":"Sun LH, Cui K, Chen JH, Wang J, He XC (2013) Research on permutation flow shop scheduling problems with general position-dependent learning effects. Ann Op Res 211(1):473\u2013480","journal-title":"Ann Op Res"},{"key":"4301_CR56","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1016\/j.ijpe.2007.12.007","volume":"113","author":"CS Sung","year":"2008","unstructured":"Sung CS, Kim HA (2008) A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times. Int J Prod Econ 113:1038\u20131048","journal-title":"Int J Prod Econ"},{"key":"4301_CR57","doi-asserted-by":"publisher","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:1238\u20131243","journal-title":"Adv Eng Softw"},{"key":"4301_CR58","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0305-0548(01)00098-3","volume":"30","author":"A Tozkapan","year":"2003","unstructured":"Tozkapan A, Kirca O, Chung CS (2003) A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Comput Op Res 30:309\u2013320","journal-title":"Comput Op Res"},{"issue":"1","key":"4301_CR59","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.jmsy.2012.08.001","volume":"32","author":"B Vahedi-Nouri","year":"2013","unstructured":"Vahedi-Nouri B, Fattahi P, Ramezanian R (2013) Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints. J Manuf Syst 32(1):167\u2013173","journal-title":"J Manuf Syst"},{"issue":"5\u20138","key":"4301_CR60","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00170-014-5841-4","volume":"73","author":"B Vahedi-Nouri","year":"2014","unstructured":"Vahedi-Nouri B, Fattahi P, Ramezanian R (2014) A general flow shop scheduling problem with consideration of position-based learning effect and multiple availability constraints. Int J Adv Manuf Technol 73(5\u20138):601\u2013611","journal-title":"Int J Adv Manuf Technol"},{"issue":"10","key":"4301_CR61","doi-asserted-by":"publisher","first-page":"3456","DOI":"10.1007\/s00500-017-3003-y","volume":"23","author":"F Villaf\u00e1\u00f1ez","year":"2019","unstructured":"Villaf\u00e1\u00f1ez F, Poza D, L\u00f3pez-Paredes A, Pajares J, del Olmo R (2019) A generic heuristic for multi-project scheduling problems with global and local resource constraints (RCMPSP). Soft Comput 23(10):3456\u20133479","journal-title":"Soft Comput"},{"issue":"4","key":"4301_CR62","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.cor.2012.10.015","volume":"40","author":"S Wang","year":"2013","unstructured":"Wang S, Liu M (2013) A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Comput Op Res 40(4):1064\u20131075","journal-title":"Comput Op Res"},{"key":"4301_CR63","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cor.2014.12.006","volume":"58","author":"JJ Wang","year":"2015","unstructured":"Wang JJ, Zhang BH (2015) Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Comput Op Res 58:24\u201331","journal-title":"Comput Op Res"},{"issue":"8","key":"4301_CR64","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1007\/s11590-011-0433-9","volume":"7","author":"JB Wang","year":"2013","unstructured":"Wang JB, Wang XY, Sun LH, Sun LY (2013) Scheduling jobs with truncated exponential learning functions. Optim Lett 7(8):1857\u20131873","journal-title":"Optim Lett"},{"issue":"4","key":"4301_CR65","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/s00521-015-1910-3","volume":"27","author":"YB Wu","year":"2016","unstructured":"Wu YB, Wang JJ (2016) Single-machine scheduling with truncated sum-of- processing-times-based learning effect including proportional delivery times. Neural Comput Appl 27(4):937\u2013943","journal-title":"Neural Comput Appl"},{"issue":"4","key":"4301_CR66","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1016\/j.cie.2011.01.016","volume":"60","author":"CC Wu","year":"2011","unstructured":"Wu CC, Yin Y, Cheng SR (2011) Some single-machine scheduling problems with a truncation learning effect. Comput Ind Eng 60(4):790\u2013795","journal-title":"Comput Ind Eng"},{"issue":"10","key":"4301_CR67","doi-asserted-by":"publisher","first-page":"5001","DOI":"10.1016\/j.apm.2011.12.038","volume":"36","author":"C-C Wu","year":"2012","unstructured":"Wu C-C, Wu WH, Hsu PH, Lai K (2012a) A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function. Appl Math Model 36(10):5001\u20135014","journal-title":"Appl Math Model"},{"issue":"4","key":"4301_CR68","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1504\/EJIE.2012.047665","volume":"6","author":"CC Wu","year":"2012","unstructured":"Wu CC, Yin Y, Wu W-H, Cheng SR (2012b) Some polynomial solvable single-machine scheduling problems with a truncation sum-of-processing-times based learning effect. Eur J Ind Eng 6(4):441\u2013453","journal-title":"Eur J Ind Eng"},{"key":"4301_CR69","doi-asserted-by":"publisher","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 Op Res Soc 64:147\u2013156","journal-title":"J Op Res Soc"},{"issue":"6","key":"4301_CR70","doi-asserted-by":"publisher","first-page":"1450046","DOI":"10.1142\/S0217595914500468","volume":"31","author":"WH Wu","year":"2014","unstructured":"Wu WH, Yin Y, Cheng SR, Hsu PH, Wu CC (2014) Genetic algorithm for a two-agent scheduling problem with truncated learning consideration. Asia-Pac J Op Res 31(6):1450046","journal-title":"Asia-Pac J Op Res"},{"issue":"2","key":"4301_CR71","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1057\/s41274-016-0008-3","volume":"68","author":"WH Wu","year":"2017","unstructured":"Wu WH, Yin Y, Cheng TCE, Lin WC, Chen JC, Luo SY, Wu C-C (2017) A combined approach for two-agent scheduling with sum-of- processing- times- based learning effect. J Op Res Soc 68(2):111\u2013120","journal-title":"J Op Res Soc"},{"key":"4301_CR72","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.swevo.2018.01.012","volume":"41","author":"C-C Wu","year":"2018","unstructured":"Wu C-C, Chen J-Y, Lin W-C, Lai K, Liu SC, Yu PW (2018a) A two-stage three-machine assembly flow shop scheduling with learning consideration to minimize the flowtime by six hybrids of particle swarm optimization. Swarm Evolut Comput 41:97\u2013110","journal-title":"Swarm Evolut Comput"},{"issue":"9","key":"4301_CR73","doi-asserted-by":"publisher","first-page":"3064","DOI":"10.1080\/00207543.2017.1401243","volume":"56","author":"C-C Wu","year":"2018","unstructured":"Wu C-C, Wang DJ, Cheng SR, Chung IH, Lin WC (2018b) 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":"4301_CR74","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1111\/j.1540-5915.1979.tb00026.x","volume":"10","author":"LE Yelle","year":"1979","unstructured":"Yelle LE (1979) The learning curve: historical review and comprehensive survey. Decis Sci 10:302\u2013328","journal-title":"Decis Sci"},{"key":"4301_CR75","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1016\/j.ins.2009.02.015","volume":"179","author":"Y Yin","year":"2009","unstructured":"Yin Y, Xu D, Sun K, Li H (2009) Some scheduling problems with general position-dependent and time-dependent learning effects. Inf Sci 179:2416\u20132425","journal-title":"Inf Sci"},{"key":"4301_CR76","doi-asserted-by":"publisher","first-page":"3623","DOI":"10.1016\/j.apm.2010.03.011","volume":"34","author":"Y Yin","year":"2010","unstructured":"Yin Y, Xu D, Wang J (2010a) Single-machine scheduling with a general sum-of- actual-processing-times-based and job-position-based learning effect. Appl Math Model 34:3623\u20133630","journal-title":"Appl Math Model"},{"key":"4301_CR77","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s00170-009-2360-9","volume":"48","author":"Y Yin","year":"2010","unstructured":"Yin Y, Xu D, Wang J (2010b) Some single-machine scheduling problems past-sequence-dependent setup times and a general learning effect. Int J Adv Manuf Technol 48:1123\u20131132","journal-title":"Int J Adv Manuf Technol"},{"key":"4301_CR78","doi-asserted-by":"publisher","first-page":"2209","DOI":"10.1016\/j.ins.2011.01.018","volume":"181","author":"Y Yin","year":"2011","unstructured":"Yin Y, Xu D, Huang X (2011) Notes on \u201csome single-machine scheduling problems with general position-dependent and time-dependent learning effects\u201d. Inf Sci 181:2209\u20132217","journal-title":"Inf Sci"},{"key":"4301_CR79","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TSMCA.2011.2147305","volume":"42","author":"Y Yin","year":"2012","unstructured":"Yin Y, Liu M, Hao J, Zhou M (2012a) Single machine scheduling with job position-dependent learning and time-dependent deterioration. IEEE Trans Syst Man Cybern Part A Syst Hum 42:192\u2013200","journal-title":"IEEE Trans Syst Man Cybern Part A Syst Hum"},{"key":"4301_CR80","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.cor.2011.07.022","volume":"39","author":"Y Yin","year":"2012","unstructured":"Yin Y, Wu C-C, Wu W-H, Cheng S-S (2012b) The single-machine total weighted tardiness scheduling problem with position-based learning effects. Comput Op Res 39:1109\u20131116","journal-title":"Comput Op Res"},{"issue":"3","key":"4301_CR81","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1007\/s40995-016-0080-1","volume":"42","author":"X Zhang","year":"2018","unstructured":"Zhang X, Liu SC, Yin Y, Wu CC (2018) Single-machine scheduling problems with a learning effect matrix. Iran J Sci Technol Trans A Sci 42(3):1327\u20131335","journal-title":"Iran J Sci Technol Trans A Sci"},{"issue":"1","key":"4301_CR82","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00500-017-2889-8","volume":"23","author":"W Zhu","year":"2019","unstructured":"Zhu W, Hu X, Xia W, Jin P (2019) A two-phase genetic annealing method for integrated earth observation satellite scheduling problems. Soft Comput 23(1):181\u2013196","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04301-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04301-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04301-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T23:21:07Z","timestamp":1599088867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04301-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,4]]},"references-count":82,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4301"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04301-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,4]]},"assertion":[{"value":"4 September 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 certify that there is no conflict of interest with any individual\/organization for the paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The paper does not involve human participants and animals. All authors have checked the paper and have agreed to the submission.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animals rights"}}]}}