Priorities and Scheduling in M/G/1

Moshe Haviv
Additional contact information
Moshe Haviv: The Hebrew University

Chapter Chapter 5 in Queues, 2013, pp 71-80 from Springer

Abstract: Abstract So far we have assumed that all customers are treated equally. In particular, the next to enter service could not be decided due to certain parameters that are customer-dependent. This was the case regardless of which of the FCFS, LCFS, or random-order policies was assumed. In this chapter we deviate from this assumption and allow some discrimination among customers. Thus, some customers may be treated better than others.

Keywords: First-come First-served (FCFS); Last Come First Served (LCFS); Mean Queueing Time; Shortest Remaining Processing Time (SRPT); Queue Regime (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:isochp:978-1-4614-6765-6_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461467656

DOI: 10.1007/978-1-4614-6765-6_5

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().