You are here

A mixed integer programming model for multi-period dyeing and batching problem in a yarn plant


Cemalettin Öztürk, Arslan M. Ornek

Publication Type: 
Refereed Conference Meeting Proceeding
In a so-called multi-period yarn dyeing and batching problem, we try to determine the optimal batching of customer orders to be dyed in dye machines in each shift to minimize total lateness and earliness costs. In addition to weight, production quantity and volume capacity of the machines, there is a set of technical dyeing interaction constraints such as flotte, colour types, colour percentages and chemical recipe of customer orders when yarns are immersed in a large vat of coloured water known as the dye-liquor that includes dyestuffs, plus a range of chemicals to assist the dyeing process in the same shift. Furthermore, because of multi-period multi-shift nature of the problem, there is a setup carryover restriction which enforces that from shift to shift the colours must be processed in the increasing degree of darkness, i.e., in technical terms, the colour percentage of the batch increases. To the best of our knowledge, there is no study in the literature to solve this combinatorial optimization problem. Hence, in this paper, we first develop a novel mixed integer programming (MIP) formulation and then, we present a case study in a worldwide known yarn manufacturing company.
Conference Name: 
44th International Conference on Computers & Industrial Engineering ; 9th International Symposium On Intelligent Manufacturing and Service Systems
CIE44 & IMSS’14 Proceedings
Digital Object Identifer (DOI): 
Publication Date: 
National University of Ireland, Cork (UCC)
Open access repository: