A bicriteria scheduling problem with a learning effect: Total completion time and total tardiness
Yükleniyor...
Tarih
2007
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Taylor & Francis Inc
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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.
Açıklama
Anahtar Kelimeler
single machine scheduling, bicriteria scheduling, learning effect, mathematical programming, heuristic method, tabu search
Kaynak
Infor
WoS Q Değeri
Q4
Scopus Q Değeri
Q3
Cilt
45
Sayı
2
Künye
closedAccess
