Optimality of the Symmetric Workload Allocation in a Single-Server Flow Line System
This paper provides a proof of the symmetrical allocation property (SAP), conjectured in an earlier work on the workload allocation problem for a manufacturing flow line system. The system consists of N single-Erlang servers in series having a common interstation buffer capacity. SAP says a symmetric workload allocation exists among the optimal solutions. We first show the reciprocal of the throughput is increasing and jointly convex, not component-wisely, in workloads. Then we apply the line reversibility property to obtain an alternative optimal allocation symmetric for any optimal workload allocation that is asymmetric. A sufficient condition for SAP to hold is also given, which relaxes the hypothesizing assumptions on the service-time distribution and interstation buffer capacities.
Volume (Year): 45 (1999)
Issue (Month): 3 (March)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:45:y:1999:i:3:p:449-451. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.