Priority and dynamic scheduling in a make‐to‐stock queue with hyperexponential demand

Apurva Jain

Naval Research Logistics (NRL), 2006, vol. 53, issue 5, 363-382

Abstract: We consider the scheduling problem in a make‐to‐stock queue with two demand classes that can be differentiated based on their variability. One class experiences Poisson arrivals and the other class experiences hyperexponential renewal arrivals. We provide an exact analysis of the case where the demand class with higher variability is given non‐preemptive priority. The results are then used to compare the inventory cost performance of three scheduling disciplines, first‐come first‐serve and priority to either class. We then build on an existing dynamic scheduling heuristic to propose a modification that works well for our system. Extensions of the heuristic to more than two classes and to the case where demand state is known are also discussed. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.

Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.20146

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:wly:navres:v:53:y:2006:i:5:p:363-382

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().