A simulated annealing approach based simulation -optimisation to the dynamic job-shop scheduling problem

Basit Öğe Kaydı
dc.contributor.authorSel, Cagri
dc.contributor.authorHamzadayi, Alper
dc.date.accessioned2024-09-29T16:09:49Z
dc.date.available2024-09-29T16:09:49Z
dc.date.issued2018
dc.departmentKarabük Üniversitesien_US
dc.description.abstractIn this study, we address a production scheduling problem. The scheduling problem is encountered in a job-shop production type. The production system is discrete and dynamic system in which jobs arrive continually. We introduce a simulation model (SM) to identify several situations such as machine failures, changing due dates in which scheduling rules (SRs) should be selected independently. Three SRs, i.e. the earliest due date rule (EDD), the shortest processing time first rule (SPT) and the first in first out rule (FIFO), are incorporated in a SM. A simulated annealing heuristic (SA) based simulation-optimisation approach is proposed to identify the unknown schedules in the dynamical system. In the numerical analysis, the performance of SRs and SA are compared using the simulation experiments. The objective functions minimising the mean flowtime and the mean tardiness are examined with varying levels of shop utilization and due date tightness. As an overall result, we observe that the proposed SA heuristic outperforms EDD and FIFO, the well-known SPT rule provides the best results. However, SA heuristic achieves very close results to the SPT and offers a reasonable computational burden in time-critical applications.en_US
dc.identifier.doi10.5505/pajes.2017.47108
dc.identifier.endpage674en_US
dc.identifier.issn1300-7009
dc.identifier.issn2147-5881
dc.identifier.issue4en_US
dc.identifier.startpage665en_US
dc.identifier.trdizinid306408en_US
dc.identifier.urihttps://doi.org/10.5505/pajes.2017.47108
dc.identifier.urihttps://search.trdizin.gov.tr/tr/yayin/detay/306408
dc.identifier.urihttps://hdl.handle.net/20.500.14619/7794
dc.identifier.volume24en_US
dc.identifier.wosWOS:000441810300014en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakTR-Dizinen_US
dc.language.isoenen_US
dc.publisherPamukkale Univen_US
dc.relation.ispartofPamukkale University Journal of Engineering Sciences-Pamukkale Universitesi Muhendislik Bilimleri Dergisien_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectJob-shop schedulingen_US
dc.subjectDiscrete and dynamic systemen_US
dc.subjectSimulated annealing algorithmen_US
dc.subjectSimulation-optimisationen_US
dc.subjectScheduling rulesen_US
dc.titleA simulated annealing approach based simulation -optimisation to the dynamic job-shop scheduling problemen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
TR-Dizin İndeksli Yayınlar Koleksiyonu