一种同步平衡和排序算法,用于规划时尚行业的装配线

IF 1.5 Q2 MATERIALS SCIENCE, TEXTILES
J. Perret
{"title":"一种同步平衡和排序算法,用于规划时尚行业的装配线","authors":"J. Perret","doi":"10.1108/rjta-04-2022-0045","DOIUrl":null,"url":null,"abstract":"\nPurpose\nThe purpose of the study is to fill a gap in the literature on mathematical production planning (joint balancing and sequencing) in the fashion industry. It considers in particular situations of mass customization, made-to-measure or small lot sizes.\n\n\nDesign/methodology/approach\nThe paper develops a mathematical model based on product options and attributes instead of fixed variants. It proposes an easy-to-use genetic algorithm to solve the resulting optimization problem. Functionality and performance of the algorithm are illustrated via a computational study.\n\n\nFindings\nAn easy-to-implement, yet efficient algorithm to solve the multi-objective implementation of a problem structure that becomes increasingly relevant in the fashion industry is proposed. Implementation of the algorithm revealed that the algorithm is ideally suited to generate significant savings and that these savings are impervious to problem and thus company size.\n\n\nPractical implications\nThe solutions from the algorithm (Pareto-efficient frontier) offer decision-makers more flexibility in selecting those solutions they deem most fitting for their situation. The computational study illustrates the significant monetary savings possible by implementing the proposed algorithm to practical situations.\n\n\nOriginality/value\nIn contrast to existing papers, for the first time, to the best of the author’s knowledge, the focus of the joint balancing and sequencing approach has been applied in the fashion instead of the automotive industry. The applicability of the approach to specific fields of the fashion industry is discussed. An option and attributes-based model, rarely used in general assembly line sequencing per se, is used for more flexibility in representing a diverse set of model types.\n","PeriodicalId":21107,"journal":{"name":"Research journal of textile and apparel","volume":" ","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2022-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A simultaneous balancing and sequencing algorithm to plan assembly lines in the fashion industry\",\"authors\":\"J. Perret\",\"doi\":\"10.1108/rjta-04-2022-0045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\nPurpose\\nThe purpose of the study is to fill a gap in the literature on mathematical production planning (joint balancing and sequencing) in the fashion industry. It considers in particular situations of mass customization, made-to-measure or small lot sizes.\\n\\n\\nDesign/methodology/approach\\nThe paper develops a mathematical model based on product options and attributes instead of fixed variants. It proposes an easy-to-use genetic algorithm to solve the resulting optimization problem. Functionality and performance of the algorithm are illustrated via a computational study.\\n\\n\\nFindings\\nAn easy-to-implement, yet efficient algorithm to solve the multi-objective implementation of a problem structure that becomes increasingly relevant in the fashion industry is proposed. Implementation of the algorithm revealed that the algorithm is ideally suited to generate significant savings and that these savings are impervious to problem and thus company size.\\n\\n\\nPractical implications\\nThe solutions from the algorithm (Pareto-efficient frontier) offer decision-makers more flexibility in selecting those solutions they deem most fitting for their situation. The computational study illustrates the significant monetary savings possible by implementing the proposed algorithm to practical situations.\\n\\n\\nOriginality/value\\nIn contrast to existing papers, for the first time, to the best of the author’s knowledge, the focus of the joint balancing and sequencing approach has been applied in the fashion instead of the automotive industry. The applicability of the approach to specific fields of the fashion industry is discussed. An option and attributes-based model, rarely used in general assembly line sequencing per se, is used for more flexibility in representing a diverse set of model types.\\n\",\"PeriodicalId\":21107,\"journal\":{\"name\":\"Research journal of textile and apparel\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2022-11-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Research journal of textile and apparel\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/rjta-04-2022-0045\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATERIALS SCIENCE, TEXTILES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Research journal of textile and apparel","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/rjta-04-2022-0045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATERIALS SCIENCE, TEXTILES","Score":null,"Total":0}
引用次数: 0

摘要

目的本研究旨在填补时尚行业数学生产计划(联合平衡和排序)文献中的空白。它考虑了大规模定制、量体裁衣或小批量的特殊情况。设计/方法论/方法本文开发了一个基于产品选项和属性而不是固定变量的数学模型。它提出了一种易于使用的遗传算法来解决由此产生的优化问题。通过计算研究说明了该算法的功能和性能。发现提出了一种易于实现但高效的算法来解决在时尚行业中越来越重要的问题结构的多目标实现。该算法的实现表明,该算法非常适合产生显著的节约,并且这些节约不受问题的影响,因此不受公司规模的影响。实际含义算法的解决方案(Pareto有效边界)为决策者提供了更大的灵活性,可以选择他们认为最适合自己情况的解决方案。计算研究表明,通过将所提出的算法应用于实际情况,可以节省大量资金。原创性/价值与现有论文相比,据作者所知,联合平衡和排序方法的重点首次应用于时尚而非汽车行业。讨论了该方法在时尚行业特定领域的适用性。基于选项和属性的模型本身很少用于通用装配线排序,用于在表示一组不同的模型类型时提供更大的灵活性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A simultaneous balancing and sequencing algorithm to plan assembly lines in the fashion industry
Purpose The purpose of the study is to fill a gap in the literature on mathematical production planning (joint balancing and sequencing) in the fashion industry. It considers in particular situations of mass customization, made-to-measure or small lot sizes. Design/methodology/approach The paper develops a mathematical model based on product options and attributes instead of fixed variants. It proposes an easy-to-use genetic algorithm to solve the resulting optimization problem. Functionality and performance of the algorithm are illustrated via a computational study. Findings An easy-to-implement, yet efficient algorithm to solve the multi-objective implementation of a problem structure that becomes increasingly relevant in the fashion industry is proposed. Implementation of the algorithm revealed that the algorithm is ideally suited to generate significant savings and that these savings are impervious to problem and thus company size. Practical implications The solutions from the algorithm (Pareto-efficient frontier) offer decision-makers more flexibility in selecting those solutions they deem most fitting for their situation. The computational study illustrates the significant monetary savings possible by implementing the proposed algorithm to practical situations. Originality/value In contrast to existing papers, for the first time, to the best of the author’s knowledge, the focus of the joint balancing and sequencing approach has been applied in the fashion instead of the automotive industry. The applicability of the approach to specific fields of the fashion industry is discussed. An option and attributes-based model, rarely used in general assembly line sequencing per se, is used for more flexibility in representing a diverse set of model types.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Research journal of textile and apparel
Research journal of textile and apparel MATERIALS SCIENCE, TEXTILES-
CiteScore
2.90
自引率
13.30%
发文量
46
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信