Solving scheduling problem with time dependent learning effect to number of tardy jobs and range of lateness criteria
dc.contributor.author | Eren, Tamer | |
dc.date.accessioned | 2020-06-25T17:52:24Z | |
dc.date.available | 2020-06-25T17:52:24Z | |
dc.date.issued | 2012 | |
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 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. | en_US |
dc.identifier.citation | closedAccess | en_US |
dc.identifier.endpage | 879 | en_US |
dc.identifier.issn | 1300-1884 | |
dc.identifier.issue | 4 | en_US |
dc.identifier.scopus | 2-s2.0-84872405463 | |
dc.identifier.scopusquality | Q2 | |
dc.identifier.startpage | 875 | en_US |
dc.identifier.uri | https://hdl.handle.net/20.500.12587/5149 | |
dc.identifier.volume | 27 | en_US |
dc.identifier.wos | WOS:000314494700019 | |
dc.identifier.wosquality | Q4 | |
dc.indekslendigikaynak | Web of Science | |
dc.indekslendigikaynak | Scopus | |
dc.language.iso | tr | |
dc.publisher | Gazi Univ, Fac Engineering Architecture | en_US |
dc.relation.ispartof | Journal Of The Faculty Of Engineering And Architecture Of Gazi University | |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Single machine scheduling | en_US |
dc.subject | bicriteria | en_US |
dc.subject | time-dependent learning effect | en_US |
dc.subject | number of tardy | en_US |
dc.subject | range of lateness | en_US |
dc.title | Solving scheduling problem with time dependent learning effect to number of tardy jobs and range of lateness criteria | en_US |
dc.type | Article |
Dosyalar
Orijinal paket
1 - 1 / 1
[ X ]
- İsim:
- Solving scheduling problem with time dependent learning effect to number of tardy jobs and range of lateness criteria.pdf
- Boyut:
- 282.72 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Tam Metin/Full Text