Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Enter minimum inter-arrival time: 5
- Enter maximum inter-arrival time: 5
- Enter minimum service time: 5
- Enter maximum service time: 5
- Enter number of queues: 1
- Enter number of customers: 1000
- Method to determine the shortest queue? (1=time, 2=size): 1
- Average waiting time is 0.0 <---
- The largest number of concurrent customers in the queue was 0
- Evaluate another simulation instance? (Y=Yes): y
- Enter number of queues: 2
- Enter number of customers: 1000
- Method to determine the shortest queue? (1=time, 2=size): 1
- Average waiting time is 0.0 <---
- The largest number of concurrent customers in the queue was 0
- Evaluate another simulation instance? (Y=Yes): y
- Enter number of queues: 5
- Enter number of customers: 1000
- Method to determine the shortest queue? (1=time, 2=size): 1
- Average waiting time is 0.0 <---
- The largest number of concurrent customers in the queue was 0
- Evaluate another simulation instance? (Y=Yes): y
- Enter number of queues: 10
- Enter number of customers: 1000
- Method to determine the shortest queue? (1=time, 2=size): 1
- Average waiting time is 0.0 <---
- The largest number of concurrent customers in the queue was 0
- Evaluate another simulation instance? (Y=Yes): y
- Enter number of queues: 100
- Enter number of customers: 1000
- Method to determine the shortest queue? (1=time, 2=size): 1
- Average waiting time is 0.0 <---
- The largest number of concurrent customers in the queue was 0
- Evaluate another simulation instance? (Y=Yes): y
- Enter number of queues: 1000
- Enter number of customers: 1000
- Method to determine the shortest queue? (1=time, 2=size): 1
- Average waiting time is 0.0 <---
- The largest number of concurrent customers in the queue was 0
- Evaluate another simulation instance? (Y=Yes):
- Program completed.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement