{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:40:54Z","timestamp":1764978054287,"version":"3.46.0"},"reference-count":23,"publisher":"Walter de Gruyter GmbH","issue":"4","license":[{"start":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T00:00:00Z","timestamp":1473897600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>A large number of changeovers exist in multi-item and small lot size production mode, which lead to a long setup time and significantly influence productivity. However, setup time has received significantly less attention in previous studies regarding the single machine scheduling (SMS) problem. This paper investigates the SMS problem with sequence-dependent setup time (SDST). First, a model of SMS-SDST is developed to minimise the makespan. An earliest due date (EDD), SDST, and ant colony optimisation (ACO) heuristic algorithm is presented. In order to evaluate the performance of the proposed algorithm, Taguchi\u2019s robust design method is employed to define the best parameter values. Related results are analysed by statistical tools. The computational experiments are compared with an ACO algorithm and a genetic algorithm. The experimental results and statistical analyses show that the proposed EDD-SDST-ACO is effective for the problem.<\/jats:p>","DOI":"10.1515\/jisys-2016-0019","type":"journal-article","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T09:18:19Z","timestamp":1473931099000},"page":"657-667","source":"Crossref","is-referenced-by-count":2,"title":["Single Machine Scheduling Based on EDD-SDST-ACO Heuristic Algorithm"],"prefix":"10.1515","volume":"26","author":[{"given":"Haicao","family":"Song","sequence":"first","affiliation":[{"name":"College of Mechanical Engineering , Chongqing University , Chongqing , China"},{"name":"College of Mechanical and Electrical Engineering , Shihezi University , Shihezi , China"}]},{"given":"Shuping","family":"Yi","sequence":"additional","affiliation":[{"name":"College of Mechanical Engineering , Chongqing University , Chongqing 400044 , China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5587-3966","authenticated-orcid":false,"given":"Mi","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Mechanical Engineering , Chongqing University , Chongqing , China"}]},{"given":"Gaoyang","family":"Qin","sequence":"additional","affiliation":[{"name":"College of Mechanical Engineering , Chongqing University , Chongqing , China"}]}],"member":"374","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"key":"2025120523365023767_j_jisys-2016-0019_ref_001_w2aab3b7b3b1b6b1ab1b7b1Aa","doi-asserted-by":"crossref","unstructured":"A. Allahverdi, J. N. Gupta and T. Aldowaisan, A review of scheduling research involving setup considerations, Omega27(1999), 219\u2013239.10.1016\/S0305-0483(98)00042-5","DOI":"10.1016\/S0305-0483(98)00042-5"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_002_w2aab3b7b3b1b6b1ab1b7b2Aa","doi-asserted-by":"crossref","unstructured":"B. Almada-Lobo, D. Klabjan, M. A. Carravilla and J. F. Oliveira, Single machine multi-product capacitated lot sizing with sequence-dependent setups, Int. J. Prod. Res.45(2007), 4873\u20134894.10.1080\/00207540601094465","DOI":"10.1080\/00207540601094465"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_003_w2aab3b7b3b1b6b1ab1b7b3Aa","unstructured":"K. R. Baker, Introduction to Sequencing and Scheduling, vol. 15, 1974, Wiley, New York."},{"key":"2025120523365023767_j_jisys-2016-0019_ref_004_w2aab3b7b3b1b6b1ab1b7b4Aa","doi-asserted-by":"crossref","unstructured":"P. Brucker and O. Thiele, A branch and bound method for the general-shop problem with sequence dependent setup-times, Oper.-Res.-Spekt.18(1996), 145\u2013161.10.1007\/BF01539706","DOI":"10.1007\/BF01539706"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_005_w2aab3b7b3b1b6b1ab1b7b5Aa","doi-asserted-by":"crossref","unstructured":"I. Choi and O. Korkmaz, Job shop scheduling with separable sequence-dependent setups, Ann. Oper. Res.70 (1997), 155\u2013170.10.1023\/A:1018918003761","DOI":"10.1023\/A:1018918003761"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_006_w2aab3b7b3b1b6b1ab1b7b6Aa","doi-asserted-by":"crossref","unstructured":"R. Das and D. K. Prasad, Prediction of porosity and thermal diffusivity in a porous fin using differential evolution algorithm, Swarm Evol. Comput.23 (2015), 27\u201339.10.1016\/j.swevo.2015.03.001","DOI":"10.1016\/j.swevo.2015.03.001"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_007_w2aab3b7b3b1b6b1ab1b7b7Aa","doi-asserted-by":"crossref","unstructured":"R. Das and K. T. Ooi, Application of simulated annealing in a rectangular fin with variable heat transfer coefficient, Inverse Prob. Sci. Eng.21 (2013), 1352\u20131367.10.1080\/17415977.2013.764294","DOI":"10.1080\/17415977.2013.764294"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_008_w2aab3b7b3b1b6b1ab1b7b8Aa","doi-asserted-by":"crossref","unstructured":"P. M. Fran\u00e7a, M. Gendreau, G. Laporte and F. M. M\u00fcller, A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times, Int. J. Prod. Econ.43(1996), 79\u201389.10.1016\/0925-5273(96)00031-X","DOI":"10.1016\/0925-5273(96)00031-X"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_009_w2aab3b7b3b1b6b1ab1b7b9Aa","doi-asserted-by":"crossref","unstructured":"C. Gagne, W. L. Prince, and M. Gravel, Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times, J. Oper. Res. Soc.53 (2002), 895\u2013906.10.1057\/palgrave.jors.2601390","DOI":"10.1057\/palgrave.jors.2601390"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_010_w2aab3b7b3b1b6b1ab1b7c10Aa","doi-asserted-by":"crossref","unstructured":"J. Hurink and S. Knust, Makespan minimization for flow-shop problems with transportation times and a single robot, Discr. Appl. Math.112 (2001), 199\u2013216.10.1016\/S0166-218X(00)00316-4","DOI":"10.1016\/S0166-218X(00)00316-4"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_011_w2aab3b7b3b1b6b1ab1b7c11Aa","unstructured":"F. H. Jin, F. S. Kong and D. W. Kim, Scheduling rules for assembly job shop based on machine available time, Comput. Integr. Manuf. Syst.14(2008), 1727\u20131732."},{"key":"2025120523365023767_j_jisys-2016-0019_ref_012_w2aab3b7b3b1b6b1ab1b7c12Aa","doi-asserted-by":"crossref","unstructured":"F. Jolai, M. Rabiee and H. Asefi, A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times, Int. J. Prod. Res.50(2012), 7447\u20137466.10.1080\/00207543.2011.653012","DOI":"10.1080\/00207543.2011.653012"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_013_w2aab3b7b3b1b6b1ab1b7c13Aa","doi-asserted-by":"crossref","unstructured":"B. J. Lageweg, J. K. Lenstra and A. Rinnooy Kan, A general bounding scheme for the permutation flow-shop problem, Oper. Res.26(1978), 53\u201367.10.1287\/opre.26.1.53","DOI":"10.1287\/opre.26.1.53"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_014_w2aab3b7b3b1b6b1ab1b7c14Aa","doi-asserted-by":"crossref","unstructured":"C. Liao and H. Juan, An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups, Comput. Oper. Res.34(2007), 1899\u20131909.10.1016\/j.cor.2005.07.020","DOI":"10.1016\/j.cor.2005.07.020"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_015_w2aab3b7b3b1b6b1ab1b7c15Aa","unstructured":"N. Mandahawi, S. Al-Shihabi and S. Altarazi, A max-min ant system to minimize total tardiness on a single machine with sequence dependent setup times implementing a limited budget local search, Int. J. Res. Rev. Appl. Sci.6 (2011), 30\u201340."},{"key":"2025120523365023767_j_jisys-2016-0019_ref_016_w2aab3b7b3b1b6b1ab1b7c16Aa","doi-asserted-by":"crossref","unstructured":"A. Manikas and Y. Chang, A scatter search approach to sequence-dependent setup times job shop scheduling, Int. J. Prod. Res.47(2009), 5217\u20135236.10.1080\/00207540701805646","DOI":"10.1080\/00207540701805646"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_017_w2aab3b7b3b1b6b1ab1b7c17Aa","doi-asserted-by":"crossref","unstructured":"B. Naderi, M. Zandieh and S. F. Ghomi, A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance, J. Intell. Manuf.20 (2009), 683\u2013694.10.1007\/s10845-008-0157-6","DOI":"10.1007\/s10845-008-0157-6"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_018_w2aab3b7b3b1b6b1ab1b7c18Aa","unstructured":"Q. Niu, T. Zhou, X. Wang and H. Zhang, Clonal selection algorithm for parallel machine scheduling with setup time, J. SE Univ. (Nat. Sci. Ed.) 42(2012), 163\u2013167."},{"key":"2025120523365023767_j_jisys-2016-0019_ref_019_w2aab3b7b3b1b6b1ab1b7c19Aa","doi-asserted-by":"crossref","unstructured":"S. S. Panwalkar, R. A. Dudek and M. L. Smith, Sequencing research and the industrial scheduling problem, in: Symposium on the Theory of Scheduling and Its Applications, Springer, Berlin, 1973.","DOI":"10.1007\/978-3-642-80784-8_2"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_020_w2aab3b7b3b1b6b1ab1b7c20Aa","doi-asserted-by":"crossref","unstructured":"N. Raman, R. V. Rachamadugu and F. B. Talbot, Real-time scheduling of an automated manufacturing center, Eur. J. Oper. Res.40(1989), 222\u2013242.10.1016\/0377-2217(89)90332-9","DOI":"10.1016\/0377-2217(89)90332-9"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_021_w2aab3b7b3b1b6b1ab1b7c21Aa","doi-asserted-by":"crossref","unstructured":"C. Solnon, V. D. Cung, A. Nguyen and C. Artigues, The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF\u20192005 challenge problem, Eur. J. Oper. Res.191 (2008), 912\u2013927.10.1016\/j.ejor.2007.04.033","DOI":"10.1016\/j.ejor.2007.04.033"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_022_w2aab3b7b3b1b6b1ab1b7c22Aa","doi-asserted-by":"crossref","unstructured":"J. K. Wilbrecht and W. B. Prescott, The influence of setup time on job shop performance, Manage. Sci.16 (1969), B-274\u2013B-280.10.1287\/mnsc.16.4.B274","DOI":"10.1287\/mnsc.16.4.B274"},{"key":"2025120523365023767_j_jisys-2016-0019_ref_023_w2aab3b7b3b1b6b1ab1b7c23Aa","doi-asserted-by":"crossref","unstructured":"C. Zhou and P. J. Egbelu, Scheduling in a manufacturing shop with sequence-dependent setups, Robot. Comput. Integr. Manuf.5(1989), 73\u201381.10.1016\/0736-5845(89)90031-8","DOI":"10.1016\/0736-5845(89)90031-8"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/26\/4\/article-p657.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0019\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0019\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:37:22Z","timestamp":1764977842000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0019\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,15]]},"references-count":23,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2016,10,4]]},"published-print":{"date-parts":[[2017,9,26]]}},"alternative-id":["10.1515\/jisys-2016-0019"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2016-0019","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2016,9,15]]}}}