{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:01:51Z","timestamp":1778662911144,"version":"3.51.4"},"reference-count":14,"publisher":"Walter de Gruyter GmbH","issue":"2","funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["723634"],"award-info":[{"award-number":["723634"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,2,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>This paper considers an application of a new variant of a multi-objective flexible job-shop scheduling problem, featuring multisubset selection of manufactured recipes, to a real-world chemical plant. The problem is optimised using a multi-objective genetic algorithm with customised mutation and elitism operators that minimises both the total production time and the produced commodity surplus. The algorithm evaluation is performed with both random and historic manufacturing orders. The latter demonstrated that the proposed system can lead to more than 10\u2009% makespan improvements in comparison with human operators.<\/jats:p>","DOI":"10.1515\/auto-2019-0104","type":"journal-article","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T09:01:55Z","timestamp":1579683715000},"page":"140-147","source":"Crossref","is-referenced-by-count":7,"title":["Process planning and scheduling optimisation with alternative recipes"],"prefix":"10.1515","volume":"68","author":[{"given":"Piotr","family":"Dziurzanski","sequence":"first","affiliation":[{"name":"Department of Computer Science , Univ. of York , Deramore Lane, Heslington , York , UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Zhao","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Univ. of York , Deramore Lane, Heslington , York , UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Scholze","sequence":"additional","affiliation":[{"name":"Institut fur Angewandte Systemtechnik Bremen GmbH , Wiener Strasse 1 , Bremen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Zilverberg","sequence":"additional","affiliation":[{"name":"Institut fur Angewandte Systemtechnik Bremen GmbH , Wiener Strasse 1 , Bremen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl","family":"Krone","sequence":"additional","affiliation":[{"name":"OAS AG , Caroline-Herschel-Strasse 1 , Bremen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leandro Soares","family":"Indrusiak","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Univ. of York , Deramore Lane, Heslington , York , UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"2023033110001597917_j_auto-2019-0104_ref_001_w2aab3b7b1b1b6b1ab1b6b1Aa","doi-asserted-by":"crossref","unstructured":"Chaudhry Imran Ali and Khan Abid Ali. A research survey: review of flexible job shop scheduling techniques. Int. Transactions in Operational Research, 23(3):551\u2013591, 2015.","DOI":"10.1111\/itor.12199"},{"key":"2023033110001597917_j_auto-2019-0104_ref_002_w2aab3b7b1b1b6b1ab1b6b2Aa","doi-asserted-by":"crossref","unstructured":"Kamal Muhammad Amjad et al. Recent research trends in genetic algorithm based flexible job shop scheduling problems. Mathematical Problems in Engineering, pages 1\u201332, 2018.","DOI":"10.1155\/2018\/9270802"},{"key":"2023033110001597917_j_auto-2019-0104_ref_003_w2aab3b7b1b1b6b1ab1b6b3Aa","doi-asserted-by":"crossref","unstructured":"Piotr Dziurzanski, Jerry Swan, Leandro Soares Indrusiak and Jose Ramos. Implementing digital twins of smart factories with interval algebra. In IEEE International Conference on Industrial Technology, ICIT, 2019.","DOI":"10.1109\/ICIT.2019.8755026"},{"key":"2023033110001597917_j_auto-2019-0104_ref_004_w2aab3b7b1b1b6b1ab1b6b4Aa","doi-asserted-by":"crossref","unstructured":"Piotr Dziurzanski, Shuai Zhao, Jerry Swan, Leandro Soares Indrusiak, Sebastian Scholze and Karl Krone. Solving the multi-objective flexible job-shop scheduling problem with alternative recipes for a chemical production process. In Applications of Evolutionary Computation, pages 33\u201348. Springer International Publishing, 2019.","DOI":"10.1007\/978-3-030-16692-2_3"},{"key":"2023033110001597917_j_auto-2019-0104_ref_005_w2aab3b7b1b1b6b1ab1b6b5Aa","unstructured":"Michael R. Garey and David S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W.\u2009H. Freeman & Co., New York, NY, USA, 1990."},{"key":"2023033110001597917_j_auto-2019-0104_ref_006_w2aab3b7b1b1b6b1ab1b6b6Aa","doi-asserted-by":"crossref","unstructured":"Mitsuo Gen and Lin Lin. Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey. Journal of Intelligent Manufacturing, 25(5):849\u2013866, Oct 2014.10.1007\/s10845-013-0804-4","DOI":"10.1007\/s10845-013-0804-4"},{"key":"2023033110001597917_j_auto-2019-0104_ref_007_w2aab3b7b1b1b6b1ab1b6b7Aa","doi-asserted-by":"crossref","unstructured":"Andy Ham. Flexible job shop scheduling problem for parallel batch processing machine with compatible job families. Applied Mathematical Modelling, 45:551\u2013562, 2017.10.1016\/j.apm.2016.12.034","DOI":"10.1016\/j.apm.2016.12.034"},{"key":"2023033110001597917_j_auto-2019-0104_ref_008_w2aab3b7b1b1b6b1ab1b6b8Aa","doi-asserted-by":"crossref","unstructured":"Nhat-To Huynh and Chen-Fu Chien. A hybrid multi-subpopulation genetic algorithm for textile batch dyeing scheduling and an empirical study. Computers & Industrial Engineering, 125:615\u2013627, 2018.10.1016\/j.cie.2018.01.005","DOI":"10.1016\/j.cie.2018.01.005"},{"key":"2023033110001597917_j_auto-2019-0104_ref_009_w2aab3b7b1b1b6b1ab1b6b9Aa","doi-asserted-by":"crossref","unstructured":"H. Ishibuchi and T. Murata. A multi-objective genetic local search algorithm and its application to flowshop scheduling. Trans. Sys. Man Cyber Part C, 28(3):392\u2013403, August 1998.10.1109\/5326.704576","DOI":"10.1109\/5326.704576"},{"key":"2023033110001597917_j_auto-2019-0104_ref_010_w2aab3b7b1b1b6b1ab1b6c10Aa","doi-asserted-by":"crossref","unstructured":"Lin Li and Jia-Zhen Huo. Multi-objective flexible job-shop scheduling problem in steel tubes production. Systems Engineering \u2013 Theory & Practice, 29(8):117\u2013126, 2009.10.1016\/S1874-8651(10)60063-4","DOI":"10.1016\/S1874-8651(10)60063-4"},{"key":"2023033110001597917_j_auto-2019-0104_ref_011_w2aab3b7b1b1b6b1ab1b6c11Aa","doi-asserted-by":"crossref","unstructured":"Carlos A M\u00e9ndez et al.State-of-the-art review of optimization methods for short-term scheduling of batch processes. Computers & Chemical Engineering, 30(6-7):913\u2013946, 2006.10.1016\/j.compchemeng.2006.02.008","DOI":"10.1016\/j.compchemeng.2006.02.008"},{"key":"2023033110001597917_j_auto-2019-0104_ref_012_w2aab3b7b1b1b6b1ab1b6c12Aa","doi-asserted-by":"crossref","unstructured":"Cemal Ozguven, Lale Ozbak\u0131r and Yasemin Yavuz. Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Applied Mathematical Modelling, 34(6):1539\u20131548, 2010.10.1016\/j.apm.2009.09.002","DOI":"10.1016\/j.apm.2009.09.002"},{"key":"2023033110001597917_j_auto-2019-0104_ref_013_w2aab3b7b1b1b6b1ab1b6c13Aa","doi-asserted-by":"crossref","unstructured":"C.\u2009S. Thomalla. Job shop scheduling with alternative process plans. International Journal of Production Economics, 74(1-3):125\u2013134, 2001.10.1016\/S0925-5273(01)00119-0","DOI":"10.1016\/S0925-5273(01)00119-0"},{"key":"2023033110001597917_j_auto-2019-0104_ref_014_w2aab3b7b1b1b6b1ab1b6c14Aa","doi-asserted-by":"crossref","unstructured":"Q. Zhang and H. Li. MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. on Evolutionary Computation, 11(6):712\u2013731, Dec 2007.10.1109\/TEVC.2007.892759","DOI":"10.1109\/TEVC.2007.892759"}],"container-title":["at - Automatisierungstechnik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/auto\/68\/2\/article-p140.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2019-0104\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2019-0104\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T10:38:16Z","timestamp":1680259096000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2019-0104\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,22]]},"references-count":14,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,1,22]]},"published-print":{"date-parts":[[2020,2,25]]}},"alternative-id":["10.1515\/auto-2019-0104"],"URL":"https:\/\/doi.org\/10.1515\/auto-2019-0104","relation":{},"ISSN":["2196-677X","0178-2312"],"issn-type":[{"value":"2196-677X","type":"electronic"},{"value":"0178-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2020,1,22]]}}}