{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T08:29:49Z","timestamp":1771748989758,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T00:00:00Z","timestamp":1318032000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10898-011-9793-z","type":"journal-article","created":{"date-parts":[[2011,10,7]],"date-time":"2011-10-07T18:59:41Z","timestamp":1318013981000},"page":"791-812","source":"Crossref","is-referenced-by-count":18,"title":["A BB&amp;R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times"],"prefix":"10.1007","volume":"54","author":[{"given":"Edward C.","family":"Sewell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason J.","family":"Sauppe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David R.","family":"Morrison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gio K.","family":"Kao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,8]]},"reference":[{"issue":"3","key":"9793_CR1","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A. Allahverdi","year":"2008","unstructured":"Allahverdi A., Ng C.T., Cheng T.C.E., Kovalyov M.Y.: A survey of scheduling problems with setup time or cost. Eur. J. Oper. Res. 187(3), 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"9793_CR2","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1080\/095372800432188","volume":"11","author":"V.A. Armentano","year":"2000","unstructured":"Armentano V.A., Mazzini R.: A genetic algorithm for scheduling on a single machine with set-up times and due dates. Prod. Plan. Control 11(7), 713\u2013720 (2000)","journal-title":"Prod. Plan. Control"},{"key":"9793_CR3","volume-title":"Integrated Production Control Systems: Management, Analysis Design","author":"D. Bedworth","year":"1987","unstructured":"Bedworth D., Bailey J.: Integrated Production Control Systems: Management, Analysis Design. Wiley, New York (1987)"},{"key":"9793_CR4","volume-title":"Scheduling Algorithms, 2nd edn","author":"P. Brucker","year":"1999","unstructured":"Brucker P.: Scheduling Algorithms, 2nd edn. Springer, Heidelberg (1999)"},{"issue":"5","key":"9793_CR5","first-page":"221","volume":"17","author":"S. Chang","year":"1995","unstructured":"Chang S., Lu Q., Tang G., Yu W.: On decomposition of the total tardiness problem. Oper. Res. 17(5), 221\u2013229 (1995)","journal-title":"Oper. Res."},{"issue":"3","key":"9793_CR6","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(3), 483\u2013495 (1990)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9793_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0305-0548(90)90040-E","volume":"17","author":"F.F. Easton","year":"1990","unstructured":"Easton F.F.: A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem. Comput. Oper. Res. 17(2), 163\u2013175 (1990)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"9793_CR8","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1057\/palgrave.jors.2601390","volume":"53","author":"C. Gagn\u00e9","year":"2002","unstructured":"Gagn\u00e9 C., Price W.L., Gravel M.: Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. J. Oper. Res. Soc. 53(8), 895\u2013906 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"9793_CR9","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1057\/palgrave.jors.2601868","volume":"56","author":"C. Gagn\u00e9","year":"2005","unstructured":"Gagn\u00e9 C., Gravel M., Price W.L.: Using metaheuristic compromise programming for the solution of multi-objective scheduling problems. J. Oper. Res. Soc. 56(6), 687\u2013698 (2005)","journal-title":"J. Oper. Res. Soc."},{"key":"9793_CR10","volume-title":"Integer Programming","author":"R. Garfinkel","year":"1972","unstructured":"Garfinkel R., Nemhauser G.: Integer Programming. Wiley, New York (1972)"},{"key":"9793_CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"Graham R., Lawler E., Lenstra J., Rinnooy Kan A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"2","key":"9793_CR12","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.ejor.2005.05.018","volume":"175","author":"S.R. Gupta","year":"2006","unstructured":"Gupta S.R., Smith J.S.: Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur. J. Oper. Res. 175(2), 722\u2013739 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9793_CR13","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"A. Jouglet","year":"2004","unstructured":"Jouglet A., Baptiste P., Carlier J.: Branch-and-bound algorithms for total weighted tardiness. In: Leung, J.Y-T. (eds) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press, Boca Raton (2004)"},{"issue":"2","key":"9793_CR14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10951-008-0087-3","volume":"12","author":"G.K. Kao","year":"2009","unstructured":"Kao G.K., Sewell E.C., Jacobson S.H.: A branch, bound, and remember algorithm for the $${1|r_{i}|\\sum t_{i} }$$ scheduling problem. J. Sched. 12(2), 163\u2013175 (2009)","journal-title":"J. Sched."},{"key":"9793_CR15","doi-asserted-by":"crossref","unstructured":"Kao, G.K., Sewell, E.C., Jacobson, S.H., Hall, S.N.: New Dominance Rules and Exploration Strategies for the $${1|r_{i}|\\sum U_{i}}$$ Scheduling Problem. Technical Report, Department of Computer Science, University of Illinois at Urbana Champaign (2010)","DOI":"10.1007\/s10589-010-9378-7"},{"key":"9793_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E.L. Lawler","year":"1977","unstructured":"Lawler E.L.: A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness. Ann. Discret. Math. 1, 331\u2013342 (1977)","journal-title":"Ann. Discret. Math."},{"issue":"1","key":"9793_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1080\/07408179708966311","volume":"29","author":"Y.H. Lee","year":"1997","unstructured":"Lee Y.H., Bhaskaran K., Pinedo M.: A heuristic to minimize the total weighted tardiness with sequence dependent setups. IIE Trans. 29(1), 45\u201352 (1997)","journal-title":"IIE Trans."},{"key":"9793_CR18","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.cor.2005.07.020","volume":"34","author":"C.J. Liao","year":"2007","unstructured":"Liao C.J., Juan H.C.: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Comput. Oper. Res. 34, 1899\u20131909 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"9793_CR19","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1007\/s00170-006-0693-1","volume":"34","author":"S.W. Lin","year":"2007","unstructured":"Lin S.W., Ying K.C.: Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. Int. J. Adv. Manuf. Technol. 34(11), 1183\u20131190 (2007)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"8","key":"9793_CR20","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1057\/palgrave.jors.2602434","volume":"59","author":"S.W. Lin","year":"2008","unstructured":"Lin S.W., Ying K.C.: A hybrid approach for single-machine tardiness problems with sequence-dependent setup times. J. Oper. Res. Soc. 59(8), 1109\u20131119 (2008)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9793_CR21","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.amc.2006.05.127","volume":"183","author":"X. Luo","year":"2006","unstructured":"Luo X., Chu F.: A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness. Appl. Math. Comput. 183(1), 575\u2013588 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"9793_CR22","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.ejor.2005.06.069","volume":"180","author":"X. Luo","year":"2007","unstructured":"Luo X., Chu C.: A branch and bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness. Eur. J. Oper. Res. 180(1), 68\u201381 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"17","key":"9793_CR23","doi-asserted-by":"crossref","first-page":"3367","DOI":"10.1080\/00207540500543257","volume":"44","author":"X. Luo","year":"2006","unstructured":"Luo X., Chu C., Wang C.: Some dominance properties for single-machine tardiness problem with sequence-dependent setup. Int. J. Prod. Res. 44(17), 3367\u20133378 (2006)","journal-title":"Int. J. Prod. Res."},{"key":"9793_CR24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1038\/218019a0","volume":"218","author":"D. Michie","year":"1968","unstructured":"Michie D.: Memo functions and machine learning. Nature 218, 19\u201322 (1968)","journal-title":"Nature"},{"issue":"4","key":"9793_CR25","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.24.4.611","volume":"24","author":"T. Morin","year":"1976","unstructured":"Morin T., Marsten R.: Branch-and-bound strategies for dynamic programming. Oper. Res. 24(4), 611\u2013627 (1976)","journal-title":"Oper. Res."},{"key":"9793_CR26","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-642-80784-8_2","volume-title":"Symposium on the Theory of Scheduling and its Applications","author":"S.S. Panwalkar","year":"1973","unstructured":"Panwalkar S.S., Dudek R.A., Smith M.L.: Sequencing research and the industrial scheduling problem. In: Elmaghraby, E. (eds) Symposium on the Theory of Scheduling and its Applications, pp. 29\u201338. Springer, Berlin (1973)"},{"key":"9793_CR27","volume-title":"Complexity in Numerical Optimization","year":"1993","unstructured":"Pardalos, P.M. (eds): Complexity in Numerical Optimization. World Scientific, Singapore (1993)"},{"key":"9793_CR28","volume-title":"Handbook of Applied Optimization","year":"2002","unstructured":"Pardalos, P.M., Resende, M.G.C. (eds): Handbook of Applied Optimization. Oxford University Press, New York (2002)"},{"issue":"5","key":"9793_CR29","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(5), 177\u2013182 (1982)","journal-title":"Oper. Res. Lett."},{"key":"9793_CR30","unstructured":"Ragatz, G.L.: A branch and bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times. In: Proceedings of the 24th Annual Meeting of the Decision Sciences Institute, pp. 1375\u20131377 (1993)"},{"issue":"1","key":"9793_CR31","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0305-0548(93)E0021-K","volume":"22","author":"P.A. Rubin","year":"1995","unstructured":"Rubin P.A., Ragatz G.L.: Scheduling in a sequence dependent setup environment with genetic search. Comput. Oper. Res. 22(1), 85\u201399 (1995)","journal-title":"Comput. Oper. Res."},{"key":"9793_CR32","doi-asserted-by":"crossref","unstructured":"Sellers, D.W.: A survey of approaches to the job shop scheduling problem. In: 28th Southeastern Symposium on System Theory, pp. 396\u2013400. IEEE Computer Society, Washington (1996)","DOI":"10.1109\/SSST.1996.493536"},{"key":"9793_CR33","doi-asserted-by":"crossref","unstructured":"Souissi, A., Chu, C.: Minimizing total tardiness on a single machine with sequence-dependent setup times. In: 2004 IEEE International Conference on Systems, Man and Cybernetics, pp. 1481\u20131485. IEEE Computer Society, Hague (2004)","DOI":"10.1109\/ICSMC.2004.1399840"},{"key":"9793_CR34","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199903\/04)2:2<55::AID-JOS14>3.0.CO;2-5","volume":"2","author":"W. Szwarc","year":"1999","unstructured":"Szwarc W., Della Croce F., Grosso A.: Solution of the single-machine total tardiness problem. J. Sched. 2, 55\u201371 (1999)","journal-title":"J. Sched."},{"issue":"6","key":"9793_CR35","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/S0305-0483(97)00024-8","volume":"25","author":"K.C. Tan","year":"1997","unstructured":"Tan K.C., Narasimhan R.: Minimizing tardiness on a single processor with sequence dependent setup times: a simulated annealing approach. Omega 25(6), 619\u2013634 (1997)","journal-title":"Omega"},{"issue":"3","key":"9793_CR36","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0305-0483(99)00050-X","volume":"28","author":"K.C. Tan","year":"2000","unstructured":"Tan K.C., Narasimhan R., Rubin P.A., Ragatz G.L.: A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times. Omega 28(3), 313\u2013326 (2000)","journal-title":"Omega"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9793-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-011-9793-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9793-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T15:51:46Z","timestamp":1741794706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9793-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,8]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9793"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9793-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,8]]}}}