Eren, Tamer2020-06-252020-06-252008Eren, 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.1300-1884https://hdl.handle.net/20.500.12587/4150In 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.trinfo:eu-repo/semantics/openAccessSchedulingmaximum latenesstime-dependent learning effectnon-linear programming modelArticle2324594652-s2.0-47549101238Q2trdizinikyokturWOS:000273012500023N/A