John A. Buzacott

Learn More
We consider a two-stage tandem queue attended by a moving server, with homogeneous Poisson arrivals and general service times. Two different holding costs for stages 1 and 2 and different switching costs from one stage to the other are considered. We show that the optimal policy in the second stage is greedy; and if the holding cost rate in the second stage(More)
We consider processing and shipment scheduling of a batch of size M jobs on a flexible (multifunctional) machine. All jobs in the batch require the same sequence of N operations on the machine. Costs are incurred in the forms of holding costs of jobs waiting for the next operation, setup costs whenever the machine is set up for a new operation, and shipment(More)
A simulation model is used to analyze the effects of various factors on the performance of a complex manufacturing system. The system under study is a large circuit board manufacturing facility. There, circuit boards are assembled and tested on a wide variety of automated machines and manual workstations. The simulation model, written in the SLAM II(More)
Developing simulation programs shows many similarities with classical system software development tasks. In simulation one is often concerned with allocating and deallocating resources. Two forms of deadlock — the 'deadly embrace' and 'apré-vous' — can be troublesome to simulators unless they know how to avoid them in the first place.(More)
This paper examines several inventory replenishment policies for a make-to-order inventory–production system that consists of a production workshop and a warehouse. Demands arrive to the production workshop according to a Poisson process, and are processed in an FCFS manner. The production workshop requires that the warehouse provides , as needed, raw(More)