首页> 外文会议>IEEE Conference on Emerging Technologies and Factory Automation >Optimal control of two symmetric competing queues with finite capacity and non negligible setup times
【24h】

Optimal control of two symmetric competing queues with finite capacity and non negligible setup times

机译:具有有限容量和不可忽略的设置时间的两个对称竞争队列的​​最优控制

获取原文

摘要

In this paper we study optimal scheduling for a two part-type, symmetric manufacturing systems subject to non negligible setup times, and characterized by finite buffer capacity. The solution method relies on 1) restricting the possible control policies to those which respect some general necessary conditions of optimality, and on 2) the exploitation of such properties to introduce a two-dimensional sampled version of the original system. The symmetric assumptions allows to map the two-dimensional sampled model onto an equivalent scalar one. By means of such a scalar sampled model we give the analytical solution of the optimal control problem addressed.
机译:在本文中,我们研究了两种零件类型的对称制造系统的最佳调度,这是不可忽略的设置时间,并以有限缓冲容量为特征。解决方法依赖于1)将可能的控制策略限制为尊重某些一般必要条件的最优性条件,并且在2)对原始系统的二维采样版本的利用中的开发。对称假设允许将二维采样模型映射到等效标量。通过这种标量采样模型,我们提供了解决的最佳控制问题的分析解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号