Single Facility Sequencing with Random Execution Times

A single facility sequencing problem where the execution time for each job at the facility is random with known probability distribution, is formulated and solved. The solution is shown to be easily extended to situations where further jobs arrive while the program is in operation. Further extensions are discussed, where (a) the facility is taken to consist of multiple (identical or otherwise) units of equipment and, (b) special priorities are attached to some of the jobs.