Single machine earliness/tardiness scheduling problem with grey processing times and the grey common due date

Basit Öğe Kaydı
dc.authoridArik, Oguzhan Ahmet/0000-0002-7088-2104
dc.contributor.authorArık, Oğuzhan Ahmet
dc.date.accessioned2025-02-24T17:18:41Z
dc.date.available2025-02-24T17:18:41Z
dc.date.issued2021
dc.departmentFakülteler, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü
dc.description.abstractPurpose This paper presents a mixed-integer programming model for a single machine earliness/tardiness scheduling problem where the objective is to minimize total earliness/tardiness duration when the uncertainty of parameters such as processing times and due date is coded with grey numbers. Design/methodology/approach Grey theory and grey numbers are used for illustrating the uncertainty of parameters in processing times and common due date, where the objective is to minimize the total earliness/tardiness duration. The paper proposes a 0-1 mathematical model for the problem and an effective heuristic method for the problem by using expected processing times for ordering jobs. Findings The uncertainty of the processing times and common due date are encoded with grey numbers and a position-dependent mixed-integer mathematical programming model is proposed for the problem in order to minimize total grey earliness/tardiness duration of jobs having grey processing times and a common due date. By using expected processing times for ranking grey processing times,V-shaped property of the problem and an efficient heuristic method for the problem are proposed. Solutions obtained from the heuristic method show that the heuristic is effective. The experimental study also reveals that while differences between upper and lower bounds of grey processing times decrease, the proposed heuristic's performance decreases. Originality/value The grey theory and grey numbers have been rarely used as machine scheduling problems. Therefore, this study provides an important contribution to the literature.
dc.identifier.doi10.1108/GS-01-2020-0010
dc.identifier.endpage109
dc.identifier.issn2043-9377
dc.identifier.issn2043-9385
dc.identifier.issue1
dc.identifier.scopus2-s2.0-85115657876
dc.identifier.scopusqualityQ1
dc.identifier.startpage95
dc.identifier.urihttps://doi.org/10.1108/GS-01-2020-0010
dc.identifier.urihttps://hdl.handle.net/20.500.14440/792
dc.identifier.volume11
dc.identifier.wosWOS:000543480200001
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.institutionauthorArik, Oguzhan Ahmet
dc.language.isoen
dc.publisherEmerald Group Publishing Ltd
dc.relation.ispartofGrey Systems-Theory and Application
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WOS_20250201
dc.subjectGrey system theory
dc.subjectGrey number
dc.subjectSingle machine
dc.subjectScheduling
dc.subjectInteger programming
dc.subjectEarliness
dc.subjectTardiness
dc.titleSingle machine earliness/tardiness scheduling problem with grey processing times and the grey common due date
dc.typeArticle

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu