Scheduling with Random Arrivals and Linear Loss Functions

Dennis W. Fife
Additional contact information
Dennis W. Fife: Cooley Electronics Laboratory, The University of Michigan

Management Science, 1965, vol. 11, issue 3, 429-437

Abstract: The problem under consideration involves scheduling of the processing of an initial queue of jobs and subsequent Poisson arrivals on a single processor. Each job to be processed incurs a loss which increases linearly with its waiting time. The scheduling algorithm is sought which minimizes the average rate of expected loss over infinite time. It is shown that if statistical equilibrium exists for the total loss of an individual arrival, the optimal schedule minimizes the expected total loss of a single arrival, and is given by the scheduling rule which applies when there are no additional arrivals.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.11.3.429 (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:ormnsc:v:11:y:1965:i:3:p:429-437

Access Statistics for this article

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