Repetitive schemes with performance bounds for the economic-lot scheduling problem with critical set-up times

In this paper the deterministic economic-lot scheduling problem is reconsidered for a single machine producing two homogeneous groups of products. It has been proved that so-called repetitive schemes are very efficient for such problems, In this paper we will consider the extra difficulty of set-up times which interfere critically with the optimal repetitive production scheme. It will be shown how a modified repetitive scheme can be found which is still very efficient.