We consider the problem of scheduling n tasks on two identical parallel processors. Task i has a processing time of one time unit, but might have to undergo processing for a second time unit with probability p_i, i.e., the processing time distributions of the tasks have mass only on one and on...

We consider stochastic models for flow shops, job shops and open shops in which the work required by job j is the same at each machine, being a random variable W_j. Because machines operate at different speeds, S_i, the processing time of job j at machine i is W_j/S_i,. It is the main result of this...

This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory. Jobs that have to remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a...