{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:56:37Z","timestamp":1760608597919},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,5,26]],"date-time":"2010-05-26T00:00:00Z","timestamp":1274832000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10589-010-9333-7","type":"journal-article","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T16:44:06Z","timestamp":1274805846000},"page":"411-435","source":"Crossref","is-referenced-by-count":12,"title":["A GRASP based on DE to solve single machine scheduling problem with SDST"],"prefix":"10.1007","volume":"51","author":[{"given":"Hanen","family":"Akrout","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bassem","family":"Jarboui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Siarry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelwaheb","family":"Reba\u00ef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,26]]},"reference":[{"key":"9333_CR1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/j.disopt.2008.04.001","volume":"5","author":"L.P. Bigras","year":"2008","unstructured":"Bigras, L.P., Gamache, M., Savard, G.: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optim. 5, 685\u2013699 (2008)","journal-title":"Discrete Optim."},{"key":"9333_CR2","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.ejor.2005.04.038","volume":"175","author":"F.F. Choobineh","year":"2006","unstructured":"Choobineh, F.F., Mohebbi, E., Khoo, H.: A\u00a0multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 175, 318\u2013337 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9333_CR3","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1057\/jors.1995.184","volume":"46","author":"S.R. Das","year":"1995","unstructured":"Das, S.R., Gupta, J.N.D., Khumawala, B.M.: A\u00a0savings index heuristic algorithm for flowshop scheduling with sequence dependent set-up times. J.\u00a0Oper. Res. Soc. 46, 1365\u20131373 (1995)","journal-title":"J.\u00a0Oper. Res. Soc."},{"key":"9333_CR4","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":"9333_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J.\u00a0Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J.\u00a0Glob. Optim."},{"key":"9333_CR6","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/0305-0548(91)90001-8","volume":"18","author":"T.A. Feo","year":"1991","unstructured":"Feo, T.A., Venkatraman, K., Bard, J.F.: A GRASP for a difficult single machine scheduling problem. Comput. Oper. Res. 18, 635\u2013643 (1991)","journal-title":"Comput. Oper. Res."},{"key":"9333_CR7","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1016\/0305-0548(95)00084-4","volume":"23","author":"T.A. Feo","year":"1996","unstructured":"Feo, T.A., Sarathy, K., McGahan, J.: A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties. Comput. Oper. Res. 23, 881\u2013895 (1996)","journal-title":"Comput. Oper. Res."},{"key":"9333_CR8","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: GRASP and VNS for Max-Cut. In: Extended Abstracts of the Fourth Metaheuristics International Conference, pp.\u00a0371\u2013376, Porto, July (2001)"},{"key":"9333_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0925-5273(96)00031-X","volume":"43","author":"P.M. Fran\u00e7a","year":"1996","unstructured":"Fran\u00e7a, P.M., Gendreau, M., Laporte, G., M\u00fcller, F.M.: A\u00a0tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Int. J. Prod. Econ. 43, 79\u201389 (1996)","journal-title":"Int. J. Prod. Econ."},{"key":"9333_CR10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0377-2217(00)00140-5","volume":"132","author":"P.M. Fran\u00e7a","year":"2001","unstructured":"Fran\u00e7a, P.M., Mendes, A., Moscato, P.: A\u00a0memetic algorithm for the total tardiness single machine scheduling problem. Eur. J. Oper. Res. 132, 224\u2013242 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9333_CR11","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.\u00a0Oper. Res. Soc. 53, 895\u2013906 (2002)","journal-title":"J.\u00a0Oper. Res. Soc."},{"key":"9333_CR12","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 multiple-objective scheduling problems. J.\u00a0Oper. Res. Soc. 56, 687\u2013698 (2005)","journal-title":"J.\u00a0Oper. Res. Soc."},{"key":"9333_CR13","doi-asserted-by":"crossref","first-page":"3031","DOI":"10.1080\/00207540050117422","volume":"38","author":"M. Gravel","year":"2000","unstructured":"Gravel, M., Price, W.L., Gagn\u00e9, C.: Scheduling jobs in an alcan aluminium foundry using a genetic algorithm. Int. J. Prod. Res. 38, 3031\u20133041 (2000)","journal-title":"Int. J. Prod. Res."},{"key":"9333_CR14","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, 722\u2013739 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9333_CR15","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9333_CR16","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/S0305-0483(96)00033-3","volume":"24","author":"C.J. Liao","year":"1996","unstructured":"Liao, C.J., Yu, W.C.: Sequencing heuristics for dependent setups in a continuous process industry. Omega\u2014Int. J. Manag. Sci. 24, 649\u2013659 (1996)","journal-title":"Omega\u2014Int. J. Manag. Sci."},{"key":"9333_CR17","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0305-0548(02)00224-1","volume":"31","author":"C.J. Liao","year":"2004","unstructured":"Liao, C.J., Chen, W.J.: Scheduling under machine breakdown in a continuous process industry. Comput. Oper. Res. 31, 415\u2013428 (2004)","journal-title":"Comput. Oper. Res."},{"key":"9333_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 ACO single-machine tardiness scheduling with sequence-dependent setups. Comput. Oper. Res. 34, 1899\u20131909 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9333_CR19","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, 575\u2013588 (2006)","journal-title":"Appl. Math. Comput."},{"key":"9333_CR20","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, 68\u201381 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9333_CR21","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9333_CR22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0305-0483(94)00057-H","volume":"23","author":"C.O. Ozgur","year":"1995","unstructured":"Ozgur, C.O., Brown, J.R.: A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem. Omega\u2014Int. J. Manag. Sci. 23, 205\u2013219 (1995)","journal-title":"Omega\u2014Int. J. Manag. Sci."},{"key":"9333_CR23","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"C.N. Potts","year":"1985","unstructured":"Potts, C.N., Van Wassenhove, L.N.: A branch and bound algorithm for the total weighted tardiness problem. Oper. Res. 33, 363\u2013377 (1985)","journal-title":"Oper. Res."},{"key":"9333_CR24","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 twenty-fourth annual meeting of the Decision Sciences Institute, pp.\u00a01375\u20131377 (1993)"},{"key":"9333_CR25","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, 85\u201399 (1995)","journal-title":"Comput. Oper. Res."},{"key":"9333_CR26","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0377-2217(90)90154-4","volume":"45","author":"W.J. Selen","year":"1990","unstructured":"Selen, W.J., Heuts, R.M.J.: Operational production planning in a chemical manufacturing environment. Eur. J. Oper. Res. 45, 38\u201346 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"9333_CR27","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R. Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J.\u00a0Glob. Optim. 11, 341\u2013359 (1997)","journal-title":"J.\u00a0Glob. Optim."},{"key":"9333_CR28","first-page":"113","volume":"31","author":"X. Sun","year":"1999","unstructured":"Sun, X., Noble, J.S., Klein, C.M.: Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans. 31, 113\u2013124 (1999)","journal-title":"IIE Trans."},{"key":"9333_CR29","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\u2014Int. J. Manag. Sci. 25, 619\u2013634 (1997)","journal-title":"Omega\u2014Int. J. Manag. Sci."},{"key":"9333_CR30","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\u2014Int. J. Manag. Sci. 28, 313\u2013326 (2000)","journal-title":"Omega\u2014Int. J. Manag. Sci."},{"key":"9333_CR31","doi-asserted-by":"crossref","first-page":"7087","DOI":"10.1016\/j.eswa.2008.08.033","volume":"36","author":"K.C. Ying","year":"2009","unstructured":"Ying, K.C., Lin, S.W., Huang, C.Y.: Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Expert Syst. Appl. 36, 7087\u20137092 (2009)","journal-title":"Expert Syst. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-010-9333-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-010-9333-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-010-9333-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:38Z","timestamp":1559288198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-010-9333-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,26]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9333"],"URL":"https:\/\/doi.org\/10.1007\/s10589-010-9333-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,26]]}}}