{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:55:08Z","timestamp":1725540908530},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040382"},{"type":"electronic","value":"9783642040399"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04039-9_4","type":"book-chapter","created":{"date-parts":[[2009,11,16]],"date-time":"2009-11-16T03:24:03Z","timestamp":1258341843000},"page":"89-110","source":"Crossref","is-referenced-by-count":3,"title":["An Estimation of Distribution Algorithm for Flowshop Scheduling with Limited Buffers"],"prefix":"10.1007","author":[{"given":"Mansour","family":"Eddaly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bassem","family":"Jarboui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Siarry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelwaheb","family":"Reba\u00ef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Baluja, S.: Populationbased incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report N\u00b0CMU-CS-94-163. Carnegie Mellon University, Pittsburgh (1994)"},{"key":"4_CR2","first-page":"30","volume-title":"Proceedings of the 14th International Conference on Machine Learning","author":"S. Baluja","year":"1997","unstructured":"Baluja, S., Davies, S.: Using optimal dependencytrees for combinatorial optimization: Learning the structure of the search space. In: Proceedings of the 14th International Conference on Machine Learning, pp. 30\u201338. Morgan Kaufmann, San Francisco (1997)"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1051\/ro\/1978120403331","volume":"12","author":"J. Carlier","year":"1978","unstructured":"Carlier, J.: Ordonnancements a contraintes disjonctives. RAIRO-Operations Research\u00a012, 333\u2013351 (1978)","journal-title":"RAIRO-Operations Research"},{"key":"4_CR4","first-page":"424","volume-title":"Advances in Neural Information Processing Systems","author":"J.S. Bonet De","year":"1997","unstructured":"De Bonet, J.S., Isbell, C.L., Viola, P.: MIMIC: Finding optima by estimating probability densities. In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) Advances in Neural Information Processing Systems, vol.\u00a09, pp. 424\u2013431. The MIT Press, Cambridge (1997)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1287\/mnsc.21.9.989","volume":"21","author":"S.K. Dutta","year":"1975","unstructured":"Dutta, S.K., Cunningham, A.A.: Sequencing two-machine flow-shops with finite intermediate storage. Management Science\u00a021, 989\u2013996 (1975)","journal-title":"Management Science"},{"key":"4_CR6","unstructured":"Etxeberria, R., Larra\u00f1aga, P.: Global optimization with Bayesian networks. In: II Symposium on Artificial Intelligence. CIMAF 1999. Special Session on Distributions and Evolutionary Optimization, pp. 332\u2013339 (1999)"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic\u0300, N.: Variable neighborhood search: principles and applications. European Journal of Operational Research\u00a0130, 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"key":"4_CR8","unstructured":"Harik, G.: Linkage learning via probabilistic modeling in the ECGA. University of Illinois Genetic Algorithms Laboratory, Urbana (January 1999) IlliGAL Report No. 99010"},{"key":"4_CR9","first-page":"523","volume-title":"Proceedings of the IEEE Conference on Evolutionary Computation 1998 (ICEG 1998)","author":"G.R. Harik","year":"1998","unstructured":"Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. In: Proceedings of the IEEE Conference on Evolutionary Computation 1998 (ICEG 1998), pp. 523\u2013528. IEEE Service Centre, Piscataway (1998)"},{"key":"4_CR10","unstructured":"Jarboui, B., Eddaly, M., Siarry, P.: An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Computers and Operations Research (2008) doi: 10.1016\/j.cor, 11.004"},{"key":"4_CR11","unstructured":"Larra\u00f1aga, P., Etxeberria, R., Lozano, J.A., Pe\u00f1a, J.M.: Combinatorial optimization by learning and simulation of Bayesian networks. In: Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, Stanford, pp. 343\u2013352 (2000)"},{"volume-title":"Estimation of distribution algorithms: a new tool for evolutionary computation","year":"2002","key":"4_CR12","unstructured":"Larra\u00f1aga, P., Lozano, J.A. (eds.): Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer Academic Publishers, Boston (2002)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1080\/00207549008942855","volume":"28","author":"R. Leisten","year":"1990","unstructured":"Leisten, R.: Flowshop sequencing problems with limited buffer storage. International Journal of Production Research\u00a028, 2085\u20133100 (1990)","journal-title":"International Journal of Production Research"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"2791","DOI":"10.1016\/j.cor.2006.12.013","volume":"35","author":"B. Liu","year":"2008","unstructured":"Liu, B., Wang, L., Jin, Y.H.: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers. Computers and Operations Research\u00a035, 2791\u20132806 (2008)","journal-title":"Computers and Operations Research"},{"key":"4_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-32494-1","volume-title":"Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms","author":"J. Lozano","year":"2006","unstructured":"Lozano, J., Larraanaga, P., Inza, I., Bengoetxea, E.: Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms. Springer, Heidelberg (2006)"},{"key":"4_CR16","volume-title":"Design and analysis of experiments","author":"D.C. Montgomery","year":"2000","unstructured":"Montgomery, D.C.: Design and analysis of experiments, 5th edn. Wiley, New York (2000)","edition":"5"},{"key":"4_CR17","first-page":"19","volume":"7","author":"H. M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein, H., Mahnig, T.: Convergence theory and applications of the factorized distribution algorithm. Journal of Computing and Information Technology\u00a07, 19\u201332 (1999a)","journal-title":"Journal of Computing and Information Technology"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1162\/evco.1999.7.4.353","volume":"7","author":"H. M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein, H., Mahnig, T.: FDA - A scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation\u00a07, 353\u2013376 (1999b)","journal-title":"Evolutionary Computation"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel Problem Solving from Nature - PPSN IV","author":"H. M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol.\u00a01141, pp. 178\u2013187. Springer, Heidelberg (1996)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(98)00017-4","volume":"116","author":"E. Nowicki","year":"1999","unstructured":"Nowicki, E.: The permutation flow shop with buffers: a tabu search approach. European Journal of Operational Research\u00a0116, 205\u2013219 (1999)","journal-title":"European Journal of Operational Research"},{"key":"4_CR21","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/322203.322213","volume":"27","author":"C.H. Papadimitriou","year":"1980","unstructured":"Papadimitriou, C.H., Kanellakis, P.C.: Flow shop scheduling with limited temporary storage. Journal of Association Computing Machine\u00a027, 533\u2013549 (1980)","journal-title":"Journal of Association Computing Machine"},{"key":"4_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/b10910","volume-title":"Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms","author":"M. Pelikan","year":"2005","unstructured":"Pelikan, M.: Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms. Springer, Heidelberg (2005)"},{"key":"4_CR23","first-page":"525","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 1999","author":"M. Pelikan","year":"1999","unstructured":"Pelikan, M., Goldberg, D.E., Cant\u00fa-Paz, E.: BOA: The Bayesian optimization algorithm. In: Banzhaf, W., Daida, J., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M., Smith, R.E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 1999, vol.\u00a01, pp. 525\u2013532. Morgan Kaufmann Publishers, San Francisco (1999)"},{"key":"4_CR24","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/978-1-4471-0819-1_39","volume-title":"Advances in Soft Computing Engineering Design and Manufacturing","author":"M. Pelikan","year":"1999","unstructured":"Pelikan, M., M\u00fchlenbein, H.: The bivariate marginal distribution algorithm. In: Roy, R., Furuhashi, T., Chawdhry, P.K. (eds.) Advances in Soft Computing Engineering Design and Manufacturing, pp. 521\u2013535. Springer, London (1999)"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.cor.2007.08.007","volume":"36","author":"B. Qian","year":"2009","unstructured":"Qian, B., Wang, L., Huang, D.X., Wang, W.L., Wang, X.: An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers and Operations Research\u00a036, 209\u2013233 (2009)","journal-title":"Computers and Operations Research"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1287\/mnsc.23.2.216","volume":"23","author":"S.S. Reddi","year":"1976","unstructured":"Reddi, S.S.: Sequencing with finite intermediate storage. Management Science\u00a023, 216\u2013227 (1976)","journal-title":"Management Science"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C.R. Reeves","year":"1995","unstructured":"Reeves, C.R.: A genetic algorithm for flowshop sequencing. Computers and Operations Research\u00a022, 5\u201313 (1995)","journal-title":"Computers and Operations Research"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10479-005-2444-3","volume":"138","author":"D.P. Ronconi","year":"2005","unstructured":"Ronconi, D.P.: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Annals of Operations Research\u00a0138, 53\u201365 (2005)","journal-title":"Annals of Operations Research"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R. Ruiz","year":"2006","unstructured":"Ruiz, R., Maroto, C., Alcaraz, J.: Two new robust genetic algorithms for the flowshop scheduling problem. Omega\u00a034, 461\u2013476 (2006)","journal-title":"Omega"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/978-3-540-28646-2_38","volume-title":"Particle swarm optimization algorithm for permutation flowshop sequencing problem","author":"M.F. Tasgetiren","year":"2004","unstructured":"Tasgetiren, M.F., Sevkli, M., Liang, Y.C., Gencyilmaz, G.: Particle swarm optimization algorithm for permutation flowshop sequencing problem. LNCS, pp. 382\u2013389. Springer, Heidelberg (2004)"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"2960","DOI":"10.1016\/j.cor.2005.02.028","volume":"33","author":"L. Wang","year":"2006","unstructured":"Wang, L., Zhang, L., Zheng, D.Z.: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Computers and Operations Research\u00a033, 2960\u20132971 (2006)","journal-title":"Computers and Operations Research"}],"container-title":["Studies in Computational Intelligence","Natural Intelligence for Scheduling, Planning and Packing Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04039-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T11:05:34Z","timestamp":1685185534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04039-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040382","9783642040399"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04039-9_4","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}