{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T15:30:52Z","timestamp":1769268652969,"version":"3.49.0"},"reference-count":38,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:00:00Z","timestamp":1640908800000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003052","name":"Ministry of Trade, Industry and Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003052","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,30]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n               <jats:p>During the shipbuilding process, a block assembly line suffers a bottleneck when the largest amount of material is processed. Therefore, scheduling optimization is important for the productivity. Currently, sequence of inbound products is controlled by determining the input sequence using a heuristic or metaheuristic approach. However, the metaheuristic algorithm has limitations in that the computation time increases exponentially as the number of input objects increases, and separate optimization calculations are required for every problem. Also, the heuristic such as dispatching algorithm has the limitation of the exploring the problem domain. Therefore, this study tries a reinforcement learning algorithm based on a pointer network to overcome these limitations. Reinforcement learning with pointer network is found to be suitable for permutation flowshop problem, including input-order optimization. A trained neural network is applied without re-learning, even if the number of inputs is changed. The trained model shows the meaningful results compared with the heuristic and metaheuristic algorithms in makespan and computation time. The trained model outperforms the heuristic and metaheuristic algorithms within a limited range of permutation flowshop problem.<\/jats:p>","DOI":"10.1093\/jcde\/qwab068","type":"journal-article","created":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T20:15:22Z","timestamp":1636143322000},"page":"51-67","source":"Crossref","is-referenced-by-count":17,"title":["Minimize makespan of permutation flowshop using pointer network"],"prefix":"10.1093","volume":"9","author":[{"given":"Young In","family":"Cho","sequence":"first","affiliation":[{"name":"Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul 08826, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"So Hyun","family":"Nam","sequence":"additional","affiliation":[{"name":"Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul 08826, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ki Young","family":"Cho","sequence":"additional","affiliation":[{"name":"Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul 08826, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hee Chang","family":"Yoon","sequence":"additional","affiliation":[{"name":"Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul 08826, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jong Hun","family":"Woo","sequence":"additional","affiliation":[{"name":"Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul 08826, Korea"},{"name":"Research Institute of Marine Systems Engineering, Seoul National University, Seoul 08826, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,12,30]]},"reference":[{"key":"2021123110075317300_bib1","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016"},{"issue":"5","key":"2021123110075317300_bib35_1638956152076","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1093\/jcde\/qwaa050","article-title":"Moth flame optimizer-based solution approach for unit commitment and generation scheduling problem of electric power system","volume":"7","author":"Bhadoria","year":"2020","journal-title":"Journal of Computational Design and Engineering"},{"issue":"10","key":"2021123110075317300_bib2","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic algorithm for the n job, m machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Management Science"},{"issue":"2","key":"2021123110075317300_bib3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0925-5273(99)00104-8","article-title":"Minimizing makespan in a blocking flowshop using genetic algorithms","volume":"70","author":"Caraffa","year":"2001","journal-title":"International Journal of Production Economics"},{"key":"2021123110075317300_bib4","doi-asserted-by":"crossref","first-page":"142065","DOI":"10.1109\/ACCESS.2020.3014106","article-title":"Minimizing total completion time in mixed-blocking permutation flowshops","volume":"8","author":"Cheng","year":"2020","journal-title":"IEEE Access"},{"issue":"3","key":"2021123110075317300_bib5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","article-title":"An algorithm for the vehicle-dispatching problem","volume":"20","author":"Christofides","year":"1969","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"2021123110075317300_bib6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.jcde.2016.05.001","article-title":"Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem","volume":"3","author":"Eddaly","year":"2016","journal-title":"Journal of Computational Design and Engineering"},{"key":"2021123110075317300_bib7","doi-asserted-by":"crossref","first-page":"104767","DOI":"10.1016\/j.cor.2019.104767","article-title":"A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective","volume":"112","author":"Fernandez-Viagas","year":"2019","journal-title":"Computers & Operations Research"},{"issue":"2","key":"2021123110075317300_bib8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"2021123110075317300_bib36_1638956952096","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.jcde.2018.10.006","article-title":"A hybridization of differential evolution and monarch butterfly optimization for solving systems of nonlinear equations","volume":"6","author":"Ibrahim","year":"2019","journal-title":"Journal of Computational Design and Engineering"},{"key":"2021123110075317300_bib9","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.cie.2016.03.019","article-title":"Synchronized production planning and scheduling in semiconductor fabrication","volume":"96","author":"Kim","year":"2016","journal-title":"Computers & Industrial Engineering"},{"issue":"6","key":"2021123110075317300_bib10","doi-asserted-by":"crossref","first-page":"673","DOI":"10.7232\/JKIIE.2020.46.6.673","article-title":"Analysis of master plan and procurement plan of shipbuilding based on queuing theory with variability","volume":"46","author":"Kwak","year":"2020","journal-title":"Journal of the Korean Institute of Industrial Engineers"},{"issue":"5","key":"2021123110075317300_bib11","doi-asserted-by":"crossref","first-page":"314","DOI":"10.3744\/SNAK.2013.50.5.314","article-title":"Study on simulation model generation of a shipyard panel block shop using a neutral data format for production information","volume":"50","author":"Lee","year":"2013","journal-title":"Journal of the Society of Naval Architects of Korea"},{"issue":"8","key":"2021123110075317300_bib12","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1080\/09537280903164128","article-title":"Development of simulation-based production execution system in a shipyard: A case study for a panel block assembly shop","volume":"20","author":"Lee","year":"2009","journal-title":"Production Planning & Control"},{"key":"2021123110075317300_bib13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/0951192X.2020.1775304","article-title":"Simulation-based planning system for shipbuilding","volume":"33","author":"Lee","year":"2020","journal-title":"International Journal of Computer Integrated Manufacturing"},{"key":"2021123110075317300_bib14","first-page":"1","article-title":"An improved simulated annealing algorithm based on residual network for permutation flow shop scheduling","volume":"7","author":"Li","year":"2020","journal-title":"Complex & Intelligent Systems"},{"issue":"3","key":"2021123110075317300_bib37_1638957002552","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.jcde.2019.02.002","article-title":"IWOA: An improved whale optimization algorithm for optimization problems","volume":"6","author":"Mostafa\u00a0Bozorgi","year":"2019","journal-title":"Journal of Computational Design and Engineering"},{"issue":"1","key":"2021123110075317300_bib15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"issue":"14","key":"2021123110075317300_bib16","doi-asserted-by":"crossref","first-page":"4217","DOI":"10.1080\/00207540802404364","article-title":"A hybrid neural network\u2013genetic algorithm approach for permutation flow shop scheduling","volume":"48","author":"Noorul\u00a0Haq","year":"2010","journal-title":"International Journal of Production Research"},{"issue":"6","key":"2021123110075317300_bib17","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","article-title":"Simulated annealing for permutation flow-shop scheduling","volume":"17","author":"Osman","year":"1989","journal-title":"Omega"},{"issue":"1","key":"2021123110075317300_bib18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1057\/jors.1965.8","article-title":"Sequencing jobs through a multi-stage process in the minimum total time\u2014a quick method of obtaining a near optimum","volume":"16","author":"Palmer","year":"1965","journal-title":"Journal of the Operational Research Society"},{"key":"2021123110075317300_bib19","doi-asserted-by":"crossref","DOI":"10.1109\/PHM-Besancon49106.2020.00068","article-title":"Solving permutation flowshop problem with deep reinforcement learning","volume-title":"2020 Prognostics and Health Management Conference (PHM-Besan\u00e7on)","author":"Pan","year":"2020"},{"issue":"3","key":"2021123110075317300_bib20","first-page":"1420","article-title":"A reinforcement learning approach to robust scheduling of semiconductor manufacturing facilities","volume":"17","author":"Park","year":"2019","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"2021123110075317300_bib21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume":"29","author":"Pinedo","year":"2012","journal-title":"Scheduling"},{"issue":"2","key":"2021123110075317300_bib22","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.ejor.2015.06.018","article-title":"A real-time order acceptance and scheduling approach for permutation flow shop problems","volume":"247","author":"Rahman","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2021123110075317300_bib23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"A genetic algorithm for flowshop sequencing","volume":"22","author":"Reeves","year":"1995","journal-title":"Computers & Operations Research"},{"issue":"E18","key":"2021123110075317300_bib24","first-page":"257","article-title":"An improvement of reinforcement learning approach for permutation of flow-shop scheduling problems","author":"Reyna","year":"2019","journal-title":"Revista Ib\u00e9rica de Sistemas e Tecnologias de Informa\u00e7\u00e3o"},{"key":"2021123110075317300_bib25","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"issue":"2","key":"2021123110075317300_bib26","doi-asserted-by":"crossref","first-page":"79","DOI":"10.5957\/jsp.2004.20.2.79","article-title":"A modeling and simulation of production process in subassembly lines at a shipyard","volume":"20","author":"Shin","year":"2004","journal-title":"Journal of Ship Production"},{"key":"2021123110075317300_bib27","article-title":"Pointer networks","author":"Vinyals","year":"2015"},{"issue":"4","key":"2021123110075317300_bib28","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.ijnaoe.2016.03.009","article-title":"Research on scheduling and optimization under uncertain conditions in panel block production line in shipbuilding","volume":"8","author":"Wang","year":"2016","journal-title":"International Journal of Naval Architecture and Ocean Engineering"},{"issue":"4","key":"2021123110075317300_bib29","doi-asserted-by":"crossref","first-page":"5613","DOI":"10.1109\/LRA.2020.3005626","article-title":"Novel energy-and maintenance-aware collaborative scheduling for a hybrid flow shop based on dual memetic algorithms","volume":"5","author":"Wang","year":"2020","journal-title":"IEEE Robotics and Automation Letters"},{"key":"2021123110075317300_bib30","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.cor.2016.10.003","article-title":"A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem","volume":"79","author":"Wang","year":"2017","journal-title":"Computers & Operations Research"},{"key":"2021123110075317300_bib31","article-title":"Solving the flow shop problem by parallel simulated annealing","volume-title":"International Conference on Parallel Processing and Applied Mathematics","author":"Wodecki","year":"2001"},{"key":"2021123110075317300_bib32","doi-asserted-by":"crossref","first-page":"104226","DOI":"10.1016\/j.engappai.2021.104226","article-title":"Automation of load balancing for Gantt planning using reinforcement learning","volume":"101","author":"Woo","year":"2021","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"2","key":"2021123110075317300_bib33","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1080\/0951192X.2017.1407452","article-title":"Development of simulation framework for shipbuilding","volume":"31","author":"Woo","year":"2018","journal-title":"International Journal of Computer Integrated Manufacturing"},{"issue":"1","key":"2021123110075317300_bib38_1638957068333","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.jcde.2015.06.003","article-title":"Lion optimization algorithm (LOA): a nature-inspired metaheuristic algorithm","volume":"3","author":"Yazdani","year":"2016","journal-title":"Journal of Computational Design and Engineering"},{"key":"2021123110075317300_bib34","article-title":"Pointer networks for solving the permutation flow shop scheduling problem","volume-title":"The 48th International Conference on Computers & Industrial Engineering","author":"Zheng","year":"2018"}],"container-title":["Journal of Computational Design and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/9\/1\/51\/41988773\/qwab068.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/9\/1\/51\/41988773\/qwab068.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T10:08:41Z","timestamp":1640945321000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jcde\/article\/9\/1\/51\/6490309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,30]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12,30]]}},"URL":"https:\/\/doi.org\/10.1093\/jcde\/qwab068","relation":{},"ISSN":["2288-5048"],"issn-type":[{"value":"2288-5048","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,2]]},"published":{"date-parts":[[2021,12,30]]}}}