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

The issue of allocating capacity to accommodate emergent surgery cases while scheduling elective patients has major policy implications for Level-1 trauma centers including most large academic medical centers. This is because operating rooms (ORs) are the greatest source of revenues for...