A bicriteria parallel machine scheduling with a learning effect

EREN T., GÜNER E.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, cilt.40, ss.1202-1205, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 40
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1007/s00170-008-1436-2
  • Dergi Adı: INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1202-1205
  • Anahtar Kelimeler: Parallel machine scheduling, Bicriteria, Learning effect, Total completion time, Total tardiness, Mathematical programming model, MINIMIZING TOTAL TARDINESS, 2-MACHINE FLOWSHOP
  • Gazi Üniversitesi Adresli: Evet

Özet

Conventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs decline as firms produce more of a product and gain knowledge or experience. This phenomenon is known as the "learning effect." In this paper a bicriteria m-identical parallel machine scheduling problem with a learning effect is considered. The objective function of the problem is to find a sequence that minimizes a weighted sum of total completion time and total tardiness. Total completion time and total tardiness are widely used performance measures in scheduling literature. To solve this scheduling problem, a mathematical programming model is formulated.