{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T08:58:26Z","timestamp":1769849906333,"version":"3.49.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1109\/coase.2016.7743493","type":"proceedings-article","created":{"date-parts":[[2016,11,17]],"date-time":"2016-11-17T21:35:22Z","timestamp":1479418522000},"page":"872-877","source":"Crossref","is-referenced-by-count":2,"title":["A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem"],"prefix":"10.1109","author":[{"given":"Marcus","family":"Ritt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","first-page":"108","article-title":"Improvement strategies for the F-race algorithm: Sampling design and iter-ative refinement","volume":"4771","author":"balaprakash","year":"2007","journal-title":"HM 2007 ser LNCS"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","article-title":"Two new robust ge-netic algorithms for the flowshop scheduling problem","volume":"34","author":"ruiz","year":"2006","journal-title":"Omega"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.12.012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601612"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.400"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1966.25"},{"key":"ref15","first-page":"98","article-title":"On the bound of makespans and its application in m machine scheduling problem","volume":"9","author":"nabeshima","year":"1967","journal-title":"J Oper Res Soc Japan"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.53"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00083-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(80)90069-7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00352-5"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600065"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2003.12.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"ref3","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness Freeman"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"ref29","author":"rinnooy kan","year":"1976","journal-title":"Machine scheduling problems-Clas-sification complexity and computations"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.01.007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.024"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2009.2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.12.001"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.05.018"},{"key":"ref21","article-title":"A study of algorithms for industrial scheduling problems","author":"mcmahon","year":"1971"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02564710"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2016.01.005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0087-3"}],"event":{"name":"2016 IEEE International Conference on Automation Science and Engineering (CASE)","location":"Fort Worth, TX, USA","start":{"date-parts":[[2016,8,21]]},"end":{"date-parts":[[2016,8,25]]}},"container-title":["2016 IEEE International Conference on Automation Science and Engineering (CASE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7738291\/7743369\/07743493.pdf?arnumber=7743493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:53:22Z","timestamp":1498362802000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7743493\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/coase.2016.7743493","relation":{},"subject":[],"published":{"date-parts":[[2016,8]]}}}