20.500.12556/RUL-108522 A max-plus algebra approach for generating a non-delay schedule A Max-Plus algebra is one of the promising mathematical approaches that can be used for scheduling operations. It was already applied for the presentation of Johnson’s algorithm and for solving cyclic jobshop problems, but it had not yet been applied for non-delay schedules. In this article, max-plus algebra is used to formally present the generation of a non-delay schedule for the first time. We present a simple algorithm for generating matrices of starting and finishing times of operations, using max-plus algebra formalism. We apply the LRPT (Longest Remaining Processing Time) rule as the priority rule, and the SPT (Shortest Processing Time) rule as the tie-breaking rule. The algorithm is applicable for any other pair of priority rules with a few minor adjustments. max-plus algebra non-delay schedules priority rules project schedulling max-plus algebra non-delay urniki prioritetna pravilla časovni načrti projektov true false true Angleški jezik Slovenski jezik Članek v reviji 2019-07-05 13:06:04 2019-07-05 13:06:05 2025-03-18 11:49:46 0000-00-00 00:00:00 2019 0 0 Str. 35-44 no. 1 Vol. 10 2019 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 658.5(045) 1848-0225 10.17535/crorr.2019.0004 16696091 10670108 RAZ_Zuzek_Tena_i2019.pdf RAZ_Zuzek_Tena_i2019.pdf 1 D876D6157F30629724418A6EE7D68106 1f6b50400b770c10c4969393ba132a89c65732a204844d1e5299358a3c7aadcf aba45737-a1b6-11eb-a523-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=119553 https://hrcak.srce.hr/ojs/index.php/crorr/issue/view/377 1 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=119485 Fakulteta za strojništvo 0 0 0