This paper focuses on Single machine scheduling subject to inventory constraints. Jobs add and remove items to and from, respectively, the inventory. Jobs that remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a Single machine...

We discuss the performance of scheduling algorithms for a certain kind of manufacturing environment, called the "Flexible Flowshop", which consists of a certain number of machine centers. Each center has one or more identical parallel machines. Each part is processed by at most one machine in...

We consider the problem of scheduling n jobs in a pallet-constrained two-machine flowshop so as to minimize the makespan. In such a flowshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of the last operation, and the number of...