Periodic due date assignment with family setups

Basit Öğe Kaydı
dc.authorscopusid57213686085
dc.authorscopusid36934246100
dc.authorscopusid57212212831
dc.contributor.authorSertdemir, S.
dc.contributor.authorÜnal, A.T.
dc.contributor.authorDüzgit, Z.
dc.date.accessioned2024-07-18T20:17:47Z
dc.date.available2024-07-18T20:17:47Z
dc.date.issued2019
dc.description.abstractIn this study we consider a single machine due date assignment problem involving dynamic job arrivals and family setups. The due date quotation process is based on periodically generating schedules of new and old jobs. We want to keep the tardiness of old jobs below an allowable threshold while minimizing total completion time of new arriving jobs. We propose a mixed integer linear programming formulation to solve the scheduling problem. We also present a function to quote due dates for new jobs. An experimental analysis is conducted to analyze the proposed due date quotation process under various shop and solution procedure parameters. Three performance measures are considered: average quoted lead time, average tardiness, number of setups performed. The first significant outcome of our analysis is that existence of family setups plays a crucial role; the second significant observation is that batching plays a double-edged sword role in due date management. © INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING.en_US
dc.identifier.endpage961en_US
dc.identifier.issn1072-4761
dc.identifier.issue6en_US
dc.identifier.scopus2-s2.0-85077970488en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage945en_US
dc.identifier.urihttps://hdl.handle.net/11411/6726
dc.identifier.volume26en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherUniversity of Cincinnatien_US
dc.relation.ispartofInternational Journal of Industrial Engineering : Theory Applications and Practiceen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectDue Date Assignmenten_US
dc.subjectFamily Setupen_US
dc.subjectLead Time Quotationen_US
dc.subjectMixed İnteger Programmingen_US
dc.subjectSchedulingen_US
dc.subjectCombinatorial Optimizationen_US
dc.subjectSchedulingen_US
dc.subjectDue-Date Assignmenten_US
dc.subjectExperimental Analysisen_US
dc.subjectFamily Setupsen_US
dc.subjectLeadtimeen_US
dc.subjectMixed İnteger Linear Programmingen_US
dc.subjectMixed İnteger Programmingen_US
dc.subjectPerformance Measureen_US
dc.subjectTotal Completion Timeen_US
dc.subjectInteger Programmingen_US
dc.titlePeriodic due date assignment with family setups
dc.typeArticle

Dosyalar

Koleksiyon

Scopus Indexed Publications