%0 Journal Article
%T A Max-Plus algebra approach for generating a non-delay schedule
%A Ku£¿ar
%A Janez
%A Peperko
%A Aljo£¿a
%A £¿u£¿ek
%A Tena
%J -
%D 2019
%R 10.17535/crorr.2019.0004
%X Sa£¿etak 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
%K Max-Plus algebra
%K non-delay schedule
%K priority rules
%K project scheduling
%U https://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=324105