{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:10:26Z","timestamp":1761894626907},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,4]],"date-time":"2007-12-04T00:00:00Z","timestamp":1196726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s10479-007-0278-x","type":"journal-article","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T14:07:09Z","timestamp":1196690829000},"page":"233-244","source":"Crossref","is-referenced-by-count":22,"title":["A Beam Search approach for the optimization version of the Car Sequencing Problem"],"prefix":"10.1007","volume":"159","author":[{"given":"Joaqu\u00edn","family":"Bautista","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Belarmino","family":"Adenso-D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,4]]},"reference":[{"issue":"1","key":"278_CR1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0377-2217(94)00165-0","volume":"88","author":"J. Bautista","year":"1996","unstructured":"Bautista, J., Companys, R., & Corominas, A. (1996). Heuristics and exact algorithms for solving the Monden problem. European Journal of Operational Research, 88(1), 101\u2013113.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"278_CR2","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C. Blum","year":"2005","unstructured":"Blum, C. (2005). Beam-ACO\u2014hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers & Operations Research, 32(6), 1565\u20131591.","journal-title":"Computers & Operations Research"},{"key":"278_CR3","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1007\/11564751_78","volume-title":"Principles and practice of constraint programming: CP2005","author":"M. Butaru","year":"2005","unstructured":"Butaru, M., & Habbas, Z. (2005). Solving the Car Sequencing Problem as a non-binary CSP. In P. van Beek (Ed.), Lecture notes in computer science : Vol. 3709. Principles and practice of constraint programming: CP2005 (p. 840). 11th international conference, Sitges, Spain, October 1\u20135 2005. Berlin: Springer."},{"issue":"1","key":"278_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:HEUR.0000019987.10818.e0","volume":"10","author":"F. Della Croce","year":"2004","unstructured":"Della Croce, F., Ghirardi, M., & Tadei, R. (2004). Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems. Journal of Heuristics, 10(1), 89\u2013104.","journal-title":"Journal of Heuristics"},{"key":"278_CR5","first-page":"290","volume-title":"Proceedings of the 8th European conference on artificial intelligence, ECAI-88","author":"M. Dincbas","year":"1988","unstructured":"Dincbas, M., Simonis, H., & van Hentenryck, P. (1988). Solving the car sequencing problem in constraint logic programming. In Proceedings of the 8th European conference on artificial intelligence, ECAI-88, Munich (pp. 290\u2013295). London: Pitman."},{"issue":"2","key":"278_CR6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10951-006-7186-9","volume":"9","author":"A. Drexl","year":"2006","unstructured":"Drexl, A., Kimms, A., & Matthie\u00dfen, L. (2006). Algorithms for the car sequencing and the level scheduling problem. Journal of Scheduling, 9(2), 153\u2013176.","journal-title":"Journal of Scheduling"},{"key":"278_CR7","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1016\/j.ejor.2005.02.063","volume":"174","author":"C. Gagn\u00e9","year":"2006","unstructured":"Gagn\u00e9, C., Gravel, M., & Price, W. L. (2006). Solving real car sequencing problems with ant colony optimization. European Journal of Operational Research, 174, 1427\u20131448.","journal-title":"European Journal of Operational Research"},{"key":"278_CR8","unstructured":"Gent, I. (1998). Two results on car-sequencing problems. Technical report APES-02-1998."},{"key":"278_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/3-540-36605-9_23","volume-title":"Applications of evolutionary computing","author":"J. Gottlieb","year":"2003","unstructured":"Gottlieb, J., Puchta, M., & Solnon, C. (2003). A study of greedy, local search and ant colony optimization approaches for car sequencing problems. In S. Cagnori et al. (Eds.), Lecture notes in computer science : Vol. 2611. Applications of evolutionary computing (pp. 246\u2013257). Berlin: Springer."},{"issue":"11","key":"278_CR10","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1057\/palgrave.jors.2601955","volume":"56","author":"M. Gravel","year":"2005","unstructured":"Gravel, M., Gagn\u00e9, C., & Price, W. L. (2005). Review and comparison of three methods for the solution of the car sequencing problem. Journal of the Operational Research Society, 56(11), 1287\u20131295.","journal-title":"Journal of the Operational Research Society"},{"key":"278_CR11","volume-title":"Ordonnancement de la production","author":"P. L\u00f3pez","year":"2001","unstructured":"L\u00f3pez, P., & Roubellat, F. (2001). Ordonnancement de la production. Paris: Herm\u00e8s Science."},{"key":"278_CR12","unstructured":"Lowerre, B. T. (1976). The HARPY speech recognition system. Ph.D. thesis, Carnegie Mellon University, Pittsburgh."},{"key":"278_CR13","volume-title":"Toyota production system","author":"Y. Monden","year":"1983","unstructured":"Monden, Y. (1983). Toyota production system. Norcross: Institute of Industrial Engineers Press."},{"key":"278_CR14","volume-title":"Heuristic scheduling systems","author":"T. E. Morton","year":"1993","unstructured":"Morton, T. E., & Pentico, D. W. (1993). Heuristic scheduling systems. New York: Wiley."},{"key":"278_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"P. S. Ow","year":"1988","unstructured":"Ow, P. S., & Morton, T. E. (1988). Filtered beam search in scheduling. International Journal of Production Research, 26, 35\u201362.","journal-title":"International Journal of Production Research"},{"key":"278_CR16","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0017428","volume-title":"Principles and practice of constraint programming, CP-97","author":"J. C. Regin","year":"1997","unstructured":"Regin, J. C., & Puget, J. F. (1997). A filtering algorithm for global sequencing constraints. In Lecture notes in computer science : Vol. 1330. Principles and practice of constraint programming, CP-97 (pp. 32\u201346). Berlin: Springer."},{"key":"278_CR17","volume-title":"Foundations of constraint satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E. (1993). Foundations of constraint satisfaction. San Diego: Academic Press."},{"key":"278_CR18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P. Hentenryck Van","year":"1992","unstructured":"Van Hentenryck, P., Simonis, H., & Dincbas, M. (1992). Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58, 113\u2013159.","journal-title":"Artificial Intelligence"},{"key":"278_CR19","unstructured":"Zufferey, N., Studer, M., & Silver, E. A. (2006). Tabu search for a car sequencing problem. In Proceedings of the 19 international Florida artificial intelligent research society conference, FALIRS 2006 (pp. 457\u2013462)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0278-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-007-0278-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0278-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:44Z","timestamp":1559138864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-007-0278-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,4]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["278"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0278-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,4]]}}}