PERIODIC DUE DATE ASSIGNMENT WITH FAMILY SETUPS

Basit Öğe Kaydı
dc.authoridDuzgit, Zehra/0000-0003-0686-1672
dc.contributor.authorSertdemir, Sevilay
dc.contributor.authorUnal, Ali Tamer
dc.contributor.authorDuzgit, Zehra
dc.date.accessioned2024-07-18T20:52:16Z
dc.date.available2024-07-18T20:52:16Z
dc.date.issued2019
dc.departmentİstanbul Bilgi Üniversitesien_US
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 perfouned. 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.en_US
dc.identifier.endpage961en_US
dc.identifier.issn1943-670X
dc.identifier.issue6en_US
dc.identifier.startpage945en_US
dc.identifier.urihttps://hdl.handle.net/11411/8607
dc.identifier.volume26en_US
dc.identifier.wosWOS:000510852900008en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherUniv Cincinnati Industrial Engineeringen_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.subjectSchedulingen_US
dc.subjectDue Date Assignmenten_US
dc.subjectLead Time Quotationen_US
dc.subjectFamily Setupen_US
dc.subjectMixed İnteger Programmingen_US
dc.subjectSingle-Machineen_US
dc.subjectResource-Allocationen_US
dc.subjectTimesen_US
dc.subjectAlgorithmsen_US
dc.subjectCosten_US
dc.titlePERIODIC DUE DATE ASSIGNMENT WITH FAMILY SETUPS
dc.typeArticle

Dosyalar

Koleksiyon

Web of Science Indexed Publications