A single‐machine problem with multiple criteria

Ali S. Kiran and Ali Tamer Unal

Naval Research Logistics (NRL), 1991, vol. 38, issue 5, 721-727

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

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

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199110)38:53.0.CO;2-4

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:38:y:1991:i:5:p:721-727

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 ().