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.
No takes yet. Share an insight, caveat, or question.
Rothkopf et al. (1984) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: