Note: Bicriteria scheduling for minimizing flow time and maximum tardiness

Suna Köksalan Kondakci, Meral Azizoglu and Murat Köksalan

Naval Research Logistics (NRL), 1996, vol. 43, issue 6, 929-936

Abstract: 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.

Date: 1996
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199609)43:63.0.CO;2-6

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:43:y:1996:i:6:p:929-936

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().