BİR İPLİK FABRİKASINDA SİPARİŞLERİN ÇİZELGELENMESİ

Abstract

In this study, a scheduling problem which is experienced in a thread producer textile company isconsidered.The products must be processed in one of the identical machines. The machine is cleaned before production, and the cleaning time may take longer or shorter depending on the color of the previous job. As it is about fast service, reducing the cleaning times of the machines means both reducing water consumption and improving service times.Considered problem is called as parallelmachine scheduling with sequence dependent setup times inthe literature.Because that producer’s main customers are fast fashion companies, in the service indicators, speed is becoming the most important factor. In the fast fashion industry, the time from design to stores are reduced to three weeks, so completing all jobs in ashort time are becoming very critical and every delayed job may end with stoppage of customers’ production lines or loss of customers.Therefore, in this study, it is aimed to minimize themakespan and the totalnumber of tardyjobs.Due to the Np-hard nature of the problem, it is difficult to find an exact solution to large-sized problems in a reasonable time. Therefore, a simulated annealing algorithm is proposed for the solution of the problem.The proposed algorithm was coded in Visual Basic and presented with an interface suitable for daily use of the company.The schedules obtained with the proposed method are compared with the schedules used in the company and the obtained results were interpreted.

Keywords

• parallel machine scheduling
• sequence dependent setup time
• multi-objective scheduling
• simulated annealing
• fast fashion