To read the full version of this content please select one of the options below:

Worst‐case allocation algorithms in a complex of operations with interval parameters

Jerzy Józefczyk (Institute of Information Science and Engineering, Wrocław University of Technology, Poland)

Kybernetes

ISSN: 0368-492X

Article publication date: 17 June 2008

Abstract

Purpose

In many decision‐making problems under parameter uncertainty, the most popular stochastic approach is not used because of its serious drawbacks. The purpose of this paper is to present another approach, which copes with the uncertainty of parameters. It uses a precise criterion evaluating a decision with respect to uncertain parameters. This precision by the maximum operator is performed on a term based on the criterion and called the relative regret. The approach is applied to the allocation problems in a complex of operations.

Design/methodology/approach

The resource allocation problems in a complex of operations of independent and dependent structures to minimize a total execution time of all operations are investigated. Then, the results are extended for the problem of a task allocation in the complex of independent operations. The case is considered when the parameters in the functional models of the operations are uncertain, and their values belong to the intervals of known bounds. The solution algorithms for the uncertain problems are based on known solution algorithms for the corresponding deterministic problems. The solution algorithms for the latter problems are outlined in the paper.

Findings

The main contribution of the paper consists in presenting the property that it is possible for the uncertain problems considered to replace the solution of the uncertain allocation problems by solving a number of corresponding deterministic problems.

Research limitations/implications

The useful and interesting property of the solution algorithm for the allocation problems, in general, cannot be applied to the other decision‐making problems under uncertainty. As an example of such a problem, a simple routing‐scheduling problem is presented for which, however, a number of possible parameter scenarios can be substantially limited.

Practical implications

The allocation problems addressed in the paper have a variety of applications in computer systems and in manufacturing systems. Moreover, a lack of crisp values for the parameters in models of individual operations is rather common.

Originality/value

The paper extends previous results for the allocation problems in a complex of operations.

Keywords

Citation

Józefczyk, J. (2008), "Worst‐case allocation algorithms in a complex of operations with interval parameters", Kybernetes, Vol. 37 No. 5, pp. 652-676. https://doi.org/10.1108/03684920810873281

Publisher

:

Emerald Group Publishing Limited

Copyright © 2008, Emerald Group Publishing Limited