{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:07:46Z","timestamp":1742911666420,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819947546"},{"type":"electronic","value":"9789819947553"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-4755-3_28","type":"book-chapter","created":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T00:02:38Z","timestamp":1690675358000},"page":"322-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Branch and Bound Algorithm for the Two-Machine Blocking Flowshop Group Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Sen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changsheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,30]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.12.006","volume":"70","author":"JS Neufeld","year":"2016","unstructured":"Neufeld, J.S., Gupta, J.N.D., Buscher, U.: A comprehensive review of flowshop group scheduling literature. Comput. Oper. Res. 70, 56\u201374 (2016)","journal-title":"Comput. Oper. Res."},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"5999","DOI":"10.1109\/TCYB.2020.3041494","volume":"52","author":"QK Pan","year":"2022","unstructured":"Pan, Q.K., Gao, L., Wang, L.: An effective cooperative co-evolutionary algorithm for distributed flowshop group scheduling problems. IEEE Trans. Cybern. 52, 5999\u20136012 (2022)","journal-title":"IEEE Trans. Cybern."},{"issue":"5\u20138","key":"28_CR3","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00170-009-2112-x","volume":"46","author":"G Celano","year":"2010","unstructured":"Celano, G., Costa, A., Fichera, S.: Constrained scheduling of the inspection activities on semiconductor wafers grouped in families with sequence-dependent set-up times. Int. J. Adv. Manuf. Technol. 46(5\u20138), 695\u2013705 (2010)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cor.2009.04.013","volume":"37","author":"N Salmasi","year":"2010","unstructured":"Salmasi, N., Logendran, R., Skandari, M.R.: Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Comput. Oper. Res. 37(1), 199\u2013212 (2010)","journal-title":"Comput. Oper. Res."},{"key":"28_CR5","unstructured":"Gelogullari, C.A.: Group-scheduling problems in electronics manufacturing. Oregon State University (2005)"},{"issue":"3","key":"28_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1080\/05695557908974469","volume":"11","author":"T Yoshida","year":"1979","unstructured":"Yoshida, T., Hitomi, K.: Optimal two-stage production scheduling with setup times separated. AIIE Trans. 11(3), 261\u2013263 (1979)","journal-title":"AIIE Trans."},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0895-7177(90)90368-W","volume":"13","author":"K Baker","year":"1990","unstructured":"Baker, K.: Scheduling groups of jobs in the two-machine flow shop. Math. Comput. Model. 13(3), 29\u201336 (1990)","journal-title":"Math. Comput. Model."},{"issue":"1\u20132","key":"28_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0736-5845(02)00059-5","volume":"19","author":"R Logendran","year":"2003","unstructured":"Logendran, R., Gelogullari, C., Sriskandarajah, C.: Minimizing the mean flow time in a two-machine group-scheduling problem with carryover sequence dependency. Robot. Comput. Integr. Manuf. 19(1\u20132), 21\u201333 (2003)","journal-title":"Robot. Comput. Integr. Manuf."},{"issue":"5","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1016\/j.cor.2004.09.018","volume":"33","author":"X Wang","year":"2006","unstructured":"Wang, X., Cheng, T.: A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups. Comput. Oper. Res. 33(5), 1326\u20131344 (2006)","journal-title":"Comput. Oper. Res."},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-13495-1_16","volume-title":"Advances in Swarm Intelligence","author":"C-D Liou","year":"2010","unstructured":"Liou, C.-D., Liu, C.-H.: A novel encoding scheme of PSO for two-machine group scheduling. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010. LNCS, vol. 6145, pp. 128\u2013134. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13495-1_16"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"113360","DOI":"10.1016\/j.eswa.2020.113360","volume":"152","author":"S Yuan","year":"2020","unstructured":"Yuan, S., Li, T., Wang, B.: A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times. Expert Syst. Appl. 152, 113360 (2020)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"28_CR12","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"13","author":"E Ignall","year":"1965","unstructured":"Ignall, E., Schrage, L.: Application of the branch and bound technique to some flow-shop scheduling problems. Oper. Res. 13(3), 400\u2013412 (1965)","journal-title":"Oper. Res."},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1057\/jors.1965.7","volume":"16","author":"ZA Lomnicki","year":"1965","unstructured":"Lomnicki, Z.A.: A \u201cbranch-and-bound\u201d algorithm for the exact solution of the three-machine scheduling problem. J. Oper. Res. Soc. 16(1), 89\u2013100 (1965)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"28_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1057\/jors.1972.52","volume":"23","author":"SS Reddi","year":"1972","unstructured":"Reddi, S.S., Ramamoorthy, C.V.: On the flowshop sequencing problem with no-wait in process. Oper. Res. Q. 23(3), 323\u2013331 (1972)","journal-title":"Oper. Res. Q."},{"issue":"5","key":"28_CR15","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P Gilmore","year":"1964","unstructured":"Gilmore, P., Gomory, R.: Sequencing a one state variable machine: a solvable case of the traveling salesman problem. Oper. Res. 12(5), 655\u2013679 (1964)","journal-title":"Oper. Res."},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0377-2217(80)90069-7","volume":"5","author":"CN Potts","year":"1980","unstructured":"Potts, C.N.: An adaptive branching rule for the permutation flow-shop problem. Eur. J. Oper. Res. 5(1), 19\u201325 (1980)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10479-005-2444-3","volume":"138","author":"DP Ronconi","year":"2005","unstructured":"Ronconi, D.P.: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Ann. Oper. Res. 138(1), 53\u201365 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"7","key":"28_CR18","doi-asserted-by":"publisher","first-page":"1874","DOI":"10.1016\/j.cor.2013.02.003","volume":"40","author":"G Moslehi","year":"2013","unstructured":"Moslehi, G., Khorasanian, D.: Optimizing blocking flow shop scheduling problem with total completion time criterion. Comput. Oper. Res. 40(7), 1874\u20131883 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"28_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.4025\/actascitechnol.v38i3.28438","volume":"38","author":"FB Sanches","year":"2016","unstructured":"Sanches, F.B., Takano, M.I., Nagano, M.S.: Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking. Acta Sci. Technol. 38(3), 321\u2013326 (2016)","journal-title":"Acta Sci. Technol."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-4755-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T23:18:43Z","timestamp":1690931923000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-4755-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819947546","9789819947553"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-4755-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2023a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2023\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}