In Mandelbaum and Yechiali (1979) a simple formula is derived for the expected stationary remaining service time in a FIFO M/G/1 queue, conditional on the number of customers
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous resul...
The unichain condition requires that every policy in an MDP result in a single ergodic class, and guarantees that the optimal average cost is independent of the initial state. We ...