Static and dynamic scheduling of customer arrivals to a single-server system

Static and dynamic scheduling of customer arrivals to a single-server system

0.00 Avg rating0 Votes
Article ID: iaor19931788
Country: United States
Volume: 40
Issue: 3
Start Page Number: 345
End Page Number: 360
Publication Date: Apr 1993
Journal: Naval Research Logistics
Authors:
Keywords: queues: theory
Abstract:

The paper considers a single-server system whose customers arrive by appointments only. Both static and dynamic scheduling problems are studied. In static scheduling problems, one considers scheduling a finite number of customer arrivals, assuming there is no scheduled customer arrival to the system. In dynamic scheduling problems, one considers scheduling one customer arrival only, assuming that there are a number of scheduled customers already. The expected delay time is recursively computed in terms of customer interarrival times for both cases. The objective is to minimize the weighted customer delay time and the server completion time. The problem is formulated as a set of nonlinear equations. Various numerical examples are illustrated.

Reviews

Required fields are marked *. Your email address will not be published.