{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:19:24Z","timestamp":1761293964773,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030267629"},{"type":"electronic","value":"9783030267636"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26763-6_65","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"676-685","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Cross-entropy Algorithm for Mixed Model U-shaped Assembly Line Balancing Problem"],"prefix":"10.1007","author":[{"given":"Yi-Fan","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng-Hong","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"65_CR1","first-page":"1001","volume":"2","author":"YP Du","year":"2003","unstructured":"Du, Y.P., Yang, Y.X.: The research into the problem of assembly line balance. Mach. Des. Manuf. 2, 1001\u20133997 (2003)","journal-title":"Mach. Des. Manuf."},{"issue":"10","key":"65_CR2","first-page":"55","volume":"29","author":"ME Salveson","year":"1955","unstructured":"Salveson, M.E.: The assembly line balancing problem. J. Ind. Eng. 29(10), 55\u2013101 (1955)","journal-title":"J. Ind. Eng."},{"key":"65_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-662-11223-6","volume-title":"Balancing and Sequencing of Assembly Lines","author":"A Scholl","year":"1999","unstructured":"Scholl, A.: Balancing and Sequencing of Assembly Lines, 2nd edn, pp. 34\u2013351. Physica-Verlag, Heidelberg (1999)","edition":"2"},{"key":"65_CR4","doi-asserted-by":"crossref","unstructured":"Miltenburg, G.J., Wijngaard, J.: The U-line balancing problem. INFORMS (1994)","DOI":"10.1287\/mnsc.40.10.1378"},{"issue":"5","key":"65_CR5","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1287\/mnsc.44.5.738","volume":"44","author":"TL Urban","year":"1998","unstructured":"Urban, T.L.: Note. Optimal balancing of U-shaped assembly lines. Manag. Sci. 44(5), 738\u2013741 (1998)","journal-title":"Manag. Sci."},{"issue":"4","key":"65_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.apm.2004.10.003","volume":"29","author":"C Gencer","year":"2005","unstructured":"Gencer, C., et al.: A shortest route formulation of simple U-type assembly line balancing problem. Appl. Math. Model. 29(4), 373\u2013380 (2005)","journal-title":"Appl. Math. Model."},{"issue":"1\u20132","key":"65_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00170-005-0322-4","volume":"32","author":"A Baykaso\u011flu","year":"2007","unstructured":"Baykaso\u011flu, A., \u00d6zbak\u0131r, L.: Stochastic U-line balancing using genetic algorithms. Int. J. Adv. Manuf. Technol. 32(1\u20132), 139\u2013147 (2007)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"65_CR8","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.jmsy.2014.05.002","volume":"33","author":"S Jayaswal","year":"2014","unstructured":"Jayaswal, S., Agarwal, P.: Balancing U-shaped assembly lines with resource dependent task times: a simulated annealing approach. J. Manuf. Syst. 33(4), 522\u2013534 (2014)","journal-title":"J. Manuf. Syst."},{"issue":"2","key":"65_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.ijpe.2008.11.017","volume":"120","author":"I Sabuncuoglu","year":"2009","unstructured":"Sabuncuoglu, I., Erel, E., Alp, A.: Ant colony optimization for the single model U-type assembly line balancing problem. Int. J. Prod. Econ. 120(2), 287\u2013300 (2009)","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"65_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jmsy.2012.02.002","volume":"31","author":"M Rabbani","year":"2012","unstructured":"Rabbani, M., Kazemi, S.M., Manavizadeh, N.: Mixed model U-line balancing type-1 problem: A new approach. J. Manuf. Syst. 31(2), 131\u2013138 (2012)","journal-title":"J. Manuf. Syst."},{"key":"65_CR11","first-page":"137","volume":"1","author":"Z-K Zhang","year":"2016","unstructured":"Zhang, Z.-K., et al.: Balancing large-size mixed-model U-type assembly lines via improved genetic algorithm. Mach. Des. Manuf. 1, 137\u2013139 (2016)","journal-title":"Mach. Des. Manuf."},{"key":"65_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4321-0","volume-title":"The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization. Monte-Carlo Simulation and Machine Learning","author":"RY Rubinstein","year":"2004","unstructured":"Rubinstein, R.Y., Kroese, D.P.: The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization. Monte-Carlo Simulation and Machine Learning. Springer Verlag, New York (2004). https:\/\/doi.org\/10.1007\/978-1-4757-4321-0"},{"issue":"1","key":"65_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10479-005-5729-7","volume":"134","author":"K Chepuri","year":"2005","unstructured":"Chepuri, K., Homem-De-Mello, T.: Solving the vehicle routing problem with stochastic demands using the cross-entropy method. Ann. Oper. Res. 134(1), 153\u2013181 (2005)","journal-title":"Ann. Oper. Res."},{"key":"65_CR14","first-page":"171","volume":"3","author":"B Santosa","year":"2011","unstructured":"Santosa, B., Budiman, M.A., Wiratno, S.E.: A cross entropy-genetic algorithm for m-machines no-wait job-shop scheduling problem. J. Intell. Learn. Syst. Appl. 3, 171\u2013180 (2011)","journal-title":"J. Intell. Learn. Syst. Appl."},{"key":"65_CR15","doi-asserted-by":"publisher","first-page":"332","DOI":"10.21914\/anziamj.v51i0.2594","volume":"51","author":"IB Wadhawan","year":"2010","unstructured":"Wadhawan, I.B., Pudney, P.J., Howlett, P.G., et al.: Scheduling trains with cross entropy optimisation. Anziam J. 51, 332\u2013346 (2010)","journal-title":"Anziam J."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26763-6_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T13:20:07Z","timestamp":1617283207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26763-6_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030267629","9783030267636"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26763-6_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","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":"Nanchang","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2019\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ICIC Website","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"609","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"217","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.43","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}