{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:41:09Z","timestamp":1761396069532,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030788100"},{"type":"electronic","value":"9783030788117"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78811-7_25","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:22:37Z","timestamp":1625613757000},"page":"263-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Deep Reinforcement Learning for Dynamic Scheduling of Two-Stage Assembly Flowshop"],"prefix":"10.1007","author":[{"given":"Xin","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/S0377-2217(96)00312-8","volume":"103","author":"AMA Hariri","year":"1997","unstructured":"Hariri, A.M.A., Potts, C.N.: A branch and bound algorithm for the two-stage assembly scheduling problem. Eur. J. Oper. Res. 103, 547\u2013556 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1016\/j.ijpe.2007.12.007","volume":"113","author":"CS Sung","year":"2018","unstructured":"Sung, C.S., Kim, H.A.: A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times. Int. J. Prod. Econ. 113(2), 1038\u20131048 (2018)","journal-title":"Int. J. Prod. Econ."},{"doi-asserted-by":"crossref","unstructured":"Xiong, X.F.K., Wang, F., Lei, H., Han, L.: Minimizing the total completion time in a distributed two stage assembly system with setup times. Comput. Oper. Res. 47, 92\u2013105 (2014)","key":"25_CR3","DOI":"10.1016\/j.cor.2014.02.005"},{"issue":"12","key":"25_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2012.756151","volume":"51","author":"A Mozdgir","year":"2013","unstructured":"Mozdgir, A., Fatemi, G.S.M.T., Jolai, F.: Two-stage assembly flow-shop scheduling problem with non-identical assembly machines considering setup times. Int. J. Prod. Res. 51(12), 1\u201318 (2013)","journal-title":"Int. J. Prod. Res."},{"unstructured":"Nazari, M., Oroojlooy, A., Tak\u010d, M., Snyder, L.V.: Reinforcement learning for solving the vehicle routing problem. In: 32nd Conference on Neural Information Processing Systems. Montreal, pp. 9839\u20139849 (2018)","key":"25_CR5"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"102861","DOI":"10.1016\/j.trc.2020.102861","volume":"121","author":"K Zhang","year":"2020","unstructured":"Zhang, K., Fang, H., Zheng, C.Z., Xi, L., Meng, L.: Multi-vehicle routing problems with soft time windows: a multi-agent reinforcement learning approach. Trans. Res. Part C 121, 102861 (2020)","journal-title":"Trans. Res. Part C"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"106244","DOI":"10.1016\/j.knosys.2020.106244","volume":"204","author":"YJ Hu","year":"2020","unstructured":"Hu, Y.J., Yao, Y., Lee, W.S.: A reinforcement learning approach for optimizing multiple traveling salesman problems over graphs. Knowl. Based Syst. 204, 106244 (2020)","journal-title":"Knowl. Based Syst."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"106208","DOI":"10.1016\/j.asoc.2020.106208","volume":"91","author":"S Luo","year":"2020","unstructured":"Luo, S.: Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Appl. Soft Comput. J. 91, 106208 (2020)","journal-title":"Appl. Soft Comput. J."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.cie.2018.03.039","volume":"125","author":"YR Shiue","year":"2018","unstructured":"Shiue, Y.R., Lee, K.C., Su, C.T.: Real-time scheduling for a smart factory using a reinforcement learning approach. Comput. Ind. Eng. 125, 604\u2013614 (2018)","journal-title":"Comput. Ind. Eng."},{"unstructured":"Zhang, C., Song, W., Cao, J.G., Zhang, J, Tan, P.S., Xu, C.: Learning to dispatch for job shop scheduling via deep reinforcement learning. In: 34th Conference on Neural Information Processing Systems, pp. 1\u201318, Vancouver (2020)","key":"25_CR10"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78811-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:24:10Z","timestamp":1625613850000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78811-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030788100","9783030788117"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78811-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","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":"104","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":"59% - 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":"2,5","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":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}