综合优化设计和生产流程,提高产品的个性化水平

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY Accounts of Chemical Research Pub Date : 2024-02-27 DOI:10.1007/s11590-024-02099-9
Ba-Yi Cheng, Jie Duan, Xin-Yan Shi, Mi Zhou
{"title":"综合优化设计和生产流程,提高产品的个性化水平","authors":"Ba-Yi Cheng, Jie Duan, Xin-Yan Shi, Mi Zhou","doi":"10.1007/s11590-024-02099-9","DOIUrl":null,"url":null,"abstract":"<p>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.</p>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Integrated optimization of design and production process with personalization level of products\",\"authors\":\"Ba-Yi Cheng, Jie Duan, Xin-Yan Shi, Mi Zhou\",\"doi\":\"10.1007/s11590-024-02099-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>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.</p>\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2024-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11590-024-02099-9\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11590-024-02099-9","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

我们研究为客户提供个性化产品的制造商的设计和生产流程。每个客户的订单都需要经过设计和生产两个阶段。针对这一问题,我们考虑了两个调度问题,目标是最大限度地减少总加权完成时间。然后,我们考虑两种个性化生产模式。在第一种模式中,个性化产品具有相同的个性化水平,这被证明是最优解。在第二个模型中,我们针对具有任意个性化水平的个性化产品提出了一种绝对最坏情况比率不超过 2 的近似算法,该算法在强意义上被证明为 NP-hard。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Integrated optimization of design and production process with personalization level of products

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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
期刊最新文献
Management of Cholesteatoma: Hearing Rehabilitation. Congenital Cholesteatoma. Evaluation of Cholesteatoma. Management of Cholesteatoma: Extension Beyond Middle Ear/Mastoid. Recidivism and Recurrence.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1