{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T19:09:36Z","timestamp":1761764976464},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673538"},{"type":"electronic","value":"9783540455615"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45561-2_28","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:49:28Z","timestamp":1195217368000},"page":"290-299","source":"Crossref","is-referenced-by-count":40,"title":["An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Merkle","sequence":"first","affiliation":[]},{"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,11]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"A. Bauer, B. Bullnheimer, R.F. Hartl, C. Strauss: An Ant Colony Optimization Approach for the Single Machine Total Tardiness Problem; in: Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), 6\u20139 July Washington D.C., USA, 1445\u20131450, 1999.","DOI":"10.1109\/CEC.1999.782653"},{"key":"28_CR2","first-page":"39","volume":"34","author":"A. Colorni","year":"1994","unstructured":"A. Colorni, M. Dorigo, V. Maniezzo, M. Trubian: Ant System for Job-Shop Scheduling; JORBEL-Belgian Journal of Operations Research, Statistics and Computer Science, 34: 39\u201353 (1994).","journal-title":"JORBEL-Belgian Journal of Operations Research, Statistics and Computer Science"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"R.K. Congram, C.N. Potts, S. L. van de Velde: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem; submitted to INFORMS Journal on Computing.","DOI":"10.1287\/ijoc.14.1.52.7712"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/ijoc.10.3.341","volume":"10","author":"H.A.J. Crauwels","year":"1998","unstructured":"H.A.J. Crauwels, C.N. Potts, L.N. Van Wassenhove: Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem; INFORMS Journal on Computing, 10: 341\u2013359 (1998).","journal-title":"INFORMS Journal on Computing"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"M. Dorigo, G. Di Caro: The ant colony optimization meta-heuristic; in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, 1999, 11\u201332.","DOI":"10.1109\/CEC.1999.782657"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"M. Dorigo, L. M. Gambardella: Ant colony system: A cooperative learning approach to the travelling salesman problem; IEEE Trans. on Evolutionary Comp., 1: 53\u201366 (1997).","journal-title":"IEEE Trans. on Evolutionary Comp."},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo, V. Maniezzo, A. Colorni: The Ant System: Optimization by a Colony of Cooperating Agents; IEEE Trans. Systems, Man, and Cybernetics \u2014 Part B, 26:29\u201341 (1996).","journal-title":"IEEE Trans. Systems, Man, and Cybernetics \u2014 Part B"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"J. Du, J.Y.-T. Leung: Minimizing the Total Tardiness on One Machine is NP-hard; Mathematics of Operations Research, 15: 483\u2013496 (1990).","journal-title":"Mathematics of Operations Research"},{"key":"28_CR9","unstructured":"P. Forsyth, A. Wren: An Ant System for Bus Driver Scheduling; Report 97.25, University of Leeds-School of Computer Studies, 1997."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"i","author":"E.L. Lawler","year":"1977","unstructured":"E.L. Lawler: A \u2018pseudopolynomial\u2019 algorithm for sequencing jobs to minimize total tardiness; Annals of Discrete Mathematics, i: 331\u2013342 (1977).","journal-title":"Annals of Discrete Mathematics"},{"key":"28_CR11","unstructured":"R. Michels, M. Middendorf: An Ant System for the Shortest Common Supersequence Problem; in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, (1999) 692\u2013701."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1080\/07408179108963868","volume":"23","author":"C.N. Potts","year":"1991","unstructured":"C.N. Potts, L.N. Van Wessenhove: Single machine tardiness sequencing heuristics; IEE Transactions, 23: 346\u2013354 (1991)","journal-title":"IEE Transactions"},{"key":"28_CR13","first-page":"1560","volume-title":"Proc. of the 6th European Congress on Intelligent Techniques & Soft Computing (EUFIT\u2019 98)","author":"T. St\u00fctzle","year":"1998","unstructured":"T. St\u00fctzle: An ant approach for the flow shop problem; in Proc. of the 6th European Congress on Intelligent Techniques & Soft Computing (EUFIT\u2019 98), Vol. 3, Verlag Mainz, Aachen, 1560\u20131564, 1998."},{"key":"28_CR14","unstructured":"http:\/\/mscmga.ms.ic.ac.uk\/jeb\/orlib\/wtinfo.html."}],"container-title":["Lecture Notes in Computer Science","Real-World Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45561-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T11:23:01Z","timestamp":1551093781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45561-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673538","9783540455615"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45561-2_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}