TITLE

The Traveling Repairperson Home Base Location Problem

AUTHOR(S)
Jamil, Mamnoon; Batta, Rajan; Malon, David M.
PUB. DATE
May 1994
SOURCE
Transportation Science;May94, Vol. 28 Issue 2, p150
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper considers the problem of locating the home base of a traveling server on a network. Calls for service arrive solely at nodes via independent, time-homogeneous Poisson processes. Calls finding the server busy enter a finite capacity queue which is depleted in a First-Come- First-Served (FCFS) manner. The server travels from his / her home base serving calls back-to-back, returning home only when he / she finds the system empty upon the completion of a service. The objective we consider is to minimize the average response time to an accepted call. The queueing system is analyzed via a busy period analysis, which uses a decoupling scheme to simplify the task of optimizing the home base location. Computational experience is discussed and a numerical example is presented. Generalizations of the model are also discussed.
ACCESSION #
4453889

 

Related Articles

  • Inequalities between Arrival Averages and Time Averages in Stochastic Processes Arising from Queueing Theory. Shun-Chen Niu // Operations Research;Jul/Aug84, Vol. 32 Issue 4, p785 

    A common scenario in stochastic models, especially in queueing theory, is that an arrival counting process both observes and interacts with another continuous time stochastic process. In the case of Poisson arrivals, Wolff [1982] recently proved that the proportion of arrivals finding the...

  • The Output of the M/M/s Queue. Everitt, D. E.; Downs, T. // Operations Research;Jul/Aug84, Vol. 32 Issue 4, p796 

    This paper derives an explicit expression for the transient distribution of the output process of the M/M/s queue operating in continuous time. This expression is rather complex and alternative computational techniques are presented. Some computational results are included.

  • Optimal Prediction of Queue Lengths and Delays in GI/M/m Multiserver Queues. Woodside, C. Murray; Stanford, David A.; Pagurek, Bernard // Operations Research;Jul/Aug84, Vol. 32 Issue 4, p809 

    We present optimal mean square predictors for queue lengths and delays in the stationary GI/M/m queue, based on a queue length measurement. The development specifies interrelationships among these predictors and numerical examples demonstrate basic properties of the predictors.

  • INDIVIDUAL VERSUS SOCIAL OPTIMIZATION IN THE ALLOCATION OF CUSTOMERS TO ALTERNATIVE SERVERS. Bell, Colin E.; Stidham, Jr., Shaler // Management Science;Jul1983, Vol. 29 Issue 7, p831 

    Customers arrive at a service area according to a Poisson process. An arriving customer must choose one of K servers without observing present congestion levels. The only available information about the kth server is the service time distribution (with expected duration μ[SUP-1,SUBk]) and the...

  • A Single-Server Queue with Cyclostationary Arrivals and Arithmetic Service. Kaplan, Michael // Operations Research;Jan/Feb83, Vol. 31 Issue 1, p184 

    This paper studies a class of nonblocking single-server queues which arise in connection with the modeling of store-and-forward message-switching multiplexors. The essential feature of these queues is that the input processes are periodic and the service times discrete. The inputs are imagined...

  • SOME RESULTS FOR BULK-ARRIVAL QUEUES WITH STATE-DEPENDENT SERVICE TIMES. Harris, Carl M. // Management Science;Jan1970, Vol. 16 Issue 5, p313 

    The Poisson bulk-arrival single-channel first-come-first-served queuing system is generalized so that the service times are conditioned on the length of the queue at the moment service is begun. Some general theory is developed for the model, and three specific cases are explored. For each of...

  • A TIME SERIES APPROACH TO QUEUING SYSTEMS WITH APPLICATIONS FOR MODELING JOB-SHOP IN-PROCESS INVENTORIES. Steudel, Harold J.; Wu, S. M. // Management Science;Mar77, Vol. 23 Issue 7, p745 

    The behavior of a uniformly sampled queueing system is characterized and interpreted using a time series approach. The advantages of employing time series to obtain a model of the queue's behavior are shown to be simplicity, flexibility and reliability. An analysis of actual queue data shows...

  • STATIONARY SINGLE-SERVER QUEUING PROCESSES WITH A FINITE NUMBER OF SOURCES. Harrison, Gerald // Operations Research;Jul/Aug59, Vol. 7 Issue 4, p458 

    Some basic relations are obtained that apply to finite single-server stationary queuing processes These relations depend only on the mean service time and mean source idle time and not on the form of the distributions When the source idle time follows a negative exponential distribution, the...

  • Task Scheduling on the PASM Parallel Processing System. Tuomenoksa, David Lee; Siegel, Howard Jay // IEEE Transactions on Software Engineering;Feb85, Vol. 11 Issue 2, p145 

    PASM is a proposed large-scale distributed/parallel processing system which can be partitioned into independent SIMD/MIMD machines of various sizes. One design problem for systems such as PASM is task scheduling. The use of multiple FIFO queues for non-preemptive task scheduling is described....

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics