İki kriterli tek makinalı çizelgeleme problemi için bir yaklaşım

Translated title of the contribution: An approach for solving single-machine bicriteria scheduling problem

    Research output: Contribution to journalArticlepeer-review


    In this study, we develop an algorithm for a bi-criteria scheduling problem that minimizes the maximum weighted tardiness and total weighted flow time. While the algorithm is capable of generating all nondominated points, the algorithm is designed to generate a subset of the nondominated points that guarentee to represent the whole nondominated set based on a prespecified quality measure. We apply the algorithm on a wide variety of problems with different properties. The results of the experiments show that the algorithm works well not only in terms of the solution time but also the number of schedules presented to the decision maker.
    Translated title of the contributionAn approach for solving single-machine bicriteria scheduling problem
    Original languageOther
    JournalJournal of the Faculty of Engineering and Architecture of Gazi University
    Issue number4
    Publication statusPublished - 21 Jul 2020


    • Bi-criteria single machine scheduling
    • nondominated point
    • representative set
    • maximum weighted tardiness
    • total weighted flow time


    Dive into the research topics of 'An approach for solving single-machine bicriteria scheduling problem'. Together they form a unique fingerprint.

    Cite this