{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:37:38Z","timestamp":1761597458710},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,10,6]],"date-time":"2013-10-06T00:00:00Z","timestamp":1381017600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00500-013-1136-1","type":"journal-article","created":{"date-parts":[[2013,10,5]],"date-time":"2013-10-05T02:12:34Z","timestamp":1380939154000},"page":"1177-1188","source":"Crossref","is-referenced-by-count":16,"title":["A block based estimation of distribution algorithm using bivariate model for scheduling problems"],"prefix":"10.1007","volume":"18","author":[{"given":"Pei-Chann","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng-Hui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,6]]},"reference":[{"issue":"2","key":"1136_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.cie.2012.03.015","volume":"63","author":"F Ahmadizar","year":"2012","unstructured":"Ahmadizar F (2012) A new ant colony algorithm for makespan minimization in permutation flow shops. Comput Ind Eng 63(2):355\u2013361","journal-title":"Comput Ind Eng"},{"key":"1136_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5237-6","volume-title":"Multiobjective Scheduling by Genetic Algorithms","author":"TP Bagchi","year":"1999","unstructured":"Bagchi TP (1999) Multiobjective Scheduling by Genetic Algorithms. Kluwer, Boston"},{"key":"1136_CR3","volume-title":"Introduction to sequencing and scheduling","author":"KR Baker","year":"1974","unstructured":"Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York"},{"issue":"1","key":"1136_CR4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/opre.23.1.62","volume":"23","author":"KR Baker","year":"1975","unstructured":"Baker KR (1975) A comparative study of flow-shop algorithms. Oper Res 23(1):62\u201373","journal-title":"Oper Res"},{"key":"1136_CR5","unstructured":"Baluja S (1994) Population based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA"},{"issue":"1","key":"1136_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s13748-011-0005-3","volume":"1","author":"J Ceberio","year":"2012","unstructured":"Ceberio J, Irurozki E, Mendiburu A, Lozano J (2012) A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems. Prog Artif Intell 1(1):103\u2013117","journal-title":"Prog Artif Intell"},{"key":"1136_CR7","doi-asserted-by":"crossref","unstructured":"Chang PC, Chen SH, Fan CY (2008a) Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems. Appl Soft Comput J 8(1):767\u2013777","DOI":"10.1016\/j.asoc.2007.06.005"},{"key":"1136_CR8","doi-asserted-by":"crossref","unstructured":"Chang PC, Chen SH, Fan CY, Chan CL (2008b) Genetic algorithm integrated with artificial chromosomes for multi-objective flow-shop scheduling problems. Appl Math Comput 205(2):550\u2013561","DOI":"10.1016\/j.amc.2008.05.027"},{"key":"1136_CR9","unstructured":"Chang PC, Huang WH, Ting CJ (2010) Self-evolving Artificial Immune System via Developing T and B Cell for Permutation Flow-shop Scheduling Problems. Proceedings of World Academy of Science, Engineering and Technology 65:822\u2013827"},{"issue":"17","key":"1136_CR10","doi-asserted-by":"crossref","first-page":"5207","DOI":"10.1080\/00207543.2010.510808","volume":"49","author":"PC Chang","year":"2011","unstructured":"Chang PC, Huang WH, Ting CJ (2011) A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems. Int J Prod Res 49(17):5207\u20135230","journal-title":"Int J Prod Res"},{"key":"1136_CR11","doi-asserted-by":"crossref","unstructured":"Chen SH, Chen MC (2013) Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems. Int J Prod Econ 141(1):24\u201333","DOI":"10.1016\/j.ijpe.2012.05.010"},{"key":"1136_CR12","doi-asserted-by":"crossref","unstructured":"Chen YM, Chen MC, Chang PC, Chen SH (2012) Extended artificial chromosome genetic algorithm for permutation flowshop scheduling problems. Comput Ind Eng 62(2):536\u2013545","DOI":"10.1016\/j.cie.2011.11.002"},{"issue":"9","key":"1136_CR13","doi-asserted-by":"crossref","first-page":"8149","DOI":"10.1016\/j.eswa.2012.01.152","volume":"39","author":"WE Costa","year":"2012","unstructured":"Costa WE, Goldbarg MC, Goldbarg EG (2012) New VNS heuristic for total owtime owshop scheduling problem. Expert Syst Appl 39(9):8149\u20138161","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1136_CR14","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.cor.2012.08.021","volume":"40","author":"X Dong","year":"2013","unstructured":"Dong X, Chen P, Huang HK, Nowak M (2013) A multi-restart iterated local search algorithm for the permutation flow-shop problem minimizing total flow time. Comput Oper Res 40(2):627\u2013632","journal-title":"Comput Oper Res"},{"key":"1136_CR15","volume-title":"Computers and Intractibility: a Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractibility: a Guide to the Theory of NP-Completeness. Freeman, San Francisco"},{"issue":"4","key":"1136_CR16","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"Harik GR, Lobo FG, Goldberg DE (1999) The compact genetic algorithm. IEEE Trans Evolut Comput 3(4):523\u2013528","journal-title":"IEEE Trans Evolut Comput"},{"key":"1136_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1539-5","volume-title":"Estimation of distribution algorithms: A new tool for evolutionary computation","author":"PJ Larra\u00f1aga","year":"2002","unstructured":"Larra\u00f1aga PJ, Lozano A (2002) Estimation of distribution algorithms: A new tool for evolutionary computation. Kluwer Academic Publishers, Boston"},{"issue":"1","key":"1136_CR18","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.amc.2005.07.042","volume":"175","author":"Z Lian","year":"2006","unstructured":"Lian Z, Gu X, Jiao B (2006) A similar particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Appl Math Comput 175(1):773\u2013785","journal-title":"Appl Math Comput"},{"issue":"4","key":"1136_CR19","doi-asserted-by":"crossref","first-page":"4348","DOI":"10.1016\/j.eswa.2010.09.104","volume":"38","author":"HC Liu","year":"2011","unstructured":"Liu HC, Gao L, Pan QK (2011) A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flow-shop scheduling problem. Expert Syst Appl 38(4):4348\u20134360l","journal-title":"Expert Syst Appl"},{"key":"1136_CR20","unstructured":"Paul TK, Iba H (2002) Linear and Combinatorial Optimizations by Estimation of Distribution Algorithms. 9th MPS Symposium on Evolutionary Computation, IPSJ Symposium, Japan, pp 99\u2013106"},{"issue":"1","key":"1136_CR21","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2012.04.034","volume":"222","author":"QK Pen","year":"2012","unstructured":"Pen QK, Ruiz R (2012) Local search methods for the flow-shop scheduling problem with flowtime minimization. Eur J Oper Res 222(1):31\u201343","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1136_CR22","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves CR (1995) A genetic algorithm for flow-shop sequencing. Comput Oper Res 22(1):5\u201313","journal-title":"Comput Oper Res"},{"issue":"1","key":"1136_CR23","doi-asserted-by":"crossref","first-page":"3459","DOI":"10.1016\/j.ins.2011.04.018","volume":"181","author":"MF Tasgetiren","year":"2011","unstructured":"Tasgetiren MF, Pan QK, Suganthan PN, Chen AH (2011) A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow-shops. Inf Sci 181(1):3459\u20133475","journal-title":"Inf Sci"},{"key":"1136_CR24","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-45712-7_22","volume":"2439","author":"S Tsutsui","year":"2002","unstructured":"Tsutsui S (2002) Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram. Lect Notes Comput Sci 2439:224\u2013233","journal-title":"Lect Notes Comput Sci"},{"key":"1136_CR25","unstructured":"Tsutsui S, Pelikan M, Goldberg DE (2006) Node Histogram vs. Edge Histogram: a Comparison of PMBGAs in Permutation Domains. Missouri Estimation of Distribution Algorithms Laboratory, MEDAL Report No. 2006009, July"},{"key":"1136_CR26","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1007\/s00170-011-3671-1","volume":"60","author":"YR Tzeng","year":"2012","unstructured":"Tzeng YR, Chen CL, Chen CL (2012) A hybrid EDA with ACS for solving permutation flow-shop scheduling. Int J Adv Manuf Technol 60:1139\u20131147","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"1136_CR27","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/TEVC.2003.819431","volume":"8","author":"Q Zhang","year":"2004","unstructured":"Zhang Q (2004) On Stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm. IEEE Trans Evol Comput 8(1):80\u201393","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1136-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-013-1136-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1136-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:43:34Z","timestamp":1559079814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-013-1136-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,6]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["1136"],"URL":"https:\/\/doi.org\/10.1007\/s00500-013-1136-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,6]]}}}