{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T11:11:37Z","timestamp":1768734697315,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T00:00:00Z","timestamp":1423094400000},"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":["J Intell Manuf"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10845-015-1046-4","type":"journal-article","created":{"date-parts":[[2015,2,4]],"date-time":"2015-02-04T10:41:50Z","timestamp":1423046510000},"page":"617-628","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem"],"prefix":"10.1007","volume":"29","author":[{"given":"Quang Chieu","family":"Ta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Charles","family":"Billaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Louis","family":"Bouquard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,5]]},"reference":[{"key":"1046_CR1","doi-asserted-by":"crossref","unstructured":"Della Croce, F., Grosso, A., & Salassa, F. (2011). A matheuristic approach for the total completion time two-machines permutation flow-shop problem. In Lecture Notes in Computer Science, 6622 LNCS, (pp. 38\u201347).","DOI":"10.1007\/978-3-642-20364-0_4"},{"key":"1046_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:HEUR.0000019987.10818.e0","volume":"10","author":"F Della Croce","year":"2004","unstructured":"Della Croce, F., Ghirardi, M., & Tadei, R. (2004). Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems. Journal of Heuristics, 10, 89\u2013104.","journal-title":"Journal of Heuristics"},{"key":"1046_CR3","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"19","author":"J Du","year":"1990","unstructured":"Du, J., & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 19, 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"key":"1046_CR4","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison-Welsey."},{"key":"1046_CR5","doi-asserted-by":"crossref","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J Grabowski","year":"2004","unstructured":"Grabowski, J., & Wodecki, M. (2004). A very fast tabu search algorithm for the permutation flow-shop problem with makespan criterion. Computers and Operations Research, 31, 1891\u20131909.","journal-title":"Computers and Operations Research"},{"key":"1046_CR6","volume-title":"Adaptation in natural and artificial systems","author":"JA Holland","year":"1975","unstructured":"Holland, J. A. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan."},{"key":"1046_CR7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10852-008-9101-1","volume":"8","author":"A Jouglet","year":"2009","unstructured":"Jouglet, A., Oguz, C., & Sevaux, M. (2009). Hybrid flow-shop: A memetic algorithm using constraint-based scheduling for efficient search. Journal of Mathematical Modelling and Algorithms, 8, 271\u2013292.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"1046_CR8","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0305-0548(93)90083-U","volume":"20","author":"YD Kim","year":"1993","unstructured":"Kim, Y. D. (1993). A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Computers and Operations Research, 20, 391\u2013401.","journal-title":"Computers and Operations Research"},{"key":"1046_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1057\/jors.1993.3","volume":"44","author":"YD Kim","year":"1993","unstructured":"Kim, Y. D. (1993). Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of the Operational Research Society, 44, 19\u201328.","journal-title":"Journal of the Operational Research Society"},{"key":"1046_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0305-0548(97)00028-2","volume":"25","author":"C Koulamas","year":"1998","unstructured":"Koulamas, C. (1998). A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem. Computers and Operations Research, 25, 83\u201389.","journal-title":"Computers and Operations Research"},{"key":"1046_CR11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"1046_CR12","doi-asserted-by":"crossref","first-page":"3099","DOI":"10.1016\/j.cor.2005.11.017","volume":"34","author":"CJ Liao","year":"2007","unstructured":"Liao, C. J., Tseng, C. T., & Luarn, P. (2007). A discrete version of particle swarm optimization for flowshop scheduling problems. Computers and Operations Research, 34, 3099\u20133111.","journal-title":"Computers and Operations Research"},{"key":"1046_CR13","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., Stutzle, T., & Vo\u00df, S. (Eds.). (2010). Matheuristics: Hybridizing metaheuristics and mathematical programming. Annals of Information Systems (Vol. 10). Springer.","DOI":"10.1007\/978-1-4419-1306-7"},{"issue":"1","key":"1046_CR14","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, E, Jr, & Ham, T. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, The International Journal of Management Science, 11(1), 91\u201395.","journal-title":"OMEGA, The International Journal of Management Science"},{"key":"1046_CR15","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., & Smutnicki, C. (1996). A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research, 91, 160\u2013175.","journal-title":"European Journal of Operational Research"},{"key":"1046_CR16","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1080\/095372899232993","volume":"10","author":"GC Onwubolu","year":"1999","unstructured":"Onwubolu, G. C., & Mutingi, M. (1999). Genetic algorithm for minimizing tardiness in flow-shop scheduling. Production Planning and Control, 10, 462\u2013471.","journal-title":"Production Planning and Control"},{"key":"1046_CR17","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I Osman","year":"1989","unstructured":"Osman, I., & Potts, C. (1989). Simulated annealing for permutation flow-shop scheduling. Omega, 17, 551\u2013557.","journal-title":"Omega"},{"key":"1046_CR18","doi-asserted-by":"crossref","unstructured":"Pan, J. C. H., & Fan, E. T. (1997). Two-machine flowshop scheduling to minimize total tardiness. International Journal of Systems Science, 28, 405\u2013414.","DOI":"10.1080\/00207729708929401"},{"key":"1046_CR19","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/S0305-0548(00)00090-3","volume":"29","author":"JCH Pan","year":"2002","unstructured":"Pan, J. C. H., Chen, J. S., & Chao, C. M. (2002). Minimizing tardiness in a two-machine flow-shop. Computers and Operations Research, 29, 869\u2013885.","journal-title":"Computers and Operations Research"},{"key":"1046_CR20","doi-asserted-by":"crossref","unstructured":"Pessan, C., Bouquard, J. L., & N\u00e9ron, E. (2008). Genetic branch-and-bound or exact genetic algorithm? In N. Monmarch\u00e9, et al. (Eds.), EA 2007, LNCS 4926 (pp. 136\u2013147).","DOI":"10.1007\/978-3-540-79305-2_12"},{"key":"1046_CR21","volume-title":"Scheduling theory, algorithms, and system","author":"M Pinedo","year":"1995","unstructured":"Pinedo, M. (1995). Scheduling theory, algorithms, and system. Upper Saddle River: Prentice Hall."},{"key":"1046_CR22","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0377-2217(97)00333-0","volume":"107","author":"MC Portmann","year":"1998","unstructured":"Portmann, M. C., Vignier, A., Dardilhac, D., & Dezalay, D. (1998). Branch and bound crossed with GA to solve hybrid flowshops. European Journal of Operational Research, 107, 389\u2013400.","journal-title":"European Journal of Operational Research"},{"key":"1046_CR23","volume-title":"Production scheduling","author":"MC Portmann","year":"2008","unstructured":"Portmann, M. C., & Vignier, A. (2008). Chapter 4: Genetic algorithm and scheduling. In P. Lopez & F. Roubellat (Eds.), Production scheduling. New York: Wiley."},{"key":"1046_CR24","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","volume":"1","author":"CN Potts","year":"1982","unstructured":"Potts, C. N., & Van Wassenhove, L. N. (1982). A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 1, 177\u201381.","journal-title":"Operations Research Letters"},{"key":"1046_CR25","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, J. N. D. (1989). The two-machine flowshop scheduling problem with total tardiness. Computers and Operations Research, 16, 333\u2013340.","journal-title":"Computers and Operations Research"},{"key":"1046_CR26","unstructured":"Ta, Q. C., Billaut, J. C., & Bouquard, J. L. (2013). Recovering beam search and Matheuristic algorithms for the \n                        $$F2{\\Vert } \\sum T_j$$\n                        \n                            \n                                \n                                    F\n                                    2\n                                    \u2016\n                                    \u2211\n                                    \n                                        T\n                                        j\n                                    \n                                \n                            \n                        \n                     scheduling problem. In 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP\u201913). France: Pont \u00e0 Mousson."},{"key":"1046_CR27","volume-title":"Hybrid metaheuristics, studies in computational intelligence","year":"2013","unstructured":"Talbi, E. G. (Ed.). (2013). Hybrid metaheuristics, studies in computational intelligence. Berlin: Springer."},{"key":"1046_CR28","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren, M. F., Liang, Y. C., Sevkli, M., & Gencyilmaz, G. (2007). A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research, 177, 1930\u20131947.","journal-title":"European Journal of Operational Research"},{"key":"1046_CR29","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-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers and Operations Research, 35, 1350\u20131373.","journal-title":"Computers and Operations Research"},{"key":"1046_CR30","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.omega.2009.04.002","volume":"38","author":"E Vallada","year":"2010","unstructured":"Vallada, E., & Ruiz, R. (2010). Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega, 38, 57\u201367.","journal-title":"Omega"},{"issue":"2","key":"1046_CR31","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/nav.3800060205","volume":"6","author":"R Wagner","year":"1959","unstructured":"Wagner, R. (1959). An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly, 6(2), 131\u2013140.","journal-title":"Naval Research Logistics Quarterly"},{"key":"1046_CR32","unstructured":"Werner, F. (1984). On the solution of special sequencing problems. In Ph.D. Thesis, TU Magdeburg in German."}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1046-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-015-1046-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1046-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1046-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:12:05Z","timestamp":1559254325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-015-1046-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,5]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1046"],"URL":"https:\/\/doi.org\/10.1007\/s10845-015-1046-4","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,5]]}}}