{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:48:31Z","timestamp":1729633711175,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1109\/rivf.2013.6719893","type":"proceedings-article","created":{"date-parts":[[2014,1,24]],"date-time":"2014-01-24T16:23:41Z","timestamp":1390580621000},"page":"198-202","source":"Crossref","is-referenced-by-count":0,"title":["An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem"],"prefix":"10.1109","author":[{"given":"Quang Chieu","family":"Ta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Charles","family":"Billaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Louis","family":"Bouquard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","first-page":"1983","article-title":"A heuristic algorithm for the mmachine, n-job flow-shop sequencing problem. Omega","volume":"11","author":"nawaz","year":"0","journal-title":"The International Journal of Management Science"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00028-2"},{"key":"18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1306-7","article-title":"Matheuristics: Hybridizing metaheuristics and mathematical programming","volume":"10","author":"maniezzo","year":"2010","journal-title":"Annals of Information Systems"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00029-C"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00119-0"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)90083-U"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.2307\/2584431"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.04.030"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.07.035"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00090-3"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00037-2"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1080\/00207729708929401"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.05.012"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(89)90005-1"},{"key":"25","article-title":"Recovering beam search and matheuristic algorithms for the f2jj p tj scheduling problem","author":"ta","year":"2013","journal-title":"11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP'13)"},{"journal-title":"Hybrid Metaheuristics Studies in computational intelligence","year":"2013","author":"talbi","key":"26"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.08.016"},{"key":"3","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic algorithm for n-job, m-machine sequencing problem","volume":"16","author":"campbell","year":"1970","journal-title":"Management Science"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00136-7"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00145-X"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00060-4"},{"key":"7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2007.04.004","article-title":"A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods","volume":"54","author":"eks?ioglu","year":"2008","journal-title":"Computers & Industrial Engineering"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.12.023"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20364-0_4","article-title":"A matheuristic approach for the total completion time two-machines permutation flow shop problem","volume":"38 47","author":"della croce","year":"2011","journal-title":"Lecture Notes in Computer Science 6622 LNCS"},{"journal-title":"Theory of Scheduling","year":"1967","author":"conway","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.4"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"}],"event":{"name":"2013 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future (RIVF)","start":{"date-parts":[[2013,11,10]]},"location":"Hanoi, Vietnam","end":{"date-parts":[[2013,11,13]]}},"container-title":["The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6712195\/6719848\/06719893.pdf?arnumber=6719893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T02:38:53Z","timestamp":1498099133000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6719893\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/rivf.2013.6719893","relation":{},"subject":[],"published":{"date-parts":[[2013,11]]}}}