On server allocation in multiple center manufacturing systems
Operations Research
Buffer space allocation in automated assembly lines
Operations Research
The assignment of extra servers to stations in Tandem queueing systems with small or no buffers
Performance Evaluation - Queueing networks with finite capacity queues
On the optimal allocation of servers and workloads in closed queueing networks
Operations Research
Optimal buffer allocation in short &mgr;-balanced unreliable production lines
Computers and Industrial Engineering
Computer Communications Network Design and Analysis
Computer Communications Network Design and Analysis
Comparison of experimental designs for simulation-based symbolic regression of manufacturing systems
Computers and Industrial Engineering
| Hi-index | 0.01 |
Serial flow or production lines are modeled as tandem queueing networks and formulated as continuous-time Markov chains to investigate how to maximize throughput or minimize the average work-in-process (WIP) when the total service time and the total number of service phases among the stations are fixed (these are the workload and 'phaseload' allocation problems, respectively). This paper examines both the effect of the kind of service time distribution on the optimal workload allocation in order to maximize throughput or minimize the average WIP of perfectly reliable production lines. The new approach of this work is the differentiation of the number of service phases of the service time distribution which is assumed to be of phase type at all stations of the flow line and the placement of storage space (buffers) between any two successive stations in order to examine the effect of these factors to the form of the optimal workload vector t and the optimal service phase vector ph.