Minimizing the maximum lateness in a scheduling problem with a time-dependent learning effect: A non-linear programming model

Yükleniyor...
Küçük Resim

Tarih

2008

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Gazi Univ, Fac Engineering Architecture

Erişim Hakkı

info:eu-repo/semantics/openAccess

Ö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 problem. The objective function of the problem is minimization of the maximum lateness. This study shows that EDD rule, which guarantees the best solution in classical situation (without learning effect), can not guarantee the best results in the situation with learning effect. In addition, a non-linear programming model is proposed for this problem, and solutions are found for problems which have up to 14 jobs.

Açıklama

Anahtar Kelimeler

Scheduling, maximum lateness, time-dependent learning effect, non-linear programming model

Kaynak

Journal Of The Faculty Of Engineering And Architecture Of Gazi University

WoS Q Değeri

N/A

Scopus Q Değeri

Q2

Cilt

23

Sayı

2

Künye

Eren, T. (2008). Zamana-bağımlı öğrenme etkili çizelgeleme probleminde maksimum gecikme minimizasyonu: Doğrusal olmayan programlama modeli. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, 23(2), 459 - 465.