The Two-Machine Job-Shop with Exponential Processing Times
Using a generalized random walk model, we analyze the problem of processing a fixed number of jobs on each of two machines. The order of processing is unconstrained, and the processing times are exponential random variables. Rather simple formulas are obtained for the machine idle time distribution and the mean makespan.
Unable to display preview. Download preview PDF.