{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T06:31:38Z","timestamp":1747463498464},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_9","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:59:47Z","timestamp":1179208787000},"page":"124-138","source":"Crossref","is-referenced-by-count":7,"title":["Amplification of Search Performance through Randomization of Heuristics"],"prefix":"10.1007","author":[{"given":"Vincent A.","family":"Cicirello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen F.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"E. Bonabeau, M. Dorigo, and G. Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. Santa Fe Institute Studies in the Sciences of Complexity. Oxford University Press, 1999.","DOI":"10.1093\/oso\/9780195131581.001.0001"},{"key":"9_CR2","unstructured":"J. L. Bresina. Heuristic-biased stochastic sampling. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, Volume One, pages 271\u2013278. AAAI Press, 1996."},{"key":"9_CR3","unstructured":"A. Cesta, A. Oddi, and S. F. Smith. An iterative sampling procedure for resource constrained project scheduling with time windows. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 1022\u20131029. Morgan Kaufmann, 1999."},{"key":"9_CR4","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization. McGraw-Hill, 1999.","DOI":"10.1109\/CEC.1999.782657"},{"key":"9_CR6","unstructured":"C. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, pages 431\u2013437. AAAI Press, 1998."},{"key":"9_CR7","unstructured":"W. Harvey and M. Ginsberg. Limited discrepency search. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 607\u2013613. Morgan Kaufmann, 1995."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1080\/07408179708966311","volume":"29","author":"Y. H. Lee","year":"1997","unstructured":"Y. H. Lee, K. Bhaskaran, and M. Pinedo. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29:45\u201352, 1997.","journal-title":"IIE Transactions"},{"key":"9_CR9","unstructured":"T. E. Morton and D. W. Pentico. Heuristic Scheduling Systems: With Applications to Production Systems and Project Management. John Wiley and Sons, 1993."},{"key":"9_CR10","unstructured":"A. Oddi and S. F. Smith. Stochastic procedures for generating feasible schedules. In Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, pages 308\u2013314. AAAI Press, 1997."},{"key":"9_CR11","unstructured":"G. Theraulaz, S. Goss, J. Gervet, and J. L. Deneubourg. Task differentiation in polistes wasp colonies: A model for self-organizing groups of robots. In From Animals to Animats: Proceedings of the First International Conference on Simulation of Adaptive Behavior, pages 346\u2013355. MIT Press, 1991."},{"key":"9_CR12","unstructured":"T. Walsh. Depth-bounded discrepency search. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 1997."},{"key":"9_CR13","unstructured":"J. P. Watson, L. Barbulescu, A. E. Howe, and L. D. Whitley. Algorithm performance and problem structure for flow-shop scheduling. In Proceedings, Sixteenth National Conference on Artificial Intelligence (AAAI-99), Eleventh Innovative Applications of Artificial Intelligence Conference (IAAI-99), pages 688\u2013695. AAAI Press, 1999."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T21:19:51Z","timestamp":1683839991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}