(UM)
  • An algorithm for optimization of one dimensional cutting = Algoritem za optimizacijo enodimenzionalnega razreza
    Gradišar, Miro ...
    The article examines the sequential heuristic procedure (SHP) for optimizing one-dimensional stock cutting when all stock lenghts are different. In order to solve a bicriterial multidimensional ... knapsack problem with side constraints a lexicographic approach is applied. An item-oriented solution was found through a combination of approximations and heuristics that minimize the influence of ending conditions leading to almost optimal solutions. The computer program CUT was developed, based on the proposed algorithm. Two sample problems are presented and solved. A statistical analysis of parameters that affect material utilization was also made.
    Vrsta gradiva - znanstvena monografija ; neleposlovje za odrasle
    Založništvo in izdelava - Ljubljana : Ekonomska fakulteta, 1998
    Jezik - angleški
    ISBN - 961-6273-06-X
    COBISS.SI-ID - 72381696

Knjižnica Signatura – lokacija, inventarna št. ... Status izvoda
Univerzitetna knjižnica Maribor Prosti pristop 2. nad.
519.8 II 44061/60
prosto - za čitalnico
loading ...
loading ...
loading ...