scientific article; zbMATH DE number 4016584

From MaRDI portal
Publication:3028708





The Bellman-Johnson problem of the optimal policy for serving n units by m servers is considered. For an arbitrary (m\(\times n)\)-matrix \(B=\| b_{ij}\|\) with real elements \(b_{ij}\) the logical determinant, i.e., the extremum characterization of B, is introduced in terms of the elements \(b_{ij}\) and the operations \(+\) and max. The (m\(\times n)\)- matrix \(A=\| a_{ij}\|\) of service times, where \(a_{ij}\) is the time for serving the j-th unit by the i-th server, is introduced as well. A family of mixed optimality conditions C is described which can be characterized as optimality conditions between necessary (H) and sufficient (D) ones. It is shown that the optimal serving policy can be found with lower computational effort by using C in comparison to using conditions D or H.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028708)