Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems
dc.contributor.author | Arık, Oğuzhan Ahmet | |
dc.date.accessioned | 2025-02-24T16:23:49Z | |
dc.date.available | 2025-02-24T16:23:49Z | |
dc.date.issued | 2019 | |
dc.department | Nuh Naci Yazgan | |
dc.description.abstract | This paper investigates single machine earliness/tardiness problem considering the decision maker’s tolerances for earliness and tardiness durations in case of a restrictive common due date. In many classical or basic earliness/tardiness problems, due dates are accepted as deterministic or rigid numbers. In this paper, common due date in a single machine scheduling problem is relaxed with lower and upper bounds and these bounds are used for illustrating the decision maker’s tolerances or satisfaction levels by using fuzzy sets. As a complementary set of satisfaction levels, dissatisfaction levels can be encoded with fuzzy sets. Then, this paper uses dissatisfaction levels in order to introduce a new objective criterion that minimizes the products of earliness and tardiness durations with dissatisfaction levels. | |
dc.identifier.endpage | 15 | |
dc.identifier.issn | 2645-923X | |
dc.identifier.issue | 1 | |
dc.identifier.startpage | 1 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14440/269 | |
dc.identifier.volume | 2 | |
dc.institutionauthor | Arık, Oğuzhan Ahmet | |
dc.language.iso | tr | |
dc.publisher | Ahmet ŞAHİNER | |
dc.relation.ispartof | Journal of Multidisciplinary Modeling and Optimization | |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.snmz | KA_DergiPark_20250408 | |
dc.subject | Earliness | |
dc.subject | tardiness | |
dc.subject | single machine | |
dc.subject | scheduling | |
dc.subject | fuzzy sets | |
dc.subject | dissatisfaction levels | |
dc.subject | common due date | |
dc.title | Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems | |
dc.type | Article |