{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:33:01Z","timestamp":1759941181599,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896937"},{"type":"electronic","value":"9783540896944"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89694-4_42","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T10:25:26Z","timestamp":1228818326000},"page":"411-420","source":"Crossref","is-referenced-by-count":9,"title":["Performance Evaluation of an Adaptive Ant Colony Optimization Applied to Single Machine Scheduling"],"prefix":"10.1007","author":[{"given":"Davide","family":"Anghinolfi","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Boccalatte","sequence":"additional","affiliation":[]},{"given":"Massimo","family":"Paolucci","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Vecchiola","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"42_CR2","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms (in Italian). PhD Thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy (1992)"},{"key":"42_CR3","volume-title":"Reinforcement Learning: An Introduction","author":"R.S. Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)"},{"key":"42_CR4","volume-title":"Swarm Intelligence","author":"J. Kennedy","year":"2001","unstructured":"Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann Publishers, San Francisco (2001)"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: Max-min ant system. Future Generation Computer System\u00a016, 889\u2013914 (2000)","journal-title":"Future Generation Computer System"},{"issue":"1","key":"42_CR6","first-page":"1","volume":"5","author":"D. Anghinolfi","year":"2008","unstructured":"Anghinolfi, D., Paolucci, M.: A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem. International Journal of Operations Research\u00a05(1), 1\u201317 (2008)","journal-title":"International Journal of Operations Research"},{"key":"42_CR7","unstructured":"Cicirello, V.A.: Weighted tardiness scheduling with sequence-dependent setups: a benchmark library. Technical Report. Intelligent Coordination and Logistics Laboratory. Robotics Institute. Carnegie Mellon University, USA (2003)"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E.L. Lawler","year":"1997","unstructured":"Lawler, E.L.: A \u2018pseudopolynomial\u2019 algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics\u00a01, 331\u2013342 (1997)","journal-title":"Annals of Discrete Mathematics"},{"key":"42_CR9","doi-asserted-by":"publisher","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 Transaction\u00a029, 45\u201352 (1997)","journal-title":"IIE Transaction"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10732-005-6997-8","volume":"11","author":"V.A. Cicirello","year":"2005","unstructured":"Cicirello, V.A., Smith, S.F.: Enhancing stochastic search performance by value-based randomization of heuristics. Journal of Heuristics\u00a011, 5\u201334 (2005)","journal-title":"Journal of Heuristics"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Cicirello, V.A.: Non-Wrapping Order Crossover: An Order Preserving Crossover Operator that Respects Absolute Position. In: Proceedings of GECCO 2006 Conference, Seattle, WA, USA, pp. 1125\u20131131 (2006)","DOI":"10.1145\/1143997.1144177"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Lin, S.-W., Ying, K.-C.: Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. The International Journal of Advanced Manufacturing Technology (2006)","DOI":"10.1007\/s00170-006-0693-1"},{"key":"42_CR13","doi-asserted-by":"publisher","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. Computers & Operations Research\u00a034, 1899\u20131909 (2007)","journal-title":"Computers & Operations Research"},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01, 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Tasgetiren, M.F., Sevkli, M., Liang, Y.-C., Gencyilmaz, G.: Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of the 2004 Congress on Evolutionary Computation (CEC 2004), Portland, Oregon, pp. 1412\u20131419 (2004)","DOI":"10.1109\/CEC.2004.1331062"},{"key":"42_CR16","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs (1995)"},{"key":"42_CR17","unstructured":"Anghinolfi, D., Paolucci, M.: A new discrete particle swarm optimization approach for the total tardiness scheduling problem. European Journal of Operational Research (2007)"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89694-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T02:47:21Z","timestamp":1738810041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89694-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896937","9783540896944"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89694-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}