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

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

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 studies the allocation of buffer times in a single machine environment. Buffer times are a common tool to protect the schedule against disruptions such as machine failures. We introduce new classes of robust machine scheduling problems. For an arbitrary scheduling problem 1

This paper studies inventory constraints in a machine scheduling environment. Jobs can add and remove items of different types to the inventory and from the inventory, respectively. Jobs removing items cannot be processed if the required amount of items is not available. We first have a look at...