Article ID: | iaor20127612 |
Volume: | 33 |
Issue: | 1 |
Start Page Number: | 15 |
End Page Number: | 27 |
Publication Date: | Jan 1999 |
Journal: | RAIRO - Operations Research |
Authors: | Bui A, Bui M, Lavault C |
Keywords: | markov processes, scheduling, queues: applications, combinatorial optimization |
In previous papers, we used a Markovian model to determine the optimal functioning rules of a distributed system in various settings. Searching optimal functioning rules amounts to solve an optimization problem under constraints. The hierarchy of solutions arising from the above problem is called the ‘first order hierarchy’, and may possibly yield equivalent solutions. The present paper emphasizes a specific technique for deciding between two equivalent solutions, which establishes the ‘second order hierarchy’.