Premium
A single‐machine problem with multiple criteria
Author(s) -
Kiran Ali S.,
Unal Ali Tamer
Publication year - 1991
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199110)38:5<721::aid-nav3220380507>3.0.co;2-4
Subject(s) - set (abstract data type) , mathematical optimization , single machine scheduling , computer science , due date , mathematics , algorithm , job shop scheduling , schedule , programming language , operating system
The problem considered is that of finding the set of efficient sequences of jobs on a single machine with respect to the total flow time and the number of tardy jobs. We present some properties of an existing algorithm and the problem itself.