Worst-case relative regret algorithm for task allocation in complex operation system

• Autorzy: Józefczyk J.
• Języki publikacji: EN

Abstrakty

EN

The uncertain version of a task allocation problem in a complex of independent operations is considered. The parameters in models of the operations are assumed to belong to given intervals. The objective is to find a time-optimal robust solution in terms of the worst-case relative regret function. The optimal worst-case relative regret task allocation algorithm is presented. It consists in reducing the problem with uncertain input data to a number of deterministic problems whose solution algorithms are known. Special cases and a simple example for the polynomial models of the operations illustrate the solution algorithm.

Słowa kluczowe

EN

optimisation; task allocation; robust optimal algorithm; deterministic problems; operations research; complex operation system

• Wydawca: Oficyna Wydawnicza Politechniki Wrocławskiej
• Czasopismo: Systems Science
• Rocznik: 2005
• Tom: Vol. 31, no 2
• Strony: 57--66
• Opis fizyczny: Bibliogr. 9 poz., rys.

Twórcy

autor

Józefczyk J.

• Institute of Information Science and Engineering, Wroclaw University of Technology, ul. Janiszewskiego 11/17, 50-370 Wroclaw, Poland,

Bibliografia

• [1] Averbakh I., Minimax regret solutions for minimax optimization problems with uncertainty. Operations Research Letters, Vol. 27, 2000, 57-65.
• [2] Bubnicki Z., Optimal control of the complex of operations with random parameters. Podstawy Sterowania, Vol. 1, 1971, No. 1.
• [3] Daniels R. L., Kouvelis P., Robust scheduling to hedge against processing time uncertainty in single-stage production. Management Science, Vol. 41, 1995, 363-376.
• [4] Józefczyk J., Decision making problems in complex of operations systems, Wroclaw University of Technology Press, Wrocław 2002, (in Polish).
• [5] Józefczyk J., Robust algorithm for task scheduling on moving executors with uncertain processing times. Proceedings of 15th Mini EURO Conference on Managing Uncertainty in Decision Support Models MUDSM 2004, Coimbra, Portugal 2004, [cd-rom].
• [6] Józefczyk J., Robust algorithm for the uncertain scheduling problem with moving executors. Proceedings of 16th IFAC World Congress, Prague, 2005 (in press).
• [7] Kouvelis P., Yu G., Robust discrete optimization and its applications, Kluver Academic Publishers, Boston 1997.
• [8] Rosenblatt M. J., Lee H. L., A robustness approach to facilities design. Int. J. Production Res., Vol. 25, 1987, 479-486.
• [9] Węglarz J., Application of the convex set theory in a certain problem of time-optimal control of a complex of operations, Systems Science, Vol. 1, No. 1, 1975.