A BRANCH-AND-BOUND ALGORITHM FOR TWO-COMPETING-AGENT SINGLE-MACHINE SCHEDULING PROBLEM WITH JOBS UNDER SIMULTANEOUS EFFECTS OF LEARNING AND DETERIORATION TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME WITH NO-TARDY JOBS

Basit Öğe Kaydı
dc.contributor.authorDanaci, Tugba
dc.contributor.authorToksari, Duran
dc.date.accessioned2025-01-21T16:26:39Z
dc.date.available2025-01-21T16:26:39Z
dc.date.issued2021
dc.departmentKırıkkale Üniversitesi
dc.description.abstractRecent scheduling studies focus on variable job-processing times and multi-agent problems simultaneously, but none of them studied with jobs under the simultaneous effect of learning and deterioration. This paper studies a two-competing-agent single-machine scheduling problem with jobs under simultaneous learning and deterioration effect. The goal is to find an optimal solution to minimize the total weighted completion time for the first agent, subject to the restriction that no tardy job is allowed for the second agent. According to our current literature knowledge, this paper will be the first one with these specifications. For this problem, a two-stage methodology is developed in the study. In the first stage, heuristics are proposed to find the near-optimal solution of which is used as input for the second stage. For the second stage, a branch-and-bound algorithm along with several dominances and a lower bound is developed to find the optimal solution. Computational experiments are provided to further measure the performance of the proposed algorithms. © INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING.
dc.identifier.doi10.23055/ijietap.2021.28.6.7723
dc.identifier.endpage593
dc.identifier.issn1072-4761
dc.identifier.issue6
dc.identifier.scopus2-s2.0-85124707195
dc.identifier.scopusqualityQ3
dc.identifier.startpage577
dc.identifier.urihttps://doi.org/10.23055/ijietap.2021.28.6.7723
dc.identifier.urihttps://hdl.handle.net/20.500.12587/23162
dc.identifier.volume28
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherUniversity of Cincinnati
dc.relation.ispartofInternational Journal of Industrial Engineering : Theory Applications and Practice
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_20241229
dc.subjectBranch-and-bound algorithm; Deterioration effect; Learning effect; Multi-agent scheduling; Variable processing times
dc.titleA BRANCH-AND-BOUND ALGORITHM FOR TWO-COMPETING-AGENT SINGLE-MACHINE SCHEDULING PROBLEM WITH JOBS UNDER SIMULTANEOUS EFFECTS OF LEARNING AND DETERIORATION TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME WITH NO-TARDY JOBS
dc.typeArticle

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu