{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:39:59Z","timestamp":1730209199866,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1109\/coase.2008.4626566","type":"proceedings-article","created":{"date-parts":[[2008,9,24]],"date-time":"2008-09-24T13:55:06Z","timestamp":1222264506000},"page":"578-582","source":"Crossref","is-referenced-by-count":15,"title":["Ant colony optimization algorithm to parallel machine scheduling problem with setups"],"prefix":"10.1109","author":[{"given":"Jean-Paul","family":"Arnaout","sequence":"first","affiliation":[]},{"given":"Rami","family":"Musa","sequence":"additional","affiliation":[]},{"given":"Ghaith","family":"Rabadi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"177","article-title":"scheduling to minimize makespan on unrelated parallel machines with sequence dependent setup times","volume":"17","author":"al-salem","year":"2004","journal-title":"Engineering Journal of the University of Qatar"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00156-3"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00087-X"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.015"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(94)90205-4"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600547"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S0736-5845(02)00013-3"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0736-5845(02)00077-7"},{"year":"0","key":"21"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.29.4.646"},{"key":"20","first-page":"182","article-title":"a tabu search algorithm to minimize the makespan for unrelated parallel machines scheduling problem with setup times","volume":"3","author":"helal","year":"2006","journal-title":"International Journal of Operational Research"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(00)00066-9"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/361011.361064"},{"year":"0","key":"6"},{"key":"5","article-title":"sequencing and scheduling: algorithms and complexity","author":"lawler","year":"1993","journal-title":"Handbooks in Operations Research and Management Science 4 Logistics of Production and Inventory North Holland Amsterdam 445?524"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90215-W"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1080\/07408179908969814"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.3.846"}],"event":{"name":"2008 IEEE International Conference on Automation Science and Engineering (CASE 2008)","start":{"date-parts":[[2008,8,23]]},"location":"Arlington, VA","end":{"date-parts":[[2008,8,26]]}},"container-title":["2008 IEEE International Conference on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4622934\/4626395\/04626566.pdf?arnumber=4626566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T11:52:46Z","timestamp":1489751566000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4626566\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/coase.2008.4626566","relation":{},"subject":[],"published":{"date-parts":[[2008,8]]}}}