{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:13:54Z","timestamp":1725891234911},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314995"},{"type":"electronic","value":"9783642315008"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31500-8_3","type":"book-chapter","created":{"date-parts":[[2012,7,3]],"date-time":"2012-07-03T15:09:08Z","timestamp":1341328148000},"page":"21-30","source":"Crossref","is-referenced-by-count":2,"title":["Grid Branch-and-Bound for Permutation Flowshop"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Drozdowski","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Marciniak","sequence":"additional","affiliation":[]},{"given":"Grzegorz","family":"Pawlak","sequence":"additional","affiliation":[]},{"given":"Maciej","family":"P\u0142aza","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.1100.0394","volume":"23","author":"S. B\u0105k","year":"2011","unstructured":"B\u0105k, S., B\u0142a\u017cewicz, J., Pawlak, G., P\u0142aza, M., Burke, E., Kendall, G.: A parallel branch-and-bound approach to the rectangular guillotine strip cutting problem. INFORMS J. on Computing\u00a023, 15\u201325 (2011)","journal-title":"INFORMS J. on Computing"},{"key":"3_CR2","unstructured":"Clausen, J.: Branch and bound algorithms - principles and examples, Technical Report, Department of Computer Science, University of Copenhagen (1999)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Crainic, T., Le Cun, B., Roucairol, C.: Parallel Branch-and-Bound Algorithms. In: Talbi, E.-G. (ed.) Parallel Combinatorial Optimization, pp. 1\u201328. John Wiley & Sons (2006)","DOI":"10.1002\/9780470053928.ch1"},{"key":"3_CR4","unstructured":"ETSI: 2nd Grid Plugtests Report (2006), \n                    \n                      http:\/\/www.etsi.org\/website\/document\/plugtestshistory\/2005\/2ndgridplugtestsreport.pdf"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M. Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research\u00a01, 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"2895","DOI":"10.1080\/0020754050056417","volume":"43","author":"S. Hejazi","year":"2005","unstructured":"Hejazi, S., Saghafian, S.: Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research\u00a043, 2895\u20132929 (2005)","journal-title":"International Journal of Production Research"},{"key":"3_CR7","unstructured":"Horn, J.: Bibliography on parallel branch-and-bound algorithms (1992), \n                    \n                      http:\/\/liinwww.ira.uka.de\/bibliography\/Parallel\/par.branch.and.bound.html"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two-and-three-stage production schedules with set-up times included. Naval Research Logistics Quarterly\u00a01, 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/S0305-0548(03)00016-9","volume":"31","author":"S. Iyer","year":"2004","unstructured":"Iyer, S., Saxena, B.: Improved genetic algorithm for the permutation flowshop scheduling problem. Computers & Operations Research\u00a031, 593\u2013606 (2004)","journal-title":"Computers & Operations Research"},{"key":"3_CR10","first-page":"229","volume-title":"Computer and Job-Shop Scheduling Theory","author":"W. Kohler","year":"1976","unstructured":"Kohler, W., Steiglitz, K.: Enumerative and iterative computational approaches. In: Coffman Jr., E.G. (ed.) Computer and Job-Shop Scheduling Theory, pp. 229\u2013287. Wiley, New York (1976)"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/358080.358103","volume":"27","author":"T.-H. Lai","year":"1984","unstructured":"Lai, T.-H., Sahni, S.: Anomalies in parallel branch-and-bound algorithms. Communications of the ACM\u00a027, 594\u2013602 (1984)","journal-title":"Communications of the ACM"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/TC.1985.6312201","volume":"34","author":"T.-H. Lai","year":"1985","unstructured":"Lai, T.-H., Sprague, A.: Performance of Parallel Branch-and-Bound Algorithms. IEEE Transactions on Computers\u00a034, 962\u2013964 (1985)","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega\u00a011, 91\u201395 (1983)","journal-title":"Omega"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"C. Reeves","year":"1998","unstructured":"Reeves, C., Yamada, T.: Genetic algorithms, path relinking, and flowshop sequencing problem. Evolutionary Computation\u00a06, 45\u201360 (1998)","journal-title":"Evolutionary Computation"},{"key":"3_CR15","unstructured":"ProActive - Professional Open Source Middleware for Parallel, Distributed, Multi- core Programming, \n                    \n                      http:\/\/proactive.inria.fr\/"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"3_CR17","unstructured":"Taillard, E.: Scheduling instances (2008), \n                    \n                      http:\/\/mistic.heig-vd.ch\/taillard\/problemes.dir\/ordonnancement.dir\/ordonnancement.html"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31500-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:04:27Z","timestamp":1620129867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31500-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314995","9783642315008"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31500-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}