SINGLE MACHINE SCHEDULING PROBLEMS WITH TIME-DEPENDENT LEARNING EFFECTS
[ X ]
Tarih
2013
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Yildiz Technical Univ
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In traditional scheduling problems, most literature assumes that the processing time of a job is fixed. However, there are many situations where the processing time of a job depends on the starting time or the position of the job in a sequence. In such situations, the actual processing time of a job may be more or less than its normal processing time if it is scheduled later. This phenomenon is known as the learning effect''. In this study, we introduce a time-dependent learning effect into a single-machine scheduling problems. We consider the following objective functions: (i) maximum tardiness, (ii) number of tardy jobs (iii) maximum tardiness subject to the number of tardy jobs (iv) number of tardy jobs subject to maximum tardiness. A nonlinear programming model are developed for problems which belongs to NP-hard class. Also the model is tested on an example. According to the best of our knowledge, no works exists on the optimal solutions for four problems were examined.
Açıklama
Anahtar Kelimeler
Scheduling; maximum tardiness; number of tardy jobs; time-dependent learning effect; non-linear; programming model
Kaynak
Sigma Journal of Engineering and Natural Sciences-Sigma Muhendislik Ve Fen Bilimleri Dergisi
WoS Q Değeri
N/A
Scopus Q Değeri
Cilt
31
Sayı
2
