{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:52:58Z","timestamp":1729641178315,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/scis.2013.6613246","type":"proceedings-article","created":{"date-parts":[[2013,10,2]],"date-time":"2013-10-02T18:33:20Z","timestamp":1380738800000},"page":"9-13","source":"Crossref","is-referenced-by-count":13,"title":["An enhanced migrating birds optimization algorithm for no-wait flow shop scheduling problem"],"prefix":"10.1109","author":[{"given":"K. Z.","family":"Gao","sequence":"first","affiliation":[]},{"given":"P.N.","family":"Suganthan","sequence":"additional","affiliation":[]},{"given":"T. J.","family":"Chua","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1007\/s00170-007-1099-4"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1016\/j.cie.2009.02.006"},{"key":"18","first-page":"778","article-title":"An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion","volume":"38","author":"quan-ke","year":"2008","journal-title":"Int J AdvManufTechnol"},{"key":"15","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"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1016\/j.omega.2006.11.003"},{"key":"13","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"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1016\/S0925-5273(01)00228-6"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1016\/S0924-0136(00)00720-2"},{"key":"12","article-title":"Effective heurisitics for the no-wait flow shop scheduling problem with total flow time minimization","author":"kai-zhou","year":"0","journal-title":"Intern J Adv Manuf Technol"},{"key":"21","doi-asserted-by":"crossref","first-page":"2498","DOI":"10.1016\/j.cor.2008.10.008","article-title":"A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problem","volume":"36","author":"quan-ke","year":"2009","journal-title":"Comput & Oper Res"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1016\/j.cor.2006.12.030"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1080\/03052150701732509"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1007\/s00170-006-0906-7"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1016\/j.ejor.2010.02.014"},{"key":"25","first-page":"683","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":"Int J AdvManufTechnol"},{"doi-asserted-by":"publisher","key":"26","DOI":"10.1016\/j.ins.2012.06.032"},{"doi-asserted-by":"publisher","key":"27","DOI":"10.1007\/s00170-008-1454-0"},{"doi-asserted-by":"publisher","key":"28","DOI":"10.1016\/0377-2217(93)90182-M"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1016\/S0377-2217(99)00224-6"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1287\/opre.44.3.510"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1016\/j.omega.2005.03.003"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1038\/sj\/jors\/0450411"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1016\/S0377-2217(02)00834-2"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1002\/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1287\/opre.26.1.36"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1016\/S0377-2217(99)00285-4"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"8","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(99)00136-7","article-title":"A new heuristic and dominance relations for no-wait flow shops with setups","volume":"28","author":"aldowaisan","year":"2001","journal-title":"J Comput Res"}],"event":{"name":"2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched)","start":{"date-parts":[[2013,4,16]]},"location":"Singapore, Singapore","end":{"date-parts":[[2013,4,19]]}},"container-title":["2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6596012\/6613243\/06613246.pdf?arnumber=6613246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T19:02:29Z","timestamp":1498071749000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6613246\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/scis.2013.6613246","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}