A bicriteria scheduling problem with a learning effect: Total completion time and total tardiness


INFOR, cilt.45, sa.2, ss.75-81, 2007 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 45 Konu: 2
  • Basım Tarihi: 2007
  • Doi Numarası: 10.3138/infor.45.2.75
  • Dergi Adı: INFOR
  • Sayfa Sayıları: ss.75-81


This paper considers a bicriteria scheduling problem with a learning effect on a single machine to minimize a weighted sum of total completion time and total tardiness. A mathematical programming model is developed for the problem, and optimal solutions are only obtained up to 25 jobs. Since the problem is NP-hard, heuristic methods based on tabu search and random search are proposed to solve large size problems, and their effectiveness is comparatively investigated considering 3600 problems.