Java 模拟银行叫号系统

本文通过使用Java中的阻塞队列实现了一个简单的餐厅管理系统,该系统模拟了顾客到达和被服务员服务的过程。系统中包含固定数量的服务员和动态增加的顾客。每个服务员从等待队列中取出并为顾客提供服务。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >


public class QueueManagementSystemBlockingQueue {
public static void main(String[] args) throws InterruptedException {
Center1 center = new Center1();
ExecutorService exec = Executors.newCachedThreadPool();
Producerr1 producer = new Producerr1(center);
Consumerr1 consumer = new Consumerr1(center);

exec.execute(producer);
for (int i = 0; i < 10; i++) {
exec.execute(consumer);
}

TimeUnit.SECONDS.sleep(10);
exec.shutdown();

}
}

class Producerr1 implements Runnable {
private Center1 center;

public Producerr1(Center1 center) {
this.center = center;
}

@Override
public void run() {
while (!Thread.interrupted()) {
center.produce();
}
}

}

class Consumerr1 implements Runnable {
private Center1 center;

public Consumerr1(Center1 center) {
this.center = center;
}

@Override
public void run() {
while (!Thread.interrupted()) {
center.consume();
}
}

}

class Center1 extends Thread {
private final static int MAXCOUNT = 10;

private BlockingQueue<Waiter1> waiters;
private BlockingQueue<Customerr1> customers;

private Random rand = new Random(47);

private final static int PRODUCERSLEEPSEED = 100;
private final static int CONSUMERSLEEPSEED = 10000;

public Center1() {
this.waiters = new LinkedBlockingQueue<Waiter1>(MAXCOUNT);
for (int i = 0; i < MAXCOUNT; i++) {
waiters.add(new Waiter1());
}
this.customers = new LinkedBlockingQueue<Customerr1>();
/*for (int j = 0; j < 20; j++) {
this.customers.add(new Customerr1());
}*/
}

public void produce() {
try {
TimeUnit.MILLISECONDS.sleep(rand.nextInt(PRODUCERSLEEPSEED));
} catch (InterruptedException e) {
e.printStackTrace();
}
this.customers.add(new Customerr1());
}

public void consume() {
try {
// 服务窗口可用
Waiter1 waiter = this.waiters.take();
this.waiters.remove(waiter);
// 客户可用
Customerr1 customer = this.customers.take();
this.customers.remove(customer);

// Do sth....
System.out.println(waiter + "正在为" + customer + "服务...");
TimeUnit.MILLISECONDS.sleep(rand.nextInt(CONSUMERSLEEPSEED));

this.waiters.add(waiter);
} catch (InterruptedException e) {
System.err.println("---" + e.getMessage());
}
}
}

class Waiter1 {
private final int id = counter++;
private static int counter = 1;

@Override
public String toString() {
if (id > 9)
return "Waiter [id=" + id + "]";
return "Waiter [id=0" + id + "]";

}
}

class Customerr1 {
private final int id = counter++;
private static int counter = 1;

@Override
public String toString() {
if (id > 9) {
return "Customer [id=" + id + "]";
}
return "Customer [id=0" + id + "]";
}
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值