{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:48:59Z","timestamp":1760708939152},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,10,29]],"date-time":"2015-10-29T00:00:00Z","timestamp":1446076800000},"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":["Soft Comput"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00500-015-1908-x","type":"journal-article","created":{"date-parts":[[2015,10,29]],"date-time":"2015-10-29T02:46:16Z","timestamp":1446086776000},"page":"2091-2103","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A two-machine flowshop scheduling problem with precedence constraint on two jobs"],"prefix":"10.1007","volume":"21","author":[{"given":"Shuenn-Ren","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Yunqiang","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Chih-Hou","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Win-Chin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Chin-Chia","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,29]]},"reference":[{"key":"1908_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0548(98)00060-4","volume":"26","author":"VA Armentano","year":"1999","unstructured":"Armentano VA, Ronconi DP (1999) Tabu search for total tardiness minimization in flow-shop scheduling problems. Comput Oper Res 26:219\u2013235","journal-title":"Comput Oper Res"},{"key":"1908_CR2","volume-title":"Introduction to sequencing and scheduling","author":"KR Baker","year":"1974","unstructured":"Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York"},{"issue":"11","key":"1908_CR3","doi-asserted-by":"crossref","first-page":"5418","DOI":"10.1016\/j.apm.2011.12.010","volume":"36","author":"M Bank","year":"2012","unstructured":"Bank M, Fatemi Ghomi SMT, Jolai F, Behnamian J (2012) Two-machine flow shop total tardiness scheduling problem with deteriorating jobs. Appl Math Model 36(11):5418\u20135426","journal-title":"Appl Math Model"},{"key":"1908_CR4","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154\u2013160","journal-title":"ORSA J Comput"},{"key":"1908_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.omega.2013.02.005","volume":"42","author":"C Chandra","year":"2014","unstructured":"Chandra C, Liu Z, He J, Ruohonen T (2014) A binary branch and bound algorithm to minimize maximum scheduling cost. Omega 42:9\u201315","journal-title":"Omega"},{"key":"1908_CR6","doi-asserted-by":"publisher","unstructured":"Chen ZY, Tsai CF, Eberle W, Lin WC, Ke W-C (2014) Instance selection by genetic-based biological algorithm. Soft Comput. doi: 10.1007\/s00500-014-1339-0","DOI":"10.1007\/s00500-014-1339-0"},{"key":"1908_CR7","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1057\/palgrave.jors.2602095","volume":"57","author":"P Chen","year":"2006","unstructured":"Chen P, Wu C-C, Lee WC (2006) A bi-criteria two-machine flowshop scheduling problem with a learning effect. J Oper Res Soc 57:1113\u20131125","journal-title":"J Oper Res Soc"},{"key":"1908_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2004.12.023","volume":"174","author":"CS Chung","year":"2006","unstructured":"Chung CS, Flynn J, Kirca O (2006) A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems. Eur J Oper Res 174:1\u201310","journal-title":"Eur J Oper Res"},{"key":"1908_CR9","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":"1908_CR10","doi-asserted-by":"crossref","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","volume":"35","author":"I Essafi","year":"2008","unstructured":"Essafi I, Mati Y, Dauzere-Peres S (2008) A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Comput Oper Res 35:2599\u20132616","journal-title":"Comput Oper Res"},{"issue":"8","key":"1908_CR11","doi-asserted-by":"crossref","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 generic algorithm for flow shop scheduling problems. J Oper Res Soc 55(8):830\u2013835","journal-title":"J Oper Res Soc"},{"key":"1908_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","volume":"11","author":"ML Fisher","year":"1971","unstructured":"Fisher ML (1971) A dual algorithm for the one-machine scheduling problem. Math Program 11:229\u2013251","journal-title":"Math Program"},{"key":"1908_CR13","volume-title":"Sequencing and scheduling: an introduction to the mathematics of the job shop","author":"S French","year":"1982","unstructured":"French S (1982) Sequencing and scheduling: an introduction to the mathematics of the job shop. British Library Cataloguing in Publish Data, Ellis Horwood Limited, Chichester"},{"key":"1908_CR14","doi-asserted-by":"crossref","unstructured":"Gao KZ, Li H, Pan QK, Li JQ, Liang JJ (2010) Hybrid heuristics based on harmony search to minimize total flow time in no-wait flow shop. Control and decision conference (CCDC), 2010 Chinese. IEEE, 2010","DOI":"10.1109\/CCDC.2010.5498155"},{"key":"1908_CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS, Sethi PR (1979) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117\u2013129","journal-title":"Math Oper Res"},{"key":"1908_CR16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/00207547808930015","volume":"16","author":"LF Gelders","year":"1978","unstructured":"Gelders LF, Sambandam N (1978) Four simple heuristics for scheduling a flowshop. Int J Prod Res 16:221\u2013231","journal-title":"Int J Prod Res"},{"key":"1908_CR17","first-page":"310","volume":"11","author":"M Gen","year":"2012","unstructured":"Gen M, Lin L (2012) Multiobjective genetic algorithm for scheduling problems in manufacturing systems. Ind Eng Manag Syst 11:310\u2013330","journal-title":"Ind Eng Manag Syst"},{"key":"1908_CR18","doi-asserted-by":"publisher","unstructured":"Gong D, Wang G, Sun X, Han Y (2014) A set-based genetic algorithm for solving the many-objective optimization problem. Soft Comput. doi: 10.1007\/s00500-014-1284-y","DOI":"10.1007\/s00500-014-1284-y"},{"issue":"3","key":"1908_CR19","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybern-Part C: Appl Rev 28(3):392\u2013403","journal-title":"IEEE Trans Syst Man Cybern-Part C: Appl Rev"},{"key":"1908_CR20","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1057\/jors.2012.89","volume":"64","author":"M Kharbeche","year":"2013","unstructured":"Kharbeche M, Haouari M (2013) MIP models for minimizing total tardiness in a two-machine flow shop. J Oper Res Soc 64:690\u2013707","journal-title":"J Oper Res Soc"},{"key":"1908_CR21","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0305-0548(93)90083-U","volume":"20","author":"Y-D Kim","year":"1993","unstructured":"Kim Y-D (1993) A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Comput Oper Res 20:391\u2013401","journal-title":"Comput Oper Res"},{"issue":"3","key":"1908_CR22","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/0377-2217(94)00029-C","volume":"85","author":"Y-D Kim","year":"1995","unstructured":"Kim Y-D (1995) Minimizing total tardiness in permutation flowshops. Eur J Oper Res 85(3):541\u2013555","journal-title":"Eur J Oper Res"},{"key":"1908_CR23","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","volume":"42","author":"C Koulamas","year":"1994","unstructured":"Koulamas C (1994) The total tardiness problem: review and extensions. Oper Res 42:1025\u20131041","journal-title":"Oper Res"},{"key":"1908_CR24","first-page":"1016","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 1:1016\u20131019","journal-title":"Ann Discrete Math"},{"issue":"6","key":"1908_CR25","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1007\/s00500-012-0942-1","volume":"17","author":"J Li","year":"2013","unstructured":"Li J, Song Y (2013) Community detection in complex networks using extended compact genetic algorithm. Soft Comput 17(6):925\u2013937","journal-title":"Soft Comput"},{"issue":"12","key":"1908_CR26","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1080\/07408170701748877","volume":"40","author":"Y Mati","year":"2008","unstructured":"Mati Y, Xie X (2008) A genetic-search-guided greedy algorithm for multi-resource shop scheduling with resource flexibility. IIE Trans 40(12):1228\u20131240","journal-title":"IIE Trans"},{"key":"1908_CR27","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1080\/095372899232993","volume":"10","author":"GC Onwubolu","year":"1999","unstructured":"Onwubolu GC, Mutingi M (1999) Genetic algorithm for minimizing tardiness in flow-shop scheduling. Prod Plan Control 10:462\u2013471","journal-title":"Prod Plan Control"},{"key":"1908_CR28","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1287\/mnsc.31.7.852","volume":"31","author":"PS Ow","year":"1985","unstructured":"Ow PS (1985) Focused scheduling in proportionate flowshops. Manag Sci 31:852\u2013869","journal-title":"Manag Sci"},{"key":"1908_CR29","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/S0305-0548(00)00090-3","volume":"29","author":"JCH Pan","year":"2002","unstructured":"Pan JCH, Chen J-S, Chao C-M (2002) Minimizing tardiness in a two-machine flow-shop. Comput Oper Res 29:869\u2013885","journal-title":"Comput Oper Res"},{"issue":"4","key":"1908_CR30","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1080\/00207729708929401","volume":"28","author":"JCH Pan","year":"1997","unstructured":"Pan JCH, Fan E-T (1997) Two-machine flowshop scheduling to minimize total tardiness. Int J Syst Sci 28(4):405\u2013414","journal-title":"Int J Syst Sci"},{"key":"1908_CR31","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"SS Panwalker","year":"1977","unstructured":"Panwalker SS, Iskander W (1977) A survey of scheduling rules. Oper Res 25:45\u201361","journal-title":"Oper Res"},{"key":"1908_CR32","doi-asserted-by":"crossref","unstructured":"Parthasarathy S, Rajendran C (1997) A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence dependent setup times of jobs-a case study. Prod Plan Control 8:475\u2013483","DOI":"10.1080\/095372897235055"},{"key":"1908_CR33","volume-title":"Scheduling: theory, algorithms and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo M (2008) Scheduling: theory, algorithms and systems. Upper Saddle River, Prentice-Hall"},{"key":"1908_CR34","doi-asserted-by":"crossref","unstructured":"Qian B, Wang L, Huang D-X, Wang W-L, Wang X (2009) An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Comput Oper Res 36(1):209\u2013233","DOI":"10.1016\/j.cor.2007.08.007"},{"key":"1908_CR35","doi-asserted-by":"crossref","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 Oper Res 80:397\u2013403","journal-title":"Eur J Oper Res"},{"issue":"12","key":"1908_CR36","doi-asserted-by":"crossref","first-page":"3273","DOI":"10.1016\/j.cor.2004.05.012","volume":"32","author":"J Schaller","year":"2005","unstructured":"Schaller J (2005) Note on minimizing total tardiness in a two-machine flowshop. Comput Oper Res 32(12):3273\u20133281","journal-title":"Comput Oper Res"},{"key":"1908_CR37","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0305-0548(89)90005-1","volume":"16","author":"T Sen","year":"1989","unstructured":"Sen T, Dileepan P, Gupta JND (1989) The two-machine flowshop scheduling problem with total tardiness. Comput Oper Res 16:333\u2013340","journal-title":"Comput Oper Res"},{"issue":"4","key":"1908_CR38","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359","journal-title":"J Glob Optim"},{"key":"1908_CR39","unstructured":"Ta QC, Billaut J-C, Bouquard J- L (2013) An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem. 2013 IEEE RIVF international conference on computing & communication technologies\u2014research, innovation, and vision for the future (RIVF), pp 198\u2013202"},{"key":"1908_CR40","unstructured":"Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2004) Differential evolution algorithm for permutation flowshop sequencing problem with makespan criterion. In: Proceedings of 4th international symposium on intelligent manufacturing systems, Sakarya, Turkey, 2004"},{"issue":"4","key":"1908_CR41","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1016\/j.cor.2006.08.016","volume":"35","author":"E Vallada","year":"2008","unstructured":"Vallada E, Ruiz R, Minella G (2008) Minimising total tardiness in the $$m$$ m -machine flowshop problem: a review and evaluation of heuristics and metaheuristics. Comput Oper Res 35(4):1350\u20131373","journal-title":"Comput Oper Res"},{"key":"1908_CR42","unstructured":"Wang L, Qian, B (2012) Hybrid differential evolution and scheduling algorithms. Beijing Tsinghua University Press. ISBN 978-7-302-28367-6 (in Chinese)"},{"issue":"7\u20138","key":"1908_CR43","first-page":"743","volume":"31","author":"C-C Wu","year":"2007","unstructured":"Wu C-C, Lee W-C, Wang W-C (2007) A two-machine flowshop maximum tardiness scheduling problem with a learning effect. Int J Adv Manuf Technol 31(7\u20138):743\u2013750","journal-title":"Int J Adv Manuf Technol"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1908-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1908-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1908-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1908-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:43:53Z","timestamp":1559094233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1908-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,29]]},"references-count":43,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1908"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1908-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,29]]}}}