{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:16:13Z","timestamp":1761894973994},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049170"},{"type":"electronic","value":"9783642049187"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04918-7_3","type":"book-chapter","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T02:08:27Z","timestamp":1254794907000},"page":"30-44","source":"Crossref","is-referenced-by-count":12,"title":["Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling"],"prefix":"10.1007","author":[{"given":"Dhananjay","family":"Thiruvady","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Blum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Ernst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"520","volume-title":"International Parallel and Distributed Processing Symposium (IPDPS)","author":"D. Abramson","year":"2000","unstructured":"Abramson, D., Giddy, J., Kotler, L.: High performance parametric modeling with nimrod\/g: Killer application for the global grid? In: International Parallel and Distributed Processing Symposium (IPDPS), pp. 520\u2013528. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/PL00011432","volume":"90","author":"N. Ascheuer","year":"2001","unstructured":"Ascheuer, N., Fischetti, M., Gr\u0151tschel, M.: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming\u00a090, 475\u2013506 (2001)","journal-title":"Mathematical Programming"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C. Blum","year":"2005","unstructured":"Blum, C.: Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers and Operations Research\u00a032, 1565\u20131591 (2005)","journal-title":"Computers and Operations Research"},{"key":"3_CR4","series-title":"Studies in Computational Intelligence","volume-title":"Hybrid Metaheuristics: An Emerging Approach to Optimization","year":"2008","unstructured":"Blum, C., Blesa, M., Roli, A., Sampels, M. (eds.): Hybrid Metaheuristics: An Emerging Approach to Optimization. Studies in Computational Intelligence, vol.\u00a0114. Springer, Heidelberg (2008)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"3","author":"C. Blum","year":"2004","unstructured":"Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics\u00a03, 1161\u20131172 (2004)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"key":"3_CR6","volume-title":"Self-Organization in Biological Systems","author":"S. Camazine","year":"2001","unstructured":"Camazine, S., Deneubourg, J.-L., Franks, N.R., Sneyd, J., Theraulaz, G., Bonabeau, E.: Self-Organization in Biological Systems. Princeton University Press, Princeton (2001)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02288323","volume":"13","author":"G. Carpaneto","year":"1988","unstructured":"Carpaneto, G., Martello, S., Toth, P.: Algorithms and codes for the assignment problem. Annals of Operations Research\u00a013, 193\u2013223 (1988)","journal-title":"Annals of Operations Research"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"C.A. Coello","year":"2002","unstructured":"Coello, C.A.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Computer Methods in Applied Mechanics and Engineering\u00a0191, 1245\u20131287 (2002)","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"key":"3_CR9","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"3_CR10","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":"3_CR11","series-title":"International Series in Operations Research & Management Science","volume-title":"Handbook of Metaheuristics","year":"2003","unstructured":"Glover, F.W., Kochenberger, G.A. (eds.): Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.\u00a057. Springer, Heidelberg (2003)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-01009-5_9","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M. L\u00f3pez-Ib\u00e1\u00f1ez","year":"2009","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Blum, C., Thiruvady, D., Ernst, A.T., Meyer, B.: Beam-ACO based on stochastic sampling for makespan optimization concerning the TSP with time windows. In: Evolutionary Computation in Combinatorial Optimization. LNCS, vol.\u00a05482, pp. 97\u2013108. Springer, Heidelberg (2009)"},{"key":"3_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming With Constraints","author":"K. Marriott","year":"1998","unstructured":"Marriott, K., Stuckey, P.: Programming With Constraints. MIT Press, Cambridge (1998)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-28646-2_15","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"B. Meyer","year":"2004","unstructured":"Meyer, B., Ernst, A.: Integrating ACO and constraint propagation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol.\u00a03172, pp. 166\u2013177. Springer, Heidelberg (2004)"},{"key":"3_CR15","volume-title":"Planning and Scheduling in Manufacturing and Services","author":"M.L. Pinedo","year":"2005","unstructured":"Pinedo, M.L.: Planning and Scheduling in Manufacturing and Services. Springer, New York (2005)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M.W.P. Savelsbergh","year":"1985","unstructured":"Savelsbergh, M.W.P.: Local search in routing problems with time windows. Annals of Operations Research\u00a04, 285\u2013305 (1985)","journal-title":"Annals of Operations Research"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u0171tzle","year":"2000","unstructured":"St\u0171tzle, T., Hoos, H.H.: Max-min ant system. Future Generation Computer Systems\u00a016, 889\u2013914 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"3_CR18","unstructured":"Gecode Team. Gecode: Generic constraint development environment (2008), \n                  \n                    http:\/\/www.gecode.org"},{"issue":"7","key":"3_CR19","doi-asserted-by":"publisher","first-page":"2388","DOI":"10.1016\/j.cor.2006.11.004","volume":"35","author":"J.M.S. Valente","year":"2008","unstructured":"Valente, J.M.S., Alves, R.A.F.S.: Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups. Computers and Operations Research\u00a035(7), 2388\u20132405 (2008)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04918-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T23:24:57Z","timestamp":1552173897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04918-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049170","9783642049187"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04918-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}