Raspoređivanje zadataka u dinamičkim operativnim proizvodnim sustavima s paralelnim strojevima

master's thesis

• Title (english): Scheduling in dynamic job shop systems with parallel machines
• Author: Matko Ferenca
• Mentor: Tamara Petrović (mentor)
• Committee member: Tamara Petrović (član povjerenstva)
• Committee member: Goran Vasiljević (član povjerenstva)
• Committee member: Dean Martinović (član povjerenstva)
• Granter: University of Zagreb; Faculty of Electrical Engineering and Computing; Zagreb
• Defense date and country: 2023-07-05, Croatia
• Scientific / art field, discipline and subdiscipline: TECHNICAL SCIENCES; Electrical Engineering

Abstract

U ovome radu implementiran je niz algoritama za raspoređivanje zadataka u statičkim i dinamičkim job shop proizvodnim sustavima. Algoritmi su testirani na primjerima iz Taillardovog skupa podataka. Na temelju dostupnih primjera, najbolje rezultate za raspoređivanje zadataka u statičkim sustavima daje heuristički algoritam s LWKR pravilom prioriteta. Heuristički algoritam daje generalno bolje rješenje u manje vremena od metode pomičnog uskog grla. Drugu paralelnu instancu svakog stroja isplativo je dodavati samo za sustave s barem 30 poslova, dok je treću paralelnu instancu isplativo dodavati samo za sustave s barem 50 poslova. Kod dinamičkog raspoređivanja zadataka, preporučuje se omogućiti promjenu originalno dobivenog rasporeda zadataka.

Abstract (english)

In this paper, several algorithms for static and dynamic job shop scheduling are implemented. Algorithms are tested on the Taillard's instances. Based on the results of available instances, the best result for static job shop scheduling is produced by heuristic algorithm with LWKR priority rule. In general, heuristic algorithm produces better results than shifting bottleneck algorithm, and in less time. Adding a second parallel machine is justified for job shops with at least 30 jobs, while adding a third parallel machine is justified only for job shops with at least 50 jobs. In dynamic job shop scheduling, it is recommended to allow the initial schedule to be changed.

• Keywords: Heuristički algoritam; metoda pomičnog uskog grla; Taillardov skup podataka; job shop
• Keywords (english): Heuristic algorithm; shifting bottleneck; Taillard's instances; job shop
• Language: croatian
• URN:NBN: urn:nbn:hr:168:633245
• Study programme: Title: Electrical Engineering and Information Technology; Study programme type: university; Study level: graduate; Academic / professional title: magistar/magistra inženjer/inženjerka elektrotehnike i informacijske tehnologije (magistar/magistra inženjer/inženjerka elektrotehnike i informacijske tehnologije)
• Type of resource: Text
• File origin: Born digital
• Access conditions: Closed access
• Created on: 2023-10-11 08:50:09