Minimizing total flow time on a single flexible machine


Karakayali I., Azizoglu M.

INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS, cilt.18, ss.55-73, 2006 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 18 Konu: 1
  • Basım Tarihi: 2006
  • Doi Numarası: 10.1007/s10696-006-9000-6
  • Dergi Adı: INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS
  • Sayfa Sayıları: ss.55-73

Özet

In this study, we address a job sequencing and tool switching problem arising in flexible manufacturing systems. We consider the single machine problem of minimizing total flow time. We prove that the problem is NP-hard in the strong sense and show that the tool switching problem is polynomially solvable for a given sequence.