A fixed job scheduling problem with machine-dependent job weights

Eliiyi D. T., AZİZOĞLU M.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.47, sa.9, ss.2231-2256, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 47 Sayı: 9
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1080/00207540701499499
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.2231-2256
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

This study considers the identical parallel machines operational fixed job scheduling problem with machine-dependent job weights. A job is either processed in a fixed interval or is not processed at all. Our aim is to maximise the total weight of the processed jobs. We show that the problem with machine eligibility constraints resides as a special case of this problem. We identify some special polynomially solvable cases and propose a branch-and-bound (BB) algorithm that employs efficient bounding schemes and dominance conditions. Computational experience on large-sized problem examples reveals the satisfactory performance of the BB algorithm.