Formulation and Solution of the Probabilistic Bottleneck Assignment Problem

摘要：

The purpose of this paper is to present a new result on how the productivity of a manufacturing or service process may be maximized by improving the performance of its bottleneck to the extent possible in an uncertain environment. Specifically, we consider the probabilistic bottleneck assignment problem (PBAP), which is a variation of the classic assignment problem (CAP), and formulate it as an integer programming model with an aim to minimize the expected longest processing time at the bottleneck in a production or operations system. It is proven that the intrinsically difficult PBAP is reducible to an efficiently solvable CAP provided that the processing times are independent random variables following the Bernoulli family of probability distributions.

关键词： Bottleneck assignment Zero-one programming Bernoulli distribution

作者: Ching-Chung Kuo

作者单位: Department of Management University of North Texas, Denton, TX 76203, U.S.A.

会议类型: 国际会议

会议名称: The Third International Conference on Operations and Supply Chain Management(第三届运营与供应链管理国际会议)

会议地点: 武汉

会议语种:英文

页码: 430-431

在线出版日期: 2009-07-28（万方平台首次上网日期，不代表论文的发表时间）