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...

We consider the problem of minimizing the expected makespan of n jobs with independent exponentially distributed processing times on two parallel machines, under resource constraints. Job j has expected processing time 1/\mu _j and requires throughout its processing an amount r_j of a resource; the...

The overuse of its currency processing facilities by depository institutions (DIs) has motivated the Federal Reserve (Fed) to impose its new cash recirculation policy. This overuse is characterized by the practice of cross-shipping, where a DI both deposits and withdraws cash of the same...

Recently, an agile software development technique called extreme programming has caught the attention of practitioners and researchers in the software industry. A core practice of extreme programming is pair programming, where two developers work on the same piece of code. We introduce the...