A Discrete-Time Queuing Analysis of Conveyor-Serviced Production Stations

Charles S. Beightler and Robert M. Crisp
Additional contact information
Charles S. Beightler: The University of Texas, Austin, Texas
Robert M. Crisp: The University of Arkansas, Fayetteville, Arkansas

Operations Research, 1968, vol. 16, issue 5, 986-1001

Abstract: This paper analyzes production stations that operate in conjunction with conveyors. Two types of production stations are considered: (1) loading stations that load processed material to the conveyor, and (2) unloading stations that remove material from the conveyor. An operating policy, the sequential range policy, is proposed as a method for operating the production stations. An analysis of the sequential range policy is given. The system is considered as a discrete-time queuing process with a stationary Bernoulli arrival rate. In-process storage is treated as a Markov process discrete in time and discrete in space. The expected number of units in storage and the expected delay per unit produced are derived. Certain economic problems are considered.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.5.986 (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:oropre:v:16:y:1968:i:5:p:986-1001

Access Statistics for this article

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