Clustering of products in the single-machine lot-size scheduling problem

M.A.J. Starmans, J. Wessels

Research output: Book/ReportReportAcademic

37 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Hogeschool Eindhoven
Number of pages23
Publication statusPublished - 1981

Publication series

NameMemorandum COSOR
ISSN (Print)0926-4493


Dive into the research topics of 'Clustering of products in the single-machine lot-size scheduling problem'. Together they form a unique fingerprint.

Cite this