For the single-machine multi-product lot-size scheduling problem very good solutions can be obtained in a very simple way, if the products belong to two homogeneous groups. In this paper it is investigated how, in the general case, the products can be clustered in two groups and how good the solutions are if these groups are treated as homogeneous.
|Place of Publication||Eindhoven|
|Publisher||Technische Hogeschool Eindhoven|
|Number of pages||23|
|Publication status||Published - 1981|