{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:39:52Z","timestamp":1760708392932},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,2,5]],"date-time":"2012-02-05T00:00:00Z","timestamp":1328400000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s11590-012-0448-x","type":"journal-article","created":{"date-parts":[[2012,2,4]],"date-time":"2012-02-04T05:24:23Z","timestamp":1328333063000},"page":"665-684","source":"Crossref","is-referenced-by-count":15,"title":["New heuristics for total tardiness minimization in a flexible flowshop"],"prefix":"10.1007","volume":"7","author":[{"given":"Guilherme B.","family":"Mainieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00e9bora P.","family":"Ronconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,5]]},"reference":[{"key":"448_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0272-6963(82)90020-1","volume":"3","author":"K.R. Baker","year":"1982","unstructured":"Baker K.R., Bertrand J.W.M.: A dynamic priority rule for scheduling against due-dates. J. Oper. Manag. 3, 37\u201342 (1982)","journal-title":"J. Oper. Manag."},{"key":"448_CR2","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1080\/09537289608930364","volume":"7","author":"S.A. Brah","year":"1996","unstructured":"Brah S.A.: A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Prod. Plan. Control 7, 362\u2013373 (1996)","journal-title":"Prod. Plan. Control"},{"key":"448_CR3","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/0377-2217(92)90071-G","volume":"58","author":"C. Chu","year":"1992","unstructured":"Chu C., Portmann M.-C.: Some new efficient methods to solve the n\/1\/ri\/\u2211Ti scheduling problem. Eur. J. Oper. Res. 58, 404\u2013413 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"448_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/1520-6750(199302)40:1<85::AID-NAV3220400106>3.0.CO;2-C","volume":"40","author":"J.S. Davis","year":"1993","unstructured":"Davis J.S., Kanet J.J.: Single machine scheduling with early and tardy completion costs. Naval Res. Logist. 40, 85\u2013101 (1993)","journal-title":"Naval Res. Logist."},{"key":"448_CR5","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"Du J., Leung J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15, 483\u2013495 (1990)","journal-title":"Math. Oper. Res."},{"key":"448_CR6","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1080\/00207549608904972","volume":"34","author":"A. Guinet","year":"1996","unstructured":"Guinet A., Solomon M.M., Kedia P.K., Dussauchoy A.: A computational study of heuristics for two-stage flexible flowshops. Int. J. Prod. Res. 34, 1399\u20131415 (1996)","journal-title":"Int. J. Prod. Res."},{"key":"448_CR7","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1111\/j.1937-5956.2002.tb00492.x","volume":"11","author":"Z.H. Jin","year":"2002","unstructured":"Jin Z.H., Ohno K., Ito T.: Elmaghraby SE scheduling hybrid flowshops in printed circuit board assembly lines. Prod. Oper. Manag. 11, 216\u2013230 (2002)","journal-title":"Prod. Oper. Manag."},{"key":"448_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/B:JOSH.0000031421.64487.95","volume":"7","author":"J.J. Kanet","year":"2004","unstructured":"Kanet J.J., Li X.: A weighted modified due date rule for sequencing to minimize weighted tardiness. J. Schedul. 7, 261\u2013276 (2004)","journal-title":"J. Schedul."},{"key":"448_CR9","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF00121683","volume":"9","author":"U.S. Karmarkar","year":"1996","unstructured":"Karmarkar U.S., Nambimadom R.S.: Material allocation in MRP with tardiness penalties. J. Glob. Optim. 9, 453\u2013482 (1996)","journal-title":"J. Glob. Optim."},{"key":"448_CR10","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0305-0548(94)E0019-4","volume":"22","author":"Y.D. Kim","year":"1995","unstructured":"Kim Y.D.: A backward approach in list scheduling algorithms for multi-machine tardiness problems. Comput. Oper. Res. 22, 307\u2013319 (1995)","journal-title":"Comput. Oper. Res."},{"key":"448_CR11","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","volume":"42","author":"C.P. Koulamas","year":"1994","unstructured":"Koulamas C.P.: The total tardiness problem: review and extensions. Oper. Res. 42, 1025\u20131041 (1994)","journal-title":"Oper. Res."},{"key":"448_CR12","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1057\/palgrave.jors.2601601","volume":"54","author":"G.C. Lee","year":"2003","unstructured":"Lee G.C., Kim Y.D., Kim J.G., Choi S.H.: A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system. J. Oper. Res. Soc. 54, 1038\u20131049 (2003)","journal-title":"J. Oper. Res. Soc."},{"key":"448_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/00207540310001602892","volume":"42","author":"G.C. Lee","year":"2004","unstructured":"Lee G.C., Kim Y.D., Choi S.W.: Bottleneck-focused scheduling for a hybrid flowshop. Int. J. Prod. Res. 42, 165\u2013181 (2004)","journal-title":"Int. J. Prod. Res."},{"key":"448_CR14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","volume":"37","author":"R. Linn","year":"1999","unstructured":"Linn R., Zhang W.: Hybrid flow shop scheduling: a survey. Comput. Ind. Eng. 37, 57\u201361 (1999)","journal-title":"Comput. Ind. Eng."},{"key":"448_CR15","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10898-004-1848-y","volume":"33","author":"L. Narain","year":"2005","unstructured":"Narain L., Bagga P.C.: Flowshop\/no-idle scheduling to minimize total elapsed time. J. Glob. Optim. 33, 349\u2013367 (2005)","journal-title":"J. Glob. Optim."},{"key":"448_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5362-2","volume-title":"Handbook of Applied Optimization","author":"P.M. Pardalos","year":"2002","unstructured":"Pardalos P.M., Resende M.: Handbook of Applied Optimization. Oxford University Press, Oxford (2002)"},{"key":"448_CR17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","volume":"1","author":"C.N. Potts","year":"1982","unstructured":"Potts C.N., Van Wassenhove L.N.: A decomposition algorithm for the single machine total tardiness problem. Oper. Res. Lett. 1, 177\u2013181 (1982)","journal-title":"Oper. Res. Lett."},{"key":"448_CR18","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1016\/j.ejor.2006.01.042","volume":"178","author":"D. Quadt","year":"2007","unstructured":"Quadt D., Kuhn H.: A taxonomy of flexible flow line scheduling procedures. Eur. J. Oper. Res. 178, 686\u2013698 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"448_CR19","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I. Ribas","year":"2010","unstructured":"Ribas I., Leisten R., Framinan J.M.: Review and classification of hybrid flow shop scheduling problems from a production systems and a solutions procedure perspective. Comput. Oper. Res. 37, 1439\u20131454 (2010)","journal-title":"Comput. Oper. Res."},{"key":"448_CR20","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0925-5273(03)00065-3","volume":"87","author":"D.P. Ronconi","year":"2004","unstructured":"Ronconi D.P.: A note on constructive heuristics for the flowshop problem with blocking. Int. J. Prod. Econ. 87, 39\u201348 (2004)","journal-title":"Int. J. Prod. Econ."},{"key":"448_CR21","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10951-009-0160-6","volume":"13","author":"D.P. Ronconi","year":"2010","unstructured":"Ronconi D.P., Powell W.B.: Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming. J. Scheduling 13, 597\u2013607 (2010)","journal-title":"J. Scheduling"},{"key":"448_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R. Ruiz","year":"2010","unstructured":"Ruiz R., V\u00e1zquez-Rodr\u00edguez J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205, 1\u201318 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"448_CR23","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0377-2217(93)E0326-S","volume":"80","author":"D.L. Santos","year":"1995","unstructured":"Santos D.L., Hunsucker J.L., Deal D.E.: Global lower bound for flow shops with multiple processors. Eur. J. Oper. Res. 80, 112\u2013120 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"448_CR24","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0483(84)90011-2","volume":"12","author":"T. Sen","year":"1984","unstructured":"Sen T., Gupta S.K.: A state-of-art survey of static scheduling research involving due dates. OMEGA 12, 63\u201376 (1984)","journal-title":"OMEGA"},{"key":"448_CR25","volume-title":"Nonparametric Statistics for the Behavioral Sciences","author":"S. Siegel","year":"1956","unstructured":"Siegel S.: Nonparametric Statistics for the Behavioral Sciences. McGraw Hill, New York (1956)"},{"key":"448_CR26","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1016\/S0305-0548(96)00025-1","volume":"23","author":"V. Sridharan","year":"1996","unstructured":"Sridharan V., Zhou Z.: Dynamic non-preemptive single machine scheduling. Comput. Oper. Res. 23, 1183\u20131190 (1996)","journal-title":"Comput. Oper. Res."},{"key":"448_CR27","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00121673","volume":"9","author":"W. Szwarc","year":"1996","unstructured":"Szwarc W., Mukhopadhyay S.K.: Earliness and tardiness single machine scheduling with proportional weights. J. Glob. Optim. 9, 227\u2013238 (1996)","journal-title":"J. Glob. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0448-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0448-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0448-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:31Z","timestamp":1559394691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0448-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,5]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["448"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0448-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,5]]}}}