Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs

Michael H. Rothkopf and Stephen A. Smith
Additional contact information
Michael H. Rothkopf: University of California, Lawrence Laboratory, Berkeley, California
Stephen A. Smith: University of Santa Clara, Santa Clara, California

Operations Research, 1984, vol. 32, issue 2, 451-456

Abstract: There are two known priority index rules for minimizing total delay costs in sequencing a finite group of independent tasks on a single processor. One of these rules applies when delay costs are linear and the other when they are restricted to a class of exponential functions. We prove that there are no other classes of delay cost function for which a simple priority index rule is optimal.

Keywords: 593 optimal sequencing; 701 optimal priority assignment (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.2.451 (application/pdf)

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:inm:oropre:v:32:y:1984:i:2:p:451-456

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().