...
首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >A Nonpolynomial Optimal Algorithm for Sequencing Inspectors in a Repeat Inspection System with Rework
【24h】

A Nonpolynomial Optimal Algorithm for Sequencing Inspectors in a Repeat Inspection System with Rework

机译:具有返工的重复检验系统中检验人员排序的非多项式最优算法。

获取原文
   

获取外文期刊封面封底 >>

       

摘要

Assuming that two types of inspection errors are nonidentical and that only the items rejected by an inspector are reworked and sent to the next inspection cycle, we formulate a combinatorial optimization problem for simultaneously determining both the minimum frequency of inspection-rework cycles and the optimal sequence of inspectors selected from a set of available inspectors, in order to meet the constraints of the outgoing quality level. Based on the inherent properties from our mathematical model, we provide a nonpolynomial optimal algorithm with a time complexity ofO(2m).
机译:假设两种类型的检查错误是不相同的,并且仅对检查员拒绝的项目进行重新加工并发送到下一个检查周期,我们制定了一个组合优化问题,可以同时确定最小的检查-重新工作周期频率和最佳顺序从一组可用的检查员中选择一个检查员,以符合外发质量水平的约束。基于数学模型的固有属性,我们提供了时间复杂度为O(2m)的非多项式最优算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号