A heuristic for single machine common due date assignment problem with different earliness/tardiness weights

dc.contributor.authorArık, Oğuzhan Ahmet
dc.date.accessioned2025-02-24T17:18:33Z
dc.date.available2025-02-24T17:18:33Z
dc.date.issued2023
dc.departmentFakülteler, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü
dc.description.abstractThis paper considers the common due date assignment for single machine weighted earliness/tardiness scheduling problem with different earliness and tardiness weights for jobs where the objective is to minimize the cost of the sum of weighted earliness/tardiness and assignment common due date. The single machine common due date assignment problem where all jobs have the same earliness/tardiness weight has a polynomial-time algorithm to solve it optimally. Furthermore, some properties for the problem where the common due date is an input have been revealed by researchers in the literature. This paper proposes a heuristic algorithm for the problem using the revealed properties of similar problems' optimal solutions such as the V-shaped property and zero-start time of the machine. The experimental study of this paper shows that the proposed heuristic finds better solutions for the problems in a reasonable time than a commercial solver has when the problem size is increased.
dc.identifier.doi10.1007/s12597-023-00652-1
dc.identifier.endpage1574
dc.identifier.issn0030-3887
dc.identifier.issn0975-0320
dc.identifier.issue3
dc.identifier.scopus2-s2.0-85153775473
dc.identifier.scopusqualityQ3
dc.identifier.startpage1561
dc.identifier.urihttps://doi.org/10.1007/s12597-023-00652-1
dc.identifier.urihttps://hdl.handle.net/20.500.14440/746
dc.identifier.volume60
dc.identifier.wosWOS:000976188100001
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.institutionauthorArik, Oguzhan Ahmet
dc.language.isoen
dc.publisherSpringer India
dc.relation.ispartofOpsearch
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WOS_20250201
dc.subjectCommon due date assignment
dc.subjectSingle machine
dc.subjectEarliness
dc.subjectTardiness
dc.subjectScheduling
dc.titleA heuristic for single machine common due date assignment problem with different earliness/tardiness weights
dc.typeArticle

Dosyalar