Minimizing the weighted number of late jobs in UET open shops

G. Galambos, G.J. Woeginger

    Research output: Contribution to journalArticleAcademicpeer-review

    7 Citations (Scopus)


    We consider a two-machine open shop problem where the jobs have release dates and due dates, and where all single operations have unit processing times. The goal is to minimize the weighted number of late jobs. We derive a polynomial time algorithm for this problem, thereby answering an open question posed in a recent paper by Brucker et al.
    Original languageEnglish
    Pages (from-to)109-114
    Number of pages6
    JournalMathematical Methods of Operations Research
    Issue number1
    Publication statusPublished - 1995


    Dive into the research topics of 'Minimizing the weighted number of late jobs in UET open shops'. Together they form a unique fingerprint.

    Cite this