Eren, Tamer2020-06-252020-06-252012closedAccess1300-1884https://hdl.handle.net/20.500.12587/5149In 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. We consider the following objective function minimize range of lateness subject to the number of tardy jobs. A non-linear programming model is developed for the problem which belongs to NP-hard class. Also the model is tested on an example.trinfo:eu-repo/semantics/closedAccessSingle machine schedulingbicriteriatime-dependent learning effectnumber of tardyrange of latenessArticle2748758792-s2.0-84872405463Q2WOS:000314494700019Q4