A parallel heuristic for hybrid job shop scheduling problem considering conflict-free AGV routing

Basit Öğe Kaydı
dc.authoridSimic, Vladimir/0000-0001-5709-3744
dc.authoridTirkolaee, Erfan Babaee/0000-0003-1664-9210
dc.authoridAmirteimoori, Arash/0000-0003-3792-1519
dc.authorwosidSimic, Vladimir/B-8837-2011
dc.authorwosidTirkolaee, Erfan Babaee/U-3676-2017
dc.contributor.authorAmirteimoori, Arash
dc.contributor.authorTirkolaee, Erfan Babaee
dc.contributor.authorSimic, Vladimir
dc.contributor.authorWeber, Gerhard-Wilhelm
dc.date.accessioned2024-05-19T14:45:50Z
dc.date.available2024-05-19T14:45:50Z
dc.date.issued2023
dc.departmentİstinye Üniversitesien_US
dc.description.abstractIn this study, a novel and computationally efficacious Parallel Two-Step Decomposition-Based Heuristic (PTSDBH) and a Mixed Integer Linear Programming (MILP) are developed to tackle the concurrent scheduling of jobs and Automated Guided Vehicles (AGVs) or transporters in a hybrid job shop system. Finite multiple AGVs, AGV eligibility, job's alternative process routes, job re-entry, and conflict-free AGV routing are considered. As far as the authors know, the importance of conflict-free routing for AGVs has not been featured in any of the past studies. Conflict-free AGV routing is an indispensable technicality, specifically where AGVs are the main mean of transportation as AGVs may collide on routes and the whole system ends up in breakdown. To avoid this issue, a conflict-free routing strategy is considered. Utilizing the parallel computing approach, PTSDBH is capable of tackling large-sized problems in remarkably shorter runtimes. To support this, PTSDBH is compared against three literarily well-known metaheuristics; i.e., Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Ant Colony Optimization (ACO) along with TSDBH (i.e., the single-core variant of PTSDBH) on three different-sized sets of benchmark instances. The results reveal that PTSDBH and TSDBH produce the same objective values and outperform the metaheuristics in terms of the quality of objective value. However, the runtimes of TSDBH are considerably higher than those of PTSDBH as it only uses one core to process. Finally, employing Nemenyi's post-hoc procedure for Friedman's test and the convergence plot, it is supported that the objective values generated by PTSDBH and TSDBH are significantly more desirable than those generated by the metaheuristics.en_US
dc.identifier.doi10.1016/j.swevo.2023.101312
dc.identifier.issn2210-6502
dc.identifier.issn2210-6510
dc.identifier.scopus2-s2.0-85153270271en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org10.1016/j.swevo.2023.101312
dc.identifier.urihttps://hdl.handle.net/20.500.12713/5364
dc.identifier.volume79en_US
dc.identifier.wosWOS:000987055500001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofSwarm and Evolutionary Computationen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.snmz20240519_kaen_US
dc.subjectMixed Integer Linear Programmingen_US
dc.subjectHybrid Job Shop Schedulingen_US
dc.subjectConflict-Free Agv Routingen_US
dc.subjectParallel Two-Step Decomposition-Baseden_US
dc.subjectHeuristicen_US
dc.subjectMetaheuristicsen_US
dc.subjectParallel Computingen_US
dc.titleA parallel heuristic for hybrid job shop scheduling problem considering conflict-free AGV routingen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu