{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T11:34:00Z","timestamp":1783164840853,"version":"3.54.6"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"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":[[2010,9]]},"DOI":"10.1007\/s10479-008-0461-8","type":"journal-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T15:49:16Z","timestamp":1225986556000},"page":"57-76","source":"Crossref","is-referenced-by-count":13,"title":["Space and time allocation in a shipyard assembly hall"],"prefix":"10.1007","volume":"179","author":[{"given":"Maud","family":"Bay","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yves","family":"Crama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yves","family":"Langer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippe","family":"Rigo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"461_CR1","volume-title":"Simulated annealing and Boltzmann machines\u2014a stochastic approach to combinatorial optimization and neural computing","author":"E. Aarts","year":"1989","unstructured":"Aarts, E., & Korst, J. (1989). Simulated annealing and Boltzmann machines\u2014a stochastic approach to combinatorial optimization and neural computing. New York: Wiley."},{"issue":"3","key":"461_CR2","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/ijoc.1030.0068","volume":"17","author":"L. Brunetta","year":"2005","unstructured":"Brunetta, L., & Gr\u00e9goire, Ph. (2005). A general purpose algorithm for three-dimensional packing. INFORMS Journal on Computing, 17(3), 328\u2013338.","journal-title":"INFORMS Journal on Computing"},{"key":"461_CR3","volume-title":"Approximation algorithms for NP-hard problems","author":"E. G. Coffman","year":"1997","unstructured":"Coffman, E. G., Garey, M. R., & Johnson, D. S. (1997). Approximation algorithms for bin packing: A survey. In D. S. Hochbaum (Ed.), Approximation algorithms for NP-hard problems. Boston: PWS Publishing Company."},{"key":"461_CR4","volume-title":"Handbook of combinatorial optimization","author":"E. G. Coffman","year":"1999","unstructured":"Coffman, E. G., Galambos, G., Martello, S., & Vigo, D. (1999). Packing approximation algorithms: Combinatorial analysis. In D.-Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization. Dordrecht: Kluwer Academic."},{"key":"461_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H. Dyckhoff","year":"1990","unstructured":"Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44, 145\u2013159.","journal-title":"European Journal of Operational Research"},{"key":"461_CR6","volume-title":"Annotated bibliographies in combinatorial optimization","author":"H. Dyckhoff","year":"1997","unstructured":"Dyckhoff, H., Scheithauer, G., & Terno, J. (1997). Cutting and packing. In M. Dell\u2019Amico, F. Maffioli, & S.\u00a0Martello (Eds.), Annotated bibliographies in combinatorial optimization. New York: Wiley."},{"issue":"3","key":"461_CR7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/ijoc.15.3.267.16080","volume":"15","author":"O. Faroe","year":"2003","unstructured":"Faroe, O., Pisinger, D., & Zachariasen, M. (2003). Guided local search for the three-dimensional bin-packing problem. INFORMS Journal on Computing, 15(3), 267\u2013283.","journal-title":"INFORMS Journal on Computing"},{"key":"461_CR8","series-title":"International Series in Operations Research & Management Science","volume-title":"Handbook of metaheuristics","author":"F. Focacci","year":"2003","unstructured":"Focacci, F., Laburthe, F., & Lodi, A. (2003). Local search and constraint programming. In F. Glover & G.\u00a0Kochenberger (Eds.), Handbook of metaheuristics. International Series in Operations Research & Management Science. Dordrecht: Kluwer Academic."},{"key":"461_CR9","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"issue":"4","key":"461_CR10","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). Tabu search: a tutorial. Interfaces, 20(4), 74\u201394.","journal-title":"Interfaces"},{"key":"461_CR11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovi\u010d, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130, 449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"461_CR12","unstructured":"ILOG (2007). CP Optimizer user\u2019s manual and reference manual. ILOG, Paris."},{"key":"461_CR13","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10107-003-0427-1","volume":"97","author":"S. Imahori","year":"2003","unstructured":"Imahori, S., Yagiura, M., & Ibaraki, T. (2003). Local search algorithms for the rectangle packing problem with general spatial costs. Mathematical Programming, 97, 543\u2013569.","journal-title":"Mathematical Programming"},{"key":"461_CR14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.ejor.2004.02.020","volume":"167","author":"S. Imahori","year":"2005","unstructured":"Imahori, S., Yagiura, M., & Ibaraki, T. (2005). Improved local search algorithms for the rectangle packing problem with general spatial costs. European Journal of Operational Research, 167, 48\u201367.","journal-title":"European Journal of Operational Research"},{"key":"461_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"N. Jussien","year":"2002","unstructured":"Jussien, N., & Lhomme, O. (2002). Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139, 21\u201345.","journal-title":"Artificial Intelligence"},{"key":"461_CR16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problem: a survey. European Journal of Operational Research, 141, 241\u2013252.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"461_CR17","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S. Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., & Vigo, D. (2000). The three dimensional bin packing problem. Operations Research, 48(2), 256\u2013267.","journal-title":"Operations Research"},{"issue":"1","key":"461_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1206040.1206047","volume":"33","author":"S. Martello","year":"2007","unstructured":"Martello, S., Pisinger, D., Vigo, D., Den Boef, E., & Korst, J. (2007). Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. ACM Transactions on Mathematical Software, 33(1), 1\u201312.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"461_CR19","volume-title":"Knapsack problems\u2014algorithms and computer implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems\u2014algorithms and computer implementations. New York: Wiley."},{"issue":"1","key":"461_CR20","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"D. Pisinger","year":"2007","unstructured":"Pisinger, D., & Sigurd, M. (2007). Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS Journal on Computing, 19(1), 36\u201351.","journal-title":"INFORMS Journal on Computing"},{"key":"461_CR21","volume-title":"Constraint-based local search","author":"P. Hentenryck Van","year":"2005","unstructured":"Van Hentenryck, P., & Michel, L. (2005). Constraint-based local search. Cambridge, MA: The MIT Press."},{"key":"461_CR22","unstructured":"Voudouris, C. (1997). Guided local search for combinatorial optimization problems. Ph.D. Thesis, Department of Computer Science, University of Essex, Colchester, United Kingdom."},{"key":"461_CR23","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0167-6377(96)00042-9","volume":"20","author":"C. Voudouris","year":"1997","unstructured":"Voudouris, C., & Tsang, E. (1997). Fast local search and guided local search and their application to British Telecom\u2019s workforce scheduling problem. Operations Research Letters, 20, 119\u2013127.","journal-title":"Operations Research Letters"},{"key":"461_CR24","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"C. Voudouris","year":"1999","unstructured":"Voudouris, C., & Tsang, E. (1999). Guided local search and its application to the traveling salesman problem. European Journal of Operational Research, 113, 469\u2013499.","journal-title":"European Journal of Operational Research"},{"key":"461_CR25","unstructured":"Wang, C. J., & Tsang, E. (1991). Solving constraint satisfaction problems using neural-networks. In Proceedings of IEE second international conference on artificial neural networks, pp.\u00a0295\u2013299."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0461-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0461-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0461-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:51Z","timestamp":1559153271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0461-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,7]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["461"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0461-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,7]]}}}