SINGLE MACHINE SCHEDULING WITH GENERAL LEARNING FUNCTIONS: OPTIMAL SOLUTIONS
[ X ]
Tarih
2013
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Pamukkale Univ
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
In traditional scheduling problems, most literature assumes that the processing time of a lob 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 less than its normal processing time if it is scheduled later, This phenomenon is known as the learning effect. In this study, we introduce general learning functions into a single-machine scheduling problems. We consider the following objective functions: (i) sum of weighted completion times, (ii) maximum lateness (iii) number of tardy jobs (iv) number of weighted tardy jobs, Non-linear programming models are developed for solving these problems..
Açıklama
Anahtar Kelimeler
Single machine scheduling; Learning functions; Non-linear programming models
Kaynak
Pamukkale University Journal of Engineering Sciences-Pamukkale Universitesi Muhendislik Bilimleri Dergisi
WoS Q Değeri
N/A
Scopus Q Değeri
Cilt
19
Sayı
2
