Unit-time open-shop scheduling problems with symmetric objective functions

N.V. Shakhlevich

    Research output: Book/ReportReportAcademic

    26 Downloads (Pure)

    Abstract

    The paper deals with the open??shop problems with unit??time operations and nonde??creasing symmetric objective functions depending on job completion times??. We construct two schedules??, one of them is optimal for any symmetric convex function??, the other is optimal for any symmetric concave function.?? Each of these two schedules is given by an analytically defined function which assigns to each operation the number of a unit-??time slot for its processing??.
    Original languageEnglish
    Place of PublicationEindhoven
    PublisherTechnische Universiteit Eindhoven
    Number of pages11
    Publication statusPublished - 1995

    Publication series

    NameMemorandum COSOR
    Volume9533
    ISSN (Print)0926-4493

    Fingerprint Dive into the research topics of 'Unit-time open-shop scheduling problems with symmetric objective functions'. Together they form a unique fingerprint.

    Cite this