Dyeing scheduling optimization in a multi-machine system with resource constraints

Water consumption is one of the most important concerns for a textile dyeing company in the era of global energy revolution. Different from the traditional production scheduling which focuses on the production efficiency improvement, the dyeing scheduling emphasizes the constraints of resource consu...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2024-10, Vol.2853 (1), p.12058
Main Authors: Gao, Shaofeng, Zhang, Biyue, Xiao, Lei, Zhou, Qihong
Format: Article
Language:English
Subjects:
Constraints
Delivery scheduling
Genetic algorithms
Optimization
Optimization models
Production scheduling
Resource scheduling
Scheduling
Task scheduling
Water consumption
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Water consumption is one of the most important concerns for a textile dyeing company in the era of global energy revolution. Different from the traditional production scheduling which focuses on the production efficiency improvement, the dyeing scheduling emphasizes the constraints of resource consumption. Besides, different from the traditional production scheduling where the task relevance is seldomly considered, the colour depth heavily impacts the water consumption and the dyeing scheduling results, which aggravates the uncertainty and complexity when modelling the dyeing scheduling optimization. Therefore, how to select proper dyeing orders among a large number of orders and schedule them for the purpose of generating more profit is challenging. To address the above issue, an optimization model with objective of maximizing profit and consideration of water consumption, delivery due time, and machine capacity, is built, and genetic algorithm is adopted to solve the problem. A numeric experiment is conducted to validate the effectiveness of the proposed method.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/2853/1/012058