Mathematical Models for a Batch Scheduling Problem to Minimize Earliness and Tardiness

Ogun B., ALABAŞ USLU Ç.

JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT-JIEM, cilt.11, sa.3, ss.390-405, 2018 (ESCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 11 Sayı: 3
  • Basım Tarihi: 2018
  • Doi Numarası: 10.3926/jiem.2541
  • Dergi Adı: JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT-JIEM
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus
  • Sayfa Sayıları: ss.390-405
  • Anahtar Kelimeler: batch scheduling, earliness and tardiness, mixed integer programming formulation, on-time delivery, COMMON DUE-DATE, PROCESSING MACHINE, ALGORITHMS, COMPLEXITY
  • Marmara Üniversitesi Adresli: Evet

Özet

Purpose: Today's manufacturing facilities are challenged by highly customized products and just in time manufacturing and delivery of these products. In this study, a batch scheduling problem has been addressed to enable on-time completion of customer orders in a lean manufacturing environment. The problem is optimizing the partitioning of product components into batches and scheduling of the resulting batches where each customer order is received as a set of products made of various components.