• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Seminar on Application for Technology of Information and Communication >Time and Cost Optimization of Parallel Services on Line Balancing Problem Using Integer Programming
【24h】

Time and Cost Optimization of Parallel Services on Line Balancing Problem Using Integer Programming

机译：使用整数编程在线平衡问题的时间和成本优化

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Human resources are one of the most crucial assets of any enterprise. Optimal usage of manpower is a pivotal assignment to a manager of a dynamic control system. on this observe, we introduce a way of the concern constraints and the station limits for the parallel offerings on line Balancing problem. in lots of realistic settings, despite the fact that the real task time of a task is modeled as an growing characteristic of its starting time due to deterioration outcomes the produced man power develops constantly by means of repeated the equal or comparable activities. The technique aimed toward determining the effective size of manpower to be hired to make sure most earnings, contemplating, manufacturing or demand capacity and time of operation. This paper additionally discusses the edition of the Linear Integer Programming approach to make sure maximum earnings, deliberating, production or call for capacity and time of operation.
机译：人力资源是任何企业最关键的资产之一。人力的最佳用法是对动态控制系统的经理的关键分配。在这方面，我们介绍了一种令人担忧的限制和站限制的方式，并在线平衡问题上的并行提议。在许多现实设置中，尽管任务的实际任务时间被建模为由于劣化成果而导致其开始时间的增长特征，所以通过重复的等于或可比活动，所产生的人力不断发展。该技术旨在确定人力的有效规模被雇用，以确保大多数收益，考虑，制造或需求和运作时间。本文还讨论了线性整数编程方法的版本，以确保最大收益，审议，生产或呼叫操作能力和运行时间。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号