Bottleneck Minimization

Part of the International Series in Operations Research & Management Science book series (ISOR, volume 127)
We presented a solution to the maximum deviation problem in Chap. 3. We now take a closer look at the bottleneck deviation problem where the function to be minimized over all just-in-time sequences S for a given vector d = (d1,…,dn) is defined as follows:
$$H\left( S \right) = \mathop {\max }\limits_{i,k} |X_{ik} - rik|.$$
We keep the same notation here as in Chap. 3. More precisely, we deal with the following minimization problem referred to in this chapter as simply the bottleneck problem.
$$B* = \mathop {\min }\limits_S \,\{ H\left( S \right) = \mathop {\max }\limits_{i,k} |X_{ik} - rik|\} $$


Ideal Position Common Resource Regular Word Marked Graph Bottleneck Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2009

Personalised recommendations