Multiple feedback at a single-server station

Isaac Meilijson and Gideon Weiss

Stochastic Processes and their Applications, 1977, vol. 5, issue 2, 195-205

Abstract: A single server facility is equipped to perform a collection of operations. The service rendered to a customer is a branching process of operations. While the performance of an operation may not be interrupted before its completion, once completed, the required follow-up work may be delayed, at a cost per unit time of waiting that depends on the type and load of work being delayed. Under some probabilistic assumptions on the nature of the required service and on the stream of customers, the problem is to find service schedules that minimize expected costs. The authors generalize results of Bruno [2], Chazan, Konheim and B. Weiss [4], Harrison [8], Klimov [10], Konheim [11], and Meilijson and G. Weiss [13], using a dynamic programming approach.

Keywords: Single; server; station; holding; costs; dynamic; programming; service; policies; priorities (search for similar items in EconPapers)
Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(77)90029-1
Full text for ScienceDirect subscribers only

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:eee:spapps:v:5:y:1977:i:2:p:195-205

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().