{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T17:59:59Z","timestamp":1770487199383,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"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":["Flex Serv Manuf J"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10696-019-09363-6","type":"journal-article","created":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T14:06:31Z","timestamp":1562076391000},"page":"487-522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Maria Raquel C.","family":"Costa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5917-8880","authenticated-orcid":false,"given":"Jorge M. S.","family":"Valente","sequence":"additional","affiliation":[]},{"given":"Jeffrey E.","family":"Schaller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,2]]},"reference":[{"key":"9363_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0360-8352(95)00166-2","volume":"30","author":"B Alidaee","year":"1996","unstructured":"Alidaee B, Ramakrishnan KR (1996) A computational experiment of COVERT-AU class of rules for single machine tardiness scheduling problem. Comput Ind Eng 30:201\u2013209","journal-title":"Comput Ind Eng"},{"key":"9363_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0272-6963(82)90020-1","volume":"3","author":"KR Baker","year":"1982","unstructured":"Baker KR, Bertrand JWM (1982) A dynamic priority rule for scheduling against due-dates. J Op Manage 3:37\u201342","journal-title":"J Op Manage"},{"key":"9363_CR3","first-page":"467","volume":"18","author":"VM Dalfard","year":"2011","unstructured":"Dalfard VM, Ardakani A, Banihashemi TN (2011) Hybrid genetic algorithm for assembly flow-shop scheduling problem with sequence-dependent setup and transportation times. Tehnicki Vjesnik 18:467\u2013504","journal-title":"Tehnicki Vjesnik"},{"key":"9363_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cor.2015.02.002","volume":"60","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas V, Framinan JM (2015a) NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Comput Op Res 60:27\u201336","journal-title":"Comput Op Res"},{"key":"9363_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.cor.2014.08.004","volume":"53","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas V, Framinan JM (2015b) A new set of high-performing heuristics to minimise flowtime in permutation flowshops. Comput Op Res 53:68\u201380","journal-title":"Comput Op Res"},{"key":"9363_CR6","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.eswa.2016.05.040","volume":"61","author":"V Fernandez-Viagas","year":"2016","unstructured":"Fernandez-Viagas V, Leisten R, Framinan JM (2016) A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime. Expert Syst Appl 61:290\u2013301","journal-title":"Expert Syst Appl"},{"key":"9363_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","volume":"257","author":"V Fernandez-Viagas","year":"2017","unstructured":"Fernandez-Viagas V, Ruiz R, Framinan JM (2017) A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation. Eur J Op Res 257:707\u2013721","journal-title":"Eur J Op Res"},{"key":"9363_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.eswa.2017.10.050","volume":"94","author":"V Fernandez-Viagas","year":"2018","unstructured":"Fernandez-Viagas V, Valente JMS, Framinan JM (2018) Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness. Expert Syst Appl 94:58\u201369","journal-title":"Expert Syst Appl"},{"key":"9363_CR9","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"JM Framinan","year":"2004","unstructured":"Framinan JM, Gupta JND, Leisten R (2004) A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Op Res Soc 55:1243\u20131255","journal-title":"J Op Res Soc"},{"key":"9363_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cor.2016.01.004","volume":"70","author":"TC Gon\u00e7alves","year":"2016","unstructured":"Gon\u00e7alves TC, Valente JMS, Schaller JE (2016) Metaheuristics for the single machine weighted quadratic tardiness scheduling problem. Comput Op Res 70:115\u2013126","journal-title":"Comput Op Res"},{"key":"9363_CR11","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1080\/00207540310001657595","volume":"42","author":"S Hasija","year":"2004","unstructured":"Hasija S, Rajendran C (2004) Scheduling in flowshops to minimize total tardiness of jobs. Int J Prod Res 42:2289\u20132301","journal-title":"Int J Prod Res"},{"key":"9363_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/37.45792","volume":"10","author":"DJ Hoitomt","year":"1990","unstructured":"Hoitomt DJ, Luh PB, Max E, Pattipati KR (1990) Scheduling jobs with simple precedence constraints on parallel machines. IEEE Control Syst Mag 10:34\u201340","journal-title":"IEEE Control Syst Mag"},{"key":"9363_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0305-0483(98)00072-3","volume":"27","author":"JE Holsenback","year":"1999","unstructured":"Holsenback JE, Russell RM, Markland RE, Philipoom PR (1999) An improved heuristic for the single-machine, weighted-tardiness problem. Omega 27:485\u2013495","journal-title":"Omega"},{"key":"9363_CR14","volume-title":"Scheduling a production line to minimize maximum tardiness, Management Science Research Project, Research Report 43","author":"JR Jackson","year":"1955","unstructured":"Jackson JR (1955) Scheduling a production line to minimize maximum tardiness, Management Science Research Project, Research Report 43. University of California, Los Angeles"},{"key":"9363_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/B:JOSH.0000031421.64487.95","volume":"7","author":"JJ Kanet","year":"2004","unstructured":"Kanet JJ, Li XM (2004) A weighted modified due date rule for sequencing to minimize weighted tardiness. J Sched 7:261\u2013276","journal-title":"J Sched"},{"key":"9363_CR16","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2016.06.012","volume":"98","author":"K Karabulut","year":"2016","unstructured":"Karabulut K (2016) A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops. Comput Ind Eng 98:300\u2013307","journal-title":"Comput Ind Eng"},{"key":"9363_CR17","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1109\/9.231461","volume":"38","author":"PB Luh","year":"1993","unstructured":"Luh PB, Hoitomt DJ (1993) Scheduling of manufacturing systems using the Lagrangian relaxation technique. IEEE Trans Autom Control 38:1066\u20131079","journal-title":"IEEE Trans Autom Control"},{"key":"9363_CR18","doi-asserted-by":"publisher","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:91\u201395","journal-title":"Omega"},{"key":"9363_CR19","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.12.006","volume":"70","author":"JS Neufeld","year":"2016","unstructured":"Neufeld JS, Gupta JND, Buscher U (2016) A comprehensive review of flowshop group scheduling literature. Comput Op Res 70:56\u201374","journal-title":"Comput Op Res"},{"key":"9363_CR20","unstructured":"Osman IH, Belouadah H, Fleszar K, Saffar M (2009), Hybrid of the weighted minimum slack and shortest processing time dispatching rules for the total weighted tardiness single machine scheduling problem with availability constraints. In: Paper presented at the MISTA 2009\u2014multidisciplinary international conference on scheduling: theory and applications, Dublin, Ireland"},{"key":"9363_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"PS Ow","year":"1988","unstructured":"Ow PS, Morton TE (1988) Filtered beam search in scheduling. Int J Prod Res 26:35\u201362","journal-title":"Int J Prod Res"},{"key":"9363_CR22","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"SS Panwalkar","year":"1977","unstructured":"Panwalkar SS, Iskander W (1977) Survey of scheduling rules. Op Res 25:45\u201361","journal-title":"Op Res"},{"key":"9363_CR23","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1080\/07408179108963868","volume":"23","author":"CN Potts","year":"1991","unstructured":"Potts CN, van Wassenhove LN (1991) Single-machine tardiness sequencing heuristics. IIE Trans 23:346\u2013354","journal-title":"IIE Trans"},{"key":"9363_CR24","doi-asserted-by":"publisher","first-page":"2895","DOI":"10.1080\/0020754050056417","volume":"43","author":"S Reza Hejazi","year":"2005","unstructured":"Reza Hejazi S, Saghafian S (2005) Flowshop-scheduling problems with makespan criterion: a review. Int J Prod Res 43:2895\u20132929","journal-title":"Int J Prod Res"},{"key":"9363_CR25","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Op Res 165:479\u2013494","journal-title":"Eur J Op Res"},{"key":"9363_CR26","doi-asserted-by":"publisher","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 Op Res 187:1143\u20131159","journal-title":"Eur J Op Res"},{"key":"9363_CR27","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/j.cor.2011.07.018","volume":"39","author":"J Schaller","year":"2012","unstructured":"Schaller J, Valente JMS (2012) Minimizing the weighted sum of squared tardiness on a single machine. Comput Op Res 39:919\u2013928","journal-title":"Comput Op Res"},{"key":"9363_CR28","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.cie.2018.03.036","volume":"119","author":"J Schaller","year":"2018","unstructured":"Schaller J, Valente JMS (2018) Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines. Comput Ind Eng 119:146\u2013156","journal-title":"Comput Ind Eng"},{"key":"9363_CR29","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist Q 3:59\u201366","journal-title":"Naval Res Logist Q"},{"key":"9363_CR30","first-page":"113","volume":"31","author":"XQ Sun","year":"1999","unstructured":"Sun XQ, Noble JS, Klein CM (1999) Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans 31:113\u2013124","journal-title":"IIE Trans"},{"key":"9363_CR31","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s00170-010-3094-4","volume":"55","author":"Y Sun","year":"2011","unstructured":"Sun Y, Zhang C, Gao L, Wang X (2011) Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects. Int J Adv Manuf Technol 55:723\u2013739","journal-title":"Int J Adv Manuf Technol"},{"key":"9363_CR32","volume-title":"Introduction to quality engineering: designing quality into products and processes","author":"G Taguchi","year":"1986","unstructured":"Taguchi G (1986) Introduction to quality engineering: designing quality into products and processes. Asian Productivity Organization, Tokio"},{"key":"9363_CR33","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Op Res 64:278\u2013285","journal-title":"Eur J Op Res"},{"key":"9363_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0925-5273(01)00119-0","volume":"74","author":"CS Thomalla","year":"2001","unstructured":"Thomalla CS (2001) Job shop scheduling with alternative process plans. Int J Prod Econ 74:125\u2013134","journal-title":"Int J Prod Econ"},{"key":"9363_CR35","doi-asserted-by":"publisher","first-page":"3696","DOI":"10.1016\/j.cor.2007.04.006","volume":"35","author":"JMS Valente","year":"2008","unstructured":"Valente JMS, Alves RAFS (2008) Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Comput Op Res 35:3696\u20133713","journal-title":"Comput Op Res"},{"key":"9363_CR36","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1016\/j.cor.2011.11.005","volume":"39","author":"JMS Valente","year":"2012","unstructured":"Valente JMS, Schaller JE (2012) Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. Comput Op Res 39:2223\u20132231","journal-title":"Comput Op Res"},{"key":"9363_CR37","doi-asserted-by":"publisher","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"},{"key":"9363_CR38","doi-asserted-by":"publisher","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. Comput Op Res 35:1350\u20131373","journal-title":"Comput Op Res"},{"key":"9363_CR39","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"APJ Vepsalainen","year":"1987","unstructured":"Vepsalainen APJ, Morton TE (1987) Priority rules for job shops with weighted tardiness costs. Manage Sci 33:1035\u20131047","journal-title":"Manage Sci"},{"key":"9363_CR40","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0305-0548(98)00048-3","volume":"26","author":"A Volgenant","year":"1999","unstructured":"Volgenant A, Teerhuis E (1999) Improved heuristics for the n-job single-machine weighted tardiness problem. Comput Op Res 26:35\u201344","journal-title":"Comput Op Res"}],"container-title":["Flexible Services and Manufacturing Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10696-019-09363-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10696-019-09363-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10696-019-09363-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,16]],"date-time":"2020-08-16T16:21:29Z","timestamp":1597594889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10696-019-09363-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,2]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["9363"],"URL":"https:\/\/doi.org\/10.1007\/s10696-019-09363-6","relation":{},"ISSN":["1936-6582","1936-6590"],"issn-type":[{"value":"1936-6582","type":"print"},{"value":"1936-6590","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,2]]},"assertion":[{"value":"2 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}