Optimality of the Symmetric Workload Allocation in a Single-Server Flow Line System
AbstractThis 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 45 (1999)
Issue (Month): 3 (March)
flow line system; symmetric workload allocation; tandem queues;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.