{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:08:14Z","timestamp":1729652894212,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/cec.2012.6252932","type":"proceedings-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T20:51:10Z","timestamp":1344286270000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["A composite heuristic for the no-wait flow shop scheduling"],"prefix":"10.1109","author":[{"given":"Gao","family":"Kaizhou","sequence":"first","affiliation":[]},{"given":"P.N.","family":"Suganthan","sequence":"additional","affiliation":[]},{"family":"Bao Zhenqiang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2008.05.002"},{"key":"17","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/s00170-011-3197-6","article-title":"Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion","volume":"56","author":"kai-zhou","year":"2011","journal-title":"Intern J Adv Manuf Technol"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.030"},{"key":"15","first-page":"53","volume":"35","author":"kalczynski","year":"2007","journal-title":"On the NEH Heuristic for Minimizing the Makespan in Permutation Flow Shop Omega"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/S0924-0136(00)00720-2"},{"key":"13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1057\/palgrave.jors.2601110","article-title":"Minimizing total completion time in nowait flow shop with sequence dependent additive changeover times","volume":"52","author":"allahverdi","year":"2001","journal-title":"J Oper Res Soc"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.01.004"},{"key":"12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1111\/j.1475-3995.2000.tb00197.x","article-title":"No-wait and separete setup three-machine flow shop with total completion time criterion","volume":"7","author":"allahverdi","year":"2000","journal-title":"Int Trans Oper Res"},{"key":"21","doi-asserted-by":"crossref","first-page":"5717","DOI":"10.1080\/00207540802070942","article-title":"New heuristics for no-wait flow shops with a liner combination of makespan and maximum lateness","volume":"47","author":"ruiz","year":"2009","journal-title":"Int J Produc Res"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(03)00047-1"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(01)00228-6"},{"key":"23","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1016\/j.cor.2003.11.002","article-title":"Comparison of heuristics for flow time minimization in permutation flow shop","volume":"32","author":"framinan","year":"2005","journal-title":"Comput Operat Res"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2006.11.003"},{"key":"25","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/0360-8352(96)00042-3","article-title":"Genetic algorithm applied to the continuous flow shop problem","volume":"30","author":"chen","year":"1996","journal-title":"Compu Indus Engin"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00224-6"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.3.510"},{"key":"10","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/S0305-0548(98)00002-1","article-title":"Total flow time in no-wait flow shops with setup times","volume":"25","author":"aldowaisan","year":"1998","journal-title":"Comput Oper Res"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1038\/sj\/jors\/0450411"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.36"},{"journal-title":"Sequenceing and Scheduling An Instroduction to the Mathmatics of the Job-shop","year":"1982","author":"french","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00285-4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00136-7"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00834-2"}],"event":{"name":"2012 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2012,6,10]]},"location":"Brisbane, Australia","end":{"date-parts":[[2012,6,15]]}},"container-title":["2012 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6241678\/6252855\/06252932.pdf?arnumber=6252932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T22:31:04Z","timestamp":1497997864000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6252932\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/cec.2012.6252932","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}