ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Combinatorial optimization methods for yarn dyeing planning

Duran, Ege*; Ozturk, Cemalettin; Ornek, M. Arslan
Flexible Services and Manufacturing Journal2024-5-18DOI: 10.1007/s10696-024-09541-1
17阅读
引用收藏
分享

摘要

Managing yarn dyeing processes is one of the most challenging problems in the textile industry due to its computational complexity. This process combines characteristics of multidimensional knapsack, bin packing, and unrelated parallel machine scheduling problems. Multiple customer orders need to be combined as batches and assigned to different shifts of a limited number of machines. However, several practical factors such as physical attributes of customer orders, dyeing machine eligibility conditions like flotte, color type, chemical recipe, and volume capacity of dye make this problem significantly unique. Furthermore, alongside its economic aspects, minimizing the waste of natural resources during the machine changeover and energy are sustainability concerns of the problem. The contradictory nature of these two makes the planning problem multi-objective, which adds another complexity for planners. Hence, in this paper, we first propose a novel mathematical model for this scientifically highly challenging yet very practical problem from the textile industry. Then we propose Adaptive Large Neighbourhood Search (ALNS) algorithms to solve industrial-size instances of the problem. Our computational results show that the proposed algorithm provides near-optimal solutions in very short computational times. This paper provides significant contributions to flexible manufacturing research, including a mixed-integer programming model for a novel industrial problem, providing an effective and efficient adaptive large neighborhood search algorithm for delivering high-quality solutions quickly, and addressing the inefficiencies of manual scheduling in textile companies; reducing a time-consuming planning task from hours to minutes.

学科与关键词

关键词
Batching schedulingMIPALNSDyeing
相关
加载中…
  • An iterated greedy algorithm for the planning of yarn-dyeing boilers
    Demir, Yunus*International Transactions in Operational Research, 2024, 31(1): 115-139.被引 2
  • A Novel Approach for Optimum Planning of Bobbin Boilers in Textile Industry
    Demir, Yunus*; Inan, KemalTekstil ve Konfeksiyon, 2022, 32(1): 24-36.被引 2
  • An adaptive shuffled frog-leaping algorithm for parallel batch processing machines scheduling with machine eligibility in fabric dyeing process
    Lei, Deming*; Dai, TaoInternational Journal of Production Research, 2024, 62(21): 7704-7721.被引 4
查看全部 →

发表信息

论文状态
公开发表
期刊
Flexible Services and Manufacturing Journal
发表日期
2024-05-18
DOI
10.1007/s10696-024-09541-1
语言
ENGLISH
成果收录
SCIE
资助标注
Insight SFI Research Centre for Data Analytics

作者

  • D

    Duran, Ege (通讯) (第一作者)

  • O

    Ozturk, Cemalettin

查看全部 3 位作者收起作者
  • O

    Ornek, M. Arslan

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417