Solving the unrelated parallel batch machine scheduling problem with mixed-integer programming

Bakir M., Sebatli-Saglam A., ÇAVDUR F.

JOURNAL OF POLYTECHNIC-POLITEKNIK DERGISI, sa.2, ss.653-663, 2023 (ESCI) identifier

  • Yayın Türü: Makale / Tam Makale
  • Basım Tarihi: 2023
  • Doi Numarası: 10.2339/politeknik.996529
  • Dergi Adı: JOURNAL OF POLYTECHNIC-POLITEKNIK DERGISI
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.653-663
  • Anahtar Kelimeler: Unrelated parallel batch processing, machine scheduling, total flow time, makespan, total tardiness, mixed-integer programming, ITERATED GREEDY ALGORITHM, NONIDENTICAL JOB SIZES, TOTAL FLOW TIME, PROCESSING MACHINES, MINIMIZING MAKESPAN, WEIGHTED-TARDINESS, RELEASE TIMES, MINIMIZATION, CAPACITIES, EARLINESS
  • Bursa Uludağ Üniversitesi Adresli: Evet

Özet

In this study, the problem of scheduling jobs with arbitrary sizes and non-zero release times on a set of unrelated parallel batch processing machines with different capacities is discussed. Three mixed-integer programming models with different objective functions are developed to solve the problem. Corresponding models aim at minimizing (i) the total flow time, (ii) the makespan and (iii) the total tardiness, respectively, which are considered to be among the most important objectives in scheduling problems. In order to test the validity and applicability of the proposed solution approach, different datasets are generated using some rules in the literature. The results obtained by solving the mathematical programming models with these data sets are analyzed in terms of some performance parameters.