MINIMIZING MACHINE CHANGEOVER TIME IN PRODUCT LINE IN AN APPAREL INDUSTRY

KENTLİ A., Dal V., ALKAYA A. F.

TEKSTIL VE KONFEKSIYON, cilt.23, sa.2, ss.159-167, 2013 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 23 Sayı: 2
  • Basım Tarihi: 2013
  • Dergi Adı: TEKSTIL VE KONFEKSIYON
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.159-167
  • Anahtar Kelimeler: Apparel Industry, Combinatorial optimization, Changeover time, SA, GA, SEQUENCE-DEPENDENT SETUP, SHOP SCHEDULING PROBLEM, JOB-SHOP, TABU SEARCH
  • Marmara Üniversitesi Adresli: Evet

Özet

This study deals with a scheduling problem with machine changeovers in a apparel company and presents a heuristic to minimize the total setup time subject to machine changeovers in models ordered. Commonly used heuristics such as shortest processing time and earliest due date can be used to calculate a feasible schedule quickly, but usually do not produce schedules that are close to optimal in these environments. A solution approach for the problem is developed by dividing it into two subproblems. Solution of the first problem is given as an input for the second problem. In this process, an originally developed heuristic is applied for the first problem and the second problem is formulated as an open and asymmetric traveling salesman problem. The second problem is solved by Genetic (GA) and Simulated Annealing (SA) algorithms. The experimental results demonstrate the effectiveness of the proposed algorithm to solve the scheduling problem with machine changeovers.