Premium
Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
Author(s) -
Kondakci Suna Köksalan,
Azizoglu Meral,
Köksalan Murat
Publication year - 1996
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/(sici)1520-6750(199609)43:6<929::aid-nav9>3.0.co;2-6
Subject(s) - tardiness , computer science , mathematical optimization , monotonic function , scheduling (production processes) , schedule , retard , set (abstract data type) , maximum flow problem , job shop scheduling , mathematics , psychology , mathematical analysis , psychiatry , programming language , operating system
We consider the bicriteria problem of minimizing total flow time and maximum tardiness penalties for a given set of jobs on a single machine. We develop an algorithm that finds the optimal schedule for any given monotonic function of the two criteria by generating only a small subset of the efficient schedules.