Pregled bibliografske jedinice broj: 272989
Stochastic Algorithm Application In Project Management For Limited Series Production
Stochastic Algorithm Application In Project Management For Limited Series Production // Proceedings of the 5th International DAAAM Conference "Advanced Technologies for Developing Countries" (ATDC 2006) / Mikac, T. ; Katalinić, Branko (ur.).
Rijeka: Tehnički fakultet Sveučilišta u Rijeci, 2006. str. 281-286 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 272989 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Stochastic Algorithm Application In Project Management For Limited Series Production
Autori
Maričić, Sven ; Barišić, Branimir ; Car, Zlatan
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the 5th International DAAAM Conference "Advanced Technologies for Developing Countries" (ATDC 2006)
/ Mikac, T. ; Katalinić, Branko - Rijeka : Tehnički fakultet Sveučilišta u Rijeci, 2006, 281-286
Skup
Advanced Technologies for Developing Countries (5 ; 2006)
Mjesto i datum
Rijeka, Hrvatska, 28.06.2006. - 30.06.2006
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
production planning; project management for limited series production; Applying LRPT; SRPT and random rule
Sažetak
This paper presents a concept for possible solutions for production scheduling in a flexible manufacturing system applying LRPT, SRPT and random rule. When applying LRPT method manufacturing system is processing the job with the longest remaining processing time. Under SRPT method at every moment of time, manufacturing system is processing that job with the shortest processing time. Random rule is shared fairly among all jobs currently in the process. The observed problems were in 50 products on 20 machines, with realistic production times. In limited series production planning there is a need for taking account of extra expenses (storage, transportation, etc.), which are necessary because cost ratio for each piece is significantly increasing in comparison to series production. This paper presents Job shop planning problem applying three different methods of stochastic algorithm. Identical initial results are used for each method and then the results are displayed. In this paper are given directives for implementation of all three given methods. As one of references for result comparison, the initial sum of shortest production times is taken into account. Conducted research shows that achieving optimal results depends on structure of each working order. The biggest flexibility has shown the solution given applying random rule. But with its appliance, large restrictions represent inability to influence on structure of processing each group of products.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo, Strojarstvo, Temeljne tehničke znanosti
POVEZANOST RADA
Ustanove:
Tehnički fakultet, Rijeka