Abstract
We study the design and production process of manufacturers who provide customers with personalized products. Each customer’s order needs to go through two stages: design and production. For this problem, we consider the two scheduling problems with the objective of minimizing the total weighted completion time. Then we consider two models of manufacturing at a personalized level. In the first model, personalized products have the same personalization level, which is proved to have an optimal solution. In the second model, we propose an approximate algorithm with an absolute worst-case ratio of no more than two for personalized products with arbitrary personalization levels, which is proved to be NP-hard in the strong sense.





Similar content being viewed by others
References
Burcin Ozsoydan, F., Sağir, 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)
Cheng, T.C.E., Kuo, W.-H., Yang, D.-L.: Scheduling with a position-weighted learning effect. Optim. Lett. 8(1), 293–306 (2014)
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–719 (2018)
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–872 (2020)
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–326. Elsevier, Amsterdam (1979)
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–388. Springer, Heidelberg (1996)
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)
Ignall, E., Schrage, L.: Application of the branch and bound technique to some flow-shop scheduling problems. Oper. Res. 13(3), 400–412 (1965)
Kaneko, K., Kishita, Y., Umeda, Y.: In pursuit of personalization design. Procedia CIRP 61, 93–97 (2017)
Kaneko, K., Kishita, Y., Umeda, Y.: Toward developing a design method of personalization: proposal of a personalization procedure. Procedia CIRP 69, 740–745 (2018)
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–551 (2021)
Lv, D.-Y., Wang, J.-B.: Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim. Lett. 15, 2311–2319 (2021)
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–35 (2020)
Ribas, I., Companys, R., Tort-Martorell, X.: An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega 39(3), 293–301 (2011)
Ruiz, R., Pan, Q.-K., Naderi, B.: Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega 83, 213–222 (2019)
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)
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–46 (2019)
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–1409 (2012)
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–2584 (2019)
Acknowledgements
This work is partly supported by the National Natural Science Foundation of China under Grants 72371093 and 72071056. This work is also partly supported by the National Key Research and Development Program of China 2019YFE0110300.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Cheng, BY., Duan, J., Shi, XY. et al. Integrated optimization of design and production process with personalization level of products. Optim Lett 18, 1949–1960 (2024). https://doi.org/10.1007/s11590-024-02099-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-024-02099-9