This paper considers the Economic Lot Scheduling Problem: that is, the problem of finding a feasible schedule that allows cyclic production of several products on a single facility so as to minimize holding and set up costs. We consider the case when three products are required to be produced in...

This article provides a theoretical analysis of the problem of scheduling jobs in batches by family on a batch-processing machine, in the presence of perishability time windows of equal length. The problem arises in the context of production planning in a microbiological laboratory, and has...

We study a problem of minimising the total number of zeros in the gaps between blocks of consecutive ones in the columns of a binary matrix by permuting its rows. The problem is referred to as the Consecutive Ones Matrix Augmentation Problem, and is known to be NP-hard. An analysis of the...