{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T22:20:24Z","timestamp":1780957224998,"version":"3.54.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031199448","type":"print"},{"value":"9783031199455","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-19945-5_8","type":"book-chapter","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T16:04:20Z","timestamp":1666022660000},"page":"86-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Simulated Annealing and Tabu Search for Solving the Single Machine Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Adriana","family":"Mexicano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jes\u00fas C.","family":"Carmona-Frausto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascual N.","family":"Montes-Dorantes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salvador","family":"Cervantes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9-Antonio","family":"Cervantes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ricardo","family":"Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.3390\/app11052069","volume":"11","author":"M Uchronski","year":"2021","unstructured":"Uchronski, M.: Parallel algorithm with blocks for a single-machine total weighted tardiness scheduling problem. Appl. Sci. 11, 2069 (2021). https:\/\/doi.org\/10.3390\/app11052069","journal-title":"Appl. Sci."},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1007\/s12065-020-00556-9","volume":"14","author":"S Gupta","year":"2021","unstructured":"Gupta, S., Kumari, R., Singh, R.P.: Lunar cycle inspired PSO for single machine total weighted tardiness scheduling problem. Evol. Intell. 14(3), 1355\u20131366 (2021). https:\/\/doi.org\/10.1007\/s12065-020-00556-9","journal-title":"Evol. Intell."},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","volume":"30","author":"J Zhang","year":"2017","unstructured":"Zhang, J., Ding, G., Zou, Y., Qin, S., Fu, J.: Review of job shop scheduling research and its new perspectives under Industry 4.0. J. Intell. Manuf. 30(4), 1809\u20131830 (2017). https:\/\/doi.org\/10.1007\/s10845-017-1350-2","journal-title":"J. Intell. Manuf."},{"key":"8_CR4","first-page":"483","volume":"35","author":"D Jianzhong","year":"1990","unstructured":"Jianzhong, D., Leung, J.: Minimizing total tardiness on one machine is np-hard. Math. Oper. Res. 35, 483\u2013495 (1990)","journal-title":"Math. Oper. Res."},{"key":"8_CR5","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1741716","author":"S Jun","year":"2020","unstructured":"Jun, S., Lee, S.: Learning dispatching rules for single machine scheduling with dynamic arrivals based on decision trees and feature construction. Int. J. Prod. Res. (2020). https:\/\/doi.org\/10.1080\/00207543.2020.1741716","journal-title":"Int. J. Prod. Res."},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Gonz\u00e1lez, M., Vela, C.: An efficient memetic algorithm for total weighted tardiness minimization in a single machine with setups, Appl. Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2015.07.050","DOI":"10.1016\/j.asoc.2015.07.050"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Abitz1, D., Hartmann, T., Middendorf, M.: A weighted population update rule for PACO applied to the single machine total weighted tardiness problem. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 4\u201312, June 2020. https:\/\/doi.org\/10.1145\/3377930.3390182","DOI":"10.1145\/3377930.3390182"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1016\/j.ejor.2005.10.030","volume":"176","author":"\u00dc Bilge","year":"2007","unstructured":"Bilge, \u00dc., Kurtulan, M., K\u0131rac, F.: A Tabu search algorithm for the single machine total weighted tardiness problem. Eur. J. Oper. Res. 176(3), 1423\u20131435 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR9","volume-title":"Evolutionary Optimization Algorithms","author":"D Simon","year":"2013","unstructured":"Simon, D.: Evolutionary Optimization Algorithms. Wiley, New York (2013)"},{"key":"8_CR10","unstructured":"Beasley, J.E.: OR-library. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html. Accessed May 2022"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1080\/00207543.2012.663945","volume":"51","author":"J Schaller","year":"2013","unstructured":"Schaller, J., Valente, J.: A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimize total earliness and tardiness. Int. J. Prod. Res. 51(3), 772\u2013779 (2013)","journal-title":"Int. J. Prod. Res."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussaid","year":"2013","unstructured":"Boussaid, I., Lepagnot, J., Siarry, P.: A survey on optimization metaheuristics. Inf. Sci. 237, 82\u2013117 (2013)","journal-title":"Inf. Sci."},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1080\/07408179708966311","volume":"29","author":"YH Lee","year":"1997","unstructured":"Lee, Y.H., Bhaskaran, K., Pinedo, M.: A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IEEE Trans. 29(1), 45\u201352 (1997)","journal-title":"IEEE Trans."},{"issue":"7","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1016\/j.apm.2006.03.030","volume":"31","author":"T Eren","year":"2007","unstructured":"Eren, T., G\u00fcner, E.: Minimizing total tardiness in a scheduling problem with a learning effect. Appl. Math. Model. 31(7), 1351\u20131361 (2007)","journal-title":"Appl. Math. Model."},{"issue":"1","key":"8_CR15","first-page":"25","volume":"14","author":"O Suescun","year":"2009","unstructured":"Suescun, O., Yesid, B., Agudelo, R.A., Delgadillo, G., et al.: Minimizaci\u00f3n de la tardanza ponderada total en talleres de manufactura aplicando colonia de hormigas. Ingenier\u00eda 14(1), 25\u201330 (2009)","journal-title":"Ingenier\u00eda"},{"issue":"5","key":"8_CR16","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.cor.2010.09.014","volume":"38","author":"R Zhang","year":"2011","unstructured":"Zhang, R., Wu, C.: A Simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective. Comput. Oper. Res. 38(5), 854\u2013867 (2011)","journal-title":"Comput. Oper. Res."},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Li, D., Hsu, P., Chang, C., A genetic algorithm-based approach for single-machine scheduling with learning effect and release time. Math. Problems Eng. 2014 (2014). https:\/\/doi.org\/10.1155\/2014\/249493","DOI":"10.1155\/2014\/249493"},{"issue":"3","key":"8_CR18","first-page":"44","volume":"35","author":"H Nazif","year":"2009","unstructured":"Nazif, H., Lee, L.S.: A genetic algorithm on single machine scheduling problem to minimize total weighted completion time. Eur. J. Sci. Res. 35(3), 44\u2013452 (2009)","journal-title":"Eur. J. Sci. Res."},{"issue":"2","key":"8_CR19","first-page":"125","volume":"8","author":"A Bauer","year":"2000","unstructured":"Bauer, A., Bullnheimer, B., Hartl, R.F., Strauss, C.: Minimizing total tardiness on a single machine using ant colony optimization. Cent. Eur. J. Oper. Res. 8(2), 125\u2013141 (2000)","journal-title":"Cent. Eur. J. Oper. Res."},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.ejor.2021.09.039","volume":"298","author":"R Bryant","year":"2022","unstructured":"Bryant, R., Lakner, P., Pinedo, M.: On the optimality of the earliest due date rule in stochastic scheduling and in queueing. Eur. J. Oper. Res. 298(1), 202\u2013212 (2022)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Networks and Systems","Advances on P2P, Parallel, Grid, Cloud and Internet Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19945-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T16:06:30Z","timestamp":1666022790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19945-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,18]]},"ISBN":["9783031199448","9783031199455"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19945-5_8","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"value":"2367-3370","type":"print"},{"value":"2367-3389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,18]]},"assertion":[{"value":"18 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"3PGCIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tirana","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Albania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pgcic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/3pgcic\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}