We consider several two-agent scheduling problems with controllable job processing times, where agents A and B have to share either a single machine or two identical machines in parallel while processing their jobs. The processing times of the jobs of agent A are compressible at additional cost....

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

We address the scheduling of operations in a robotic cell that produces multiple part-types. The objective is to obtain a cyclic schedule--a sequence of robot moves and an ordering of the parts--that minimizes the long-run average time to produce a part or, equivalently, maximizes the...