资源约束的模块化服装生产工序编排优化模型与算法

TP391.7%TS941; 为适应"多品种、小批量、短周期"服装生产现状,考虑服装生产线工作站带有资源设备数量约束的作业平衡问题(RCALB-VRW),以资源设备总数和平滑系数(SI)的极小化建立双目标优化数学模型.针对RCALB-VRW的特点,提出基于合并工作站策略的装箱遗传算法.首先设计工序分配列表与资源设备列表的双层实数编码方式;其次基于传统资源约束的生产线平衡问题的资源配置算法,对工作站与资源设备进行装箱操作,优化工序编排方案,在混合服装生产线的设备资源投入数量最小化的前提下,实现各工作站平稳作业;最后以两款相近衬衫为算例进行测试,并与另外3种资源约束模型比较,结...

Full description

Saved in:
Bibliographic Details
Published in计算机集成制造系统 Vol. 30; no. 6; pp. 2148 - 2158
Main Authors 颜伟雄, 胡觉亮, 韩曙光
Format Journal Article
LanguageChinese
Published 浙江理工大学服装学院,浙江 杭州 310018%浙江理工大学理学院,浙江 杭州 310018 30.06.2024
Subjects
Online AccessGet full text
ISSN1006-5911
DOI10.13196/j.cims.2021.0905

Cover

Abstract TP391.7%TS941; 为适应"多品种、小批量、短周期"服装生产现状,考虑服装生产线工作站带有资源设备数量约束的作业平衡问题(RCALB-VRW),以资源设备总数和平滑系数(SI)的极小化建立双目标优化数学模型.针对RCALB-VRW的特点,提出基于合并工作站策略的装箱遗传算法.首先设计工序分配列表与资源设备列表的双层实数编码方式;其次基于传统资源约束的生产线平衡问题的资源配置算法,对工作站与资源设备进行装箱操作,优化工序编排方案,在混合服装生产线的设备资源投入数量最小化的前提下,实现各工作站平稳作业;最后以两款相近衬衫为算例进行测试,并与另外3种资源约束模型比较,结果表明装箱遗传算法能够更高效地求解有资源设备数量约束的服装生产工序编排.所提方法可为服装智能制造与精益生产的推进提供理论指导.
AbstractList TP391.7%TS941; 为适应"多品种、小批量、短周期"服装生产现状,考虑服装生产线工作站带有资源设备数量约束的作业平衡问题(RCALB-VRW),以资源设备总数和平滑系数(SI)的极小化建立双目标优化数学模型.针对RCALB-VRW的特点,提出基于合并工作站策略的装箱遗传算法.首先设计工序分配列表与资源设备列表的双层实数编码方式;其次基于传统资源约束的生产线平衡问题的资源配置算法,对工作站与资源设备进行装箱操作,优化工序编排方案,在混合服装生产线的设备资源投入数量最小化的前提下,实现各工作站平稳作业;最后以两款相近衬衫为算例进行测试,并与另外3种资源约束模型比较,结果表明装箱遗传算法能够更高效地求解有资源设备数量约束的服装生产工序编排.所提方法可为服装智能制造与精益生产的推进提供理论指导.
Abstract_FL To adapt to the current situation of"multi-variety,small-batch and short-cycle"garment production,the Resource Constrained Assembly Line Balancing problem considering Variable Resource each Workstation(RCALB-VRW)was studied,and a double objective optimization model was established to minimize the total number of re-sources and Smoothness Index(SI).Due to the characteristics of RCALB-VRW,Next Fit—Genetic Algorithm(GA-NF)was based on the combining workstation strategy.A double-layer real number coding method of process allocation list and resource equipment list was designed.Based on the traditional RCALB resource allocation algo-rithm,the workstation and resource equipment were boxed,and the process arrangement scheme was optimized to realize the smooth operation of each workstation in the hybrid garment production line under the minimization of the input quantity of resource equipment.Two similar shirts were taken as examples to calculate and test.Compared with the other three resource constraint models,the results showed that the GA-NF algorithm could more efficiently solve the modular garment production process scheduling with resource equipment quantity constraints.This study could provide theoretical guidance for the promotion of garment intelligent manufacturing and lean production.
Author 胡觉亮
颜伟雄
韩曙光
AuthorAffiliation 浙江理工大学服装学院,浙江 杭州 310018%浙江理工大学理学院,浙江 杭州 310018
AuthorAffiliation_xml – name: 浙江理工大学服装学院,浙江 杭州 310018%浙江理工大学理学院,浙江 杭州 310018
Author_FL YAN Weixiong
HU Jueliang
HAN Shuguang
Author_FL_xml – sequence: 1
  fullname: YAN Weixiong
– sequence: 2
  fullname: HU Jueliang
– sequence: 3
  fullname: HAN Shuguang
Author_xml – sequence: 1
  fullname: 颜伟雄
– sequence: 2
  fullname: 胡觉亮
– sequence: 3
  fullname: 韩曙光
BookMark eNotj81Kw0AcxPdQwVr7AL6CkPjfbHaTPUqpH1Dwouey2d1Ig6ZgFKXnelJrEW1FrEXEj5MXESX0cZpNH8OInoZhhvkxC6gUt2ON0BIGGxPM2Upky9Z-YjvgYBs40BIqYwBmUY7xPKomSSsoLGXEo7SM6rPPrkn7efpiRuP8rmveHrPRMDsfmPuL2dNpfj2epq_Z13OWXuaTgeldTSe3v2lRezibfvfy96H5uFlEc6HYS3T1XytoZ62-XduwGlvrm7XVhpVgoGARGUjtFWSNeaCYEsSTwGmAmZYicENNfFc5PuPaUa4PWise-kr4jAJnHgVSQct_u8ciDkW824zaRwdxQWxGSRTJTufksPjtAgMHyA-fWmlz
ClassificationCodes TP391.7%TS941
ContentType Journal Article
Copyright Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
Copyright_xml – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
DBID 2B.
4A8
92I
93N
PSX
TCJ
DOI 10.13196/j.cims.2021.0905
DatabaseName Wanfang Data Journals - Hong Kong
WANFANG Data Centre
Wanfang Data Journals
万方数据期刊 - 香港版
China Online Journals (COJ)
China Online Journals (COJ)
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
DocumentTitle_FL Optimization model and algorithm of modular garment production process scheduling with resource constraints
EndPage 2158
ExternalDocumentID jsjjczzxt202406020
GroupedDBID 2B.
4A8
92I
93N
ALMA_UNASSIGNED_HOLDINGS
CDYEO
PSX
TCJ
ID FETCH-LOGICAL-s1050-3cbce7637e19bd6da37c095b16ecab4fe384d2869e2d480eed9f8da8650967503
ISSN 1006-5911
IngestDate Thu May 29 04:00:06 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords arrangement of the process
资源约束
mixed garment production line
modular production
resource constrained
工序编排
混合服装生产线
模块化生产
装箱遗传算法
next fit-genetic algorithm
Language Chinese
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s1050-3cbce7637e19bd6da37c095b16ecab4fe384d2869e2d480eed9f8da8650967503
PageCount 11
ParticipantIDs wanfang_journals_jsjjczzxt202406020
PublicationCentury 2000
PublicationDate 2024-06-30
PublicationDateYYYYMMDD 2024-06-30
PublicationDate_xml – month: 06
  year: 2024
  text: 2024-06-30
  day: 30
PublicationDecade 2020
PublicationTitle 计算机集成制造系统
PublicationTitle_FL Computer Integrated Manufacturing Systems
PublicationYear 2024
Publisher 浙江理工大学服装学院,浙江 杭州 310018%浙江理工大学理学院,浙江 杭州 310018
Publisher_xml – name: 浙江理工大学服装学院,浙江 杭州 310018%浙江理工大学理学院,浙江 杭州 310018
SSID ssib006563755
ssib023646381
ssib001102950
ssib051375755
ssib023167363
ssib036438063
ssib000459500
ssib002258428
Score 2.4190235
Snippet TP391.7%TS941;...
SourceID wanfang
SourceType Aggregation Database
StartPage 2148
Title 资源约束的模块化服装生产工序编排优化模型与算法
URI https://d.wanfangdata.com.cn/periodical/jsjjczzxt202406020
Volume 30
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpR1da9RAMNT2xRdRVPymoPsg5Wqy2U12Hzd3KUWsL7bQt5LkctqCJ9gryD3XJ7WKaCtiLSJ-PPkiohz9Ob27_gxnNpu7te1DbeEIe7szszM7m8xMMrvrODdy_DqUBLSSeCytsIbMKiILvUpOOS76Ypmb43vImbvB9By7Pc_nR0ZvWllLK610MmsfuK7kKFqFOtArrpL9D80OiEIFlEG_cAUNw_VQOiaxIBEngpE4IJEi0iVxiAUVYI2sETmFNVIZGCWI8kjMdVOIBVElsgCuElFDgsongmssptGZJqiBo5AorgtAUFOOSnQRE0k1MNSIfygPO42JiDSMQHhAV7FmA5j3SXEKZukoa05ijWiBAZPQdSyJjIgo-hVaao6FKMAm4RJVjINPokgXIhCknFkIoihSMsxOlfTYEAT483XfAiUXshyF2KYCmEpqroC-1DzAT9rvUSgrk_7MzNeycg0OBa_Uj6ulsQZYMTPkqlYqc49-Bk0SqYFEtLqf-ISZBgBaUJfxBH5r8QSh_Ki8WDDHYsGyh_jCiUtjD43BNKO2eID1K3ZNNZ4UeJPiQCuNj31tprPFh7hlPvUmXenyoUsySBRdWl5aytrtJy3UmBtAbHPCGaNhiBkZY6o2c-eeHZtIbu01CX4tldxe5A2-thVrQyDjh8NF2RS3hLD2osODFcA2DYwf_PWFO2znHmCH-lTlwSCZrAkU79Ze4fSiwGYjad63_NfZ084pE3iOq-IpcsYZaT8468S7v1Z7nVf9ztfe5lb__Wrv-6fu5kb3-Xrvw4vdz0_7b7Z2Ot-6v790Oy_72-u9tdc72--wFcA-Ptv5s9b_sdH7-facMzcVz1anK-ZglcoyhFPgd2VploNjEeaeTOtBPfHDDEKt1AvyLElZI_cFq1MRyJzWmXDBjZYNUU8E7rYZYOLDeWe0-aiZX3DGkzTgPKNJwljCZIZZBSyvizTJGjlPfX7RuW7EXjAPzuWF_Uq9dCioy87J4Y17xRltPV7Jr0JI0EqvmcnwF9yoxS0
linkProvider EBSCOhost
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E8%B5%84%E6%BA%90%E7%BA%A6%E6%9D%9F%E7%9A%84%E6%A8%A1%E5%9D%97%E5%8C%96%E6%9C%8D%E8%A3%85%E7%94%9F%E4%BA%A7%E5%B7%A5%E5%BA%8F%E7%BC%96%E6%8E%92%E4%BC%98%E5%8C%96%E6%A8%A1%E5%9E%8B%E4%B8%8E%E7%AE%97%E6%B3%95&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E9%9B%86%E6%88%90%E5%88%B6%E9%80%A0%E7%B3%BB%E7%BB%9F&rft.au=%E9%A2%9C%E4%BC%9F%E9%9B%84&rft.au=%E8%83%A1%E8%A7%89%E4%BA%AE&rft.au=%E9%9F%A9%E6%9B%99%E5%85%89&rft.date=2024-06-30&rft.pub=%E6%B5%99%E6%B1%9F%E7%90%86%E5%B7%A5%E5%A4%A7%E5%AD%A6%E6%9C%8D%E8%A3%85%E5%AD%A6%E9%99%A2%2C%E6%B5%99%E6%B1%9F+%E6%9D%AD%E5%B7%9E+310018%25%E6%B5%99%E6%B1%9F%E7%90%86%E5%B7%A5%E5%A4%A7%E5%AD%A6%E7%90%86%E5%AD%A6%E9%99%A2%2C%E6%B5%99%E6%B1%9F+%E6%9D%AD%E5%B7%9E+310018&rft.issn=1006-5911&rft.volume=30&rft.issue=6&rft.spage=2148&rft.epage=2158&rft_id=info:doi/10.13196%2Fj.cims.2021.0905&rft.externalDocID=jsjjczzxt202406020
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjjczzxt%2Fjsjjczzxt.jpg