{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:25Z","timestamp":1750306585845,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T00:00:00Z","timestamp":1436572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,11]]},"DOI":"10.1145\/2739480.2754638","type":"proceedings-article","created":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T19:38:55Z","timestamp":1436297935000},"page":"441-448","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Minimizing Regular Objectives for Blocking Permutation Flow Shop Scheduling"],"prefix":"10.1145","author":[{"given":"Nouha","family":"Nouri","sequence":"first","affiliation":[{"name":"University of Tunis, Tunis, Tunisia"}]},{"given":"Talel","family":"Ladhari","sequence":"additional","affiliation":[{"name":"Umm Al-Qura University, La Mecque, Saudi Arabia"}]}],"member":"320","published-online":{"date-parts":[[2015,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.1.177.12451"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00060-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1590\/S0104-530X2000000300011"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0272-6963(81)90014-0"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(99)00104-8"},{"key":"e_1_3_2_1_6_1","volume-title":"Multiple parents crossover operators: A new approach removes the overlapping solutions for sequencing problems. Applied mathematical modelling, 37:2737--2746","author":"Chen S.","year":"2013","unstructured":"S. Chen , M. Chen , P. Chang , and V. Mani . Multiple parents crossover operators: A new approach removes the overlapping solutions for sequencing problems. Applied mathematical modelling, 37:2737--2746 , 2013 . S. Chen, M. Chen, P. Chang, and V. Mani. Multiple parents crossover operators: A new approach removes the overlapping solutions for sequencing problems. Applied mathematical modelling, 37:2737--2746, 2013."},{"key":"e_1_3_2_1_7_1","unstructured":"R. Companys. Note on the blocking flow shop problem. Working Paper http:\/\/upcommons.upc.edu\\e-prints\/handle\/2117\/420 pages 1--28 2009.  R. Companys. Note on the blocking flow shop problem. Working Paper http:\/\/upcommons.upc.edu\\e-prints\/handle\/2117\/420 pages 1--28 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.7148\/2013-0386"},{"key":"e_1_3_2_1_9_1","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO","author":"Januario T.","year":"2008","unstructured":"T. de O. Januario , J. E. C. Arroyo , and M. C. O. Moreira . Nature Inspired Cooperative Strategies for Optimization (NICSO 2008 ). Springer Berlin Heidelberg , 2009. T. de O. Januario, J. E. C. Arroyo, and M. C. O. Moreira. Nature Inspired Cooperative Strategies for Optimization (NICSO 2008). Springer Berlin Heidelberg, 2009."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1004-9541(12)60588-6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.5.655"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/549765"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2005.07.004"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.3.510"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-012-4493-5"},{"key":"e_1_3_2_1_17_1","volume-title":"University of Michigan Press","author":"Holland H.","year":"1975","unstructured":"H. Holland . Adaptation in natural and artificial systems . University of Michigan Press , Ann Arbor , 1975 . H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, 1975."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"e_1_3_2_1_20_1","first-page":"301","article-title":"An iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time criteria","volume":"23","author":"Khorasanian D.","year":"2012","unstructured":"D. Khorasanian and G. Moslehi . An iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time criteria . International Journal of Industrial Engineering and Production Research , 23 : 301 -- 308 , 2012 . D. Khorasanian and G. Moslehi. An iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time criteria. International Journal of Industrial Engineering and Production Research, 23:301--308, 2012.","journal-title":"International Journal of Industrial Engineering and Production Research"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.6.1025"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2012.03.006"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.6.925"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.02.003"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2011.06.002"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2012.2219860"},{"key":"e_1_3_2_1_28_1","volume-title":"Scheduling: theory, algorithms, and systems. Pretice Hall. U.A.S","author":"Pinedo M.","year":"2008","unstructured":"M. Pinedo . Scheduling: theory, algorithms, and systems. Pretice Hall. U.A.S , 2008 . M. Pinedo. Scheduling: theory, algorithms, and systems. Pretice Hall. U.A.S, 2008."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.08.007"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1972.52"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2010.07.007"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2013.802390"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01919082"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(03)00065-3"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-2444-3"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2007.01.003"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.04.018"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.12.004"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.04.042"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.02.013"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.09.021"}],"event":{"name":"GECCO '15: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Madrid Spain","acronym":"GECCO '15"},"container-title":["Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739480.2754638","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2739480.2754638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:24Z","timestamp":1750227384000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739480.2754638"}},"subtitle":["Heuristic Approaches"],"short-title":[],"issued":{"date-parts":[[2015,7,11]]},"references-count":40,"alternative-id":["10.1145\/2739480.2754638","10.1145\/2739480"],"URL":"https:\/\/doi.org\/10.1145\/2739480.2754638","relation":{},"subject":[],"published":{"date-parts":[[2015,7,11]]},"assertion":[{"value":"2015-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}