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

J. Wessels, N.N.T. Thijssen

    Research output: Contribution to journalArticleAcademicpeer-review

    1 Downloads (Pure)

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)49-54
    Number of pages7
    JournalMitteilungen der Mathematischen Gesellschaft der DDR
    Volume1978
    Issue number1
    Publication statusPublished - 1978

    Fingerprint

    Dive into the research topics of 'Repetitive schemes with performance bounds for the economic-lot scheduling problem with critical set-up times'. Together they form a unique fingerprint.

    Cite this