{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T15:43:06Z","timestamp":1766504586433,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031138317"},{"type":"electronic","value":"9783031138324"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-13832-4_39","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T11:32:22Z","timestamp":1660563142000},"page":"473-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Deep Reinforcement Learning Algorithm for Permutation Flow Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Yuanyuan","family":"Yang","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":"Dacheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,16]]},"reference":[{"issue":"7\u20138","key":"39_CR1","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00170-007-1115-8","volume":"38","author":"B Qian","year":"2008","unstructured":"Qian, B., Wang, L., Hu, R., Wang, W.L., Huang, D.X., Wang, X.: A hybrid differential evolution method for permutation flow-shop scheduling. Int. J. Adv. Manuf. Tech. 38(7\u20138), 757\u2013777 (2008)","journal-title":"Int. J. Adv. Manuf. Tech."},{"issue":"1","key":"39_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.cor.2012.05.018","volume":"40","author":"QK Pan","year":"2013","unstructured":"Pan, Q.K., Ruiz, R.: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Comput. Oper. Res. 40(1), 117\u2013128 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"39_CR3","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(1), 56\u201374 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"39_CR4","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","volume":"257","author":"V Fernandez-Viagas","year":"2017","unstructured":"Fernandez-Viagas, V., Ruiz, R., Framinan, J.M.: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation. Eur. J. Oper. Res. 257(3), 707\u2013721 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.trb.2016.03.009","volume":"89","author":"M Mahmoudi","year":"2016","unstructured":"Mahmoudi, M., Zhou, X.S.: Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: a dynamic programming approach based on state-space-time network representations. Transp. Res. Part B 89, 19\u201342 (2016)","journal-title":"Transp. Res. Part B"},{"issue":"1","key":"39_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1002\/net.21937","volume":"76","author":"G Lera-Romero","year":"2020","unstructured":"Lera-Romero, G., Bront, J.J.M., Soulignac, F.J.: Linear edge costs and labeling algorithms: the case of the time-dependent vehicle routing problem with time windows. Networks 76(1), 24\u201353 (2020)","journal-title":"Networks"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Teoh, E.J., Tang, H., Tan, K.C.: A columnar competitive model with simulated annealing for solving combinatorial optimization problems. In: The 2006 IEEE International Joint Conference on Neural Network Proceedings, pp. 3254\u20133259. IEEE (2006)","DOI":"10.1109\/IJCNN.2006.247320"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Wesley Barnes, J., Laguna, M.: Solving the multiple-machine weighted flow time problem using tabu search. IIE Trans. 25(2), 121\u2013128 (1993)","DOI":"10.1080\/07408179308964284"},{"issue":"2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11831-017-9247-y","volume":"26","author":"AH Halim","year":"2019","unstructured":"Halim, A.H., Ismail, I.: Combinatorial optimization: comparison of heuristic algorithms in travelling salesman problem. Arch. Comput. Methods Eng. 26(2), 367\u2013380 (2019)","journal-title":"Arch. Comput. Methods Eng."},{"issue":"1","key":"39_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s12293-017-0232-7","volume":"10","author":"A Rezoug","year":"2017","unstructured":"Rezoug, A., Bader-El-Den, M., Boughaci, D.: Guided genetic algorithm for the multidimensional knapsack problem. Memetic Comput. 10(1), 29\u201342 (2017). https:\/\/doi.org\/10.1007\/s12293-017-0232-7","journal-title":"Memetic Comput."},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Prado, R.S., Silva, R.C.P., Guimar\u00e3es, F.G., Neto, O.M.: Using differential evolution for combinatorial optimization: a general approach. In: 2010 IEEE International Conference on Systems, Man and Cybernetics, IEEE, pp. 11\u201318 (2010)","DOI":"10.1109\/ICSMC.2010.5642193"},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"20281","DOI":"10.1109\/ACCESS.2019.2897580","volume":"7","author":"W Deng","year":"2019","unstructured":"Deng, W., Xu, J., Zhao, H.: An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access 7, 20281\u201320292 (2019)","journal-title":"IEEE Access"},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","volume":"42","author":"Y Zhong","year":"2018","unstructured":"Zhong, Y., Lin, J., Wang, L., Zhang, H.: Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Swarm Evol. Comput. 42, 77\u201388 (2018)","journal-title":"Swarm Evol. Comput."},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: framework and applications. In: Handbook of Metaheuristics, pp. 129\u2013168. Springer (2019)","DOI":"10.1007\/978-3-319-91086-4_5"},{"issue":"5","key":"39_CR15","doi-asserted-by":"publisher","first-page":"11561","DOI":"10.1007\/s10586-017-1420-4","volume":"22","author":"G Zhang","year":"2019","unstructured":"Zhang, G., Zhang, L., Song, X., Wang, Y., Zhou, C.: A variable neighborhood search based genetic algorithm for flexible job-shop scheduling problem. Clust. Comput. 22(5), 11561\u201311572 (2019)","journal-title":"Clust. Comput."},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Li, L., Lin, Q., Li, K., et al.: Vertical distance-based clonal selection mechanism for the multiobjective immune algorithm. Swarm Evol. Comput., 100886 (2021)","DOI":"10.1016\/j.swevo.2021.100886"},{"key":"39_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105490","volume":"81","author":"L Li","year":"2019","unstructured":"Li, L., Lin, Q., Liu, S., et al.: A novel multi-objective immune algorithm with a decomposition-based clonal selection. Appl. Soft Comput. 81, 105490 (2019)","journal-title":"Appl. Soft Comput."},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"483","DOI":"10.18280\/ts.360602","volume":"36","author":"S Ouchtati","year":"2019","unstructured":"Ouchtati, S., Chergui, A., Mavromatis, S., Aissa, B., Rafik, D., Sequeira, J.: Novel method for brain tumor classification based on use of image entropy and seven Hu\u2019s invariant moments. Traitement du Signal 36, 483\u2013491 (2019)","journal-title":"Traitement du Signal"},{"key":"39_CR19","doi-asserted-by":"publisher","first-page":"447","DOI":"10.18280\/ria.330607","volume":"33","author":"F Berrezzek","year":"2019","unstructured":"Berrezzek, F., Khelil, K., Bouadjila, T.: Efficient wind speed forecasting using discrete wavelet transform and artificial neural networks. Revue d\u2019Intelligence Artificielle 33, 447\u2013452 (2019)","journal-title":"Revue d\u2019Intelligence Artificielle"},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"383","DOI":"10.18280\/ts.360502","volume":"36","author":"F Sbargoud","year":"2019","unstructured":"Sbargoud, F., Djeha, M., Guiatni, M., Ababou, N.: WPT-ANN and belief theory based EEG\/EMG data fusion for movement identification. Traitement du Signal 36, 383\u2013391 (2019)","journal-title":"Traitement du Signal"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Tang, J., Salonitis, K.: A Deep Reinforcement Learning Based Scheduling Policy for Reconfigurable Manufacturing Systems - ScienceDirect (2021)","DOI":"10.1016\/j.procir.2021.09.089"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Lee, Y.H., Lee, S.: Deep reinforcement learning based scheduling within production plan in semiconductor fabrication. Expert Syst. Appl. 191 (2022)","DOI":"10.1016\/j.eswa.2021.116222"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Marchesano, M.G., Guizzi, G., Santillo, L.C., Vespoli, S.: A Deep Reinforcement Learning approach for the throughput control of a Flow-Shop production system. IFAC-PapersOnLine 54(1), 61\u201366 (2021)","DOI":"10.1016\/j.ifacol.2021.08.006"},{"key":"39_CR24","doi-asserted-by":"crossref","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)","DOI":"10.1016\/j.cie.2018.03.039"},{"key":"39_CR25","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","volume":"240","author":"E Vallada","year":"2017","unstructured":"Vallada, E., Ruiz, R., Framinan, J.M.: New hard benchmark for flowshop scheduling problems minimising makespan. Eur. J. Oper. Res. 240, 666\u2013677 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"39_CR26","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1080\/002075498193877","volume":"36","author":"I Sabuncuoglu","year":"1998","unstructured":"Sabuncuoglu, I.: A study of scheduling rules of flexible manufacturing systems: a simulation approach. Int. J. Prod. Res. 36(2), 527\u2013546 (1998)","journal-title":"Int. J. Prod. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Methodologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13832-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T19:18:19Z","timestamp":1727810299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13832-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031138317","9783031138324"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13832-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 August 2022","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":"Xi'an","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2022\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IC-ICC-CN","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"449","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":"209","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":"47% - 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","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":"2.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)"}}]}}