{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T05:22:54Z","timestamp":1754112174410,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/civemsa.2017.7995322","type":"proceedings-article","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T16:38:11Z","timestamp":1501519091000},"page":"177-180","source":"Crossref","is-referenced-by-count":3,"title":["Minimizing makespan in hybrid flow shop scheduling with multiprocessor task problems using a discrete harmony search"],"prefix":"10.1109","author":[{"given":"Hanna","family":"Zini","sequence":"first","affiliation":[]},{"given":"Souad","family":"ElBernoussi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICMSAO.2015.7152245"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107600201"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3844\/ajassp.2005.1552.1557"},{"key":"ref13","article-title":"A harmony search algorithm for flow shop scheduling Problem","author":"zini","year":"2016","journal-title":"Proceedings of the 3rd IEEE International Conference on Logistics Operations Management GOL"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-011-3197-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-014-0869-8"},{"journal-title":"Data for hybrid flow shop scheduling with multiprocessor tasks Koç University","year":"2006","author":"oguz","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2010.12.006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2012.05.015"},{"key":"ref6","first-page":"1","article-title":"Scheduling of a Hybrid Flow Shop with Multiprocessor Tasks by a Hybrid Approach Based on Genetic and Imperialist Competitive Algorithms","volume":"13","author":"rezaeiana","year":"2013","journal-title":"Journal of Optimization in Industrial Engineering"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601716"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.12.014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2010.03.008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-005-1640-y"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00644-6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.08.004"}],"event":{"name":"2017 IEEE International Conference on Computational Intelligence and Virtual Environments for Measurement Systems and Applications (CIVEMSA)","start":{"date-parts":[[2017,6,26]]},"location":"Annecy, France","end":{"date-parts":[[2017,6,28]]}},"container-title":["2017 IEEE International Conference on Computational Intelligence and Virtual Environments for Measurement Systems and Applications (CIVEMSA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7989854\/7995287\/07995322.pdf?arnumber=7995322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T11:38:13Z","timestamp":1502883493000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7995322\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/civemsa.2017.7995322","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}