SINGLE MACHINE SCHEDULING PROBLEMS WITH TIME-DEPENDENT LEARNING EFFECTS
dc.contributor.author | Eren, Tamer | |
dc.date.accessioned | 2025-01-21T16:44:23Z | |
dc.date.available | 2025-01-21T16:44:23Z | |
dc.date.issued | 2013 | |
dc.department | Kırıkkale Üniversitesi | |
dc.description.abstract | 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. | |
dc.identifier.endpage | 221 | |
dc.identifier.issn | 1304-7205 | |
dc.identifier.issn | 1304-7191 | |
dc.identifier.issue | 2 | |
dc.identifier.startpage | 214 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12587/25448 | |
dc.identifier.volume | 31 | |
dc.identifier.wos | WOS:000219699400007 | |
dc.identifier.wosquality | N/A | |
dc.indekslendigikaynak | Web of Science | |
dc.language.iso | tr | |
dc.publisher | Yildiz Technical Univ | |
dc.relation.ispartof | Sigma Journal of Engineering and Natural Sciences-Sigma Muhendislik Ve Fen Bilimleri Dergisi | |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
dc.rights | info:eu-repo/semantics/closedAccess | |
dc.snmz | KA_20241229 | |
dc.subject | Scheduling; maximum tardiness; number of tardy jobs; time-dependent learning effect; non-linear; programming model | |
dc.title | SINGLE MACHINE SCHEDULING PROBLEMS WITH TIME-DEPENDENT LEARNING EFFECTS | |
dc.type | Article |