An artificial bee colony algorithm approach for unrelated parallel machine scheduling with processing set restrictions, job sequence-dependent setup times, and due date


Creative Commons License

Caniyilmaz E. , Benli B. , İLKAY M. S.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, cilt.77, ss.2105-2115, 2015 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 77
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1007/s00170-014-6614-9
  • Dergi Adı: INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
  • Sayfa Sayıları: ss.2105-2115

Özet

The problem dealt with in this study has job sequence-dependent setup times under suitable machine constraints and due date constraints. The performance criterion for this problem is to minimize the sum of makespan and total tardiness. In the literature, an application of ABC algorithm for the problems which includes all the properties that we have dealt has not been discussed. Because there is no appropriate test data, a real-life data was collected from a factory. In this study, a new approach has been proposed for the solution with meta-heuristics of unrelated parallel machine scheduling problems which is a combinatorial problem. This new neighborhood approach provides different machine assignments for every candidate job sequences. This approach is used by integrating into ABC and GA. To evaluate the performances of the algorithms, the real-life problem was solved by using ABC and GA algorithms under similar conditions. It was found that all jobs can be completed in two shifts without the need for a third shift. Computational results show that ABC algorithm has better performance than GA.