{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T06:00:52Z","timestamp":1749880852840,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71671055","72071056","71971075","71531008","71690230"],"award-info":[{"award-number":["71671055","72071056","71971075","71531008","71690230"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People\u2019s Republic of China","doi-asserted-by":"publisher","award":["2019YFE0110300"],"award-info":[{"award-number":["2019YFE0110300"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s11590-024-02099-9","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T20:02:20Z","timestamp":1709064140000},"page":"1949-1960","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Integrated optimization of design and production process with personalization level of products"],"prefix":"10.1007","volume":"18","author":[{"given":"Ba-Yi","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2253-3844","authenticated-orcid":false,"given":"Jie","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin-Yan","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"2099_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105044","volume":"125","author":"F Burcin Ozsoydan","year":"2021","unstructured":"Burcin Ozsoydan, F., Sa\u011fir, M.: Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: A case study at a manufacturing plant. Comput. Oper. Res. 125, 105044 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2099_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s11590-012-0574-5","volume":"8","author":"TCE Cheng","year":"2014","unstructured":"Cheng, T.C.E., Kuo, W.-H., Yang, D.-L.: Scheduling with a position-weighted learning effect. Optim. Lett. 8(1), 293\u2013306 (2014)","journal-title":"Optim. Lett."},{"key":"2099_CR3","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1016\/j.cie.2018.04.056","volume":"125","author":"R Dou","year":"2018","unstructured":"Dou, R., Lin, D., Nan, G., Lei, S.: A method for product personalized design based on prospect theory improved with interval reference. Comput. Ind. Eng. 125, 708\u2013719 (2018)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"2099_CR4","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1016\/j.ejor.2019.10.017","volume":"282","author":"V Fernandez-Viagas","year":"2020","unstructured":"Fernandez-Viagas, V., Molina-Pariente, J.M., Framinan, J.M.: Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling. Eur. J. Oper. Res. 282(3), 858\u2013872 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"2099_CR5","first-page":"287","volume-title":"Annals of Discrete Mathematics","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer, P.L., Johnson, E.L., Korte, B.H. (eds.) Annals of Discrete Mathematics, pp. 287\u2013326. Elsevier, Amsterdam (1979)"},{"key":"2099_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-61310-2_28","volume-title":"Integer Programming and Combinatorial Optimization","author":"H Hoogeveen","year":"1996","unstructured":"Hoogeveen, H., Kawaguchi, T.: Minimizing total completion time in a two-machine flowshop: analysis of special cases. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) Integer Programming and Combinatorial Optimization, pp. 374\u2013388. Springer, Heidelberg (1996)"},{"key":"2099_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.107021","volume":"152","author":"Y-Y Huang","year":"2021","unstructured":"Huang, Y.-Y., Pan, Q.-K., Huang, J.-P., Suganthan, P.N., Gao, L.: An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem. Comput. Ind. Eng. 152, 107021 (2021)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"2099_CR8","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"13","author":"E Ignall","year":"1965","unstructured":"Ignall, E., Schrage, L.: Application of the branch and bound technique to some flow-shop scheduling problems. Oper. Res. 13(3), 400\u2013412 (1965)","journal-title":"Oper. Res."},{"key":"2099_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.procir.2016.12.003","volume":"61","author":"K Kaneko","year":"2017","unstructured":"Kaneko, K., Kishita, Y., Umeda, Y.: In pursuit of personalization design. Procedia CIRP 61, 93\u201397 (2017)","journal-title":"Procedia CIRP"},{"key":"2099_CR10","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1016\/j.procir.2017.11.134","volume":"69","author":"K Kaneko","year":"2018","unstructured":"Kaneko, K., Kishita, Y., Umeda, Y.: Toward developing a design method of personalization: proposal of a personalization procedure. Procedia CIRP 69, 740\u2013745 (2018)","journal-title":"Procedia CIRP"},{"issue":"2","key":"2099_CR11","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s11590-018-1322-2","volume":"15","author":"S Lu","year":"2021","unstructured":"Lu, S., Liu, X., Pei, J., et al.: Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines. Optim. Lett. 15(2), 537\u2013551 (2021)","journal-title":"Optim. Lett."},{"key":"2099_CR12","doi-asserted-by":"publisher","first-page":"2311","DOI":"10.1007\/s11590-020-01670-4","volume":"15","author":"D-Y Lv","year":"2021","unstructured":"Lv, D.-Y., Wang, J.-B.: Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim. Lett. 15, 2311\u20132319 (2021)","journal-title":"Optim. Lett."},{"key":"2099_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s12351-017-0308-7","volume":"20","author":"MA Rakrouki","year":"2020","unstructured":"Rakrouki, M.A., Kooli, A., Chalghoumi, S., Ladhari, T.: A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates. Oper. Res. Int. J. 20, 21\u201335 (2020)","journal-title":"Oper. Res. Int. J."},{"issue":"3","key":"2099_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"39","author":"I Ribas","year":"2011","unstructured":"Ribas, I., Companys, R., Tort-Martorell, X.: An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega 39(3), 293\u2013301 (2011)","journal-title":"Omega"},{"key":"2099_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz, R., Pan, Q.-K., Naderi, B.: Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega 83, 213\u2013222 (2019)","journal-title":"Omega"},{"issue":"22","key":"2099_CR16","doi-asserted-by":"publisher","first-page":"5895","DOI":"10.3390\/en13225895","volume":"13","author":"S Saniuk","year":"2020","unstructured":"Saniuk, S., Grabowska, S., Gajdzik, B.: Personalization of products in the industry 4.0 concept and its impact on achieving a higher level of sustainable consumption. Energies 13(22), 5895 (2020)","journal-title":"Energies"},{"issue":"1","key":"2099_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.orl.2018.12.002","volume":"47","author":"H Wei","year":"2019","unstructured":"Wei, H., Yuan, J.: Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time. Oper. Res. Lett. 47(1), 41\u201346 (2019)","journal-title":"Oper. Res. Lett."},{"issue":"7","key":"2099_CR18","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1007\/s11590-011-0334-y","volume":"6","author":"J-B Wang","year":"2012","unstructured":"Wang, J.-B., Ji, P., Cheng, T.C.E., Wang, D.: Minimizing makespan in a two-machine flow shop with effects of deterioration and learning. Optim. Lett. 6(7), 1393\u20131409 (2012)","journal-title":"Optim. Lett."},{"issue":"8","key":"2099_CR19","doi-asserted-by":"publisher","first-page":"2571","DOI":"10.1080\/00207543.2018.1530475","volume":"57","author":"P Zheng","year":"2019","unstructured":"Zheng, P., Lin, Y., Chen, C.-H., Xu, X.: Smart, connected open architecture product: an IT-driven co-creation paradigm with lifecycle personalization concerns. Int. J. Prod. Res. 57(8), 2571\u20132584 (2019)","journal-title":"Int. J. Prod. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02099-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02099-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02099-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T09:13:12Z","timestamp":1728119592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02099-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,27]]},"references-count":19,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2099"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02099-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,2,27]]},"assertion":[{"value":"17 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}