On Two Cyclic Exponential Machines Sharing a Common Tool Magazine
Srinivas Chakravarthy · American Journal of Mathematical and Management Sciences · 1987
SYNOPTIC ABSTRACTA new class of optimization problems arising in modeling a system with two machines (or servers) sharing a common tool magazine was recently proposed. In this paper, we assume that the machines in the system require the tools according to a given permutation (order) and discuss a number of simplifications in the model leading to interesting results and also to a (conjectured) lower bound on the total proportion of idle time of the machines.