{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:08:12Z","timestamp":1762297692475},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175626"},{"type":"electronic","value":"9783642175633"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17563-3_77","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:50:50Z","timestamp":1291409450000},"page":"656-663","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Estimation of Distribution Algorithm for Job Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Xiao-juan","family":"He","sequence":"first","affiliation":[]},{"given":"Jian-chao","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Song-dong","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Li-fang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"77_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research\u00a01, 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"77_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research\u00a093, 1\u201333 (1996)","journal-title":"European Journal of Operational Research"},{"key":"77_CR3","volume-title":"Essays and Surveys in Metaheuristics","author":"S. Binato","year":"2002","unstructured":"Binato, S., Hery, W.J., Loewenstern, D.M.: Resende M.G.C. 2002, A GRASP for job shop scheduling. In: Ribeiro C.C, Hansen P.(Eds.), Essays and Surveys in Metaheuristics, Kluwer Academic Publishers(2002)."},{"key":"77_CR4","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.cie.2004.12.008","volume":"48","author":"M. Watanabe","year":"2005","unstructured":"Watanabe, M., Ida, K., Gen, M.: A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Computers &Industrial Engineering\u00a048, 743\u2013752 (2005)","journal-title":"Computers &Industrial Engineering"},{"key":"77_CR5","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/j.amc.2006.05.168","volume":"183","author":"Z. Lian","year":"2006","unstructured":"Lian, Z., Jiao, B., Gu, X.: A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation\u00a0183, 1008\u20131017 (2006)","journal-title":"Applied Mathematics and Computation"},{"key":"77_CR6","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1016\/j.eswa.2009.08.015","volume":"37","author":"T.-J. Lin","year":"2010","unstructured":"Lin, T.-J., Horng, S.-J., Kao, T.-W., Chen, Y.-H., Run, R.-S.: An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Systems with Applications\u00a037, 2629\u20132636 (2010)","journal-title":"Expert Systems with Applications"},{"key":"77_CR7","unstructured":"Baluja, S.: Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. Technical Report CMU-CS-95-163. Carnegie Mellon University, Pittsburgh (1994)"},{"key":"77_CR8","unstructured":"Pelikan, M., Goldberg, D.E., Lobo, F.: A Survey of Optimization by Building and Using Probabilistic Models. ILLiGAL Report No.99018, University of I11inois at Urbana Champaign, I11inois Genetic Algorithms Laboratory, Urbana, I11inois (1999)"},{"key":"77_CR9","unstructured":"Pelikan, M., Goldberg, D.E., Cantu-Paz, E.: BOA: the Bayesian Optimization Algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference GECCO 1999, vol.\u00a0I, pp. 525\u2013532 (1999)"},{"key":"77_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Problem Solving from Nature - PPSN VII","author":"S. Tsutsui","year":"2002","unstructured":"Tsutsui, S.: Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram. In: Guerv\u00f3s, J.J.M., Adamidis, P.A., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol.\u00a02439. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17563-3_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T17:00:49Z","timestamp":1553274049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17563-3_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175626","9783642175633"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17563-3_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}