Single machine scheduling with preventive maintenances

Batun S., Azizoğlu M.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.47, sa.7, ss.1753-1771, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 47 Sayı: 7
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1080/00207540701636348
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1753-1771
  • Anahtar Kelimeler: scheduling, preventive maintenance, branch-and-bound algorithm, FLOW-TIME, AVAILABILITY
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

We consider the single machine total flow time problem in which the jobs are non-resumable and the machine is subject to preventive maintenance activities of known starting times and durations. We propose a branch-and-bound algorithm that employs powerful optimality properties and bounding procedures. Our extensive computational studies show that our algorithm can solve large-sized problem instances with up to 80 jobs in reasonable times. We also study a two-alternative maintenance planning problem with minor and major maintenances. We give a polynomial-time algorithm to find the optimal maintenance times when the job sequence is fixed.