{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:00Z","timestamp":1725512040432},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793045"},{"type":"electronic","value":"9783540793052"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79305-2_12","type":"book-chapter","created":{"date-parts":[[2008,5,5]],"date-time":"2008-05-05T10:00:35Z","timestamp":1209981635000},"page":"136-147","source":"Crossref","is-referenced-by-count":1,"title":["Genetic Branch-and-Bound or Exact Genetic Algorithm?"],"prefix":"10.1007","author":[{"given":"C\u00e9dric","family":"Pessan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Louis","family":"Bouquard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"N\u00e9ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","first-page":"72","volume-title":"Experimental and Efficient Algorithms","author":"M. Basseur","year":"2005","unstructured":"Basseur, M., Lemesre, J., Dhaenens, C., Talbi, E.G.: Cooperation between Branch and Bound and Evolutionary Approaches to solve a BiObjective Flow Shop Problem. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 72\u201386. Springer, Heidelberg (2005)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/0377-2217(87)90243-8","volume":"127","author":"J. Carlier","year":"1987","unstructured":"Carlier, J.: Scheduling jobs with release dates and tails on identical parallel machines to minimize the makespan. European Journal of Operational Research\u00a0127, 298\u2013306 (1987)","journal-title":"European Journal of Operational Research"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Cotta, C., Aldana, J.F., Nebro, A.J., Troya, J.M.: Hybridizing genetic algorithms with Branch and Bound techniques for the resolution of the TSP. In: Pearson, D.W., Steele, N.C., Albrect, R.F. (eds.), Artificial Neural Nets and Genetic Algorithms. Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, Ales, France, pp. 277\u2013280 (1995)","DOI":"10.1007\/978-3-7091-7535-4_73"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1023\/A:1011921025322","volume":"7","author":"A.P. French","year":"2001","unstructured":"French, A.P., Robinson, A.C., Wilson, J.M.: Using a Hybrid Genetic-Algorithm\/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems. Journal of Heuristics\u00a07, 551\u2013564 (2001)","journal-title":"Journal of Heuristics"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"5","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Strong NP-Completeness results: motivations, examples, and implications. Journal of the ACM\u00a05(3), 499\u2013508 (1978)","journal-title":"Journal of the ACM"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/jos.103","volume":"5","author":"A. Gharbi","year":"2002","unstructured":"Gharbi, A., Haouari, M.: Minimizing makespan on parallel machines subject to release dates and delivery times. Journal of Scheduling\u00a05, 329\u2013355 (2002)","journal-title":"Journal of Scheduling"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.dam.2004.12.003","volume":"148","author":"A. Gharbi","year":"2005","unstructured":"Gharbi, A., Haouari, M.: Optimal parallel machines scheduling with availability constraints. Discrete Applied Mathematics\u00a0148, 63\u201387 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR8","volume-title":"Adaptation in natural and artificial systems","author":"J. Holland","year":"1975","unstructured":"Holland, J.: Adaptation in natural and artificial systems. University of Michigan Press, Michigan (1975)"},{"key":"12_CR9","unstructured":"Jouglet, A., Sevaux, M., Oguz, C.: Flowshop hybride: de nouvelles perspectives en m\u00ealant algorithme g\u00e9n\u00e9tique et propagation de contraintes. In: ROADEF 2005, Congr\u00e9s de la Soci\u00e9t\u00e9 Fran\u00e7aise en Recherche Op\u00e9rationnelle, Tours, France (2005)"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/322092.322101","volume":"25","author":"E.L. Lawler","year":"1978","unstructured":"Lawler, E.L., Labetoulle, J.: On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM\u00a025(4), 612\u2013619 (1978)","journal-title":"Journal of the ACM"},{"key":"12_CR11","unstructured":"Pessan, C., N\u00e9ron, E., Bellenguez-Morineau, O.: Mod\u00e9lisation et planification des op\u00e9rations de r\u00e9glage de machines lors de changements de s\u00e9rie. In: Gourgand, M., Riane, F. (eds.) MOSIM 2006 conference, 2nd edn., pp. 1545\u20131554 (2006)"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1504\/EJIE.2008.017349","volume":"2","author":"C. Pessan","year":"2008","unstructured":"Pessan, C., Bouquard, J.-L., N\u00e9ron, E.: An unrelated parallel machines model for an industrial production resetting problem. European J. Industrial Engineering\u00a02(2), 153\u2013171 (2008)","journal-title":"European J. Industrial Engineering"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0377-2217(97)00333-0","volume":"107","author":"M.. Portman","year":"1998","unstructured":"Portman, M., Vignier, A., Dardilhac, D., Dezalay, D.: Branch and Bound crossed with GA to solve hybrid flowshops. Eur J Oper Res\u00a0107, 389\u2013400 (1998)","journal-title":"Eur J Oper Res"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In: Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, vol.\u00a03562, pp. 41\u201353 (2005)","DOI":"10.1007\/11499305_5"},{"key":"12_CR15","unstructured":"Rocha, P.L., Ravetti, M.G., Mateus, G.R.: The meta-heuristic grasp as an upper bound for a branch and bound algorithm in a scheduling problem with non-related parallel machines and sequence-dependent setup times. In: EU\/ME Workshop, Nottingham, UK (2004)"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79305-2_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:16:46Z","timestamp":1619522206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79305-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540793045","9783540793052"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79305-2_12","relation":{},"subject":[]}}